/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix051_tso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-1d1d2b5 [2020-10-21 23:00:57,702 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-21 23:00:57,705 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-21 23:00:57,729 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-21 23:00:57,729 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-21 23:00:57,730 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-21 23:00:57,732 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-21 23:00:57,734 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-21 23:00:57,736 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-21 23:00:57,737 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-21 23:00:57,738 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-21 23:00:57,739 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-21 23:00:57,739 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-21 23:00:57,740 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-21 23:00:57,741 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-21 23:00:57,742 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-21 23:00:57,743 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-21 23:00:57,744 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-21 23:00:57,745 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-21 23:00:57,747 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-21 23:00:57,749 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-21 23:00:57,750 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-21 23:00:57,751 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-21 23:00:57,751 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-21 23:00:57,754 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-21 23:00:57,754 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-21 23:00:57,754 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-21 23:00:57,755 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-21 23:00:57,756 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-21 23:00:57,757 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-21 23:00:57,757 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-21 23:00:57,758 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-21 23:00:57,758 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-21 23:00:57,759 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-21 23:00:57,760 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-21 23:00:57,760 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-21 23:00:57,761 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-21 23:00:57,761 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-21 23:00:57,761 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-21 23:00:57,762 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-21 23:00:57,763 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-21 23:00:57,764 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA.epf [2020-10-21 23:00:57,787 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-21 23:00:57,787 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-21 23:00:57,788 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-21 23:00:57,788 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-21 23:00:57,789 INFO L138 SettingsManager]: * Use SBE=true [2020-10-21 23:00:57,789 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-21 23:00:57,789 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-21 23:00:57,789 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-21 23:00:57,790 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-21 23:00:57,790 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-21 23:00:57,790 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-21 23:00:57,790 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-21 23:00:57,790 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-21 23:00:57,791 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-21 23:00:57,791 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-21 23:00:57,791 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-21 23:00:57,791 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-21 23:00:57,791 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-21 23:00:57,792 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-21 23:00:57,792 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-21 23:00:57,792 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-21 23:00:57,792 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-21 23:00:57,793 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-21 23:00:57,793 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2020-10-21 23:00:57,793 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-21 23:00:57,793 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-21 23:00:57,793 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-21 23:00:57,794 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2020-10-21 23:00:57,794 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-21 23:00:58,088 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-21 23:00:58,106 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-21 23:00:58,111 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-21 23:00:58,113 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-21 23:00:58,113 INFO L275 PluginConnector]: CDTParser initialized [2020-10-21 23:00:58,114 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix051_tso.oepc.i [2020-10-21 23:00:58,188 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9f1883b8d/9c0b0240812347a2b80fd833100a3460/FLAGfbe19f069 [2020-10-21 23:00:58,705 INFO L306 CDTParser]: Found 1 translation units. [2020-10-21 23:00:58,706 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix051_tso.oepc.i [2020-10-21 23:00:58,727 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9f1883b8d/9c0b0240812347a2b80fd833100a3460/FLAGfbe19f069 [2020-10-21 23:00:58,975 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9f1883b8d/9c0b0240812347a2b80fd833100a3460 [2020-10-21 23:00:58,983 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-21 23:00:58,991 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-21 23:00:58,992 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-21 23:00:58,992 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-21 23:00:58,996 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-21 23:00:58,997 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.10 11:00:58" (1/1) ... [2020-10-21 23:00:59,000 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@66be459d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 11:00:58, skipping insertion in model container [2020-10-21 23:00:59,000 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.10 11:00:58" (1/1) ... [2020-10-21 23:00:59,008 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-21 23:00:59,054 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-21 23:00:59,641 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-21 23:00:59,653 INFO L203 MainTranslator]: Completed pre-run [2020-10-21 23:00:59,763 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-21 23:00:59,854 INFO L208 MainTranslator]: Completed translation [2020-10-21 23:00:59,855 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 11:00:59 WrapperNode [2020-10-21 23:00:59,855 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-21 23:00:59,856 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-21 23:00:59,856 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-21 23:00:59,856 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-21 23:00:59,867 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 11:00:59" (1/1) ... [2020-10-21 23:00:59,890 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 11:00:59" (1/1) ... [2020-10-21 23:00:59,934 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-21 23:00:59,934 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-21 23:00:59,934 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-21 23:00:59,934 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-21 23:00:59,945 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 11:00:59" (1/1) ... [2020-10-21 23:00:59,946 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 11:00:59" (1/1) ... [2020-10-21 23:00:59,951 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 11:00:59" (1/1) ... [2020-10-21 23:00:59,952 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 11:00:59" (1/1) ... [2020-10-21 23:00:59,964 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 11:00:59" (1/1) ... [2020-10-21 23:00:59,968 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 11:00:59" (1/1) ... [2020-10-21 23:00:59,973 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 11:00:59" (1/1) ... [2020-10-21 23:00:59,982 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-21 23:00:59,982 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-21 23:00:59,982 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-21 23:00:59,983 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-21 23:00:59,983 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 11:00:59" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-21 23:01:00,071 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-21 23:01:00,071 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-21 23:01:00,071 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-21 23:01:00,072 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-21 23:01:00,072 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-21 23:01:00,072 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-21 23:01:00,072 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-21 23:01:00,073 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-21 23:01:00,073 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-21 23:01:00,073 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-21 23:01:00,073 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2020-10-21 23:01:00,074 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2020-10-21 23:01:00,074 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-21 23:01:00,074 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-21 23:01:00,074 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-21 23:01:00,074 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-21 23:01:00,077 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-21 23:01:02,550 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-21 23:01:02,550 INFO L298 CfgBuilder]: Removed 14 assume(true) statements. [2020-10-21 23:01:02,553 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.10 11:01:02 BoogieIcfgContainer [2020-10-21 23:01:02,553 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-21 23:01:02,554 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-21 23:01:02,554 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-21 23:01:02,558 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-21 23:01:02,558 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.10 11:00:58" (1/3) ... [2020-10-21 23:01:02,559 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23c2b22e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.10 11:01:02, skipping insertion in model container [2020-10-21 23:01:02,559 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 11:00:59" (2/3) ... [2020-10-21 23:01:02,560 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23c2b22e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.10 11:01:02, skipping insertion in model container [2020-10-21 23:01:02,560 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.10 11:01:02" (3/3) ... [2020-10-21 23:01:02,562 INFO L111 eAbstractionObserver]: Analyzing ICFG mix051_tso.oepc.i [2020-10-21 23:01:02,574 WARN L153 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-10-21 23:01:02,574 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-10-21 23:01:02,583 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-21 23:01:02,584 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-21 23:01:02,619 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:02,619 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:02,619 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:02,619 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:02,620 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:02,620 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:02,620 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:02,620 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:02,620 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:02,620 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:02,621 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:02,621 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:02,621 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:02,622 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:02,622 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:02,622 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:02,623 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:02,623 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:02,623 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:02,623 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:02,623 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:02,624 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:02,624 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:02,624 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:02,624 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:02,624 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:02,624 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:02,625 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:02,625 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:02,625 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:02,625 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:02,625 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:02,626 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:02,626 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:02,626 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:02,627 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:02,627 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:02,627 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:02,627 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:02,628 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:02,628 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:02,628 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:02,628 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:02,629 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:02,629 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:02,629 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:02,629 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:02,630 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:02,630 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:02,630 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:02,630 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:02,631 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:02,631 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:02,631 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:02,631 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:02,631 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:02,631 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:02,632 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:02,632 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:02,632 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:02,632 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:02,633 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:02,637 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:02,637 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:02,637 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:02,637 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:02,638 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:02,638 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:02,638 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:02,638 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:02,638 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:02,639 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:02,639 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:02,639 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:02,639 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:02,639 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:02,645 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:02,646 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:02,646 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:02,646 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:02,646 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:02,647 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:02,647 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:02,647 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:02,647 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:02,648 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:02,649 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:02,650 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:02,650 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:02,650 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:02,650 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:02,651 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:02,651 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:02,651 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:02,652 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:02,652 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:02,653 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:02,654 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:02,654 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:02,654 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:02,654 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:02,655 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:02,655 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:02,655 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:02,655 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:02,655 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:02,657 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-10-21 23:01:02,674 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2020-10-21 23:01:02,698 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-21 23:01:02,698 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-21 23:01:02,698 INFO L379 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-10-21 23:01:02,698 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-21 23:01:02,698 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-21 23:01:02,698 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-21 23:01:02,699 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-21 23:01:02,699 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-21 23:01:02,714 INFO L137 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2020-10-21 23:01:02,715 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 130 places, 120 transitions, 260 flow [2020-10-21 23:01:02,718 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 130 places, 120 transitions, 260 flow [2020-10-21 23:01:02,720 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 130 places, 120 transitions, 260 flow [2020-10-21 23:01:02,781 INFO L129 PetriNetUnfolder]: 3/116 cut-off events. [2020-10-21 23:01:02,782 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-21 23:01:02,787 INFO L80 FinitePrefix]: Finished finitePrefix Result has 129 conditions, 116 events. 3/116 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 93 event pairs, 0 based on Foata normal form. 0/111 useless extension candidates. Maximal degree in co-relation 80. Up to 2 conditions per place. [2020-10-21 23:01:02,791 INFO L116 LiptonReduction]: Number of co-enabled transitions 2896 [2020-10-21 23:01:03,149 WARN L193 SmtUtils]: Spent 308.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2020-10-21 23:01:03,295 WARN L193 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2020-10-21 23:01:05,360 WARN L193 SmtUtils]: Spent 1.53 s on a formula simplification. DAG size of input: 228 DAG size of output: 188 [2020-10-21 23:01:05,392 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 2, 1] term [2020-10-21 23:01:05,393 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 23:01:05,395 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-21 23:01:05,396 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 23:01:06,590 WARN L193 SmtUtils]: Spent 1.18 s on a formula simplification. DAG size of input: 145 DAG size of output: 125 [2020-10-21 23:01:06,931 WARN L193 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-10-21 23:01:07,034 WARN L193 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-10-21 23:01:08,312 WARN L193 SmtUtils]: Spent 689.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 119 [2020-10-21 23:01:08,610 WARN L193 SmtUtils]: Spent 294.00 ms on a formula simplification that was a NOOP. DAG size: 116 [2020-10-21 23:01:09,169 WARN L193 SmtUtils]: Spent 378.00 ms on a formula simplification that was a NOOP. DAG size: 127 [2020-10-21 23:01:09,542 WARN L193 SmtUtils]: Spent 370.00 ms on a formula simplification that was a NOOP. DAG size: 127 [2020-10-21 23:01:10,214 WARN L193 SmtUtils]: Spent 658.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 110 [2020-10-21 23:01:10,538 WARN L193 SmtUtils]: Spent 321.00 ms on a formula simplification that was a NOOP. DAG size: 107 [2020-10-21 23:01:11,193 WARN L193 SmtUtils]: Spent 606.00 ms on a formula simplification that was a NOOP. DAG size: 133 [2020-10-21 23:01:11,746 WARN L193 SmtUtils]: Spent 549.00 ms on a formula simplification that was a NOOP. DAG size: 131 [2020-10-21 23:01:12,064 WARN L193 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2020-10-21 23:01:12,186 WARN L193 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2020-10-21 23:01:12,702 WARN L193 SmtUtils]: Spent 496.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 122 [2020-10-21 23:01:12,902 WARN L193 SmtUtils]: Spent 197.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2020-10-21 23:01:12,911 INFO L131 LiptonReduction]: Checked pairs total: 8383 [2020-10-21 23:01:12,911 INFO L133 LiptonReduction]: Total number of compositions: 101 [2020-10-21 23:01:12,918 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 46 places, 33 transitions, 86 flow [2020-10-21 23:01:13,184 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 4122 states. [2020-10-21 23:01:13,187 INFO L276 IsEmpty]: Start isEmpty. Operand 4122 states. [2020-10-21 23:01:13,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-10-21 23:01:13,196 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:01:13,197 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-10-21 23:01:13,197 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:01:13,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:01:13,204 INFO L82 PathProgramCache]: Analyzing trace with hash 1192686716, now seen corresponding path program 1 times [2020-10-21 23:01:13,214 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:01:13,214 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185140096] [2020-10-21 23:01:13,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:01:13,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:01:13,469 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-21 23:01:13,470 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1185140096] [2020-10-21 23:01:13,471 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:01:13,471 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-21 23:01:13,472 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672844565] [2020-10-21 23:01:13,477 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-21 23:01:13,477 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:01:13,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-21 23:01:13,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-21 23:01:13,496 INFO L87 Difference]: Start difference. First operand 4122 states. Second operand 3 states. [2020-10-21 23:01:13,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:01:13,674 INFO L93 Difference]: Finished difference Result 3437 states and 13500 transitions. [2020-10-21 23:01:13,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-21 23:01:13,677 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-10-21 23:01:13,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:01:13,724 INFO L225 Difference]: With dead ends: 3437 [2020-10-21 23:01:13,725 INFO L226 Difference]: Without dead ends: 2812 [2020-10-21 23:01:13,726 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-21 23:01:13,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2812 states. [2020-10-21 23:01:13,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2812 to 2812. [2020-10-21 23:01:13,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2812 states. [2020-10-21 23:01:13,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2812 states to 2812 states and 10875 transitions. [2020-10-21 23:01:13,944 INFO L78 Accepts]: Start accepts. Automaton has 2812 states and 10875 transitions. Word has length 5 [2020-10-21 23:01:13,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:01:13,945 INFO L481 AbstractCegarLoop]: Abstraction has 2812 states and 10875 transitions. [2020-10-21 23:01:13,945 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-21 23:01:13,945 INFO L276 IsEmpty]: Start isEmpty. Operand 2812 states and 10875 transitions. [2020-10-21 23:01:13,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-21 23:01:13,949 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:01:13,949 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:01:13,950 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-21 23:01:13,950 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:01:13,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:01:13,951 INFO L82 PathProgramCache]: Analyzing trace with hash 1586905763, now seen corresponding path program 1 times [2020-10-21 23:01:13,951 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:01:13,951 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708474937] [2020-10-21 23:01:13,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:01:14,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:01:14,100 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-21 23:01:14,100 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1708474937] [2020-10-21 23:01:14,101 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:01:14,101 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-21 23:01:14,102 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395197334] [2020-10-21 23:01:14,103 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-21 23:01:14,104 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:01:14,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-21 23:01:14,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-21 23:01:14,105 INFO L87 Difference]: Start difference. First operand 2812 states and 10875 transitions. Second operand 3 states. [2020-10-21 23:01:14,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:01:14,224 INFO L93 Difference]: Finished difference Result 2762 states and 10645 transitions. [2020-10-21 23:01:14,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-21 23:01:14,225 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2020-10-21 23:01:14,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:01:14,255 INFO L225 Difference]: With dead ends: 2762 [2020-10-21 23:01:14,256 INFO L226 Difference]: Without dead ends: 2762 [2020-10-21 23:01:14,257 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-21 23:01:14,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2762 states. [2020-10-21 23:01:14,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2762 to 2762. [2020-10-21 23:01:14,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2762 states. [2020-10-21 23:01:14,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2762 states to 2762 states and 10645 transitions. [2020-10-21 23:01:14,390 INFO L78 Accepts]: Start accepts. Automaton has 2762 states and 10645 transitions. Word has length 11 [2020-10-21 23:01:14,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:01:14,392 INFO L481 AbstractCegarLoop]: Abstraction has 2762 states and 10645 transitions. [2020-10-21 23:01:14,392 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-21 23:01:14,392 INFO L276 IsEmpty]: Start isEmpty. Operand 2762 states and 10645 transitions. [2020-10-21 23:01:14,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-21 23:01:14,396 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:01:14,396 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:01:14,396 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-21 23:01:14,397 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:01:14,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:01:14,397 INFO L82 PathProgramCache]: Analyzing trace with hash 1804240950, now seen corresponding path program 1 times [2020-10-21 23:01:14,397 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:01:14,398 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136491199] [2020-10-21 23:01:14,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:01:14,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:01:14,761 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-21 23:01:14,762 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136491199] [2020-10-21 23:01:14,762 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:01:14,762 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-21 23:01:14,763 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526654586] [2020-10-21 23:01:14,763 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-21 23:01:14,763 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:01:14,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-21 23:01:14,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-21 23:01:14,764 INFO L87 Difference]: Start difference. First operand 2762 states and 10645 transitions. Second operand 5 states. [2020-10-21 23:01:14,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:01:14,939 INFO L93 Difference]: Finished difference Result 2934 states and 11297 transitions. [2020-10-21 23:01:14,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-21 23:01:14,941 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2020-10-21 23:01:14,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:01:14,967 INFO L225 Difference]: With dead ends: 2934 [2020-10-21 23:01:14,967 INFO L226 Difference]: Without dead ends: 2934 [2020-10-21 23:01:14,968 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-10-21 23:01:14,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2934 states. [2020-10-21 23:01:15,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2934 to 2934. [2020-10-21 23:01:15,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2934 states. [2020-10-21 23:01:15,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2934 states to 2934 states and 11297 transitions. [2020-10-21 23:01:15,092 INFO L78 Accepts]: Start accepts. Automaton has 2934 states and 11297 transitions. Word has length 12 [2020-10-21 23:01:15,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:01:15,093 INFO L481 AbstractCegarLoop]: Abstraction has 2934 states and 11297 transitions. [2020-10-21 23:01:15,093 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-21 23:01:15,093 INFO L276 IsEmpty]: Start isEmpty. Operand 2934 states and 11297 transitions. [2020-10-21 23:01:15,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-21 23:01:15,096 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:01:15,096 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:01:15,096 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-21 23:01:15,096 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:01:15,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:01:15,097 INFO L82 PathProgramCache]: Analyzing trace with hash 1521554523, now seen corresponding path program 1 times [2020-10-21 23:01:15,097 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:01:15,097 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812083945] [2020-10-21 23:01:15,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:01:15,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:01:15,348 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-21 23:01:15,349 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812083945] [2020-10-21 23:01:15,349 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:01:15,349 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-21 23:01:15,350 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528088034] [2020-10-21 23:01:15,350 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-21 23:01:15,350 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:01:15,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-21 23:01:15,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-21 23:01:15,351 INFO L87 Difference]: Start difference. First operand 2934 states and 11297 transitions. Second operand 5 states. [2020-10-21 23:01:15,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:01:15,597 INFO L93 Difference]: Finished difference Result 2920 states and 11221 transitions. [2020-10-21 23:01:15,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-21 23:01:15,598 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-10-21 23:01:15,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:01:15,623 INFO L225 Difference]: With dead ends: 2920 [2020-10-21 23:01:15,623 INFO L226 Difference]: Without dead ends: 2920 [2020-10-21 23:01:15,624 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2020-10-21 23:01:15,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2920 states. [2020-10-21 23:01:15,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2920 to 2859. [2020-10-21 23:01:15,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2859 states. [2020-10-21 23:01:15,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2859 states to 2859 states and 10977 transitions. [2020-10-21 23:01:15,733 INFO L78 Accepts]: Start accepts. Automaton has 2859 states and 10977 transitions. Word has length 13 [2020-10-21 23:01:15,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:01:15,734 INFO L481 AbstractCegarLoop]: Abstraction has 2859 states and 10977 transitions. [2020-10-21 23:01:15,734 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-21 23:01:15,734 INFO L276 IsEmpty]: Start isEmpty. Operand 2859 states and 10977 transitions. [2020-10-21 23:01:15,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-21 23:01:15,737 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:01:15,737 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:01:15,737 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-21 23:01:15,737 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:01:15,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:01:15,737 INFO L82 PathProgramCache]: Analyzing trace with hash -221647490, now seen corresponding path program 1 times [2020-10-21 23:01:15,738 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:01:15,738 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128794734] [2020-10-21 23:01:15,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:01:15,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:01:16,013 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-21 23:01:16,014 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128794734] [2020-10-21 23:01:16,014 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:01:16,014 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-21 23:01:16,015 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039775970] [2020-10-21 23:01:16,015 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-21 23:01:16,015 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:01:16,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-21 23:01:16,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-10-21 23:01:16,016 INFO L87 Difference]: Start difference. First operand 2859 states and 10977 transitions. Second operand 6 states. [2020-10-21 23:01:16,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:01:16,181 INFO L93 Difference]: Finished difference Result 3472 states and 13441 transitions. [2020-10-21 23:01:16,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-21 23:01:16,183 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2020-10-21 23:01:16,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:01:16,210 INFO L225 Difference]: With dead ends: 3472 [2020-10-21 23:01:16,210 INFO L226 Difference]: Without dead ends: 3472 [2020-10-21 23:01:16,210 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-10-21 23:01:16,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3472 states. [2020-10-21 23:01:16,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3472 to 3094. [2020-10-21 23:01:16,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3094 states. [2020-10-21 23:01:16,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3094 states to 3094 states and 11949 transitions. [2020-10-21 23:01:16,476 INFO L78 Accepts]: Start accepts. Automaton has 3094 states and 11949 transitions. Word has length 14 [2020-10-21 23:01:16,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:01:16,477 INFO L481 AbstractCegarLoop]: Abstraction has 3094 states and 11949 transitions. [2020-10-21 23:01:16,477 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-21 23:01:16,477 INFO L276 IsEmpty]: Start isEmpty. Operand 3094 states and 11949 transitions. [2020-10-21 23:01:16,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-21 23:01:16,481 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:01:16,481 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:01:16,481 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-21 23:01:16,482 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:01:16,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:01:16,482 INFO L82 PathProgramCache]: Analyzing trace with hash -76450844, now seen corresponding path program 2 times [2020-10-21 23:01:16,483 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:01:16,483 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881735409] [2020-10-21 23:01:16,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:01:16,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:01:16,734 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-21 23:01:16,734 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881735409] [2020-10-21 23:01:16,734 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:01:16,735 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-21 23:01:16,735 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275690214] [2020-10-21 23:01:16,735 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-21 23:01:16,735 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:01:16,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-21 23:01:16,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-21 23:01:16,736 INFO L87 Difference]: Start difference. First operand 3094 states and 11949 transitions. Second operand 6 states. [2020-10-21 23:01:17,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:01:17,028 INFO L93 Difference]: Finished difference Result 3544 states and 13611 transitions. [2020-10-21 23:01:17,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-21 23:01:17,029 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2020-10-21 23:01:17,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:01:17,046 INFO L225 Difference]: With dead ends: 3544 [2020-10-21 23:01:17,047 INFO L226 Difference]: Without dead ends: 3544 [2020-10-21 23:01:17,047 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-10-21 23:01:17,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3544 states. [2020-10-21 23:01:17,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3544 to 3293. [2020-10-21 23:01:17,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3293 states. [2020-10-21 23:01:17,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3293 states to 3293 states and 12585 transitions. [2020-10-21 23:01:17,189 INFO L78 Accepts]: Start accepts. Automaton has 3293 states and 12585 transitions. Word has length 14 [2020-10-21 23:01:17,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:01:17,189 INFO L481 AbstractCegarLoop]: Abstraction has 3293 states and 12585 transitions. [2020-10-21 23:01:17,189 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-21 23:01:17,189 INFO L276 IsEmpty]: Start isEmpty. Operand 3293 states and 12585 transitions. [2020-10-21 23:01:17,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-21 23:01:17,192 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:01:17,192 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:01:17,193 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-21 23:01:17,193 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:01:17,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:01:17,193 INFO L82 PathProgramCache]: Analyzing trace with hash 1572195959, now seen corresponding path program 1 times [2020-10-21 23:01:17,194 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:01:17,194 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830410532] [2020-10-21 23:01:17,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:01:17,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:01:17,293 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-21 23:01:17,294 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830410532] [2020-10-21 23:01:17,294 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:01:17,294 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-21 23:01:17,295 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007254163] [2020-10-21 23:01:17,295 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-21 23:01:17,295 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:01:17,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-21 23:01:17,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-21 23:01:17,296 INFO L87 Difference]: Start difference. First operand 3293 states and 12585 transitions. Second operand 4 states. [2020-10-21 23:01:17,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:01:17,390 INFO L93 Difference]: Finished difference Result 3316 states and 11559 transitions. [2020-10-21 23:01:17,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-21 23:01:17,391 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2020-10-21 23:01:17,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:01:17,407 INFO L225 Difference]: With dead ends: 3316 [2020-10-21 23:01:17,407 INFO L226 Difference]: Without dead ends: 2495 [2020-10-21 23:01:17,408 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-21 23:01:17,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2495 states. [2020-10-21 23:01:17,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2495 to 2495. [2020-10-21 23:01:17,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2495 states. [2020-10-21 23:01:17,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2495 states to 2495 states and 8595 transitions. [2020-10-21 23:01:17,542 INFO L78 Accepts]: Start accepts. Automaton has 2495 states and 8595 transitions. Word has length 14 [2020-10-21 23:01:17,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:01:17,542 INFO L481 AbstractCegarLoop]: Abstraction has 2495 states and 8595 transitions. [2020-10-21 23:01:17,542 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-21 23:01:17,543 INFO L276 IsEmpty]: Start isEmpty. Operand 2495 states and 8595 transitions. [2020-10-21 23:01:17,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-21 23:01:17,547 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:01:17,547 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:01:17,547 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-21 23:01:17,547 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:01:17,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:01:17,548 INFO L82 PathProgramCache]: Analyzing trace with hash 713638536, now seen corresponding path program 1 times [2020-10-21 23:01:17,548 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:01:17,548 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136940051] [2020-10-21 23:01:17,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:01:17,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:01:17,661 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-21 23:01:17,661 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136940051] [2020-10-21 23:01:17,662 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:01:17,662 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-21 23:01:17,662 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916146836] [2020-10-21 23:01:17,663 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-21 23:01:17,663 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:01:17,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-21 23:01:17,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-21 23:01:17,664 INFO L87 Difference]: Start difference. First operand 2495 states and 8595 transitions. Second operand 5 states. [2020-10-21 23:01:17,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:01:17,746 INFO L93 Difference]: Finished difference Result 2074 states and 6613 transitions. [2020-10-21 23:01:17,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-21 23:01:17,747 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2020-10-21 23:01:17,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:01:17,754 INFO L225 Difference]: With dead ends: 2074 [2020-10-21 23:01:17,754 INFO L226 Difference]: Without dead ends: 1583 [2020-10-21 23:01:17,755 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-21 23:01:17,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1583 states. [2020-10-21 23:01:17,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1583 to 1419. [2020-10-21 23:01:17,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1419 states. [2020-10-21 23:01:17,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1419 states to 1419 states and 4381 transitions. [2020-10-21 23:01:17,811 INFO L78 Accepts]: Start accepts. Automaton has 1419 states and 4381 transitions. Word has length 15 [2020-10-21 23:01:17,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:01:17,812 INFO L481 AbstractCegarLoop]: Abstraction has 1419 states and 4381 transitions. [2020-10-21 23:01:17,812 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-21 23:01:17,812 INFO L276 IsEmpty]: Start isEmpty. Operand 1419 states and 4381 transitions. [2020-10-21 23:01:17,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-10-21 23:01:17,818 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:01:17,818 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:01:17,818 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-21 23:01:17,818 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:01:17,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:01:17,819 INFO L82 PathProgramCache]: Analyzing trace with hash 1377884487, now seen corresponding path program 1 times [2020-10-21 23:01:17,819 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:01:17,819 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400210763] [2020-10-21 23:01:17,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:01:17,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:01:18,006 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-21 23:01:18,006 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400210763] [2020-10-21 23:01:18,007 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:01:18,007 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-21 23:01:18,008 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803645514] [2020-10-21 23:01:18,009 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-21 23:01:18,009 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:01:18,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-21 23:01:18,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-21 23:01:18,010 INFO L87 Difference]: Start difference. First operand 1419 states and 4381 transitions. Second operand 6 states. [2020-10-21 23:01:18,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:01:18,091 INFO L93 Difference]: Finished difference Result 1234 states and 3787 transitions. [2020-10-21 23:01:18,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-21 23:01:18,092 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2020-10-21 23:01:18,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:01:18,097 INFO L225 Difference]: With dead ends: 1234 [2020-10-21 23:01:18,097 INFO L226 Difference]: Without dead ends: 1095 [2020-10-21 23:01:18,098 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2020-10-21 23:01:18,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1095 states. [2020-10-21 23:01:18,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1095 to 1007. [2020-10-21 23:01:18,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1007 states. [2020-10-21 23:01:18,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1007 states to 1007 states and 3145 transitions. [2020-10-21 23:01:18,135 INFO L78 Accepts]: Start accepts. Automaton has 1007 states and 3145 transitions. Word has length 19 [2020-10-21 23:01:18,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:01:18,138 INFO L481 AbstractCegarLoop]: Abstraction has 1007 states and 3145 transitions. [2020-10-21 23:01:18,139 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-21 23:01:18,139 INFO L276 IsEmpty]: Start isEmpty. Operand 1007 states and 3145 transitions. [2020-10-21 23:01:18,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-10-21 23:01:18,142 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:01:18,142 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:01:18,142 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-21 23:01:18,143 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:01:18,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:01:18,143 INFO L82 PathProgramCache]: Analyzing trace with hash 1654709643, now seen corresponding path program 1 times [2020-10-21 23:01:18,143 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:01:18,143 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567055255] [2020-10-21 23:01:18,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:01:18,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:01:18,426 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-21 23:01:18,426 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567055255] [2020-10-21 23:01:18,427 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:01:18,427 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-21 23:01:18,427 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477362342] [2020-10-21 23:01:18,428 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-21 23:01:18,428 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:01:18,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-21 23:01:18,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-10-21 23:01:18,430 INFO L87 Difference]: Start difference. First operand 1007 states and 3145 transitions. Second operand 7 states. [2020-10-21 23:01:18,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:01:18,646 INFO L93 Difference]: Finished difference Result 975 states and 3079 transitions. [2020-10-21 23:01:18,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-21 23:01:18,647 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2020-10-21 23:01:18,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:01:18,651 INFO L225 Difference]: With dead ends: 975 [2020-10-21 23:01:18,651 INFO L226 Difference]: Without dead ends: 956 [2020-10-21 23:01:18,652 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2020-10-21 23:01:18,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 956 states. [2020-10-21 23:01:18,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 956 to 940. [2020-10-21 23:01:18,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 940 states. [2020-10-21 23:01:18,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 940 states to 940 states and 3003 transitions. [2020-10-21 23:01:18,702 INFO L78 Accepts]: Start accepts. Automaton has 940 states and 3003 transitions. Word has length 23 [2020-10-21 23:01:18,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:01:18,706 INFO L481 AbstractCegarLoop]: Abstraction has 940 states and 3003 transitions. [2020-10-21 23:01:18,706 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-21 23:01:18,706 INFO L276 IsEmpty]: Start isEmpty. Operand 940 states and 3003 transitions. [2020-10-21 23:01:18,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-10-21 23:01:18,711 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:01:18,711 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:01:18,712 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-21 23:01:18,712 INFO L429 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:01:18,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:01:18,713 INFO L82 PathProgramCache]: Analyzing trace with hash 1459468934, now seen corresponding path program 1 times [2020-10-21 23:01:18,713 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:01:18,713 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006981311] [2020-10-21 23:01:18,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:01:18,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:01:18,821 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-21 23:01:18,822 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006981311] [2020-10-21 23:01:18,823 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:01:18,823 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-21 23:01:18,823 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534775720] [2020-10-21 23:01:18,824 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-21 23:01:18,824 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:01:18,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-21 23:01:18,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-21 23:01:18,825 INFO L87 Difference]: Start difference. First operand 940 states and 3003 transitions. Second operand 4 states. [2020-10-21 23:01:18,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:01:18,868 INFO L93 Difference]: Finished difference Result 1242 states and 3910 transitions. [2020-10-21 23:01:18,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-21 23:01:18,869 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2020-10-21 23:01:18,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:01:18,874 INFO L225 Difference]: With dead ends: 1242 [2020-10-21 23:01:18,874 INFO L226 Difference]: Without dead ends: 740 [2020-10-21 23:01:18,875 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-21 23:01:18,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 740 states. [2020-10-21 23:01:18,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 740 to 740. [2020-10-21 23:01:18,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 740 states. [2020-10-21 23:01:18,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 740 states to 740 states and 2283 transitions. [2020-10-21 23:01:18,910 INFO L78 Accepts]: Start accepts. Automaton has 740 states and 2283 transitions. Word has length 27 [2020-10-21 23:01:18,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:01:18,910 INFO L481 AbstractCegarLoop]: Abstraction has 740 states and 2283 transitions. [2020-10-21 23:01:18,910 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-21 23:01:18,910 INFO L276 IsEmpty]: Start isEmpty. Operand 740 states and 2283 transitions. [2020-10-21 23:01:18,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-10-21 23:01:18,913 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:01:18,913 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:01:18,914 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-21 23:01:18,914 INFO L429 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:01:18,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:01:18,914 INFO L82 PathProgramCache]: Analyzing trace with hash 408462448, now seen corresponding path program 2 times [2020-10-21 23:01:18,914 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:01:18,915 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003966275] [2020-10-21 23:01:18,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:01:18,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:01:19,081 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-21 23:01:19,082 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003966275] [2020-10-21 23:01:19,082 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:01:19,082 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-21 23:01:19,083 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153364367] [2020-10-21 23:01:19,083 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-21 23:01:19,083 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:01:19,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-21 23:01:19,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-10-21 23:01:19,086 INFO L87 Difference]: Start difference. First operand 740 states and 2283 transitions. Second operand 6 states. [2020-10-21 23:01:19,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:01:19,248 INFO L93 Difference]: Finished difference Result 1353 states and 4096 transitions. [2020-10-21 23:01:19,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-21 23:01:19,249 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2020-10-21 23:01:19,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:01:19,253 INFO L225 Difference]: With dead ends: 1353 [2020-10-21 23:01:19,253 INFO L226 Difference]: Without dead ends: 887 [2020-10-21 23:01:19,254 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-21 23:01:19,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 887 states. [2020-10-21 23:01:19,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 887 to 740. [2020-10-21 23:01:19,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 740 states. [2020-10-21 23:01:19,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 740 states to 740 states and 2203 transitions. [2020-10-21 23:01:19,283 INFO L78 Accepts]: Start accepts. Automaton has 740 states and 2203 transitions. Word has length 27 [2020-10-21 23:01:19,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:01:19,283 INFO L481 AbstractCegarLoop]: Abstraction has 740 states and 2203 transitions. [2020-10-21 23:01:19,284 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-21 23:01:19,284 INFO L276 IsEmpty]: Start isEmpty. Operand 740 states and 2203 transitions. [2020-10-21 23:01:19,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-10-21 23:01:19,289 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:01:19,289 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:01:19,289 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-21 23:01:19,289 INFO L429 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:01:19,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:01:19,290 INFO L82 PathProgramCache]: Analyzing trace with hash 1137236038, now seen corresponding path program 3 times [2020-10-21 23:01:19,290 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:01:19,291 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603285149] [2020-10-21 23:01:19,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:01:19,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:01:19,377 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-21 23:01:19,378 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603285149] [2020-10-21 23:01:19,378 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:01:19,378 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-21 23:01:19,378 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714546909] [2020-10-21 23:01:19,379 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-21 23:01:19,379 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:01:19,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-21 23:01:19,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-21 23:01:19,380 INFO L87 Difference]: Start difference. First operand 740 states and 2203 transitions. Second operand 4 states. [2020-10-21 23:01:19,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:01:19,410 INFO L93 Difference]: Finished difference Result 922 states and 2724 transitions. [2020-10-21 23:01:19,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-21 23:01:19,411 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2020-10-21 23:01:19,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:01:19,413 INFO L225 Difference]: With dead ends: 922 [2020-10-21 23:01:19,413 INFO L226 Difference]: Without dead ends: 332 [2020-10-21 23:01:19,414 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-21 23:01:19,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2020-10-21 23:01:19,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 332. [2020-10-21 23:01:19,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 332 states. [2020-10-21 23:01:19,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 907 transitions. [2020-10-21 23:01:19,427 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 907 transitions. Word has length 27 [2020-10-21 23:01:19,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:01:19,428 INFO L481 AbstractCegarLoop]: Abstraction has 332 states and 907 transitions. [2020-10-21 23:01:19,428 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-21 23:01:19,428 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 907 transitions. [2020-10-21 23:01:19,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-10-21 23:01:19,430 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:01:19,430 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:01:19,430 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-21 23:01:19,430 INFO L429 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:01:19,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:01:19,431 INFO L82 PathProgramCache]: Analyzing trace with hash -851335184, now seen corresponding path program 4 times [2020-10-21 23:01:19,431 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:01:19,431 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169960450] [2020-10-21 23:01:19,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:01:19,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:01:20,035 WARN L193 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 18 [2020-10-21 23:01:20,064 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-21 23:01:20,065 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169960450] [2020-10-21 23:01:20,065 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:01:20,065 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-21 23:01:20,065 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734642424] [2020-10-21 23:01:20,066 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-21 23:01:20,066 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:01:20,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-21 23:01:20,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-10-21 23:01:20,067 INFO L87 Difference]: Start difference. First operand 332 states and 907 transitions. Second operand 9 states. [2020-10-21 23:01:20,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:01:20,281 INFO L93 Difference]: Finished difference Result 543 states and 1445 transitions. [2020-10-21 23:01:20,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-21 23:01:20,282 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 27 [2020-10-21 23:01:20,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:01:20,284 INFO L225 Difference]: With dead ends: 543 [2020-10-21 23:01:20,284 INFO L226 Difference]: Without dead ends: 411 [2020-10-21 23:01:20,285 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2020-10-21 23:01:20,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2020-10-21 23:01:20,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 336. [2020-10-21 23:01:20,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 336 states. [2020-10-21 23:01:20,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 895 transitions. [2020-10-21 23:01:20,298 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 895 transitions. Word has length 27 [2020-10-21 23:01:20,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:01:20,299 INFO L481 AbstractCegarLoop]: Abstraction has 336 states and 895 transitions. [2020-10-21 23:01:20,299 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-21 23:01:20,299 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 895 transitions. [2020-10-21 23:01:20,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-10-21 23:01:20,301 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:01:20,301 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:01:20,302 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-21 23:01:20,302 INFO L429 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:01:20,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:01:20,302 INFO L82 PathProgramCache]: Analyzing trace with hash -1386038608, now seen corresponding path program 5 times [2020-10-21 23:01:20,303 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:01:20,303 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459301825] [2020-10-21 23:01:20,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:01:20,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:01:21,120 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-21 23:01:21,121 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [459301825] [2020-10-21 23:01:21,121 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:01:21,121 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-21 23:01:21,122 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925809438] [2020-10-21 23:01:21,124 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-21 23:01:21,124 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:01:21,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-21 23:01:21,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2020-10-21 23:01:21,125 INFO L87 Difference]: Start difference. First operand 336 states and 895 transitions. Second operand 10 states. [2020-10-21 23:01:21,306 WARN L193 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 31 [2020-10-21 23:01:21,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:01:21,534 INFO L93 Difference]: Finished difference Result 374 states and 981 transitions. [2020-10-21 23:01:21,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-21 23:01:21,535 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 27 [2020-10-21 23:01:21,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:01:21,536 INFO L225 Difference]: With dead ends: 374 [2020-10-21 23:01:21,536 INFO L226 Difference]: Without dead ends: 296 [2020-10-21 23:01:21,537 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2020-10-21 23:01:21,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2020-10-21 23:01:21,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 256. [2020-10-21 23:01:21,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2020-10-21 23:01:21,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 683 transitions. [2020-10-21 23:01:21,547 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 683 transitions. Word has length 27 [2020-10-21 23:01:21,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:01:21,548 INFO L481 AbstractCegarLoop]: Abstraction has 256 states and 683 transitions. [2020-10-21 23:01:21,548 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-21 23:01:21,548 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 683 transitions. [2020-10-21 23:01:21,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-10-21 23:01:21,549 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:01:21,549 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:01:21,549 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-10-21 23:01:21,550 INFO L429 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:01:21,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:01:21,550 INFO L82 PathProgramCache]: Analyzing trace with hash 672342000, now seen corresponding path program 6 times [2020-10-21 23:01:21,550 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:01:21,550 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311705057] [2020-10-21 23:01:21,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:01:21,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-21 23:01:21,632 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-21 23:01:21,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-21 23:01:21,696 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-21 23:01:21,740 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-21 23:01:21,741 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-21 23:01:21,741 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-10-21 23:01:21,742 WARN L264 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-10-21 23:01:21,763 WARN L124 codingBacktranslator]: Skipped backtranslation of ATE [1197] [1197] L2-->L866: Formula: (let ((.cse6 (= (mod ~x$w_buff1_used~0_In-464447603 256) 0)) (.cse7 (= (mod ~x$r_buff1_thd0~0_In-464447603 256) 0)) (.cse9 (= (mod ~x$r_buff0_thd0~0_In-464447603 256) 0)) (.cse8 (= (mod ~x$w_buff0_used~0_In-464447603 256) 0))) (let ((.cse0 (not .cse8)) (.cse1 (not .cse9)) (.cse2 (or .cse8 .cse9)) (.cse3 (or .cse6 .cse7)) (.cse4 (not .cse7)) (.cse5 (not .cse6))) (and (= ULTIMATE.start_assume_abort_if_not_~cond_Out-464447603 |ULTIMATE.start_assume_abort_if_not_#in~cond_In-464447603|) (= ~x$r_buff0_thd0~0_Out-464447603 ~x$r_buff0_thd0~0_In-464447603) (= ~x$r_buff1_thd0~0_Out-464447603 ~x$r_buff1_thd0~0_In-464447603) (or (and .cse0 .cse1 (= ~x$w_buff0_used~0_Out-464447603 0)) (and (= ~x$w_buff0_used~0_In-464447603 ~x$w_buff0_used~0_Out-464447603) .cse2)) (or (and .cse0 (= ~x$w_buff0~0_In-464447603 ~x~0_Out-464447603) .cse1) (and (or (and (= ~x~0_In-464447603 ~x~0_Out-464447603) .cse3) (and (= ~x~0_Out-464447603 ~x$w_buff1~0_In-464447603) .cse4 .cse5)) .cse2)) (or (and .cse3 (= ~x$w_buff1_used~0_In-464447603 ~x$w_buff1_used~0_Out-464447603)) (and (= ~x$w_buff1_used~0_Out-464447603 0) .cse4 .cse5)) (not (= ULTIMATE.start_assume_abort_if_not_~cond_Out-464447603 0))))) InVars {~x$w_buff0~0=~x$w_buff0~0_In-464447603, ~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-464447603, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In-464447603|, ~x$w_buff1~0=~x$w_buff1~0_In-464447603, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-464447603, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-464447603, ~x~0=~x~0_In-464447603, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-464447603} OutVars{~x$w_buff0~0=~x$w_buff0~0_In-464447603, ~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_Out-464447603, ~x$w_buff1~0=~x$w_buff1~0_In-464447603, ULTIMATE.start_main_#t~ite35=|ULTIMATE.start_main_#t~ite35_Out-464447603|, ~x$w_buff1_used~0=~x$w_buff1_used~0_Out-464447603, ULTIMATE.start_main_#t~ite36=|ULTIMATE.start_main_#t~ite36_Out-464447603|, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out-464447603|, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out-464447603|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_Out-464447603, ULTIMATE.start_main_#t~ite33=|ULTIMATE.start_main_#t~ite33_Out-464447603|, ~x$w_buff0_used~0=~x$w_buff0_used~0_Out-464447603, ULTIMATE.start_main_#t~ite34=|ULTIMATE.start_main_#t~ite34_Out-464447603|, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In-464447603|, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_Out-464447603, ~x~0=~x~0_Out-464447603} AuxVars[] AssignedVars[~x$r_buff0_thd0~0, ULTIMATE.start_assume_abort_if_not_~cond, ULTIMATE.start_main_#t~ite35, ~x$w_buff1_used~0, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ULTIMATE.start_main_#t~ite37, ~x$r_buff1_thd0~0, ~x~0, ULTIMATE.start_main_#t~ite33, ~x$w_buff0_used~0, ULTIMATE.start_main_#t~ite34] because there is no mapped edge [2020-10-21 23:01:21,770 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:01:21,770 WARN L224 RCFGBacktranslator]: unable to determine which branch was taken at C: __VERIFIER_atomic_begin() [769] [2020-10-21 23:01:21,772 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:01:21,773 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:01:21,773 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:01:21,773 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:01:21,773 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:01:21,773 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:01:21,774 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:01:21,774 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:01:21,774 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:01:21,774 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:01:21,775 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:01:21,775 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:01:21,775 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:01:21,776 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:01:21,776 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:01:21,776 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:01:21,776 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:01:21,776 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:01:21,777 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:01:21,777 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:01:21,777 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:01:21,777 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:01:21,778 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:01:21,778 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:01:21,778 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:01:21,778 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:01:21,779 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:01:21,779 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:01:21,779 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:01:21,779 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:01:21,779 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:01:21,779 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:01:21,780 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:01:21,780 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:01:21,780 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:01:21,780 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:01:21,780 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:01:21,781 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:01:21,781 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:01:21,781 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:01:21,781 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:01:21,781 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:01:21,782 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:01:21,782 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:01:21,782 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:01:21,783 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:01:21,783 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:01:21,783 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:01:21,783 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:01:21,783 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:01:21,783 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:01:21,784 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:01:21,784 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:01:21,784 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:01:21,784 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:01:21,784 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:01:21,785 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:01:21,785 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:01:21,785 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:01:21,785 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:01:21,785 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:01:21,786 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:01:21,786 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:01:21,786 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:01:21,786 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:01:21,786 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:01:21,900 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.10 11:01:21 BasicIcfg [2020-10-21 23:01:21,900 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-21 23:01:21,902 INFO L168 Benchmark]: Toolchain (without parser) took 22917.41 ms. Allocated memory was 137.4 MB in the beginning and 554.2 MB in the end (delta: 416.8 MB). Free memory was 99.2 MB in the beginning and 366.4 MB in the end (delta: -267.2 MB). Peak memory consumption was 149.7 MB. Max. memory is 7.1 GB. [2020-10-21 23:01:21,902 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 137.4 MB. Free memory was 118.9 MB in the beginning and 118.6 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-10-21 23:01:21,903 INFO L168 Benchmark]: CACSL2BoogieTranslator took 863.67 ms. Allocated memory was 137.4 MB in the beginning and 201.3 MB in the end (delta: 64.0 MB). Free memory was 98.2 MB in the beginning and 152.8 MB in the end (delta: -54.7 MB). Peak memory consumption was 23.1 MB. Max. memory is 7.1 GB. [2020-10-21 23:01:21,904 INFO L168 Benchmark]: Boogie Procedure Inliner took 78.12 ms. Allocated memory is still 201.3 MB. Free memory was 152.1 MB in the beginning and 149.2 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. [2020-10-21 23:01:21,904 INFO L168 Benchmark]: Boogie Preprocessor took 47.77 ms. Allocated memory is still 201.3 MB. Free memory was 149.2 MB in the beginning and 146.3 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. [2020-10-21 23:01:21,905 INFO L168 Benchmark]: RCFGBuilder took 2571.03 ms. Allocated memory was 201.3 MB in the beginning and 252.2 MB in the end (delta: 50.9 MB). Free memory was 146.3 MB in the beginning and 143.2 MB in the end (delta: 3.2 MB). Peak memory consumption was 101.8 MB. Max. memory is 7.1 GB. [2020-10-21 23:01:21,906 INFO L168 Benchmark]: TraceAbstraction took 19345.74 ms. Allocated memory was 252.2 MB in the beginning and 554.2 MB in the end (delta: 302.0 MB). Free memory was 143.2 MB in the beginning and 366.4 MB in the end (delta: -223.2 MB). Peak memory consumption was 78.8 MB. Max. memory is 7.1 GB. [2020-10-21 23:01:21,909 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23 ms. Allocated memory is still 137.4 MB. Free memory was 118.9 MB in the beginning and 118.6 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 863.67 ms. Allocated memory was 137.4 MB in the beginning and 201.3 MB in the end (delta: 64.0 MB). Free memory was 98.2 MB in the beginning and 152.8 MB in the end (delta: -54.7 MB). Peak memory consumption was 23.1 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 78.12 ms. Allocated memory is still 201.3 MB. Free memory was 152.1 MB in the beginning and 149.2 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 47.77 ms. Allocated memory is still 201.3 MB. Free memory was 149.2 MB in the beginning and 146.3 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2571.03 ms. Allocated memory was 201.3 MB in the beginning and 252.2 MB in the end (delta: 50.9 MB). Free memory was 146.3 MB in the beginning and 143.2 MB in the end (delta: 3.2 MB). Peak memory consumption was 101.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 19345.74 ms. Allocated memory was 252.2 MB in the beginning and 554.2 MB in the end (delta: 302.0 MB). Free memory was 143.2 MB in the beginning and 366.4 MB in the end (delta: -223.2 MB). Peak memory consumption was 78.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 1470 VarBasedMoverChecksPositive, 47 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 129 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 10.1s, 130 PlacesBefore, 46 PlacesAfterwards, 120 TransitionsBefore, 33 TransitionsAfterwards, 2896 CoEnabledTransitionPairs, 7 FixpointIterations, 40 TrivialSequentialCompositions, 51 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 7 ConcurrentYvCompositions, 3 ChoiceCompositions, 101 TotalNumberOfCompositions, 8383 MoverChecksTotal - CounterExampleResult [Line: 17]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p1_EAX = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L716] 0 int __unbuffered_p3_EAX = 0; [L718] 0 int a = 0; [L719] 0 _Bool main$tmp_guard0; [L720] 0 _Bool main$tmp_guard1; [L722] 0 int x = 0; [L723] 0 _Bool x$flush_delayed; [L724] 0 int x$mem_tmp; [L725] 0 _Bool x$r_buff0_thd0; [L726] 0 _Bool x$r_buff0_thd1; [L727] 0 _Bool x$r_buff0_thd2; [L728] 0 _Bool x$r_buff0_thd3; [L729] 0 _Bool x$r_buff0_thd4; [L730] 0 _Bool x$r_buff1_thd0; [L731] 0 _Bool x$r_buff1_thd1; [L732] 0 _Bool x$r_buff1_thd2; [L733] 0 _Bool x$r_buff1_thd3; [L734] 0 _Bool x$r_buff1_thd4; [L735] 0 _Bool x$read_delayed; [L736] 0 int *x$read_delayed_var; [L737] 0 int x$w_buff0; [L738] 0 _Bool x$w_buff0_used; [L739] 0 int x$w_buff1; [L740] 0 _Bool x$w_buff1_used; [L742] 0 int y = 0; [L744] 0 int z = 0; [L745] 0 _Bool weak$$choice0; [L746] 0 _Bool weak$$choice2; [L848] 0 pthread_t t1377; [L849] FCALL, FORK 0 pthread_create(&t1377, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L850] 0 pthread_t t1378; [L851] FCALL, FORK 0 pthread_create(&t1378, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L852] 0 pthread_t t1379; [L770] 2 x$w_buff1 = x$w_buff0 [L771] 2 x$w_buff0 = 2 [L772] 2 x$w_buff1_used = x$w_buff0_used [L773] 2 x$w_buff0_used = (_Bool)1 [L18] COND FALSE 2 !(!expression) [L775] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L776] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L777] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L778] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L779] 2 x$r_buff1_thd4 = x$r_buff0_thd4 [L780] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L783] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L853] FCALL, FORK 0 pthread_create(&t1379, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L854] 0 pthread_t t1380; [L855] FCALL, FORK 0 pthread_create(&t1380, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L800] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L803] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L806] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L806] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L807] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L807] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L808] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L808] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L809] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L809] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L810] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L810] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L813] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L815] 3 return 0; [L820] 4 z = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L823] 4 __unbuffered_p3_EAX = a VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L826] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L826] EXPR 4 x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x [L826] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L826] 4 x = x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L827] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$w_buff0_used [L827] 4 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$w_buff0_used [L828] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$w_buff1_used [L828] 4 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$w_buff1_used [L829] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$r_buff0_thd4 [L829] 4 x$r_buff0_thd4 = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$r_buff0_thd4 [L830] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$r_buff1_thd4 [L830] 4 x$r_buff1_thd4 = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$r_buff1_thd4 [L750] 1 a = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L753] 1 x = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L756] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L756] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L757] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L757] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L758] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L758] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L759] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L759] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L760] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L760] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L763] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L765] 1 return 0; [L786] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L786] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L787] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L787] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L788] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L788] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L789] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L789] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L790] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L790] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L793] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L795] 2 return 0; [L833] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L835] 4 return 0; [L857] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L868] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L869] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L870] 0 x$flush_delayed = weak$$choice2 [L871] 0 x$mem_tmp = x [L872] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L872] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L873] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L873] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0) [L873] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L873] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L874] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L874] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L875] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L875] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used) [L875] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L875] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L876] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L876] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L876] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L876] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L877] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L877] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L878] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L878] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L878] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L878] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L879] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 0) [L880] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L880] 0 x = x$flush_delayed ? x$mem_tmp : x [L881] 0 x$flush_delayed = (_Bool)0 [L18] COND TRUE 0 !expression [L17] COND FALSE 0 !(0) [L17] 0 __assert_fail ("0", "mix051_tso.oepc.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 118 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 19.0s, OverallIterations: 16, TraceHistogramMax: 1, AutomataDifference: 2.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 10.4s, HoareTripleCheckerStatistics: 554 SDtfs, 758 SDslu, 1112 SDs, 0 SdLazy, 552 SolverSat, 161 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 76 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 2.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4122occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.3s AutomataMinimizationTime, 15 MinimizatonAttempts, 1220 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 2.9s InterpolantComputationTime, 302 NumberOfCodeBlocks, 302 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 260 ConstructedInterpolants, 0 QuantifiedInterpolants, 60384 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...