/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-McrAutomaton-WP.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix005_power.oepc_pso.oepc_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.mcr-reduction-c7b2d19 [2022-03-15 17:49:09,378 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-03-15 17:49:09,380 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-03-15 17:49:09,414 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-03-15 17:49:09,414 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-03-15 17:49:09,415 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-03-15 17:49:09,416 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-03-15 17:49:09,417 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-03-15 17:49:09,418 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-03-15 17:49:09,419 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-03-15 17:49:09,420 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-03-15 17:49:09,420 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-03-15 17:49:09,420 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-03-15 17:49:09,421 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-03-15 17:49:09,422 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-03-15 17:49:09,422 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-03-15 17:49:09,423 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-03-15 17:49:09,423 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-03-15 17:49:09,424 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-03-15 17:49:09,425 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-03-15 17:49:09,426 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-03-15 17:49:09,427 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-03-15 17:49:09,427 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-03-15 17:49:09,428 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-03-15 17:49:09,430 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-03-15 17:49:09,430 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-03-15 17:49:09,430 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-03-15 17:49:09,431 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-03-15 17:49:09,431 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-03-15 17:49:09,432 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-03-15 17:49:09,432 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-03-15 17:49:09,432 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-03-15 17:49:09,433 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-03-15 17:49:09,433 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-03-15 17:49:09,434 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-03-15 17:49:09,434 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-03-15 17:49:09,435 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-03-15 17:49:09,435 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-03-15 17:49:09,435 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-03-15 17:49:09,436 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-03-15 17:49:09,436 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-03-15 17:49:09,437 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-McrAutomaton-WP.epf [2022-03-15 17:49:09,452 INFO L113 SettingsManager]: Loading preferences was successful [2022-03-15 17:49:09,452 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-03-15 17:49:09,453 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-03-15 17:49:09,453 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-03-15 17:49:09,453 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-03-15 17:49:09,454 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-03-15 17:49:09,454 INFO L138 SettingsManager]: * Use SBE=true [2022-03-15 17:49:09,454 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-03-15 17:49:09,454 INFO L138 SettingsManager]: * sizeof long=4 [2022-03-15 17:49:09,454 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-03-15 17:49:09,454 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-03-15 17:49:09,454 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-03-15 17:49:09,455 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-03-15 17:49:09,455 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-03-15 17:49:09,455 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-03-15 17:49:09,455 INFO L138 SettingsManager]: * sizeof long double=12 [2022-03-15 17:49:09,455 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-03-15 17:49:09,455 INFO L138 SettingsManager]: * Use constant arrays=true [2022-03-15 17:49:09,455 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-03-15 17:49:09,456 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-03-15 17:49:09,456 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-03-15 17:49:09,456 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-03-15 17:49:09,456 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-03-15 17:49:09,456 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-15 17:49:09,456 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-03-15 17:49:09,456 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-03-15 17:49:09,457 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-03-15 17:49:09,457 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-03-15 17:49:09,457 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-03-15 17:49:09,457 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2022-03-15 17:49:09,457 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2022-03-15 17:49:09,457 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-03-15 17:49:09,457 INFO L138 SettingsManager]: * Interpolant automaton=MCR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-03-15 17:49:09,617 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-03-15 17:49:09,632 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-03-15 17:49:09,633 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-03-15 17:49:09,634 INFO L271 PluginConnector]: Initializing CDTParser... [2022-03-15 17:49:09,635 INFO L275 PluginConnector]: CDTParser initialized [2022-03-15 17:49:09,635 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix005_power.oepc_pso.oepc_rmo.oepc.i [2022-03-15 17:49:09,696 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f17852f15/6739e5eb182d407b99962c5c86eda021/FLAG5936e19be [2022-03-15 17:49:10,108 INFO L306 CDTParser]: Found 1 translation units. [2022-03-15 17:49:10,108 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix005_power.oepc_pso.oepc_rmo.oepc.i [2022-03-15 17:49:10,129 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f17852f15/6739e5eb182d407b99962c5c86eda021/FLAG5936e19be [2022-03-15 17:49:10,144 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f17852f15/6739e5eb182d407b99962c5c86eda021 [2022-03-15 17:49:10,146 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-03-15 17:49:10,147 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-03-15 17:49:10,149 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-03-15 17:49:10,149 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-03-15 17:49:10,151 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-03-15 17:49:10,152 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 05:49:10" (1/1) ... [2022-03-15 17:49:10,153 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@59097d3f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 05:49:10, skipping insertion in model container [2022-03-15 17:49:10,153 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 05:49:10" (1/1) ... [2022-03-15 17:49:10,157 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-03-15 17:49:10,196 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-03-15 17:49:10,348 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix005_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2022-03-15 17:49:10,504 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-15 17:49:10,511 INFO L203 MainTranslator]: Completed pre-run [2022-03-15 17:49:10,518 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix005_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2022-03-15 17:49:10,551 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-15 17:49:10,574 INFO L208 MainTranslator]: Completed translation [2022-03-15 17:49:10,575 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 05:49:10 WrapperNode [2022-03-15 17:49:10,575 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-03-15 17:49:10,576 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-03-15 17:49:10,576 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-03-15 17:49:10,576 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-03-15 17:49:10,581 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 05:49:10" (1/1) ... [2022-03-15 17:49:10,593 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 05:49:10" (1/1) ... [2022-03-15 17:49:10,611 INFO L137 Inliner]: procedures = 177, calls = 71, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 194 [2022-03-15 17:49:10,612 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-03-15 17:49:10,612 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-03-15 17:49:10,612 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-03-15 17:49:10,612 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-03-15 17:49:10,618 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 05:49:10" (1/1) ... [2022-03-15 17:49:10,618 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 05:49:10" (1/1) ... [2022-03-15 17:49:10,622 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 05:49:10" (1/1) ... [2022-03-15 17:49:10,622 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 05:49:10" (1/1) ... [2022-03-15 17:49:10,650 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 05:49:10" (1/1) ... [2022-03-15 17:49:10,653 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 05:49:10" (1/1) ... [2022-03-15 17:49:10,655 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 05:49:10" (1/1) ... [2022-03-15 17:49:10,658 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-03-15 17:49:10,659 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-03-15 17:49:10,659 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-03-15 17:49:10,659 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-03-15 17:49:10,660 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 05:49:10" (1/1) ... [2022-03-15 17:49:10,674 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-15 17:49:10,683 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 17:49:10,694 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-03-15 17:49:10,701 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-03-15 17:49:10,730 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-03-15 17:49:10,730 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-03-15 17:49:10,730 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-03-15 17:49:10,730 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-03-15 17:49:10,730 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-03-15 17:49:10,730 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-03-15 17:49:10,730 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-03-15 17:49:10,731 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-03-15 17:49:10,731 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-03-15 17:49:10,732 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-03-15 17:49:10,732 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-03-15 17:49:10,732 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-03-15 17:49:10,732 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-03-15 17:49:10,732 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-03-15 17:49:10,732 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-03-15 17:49:10,733 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-03-15 17:49:10,733 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-03-15 17:49:10,734 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-03-15 17:49:10,894 INFO L234 CfgBuilder]: Building ICFG [2022-03-15 17:49:10,895 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-03-15 17:49:11,275 INFO L275 CfgBuilder]: Performing block encoding [2022-03-15 17:49:11,501 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-03-15 17:49:11,501 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-03-15 17:49:11,504 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 05:49:11 BoogieIcfgContainer [2022-03-15 17:49:11,504 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-03-15 17:49:11,506 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-03-15 17:49:11,506 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-03-15 17:49:11,508 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-03-15 17:49:11,508 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.03 05:49:10" (1/3) ... [2022-03-15 17:49:11,509 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6acf88cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 05:49:11, skipping insertion in model container [2022-03-15 17:49:11,509 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 05:49:10" (2/3) ... [2022-03-15 17:49:11,510 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6acf88cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 05:49:11, skipping insertion in model container [2022-03-15 17:49:11,510 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 05:49:11" (3/3) ... [2022-03-15 17:49:11,511 INFO L111 eAbstractionObserver]: Analyzing ICFG mix005_power.oepc_pso.oepc_rmo.oepc.i [2022-03-15 17:49:11,517 WARN L150 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-03-15 17:49:11,517 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-03-15 17:49:11,518 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-03-15 17:49:11,518 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-03-15 17:49:11,604 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:49:11,605 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:49:11,605 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:49:11,605 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:49:11,605 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:49:11,605 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:49:11,605 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:49:11,605 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:49:11,605 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:49:11,606 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:49:11,606 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:49:11,606 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:49:11,606 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:49:11,606 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:49:11,607 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:49:11,607 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:49:11,607 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:49:11,607 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:49:11,607 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:49:11,608 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:49:11,608 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:49:11,608 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:49:11,608 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:49:11,608 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:49:11,609 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:49:11,609 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:49:11,609 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:49:11,609 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:49:11,609 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:49:11,609 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:49:11,611 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:49:11,611 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:49:11,612 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:49:11,612 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:49:11,612 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:49:11,612 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:49:11,612 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:49:11,612 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:49:11,612 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:49:11,612 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:49:11,612 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:49:11,612 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:49:11,613 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:49:11,613 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:49:11,613 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:49:11,613 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:49:11,613 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:49:11,613 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:49:11,613 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:49:11,614 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:49:11,614 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:49:11,614 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:49:11,614 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:49:11,614 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:49:11,614 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:49:11,614 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:49:11,615 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:49:11,615 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:49:11,615 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:49:11,615 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:49:11,615 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:49:11,615 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:49:11,615 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:49:11,615 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:49:11,615 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:49:11,615 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:49:11,615 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:49:11,616 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:49:11,616 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:49:11,616 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:49:11,616 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:49:11,616 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:49:11,616 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:49:11,616 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:49:11,617 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:49:11,617 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:49:11,617 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:49:11,617 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:49:11,617 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:49:11,617 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:49:11,617 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:49:11,617 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:49:11,618 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:49:11,618 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:49:11,625 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:49:11,625 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:49:11,626 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:49:11,626 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:49:11,628 WARN L322 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:49:11,632 WARN L322 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:49:11,632 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:49:11,632 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:49:11,632 WARN L322 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:49:11,633 WARN L322 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:49:11,633 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~nondet21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:49:11,633 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:49:11,633 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:49:11,633 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:49:11,633 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:49:11,633 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:49:11,634 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:49:11,634 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:49:11,634 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:49:11,634 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:49:11,634 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:49:11,634 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:49:11,634 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~nondet22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:49:11,635 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:49:11,635 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:49:11,635 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:49:11,635 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:49:11,635 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:49:11,635 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:49:11,635 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:49:11,635 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:49:11,635 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:49:11,635 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:49:11,635 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:49:11,635 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:49:11,635 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~nondet22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:49:11,635 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:49:11,635 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~nondet21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:49:11,636 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:49:11,636 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:49:11,636 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:49:11,636 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:49:11,636 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:49:11,636 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:49:11,636 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:49:11,636 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:49:11,636 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:49:11,636 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:49:11,638 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~nondet21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:49:11,638 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:49:11,638 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:49:11,638 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:49:11,638 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:49:11,638 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:49:11,638 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:49:11,638 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:49:11,638 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:49:11,638 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:49:11,638 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:49:11,638 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:49:11,638 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~nondet22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:49:11,638 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:49:11,638 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:49:11,639 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:49:11,639 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:49:11,639 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:49:11,639 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:49:11,639 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:49:11,639 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:49:11,640 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:49:11,640 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:49:11,640 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:49:11,640 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:49:11,640 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~nondet22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:49:11,640 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:49:11,640 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~nondet21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:49:11,640 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:49:11,640 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:49:11,640 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:49:11,640 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:49:11,640 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:49:11,641 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:49:11,641 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:49:11,641 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:49:11,641 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:49:11,641 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:49:11,643 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:49:11,643 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:49:11,643 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:49:11,643 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:49:11,643 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:49:11,643 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:49:11,643 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:49:11,643 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:49:11,643 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:49:11,643 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:49:11,644 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:49:11,644 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:49:11,644 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:49:11,644 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:49:11,644 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:49:11,644 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:49:11,645 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:49:11,645 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:49:11,647 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:49:11,647 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:49:11,647 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:49:11,648 WARN L322 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:49:11,648 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:49:11,648 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:49:11,648 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:49:11,648 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:49:11,648 WARN L322 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:49:11,648 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:49:11,648 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:49:11,648 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:49:11,649 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:49:11,649 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:49:11,649 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:49:11,649 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:49:11,649 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:49:11,649 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:49:11,649 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:49:11,649 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:49:11,649 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:49:11,649 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:49:11,649 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~nondet22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:49:11,649 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:49:11,649 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:49:11,649 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~nondet21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:49:11,650 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:49:11,652 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:49:11,653 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:49:11,653 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:49:11,653 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:49:11,653 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:49:11,653 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:49:11,654 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:49:11,654 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:49:11,654 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:49:11,655 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:49:11,655 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:49:11,655 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:49:11,655 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:49:11,655 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:49:11,655 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:49:11,655 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:49:11,655 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:49:11,655 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:49:11,656 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:49:11,656 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:49:11,660 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:49:11,660 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:49:11,660 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:49:11,660 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:49:11,660 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:49:11,660 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:49:11,661 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:49:11,661 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:49:11,661 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:49:11,661 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:49:11,661 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:49:11,661 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:49:11,661 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:49:11,661 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:49:11,661 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:49:11,661 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:49:11,662 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:49:11,662 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:49:11,662 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-03-15 17:49:11,701 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-03-15 17:49:11,712 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=MCR, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mLazyFiniteAutomaton=false, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=true, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR, mMcrOptimizeForkJoin=true, mMcrOverapproximateWrwc=true [2022-03-15 17:49:11,712 INFO L340 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-03-15 17:49:11,725 INFO L126 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2022-03-15 17:49:11,732 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 151 places, 140 transitions, 300 flow [2022-03-15 17:49:11,735 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 151 places, 140 transitions, 300 flow [2022-03-15 17:49:11,736 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 151 places, 140 transitions, 300 flow [2022-03-15 17:49:11,790 INFO L129 PetriNetUnfolder]: 2/136 cut-off events. [2022-03-15 17:49:11,790 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-03-15 17:49:11,794 INFO L84 FinitePrefix]: Finished finitePrefix Result has 149 conditions, 136 events. 2/136 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 77 event pairs, 0 based on Foata normal form. 0/132 useless extension candidates. Maximal degree in co-relation 93. Up to 2 conditions per place. [2022-03-15 17:49:11,798 INFO L116 LiptonReduction]: Number of co-enabled transitions 3534 [2022-03-15 17:49:15,285 INFO L131 LiptonReduction]: Checked pairs total: 9664 [2022-03-15 17:49:15,285 INFO L133 LiptonReduction]: Total number of compositions: 117 [2022-03-15 17:49:15,297 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 50 places, 38 transitions, 96 flow [2022-03-15 17:49:15,571 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 7274 states, 7271 states have (on average 4.225278503644615) internal successors, (30722), 7273 states have internal predecessors, (30722), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 17:49:15,597 INFO L276 IsEmpty]: Start isEmpty. Operand has 7274 states, 7271 states have (on average 4.225278503644615) internal successors, (30722), 7273 states have internal predecessors, (30722), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 17:49:15,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-03-15 17:49:15,600 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 17:49:15,601 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1] [2022-03-15 17:49:15,601 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-03-15 17:49:15,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 17:49:15,605 INFO L85 PathProgramCache]: Analyzing trace with hash 1285208, now seen corresponding path program 1 times [2022-03-15 17:49:15,618 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 17:49:15,618 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644303544] [2022-03-15 17:49:15,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 17:49:15,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 17:49:15,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 17:49:15,750 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 17:49:15,750 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 17:49:15,750 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1644303544] [2022-03-15 17:49:15,751 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1644303544] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 17:49:15,751 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 17:49:15,751 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-03-15 17:49:15,752 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [959125582] [2022-03-15 17:49:15,752 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 17:49:15,753 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 17:49:15,759 INFO L252 McrAutomatonBuilder]: Finished intersection with 4 states and 3 transitions. [2022-03-15 17:49:15,760 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 17:49:15,762 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 17:49:15,763 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-15 17:49:15,763 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 17:49:15,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-15 17:49:15,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-15 17:49:15,799 INFO L87 Difference]: Start difference. First operand has 7274 states, 7271 states have (on average 4.225278503644615) internal successors, (30722), 7273 states have internal predecessors, (30722), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 17:49:15,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 17:49:15,933 INFO L93 Difference]: Finished difference Result 5942 states and 23944 transitions. [2022-03-15 17:49:15,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 17:49:15,935 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-03-15 17:49:15,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 17:49:15,977 INFO L225 Difference]: With dead ends: 5942 [2022-03-15 17:49:15,977 INFO L226 Difference]: Without dead ends: 4862 [2022-03-15 17:49:15,977 INFO L932 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 [2022-03-15 17:49:15,980 INFO L933 BasicCegarLoop]: 5 mSDtfsCounter, 21 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 17:49:15,980 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 10 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 17:49:16,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4862 states. [2022-03-15 17:49:16,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4862 to 4862. [2022-03-15 17:49:16,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4862 states, 4861 states have (on average 4.007405883563053) internal successors, (19480), 4861 states have internal predecessors, (19480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 17:49:16,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4862 states to 4862 states and 19480 transitions. [2022-03-15 17:49:16,299 INFO L78 Accepts]: Start accepts. Automaton has 4862 states and 19480 transitions. Word has length 3 [2022-03-15 17:49:16,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 17:49:16,299 INFO L470 AbstractCegarLoop]: Abstraction has 4862 states and 19480 transitions. [2022-03-15 17:49:16,299 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 17:49:16,299 INFO L276 IsEmpty]: Start isEmpty. Operand 4862 states and 19480 transitions. [2022-03-15 17:49:16,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-03-15 17:49:16,302 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 17:49:16,302 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 17:49:16,303 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-03-15 17:49:16,303 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-03-15 17:49:16,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 17:49:16,304 INFO L85 PathProgramCache]: Analyzing trace with hash 26783613, now seen corresponding path program 1 times [2022-03-15 17:49:16,305 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 17:49:16,305 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223192178] [2022-03-15 17:49:16,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 17:49:16,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 17:49:16,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 17:49:16,487 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 17:49:16,487 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 17:49:16,487 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223192178] [2022-03-15 17:49:16,488 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1223192178] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 17:49:16,488 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 17:49:16,488 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-03-15 17:49:16,488 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1002719877] [2022-03-15 17:49:16,488 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 17:49:16,489 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 17:49:16,490 INFO L252 McrAutomatonBuilder]: Finished intersection with 13 states and 12 transitions. [2022-03-15 17:49:16,491 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 17:49:16,491 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 17:49:16,492 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-15 17:49:16,492 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 17:49:16,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-15 17:49:16,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-15 17:49:16,492 INFO L87 Difference]: Start difference. First operand 4862 states and 19480 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 17:49:16,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 17:49:16,726 INFO L93 Difference]: Finished difference Result 9082 states and 34856 transitions. [2022-03-15 17:49:16,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-03-15 17:49:16,726 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-03-15 17:49:16,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 17:49:16,771 INFO L225 Difference]: With dead ends: 9082 [2022-03-15 17:49:16,771 INFO L226 Difference]: Without dead ends: 7411 [2022-03-15 17:49:16,772 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-03-15 17:49:16,772 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 40 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 17:49:16,773 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [40 Valid, 21 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 17:49:16,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7411 states. [2022-03-15 17:49:17,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7411 to 6355. [2022-03-15 17:49:17,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6355 states, 6354 states have (on average 3.9353163361661947) internal successors, (25005), 6354 states have internal predecessors, (25005), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 17:49:17,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6355 states to 6355 states and 25005 transitions. [2022-03-15 17:49:17,071 INFO L78 Accepts]: Start accepts. Automaton has 6355 states and 25005 transitions. Word has length 12 [2022-03-15 17:49:17,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 17:49:17,071 INFO L470 AbstractCegarLoop]: Abstraction has 6355 states and 25005 transitions. [2022-03-15 17:49:17,072 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 17:49:17,072 INFO L276 IsEmpty]: Start isEmpty. Operand 6355 states and 25005 transitions. [2022-03-15 17:49:17,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-03-15 17:49:17,075 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 17:49:17,075 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 17:49:17,075 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-03-15 17:49:17,075 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-03-15 17:49:17,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 17:49:17,076 INFO L85 PathProgramCache]: Analyzing trace with hash 478123275, now seen corresponding path program 1 times [2022-03-15 17:49:17,076 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 17:49:17,077 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885761814] [2022-03-15 17:49:17,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 17:49:17,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 17:49:17,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 17:49:17,162 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 17:49:17,163 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 17:49:17,163 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885761814] [2022-03-15 17:49:17,163 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1885761814] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 17:49:17,163 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 17:49:17,163 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-03-15 17:49:17,163 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1641706888] [2022-03-15 17:49:17,163 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 17:49:17,164 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 17:49:17,166 INFO L252 McrAutomatonBuilder]: Finished intersection with 20 states and 25 transitions. [2022-03-15 17:49:17,166 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 17:49:17,307 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 17:49:17,307 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-15 17:49:17,308 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 17:49:17,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-15 17:49:17,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-15 17:49:17,309 INFO L87 Difference]: Start difference. First operand 6355 states and 25005 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 17:49:17,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 17:49:17,532 INFO L93 Difference]: Finished difference Result 6635 states and 25539 transitions. [2022-03-15 17:49:17,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-03-15 17:49:17,532 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-03-15 17:49:17,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 17:49:17,564 INFO L225 Difference]: With dead ends: 6635 [2022-03-15 17:49:17,565 INFO L226 Difference]: Without dead ends: 5795 [2022-03-15 17:49:17,565 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-03-15 17:49:17,566 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 45 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 17:49:17,566 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [45 Valid, 23 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 17:49:17,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5795 states. [2022-03-15 17:49:17,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5795 to 5099. [2022-03-15 17:49:17,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5099 states, 5098 states have (on average 3.9119262455865047) internal successors, (19943), 5098 states have internal predecessors, (19943), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 17:49:17,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5099 states to 5099 states and 19943 transitions. [2022-03-15 17:49:17,765 INFO L78 Accepts]: Start accepts. Automaton has 5099 states and 19943 transitions. Word has length 13 [2022-03-15 17:49:17,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 17:49:17,765 INFO L470 AbstractCegarLoop]: Abstraction has 5099 states and 19943 transitions. [2022-03-15 17:49:17,765 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 17:49:17,765 INFO L276 IsEmpty]: Start isEmpty. Operand 5099 states and 19943 transitions. [2022-03-15 17:49:17,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-03-15 17:49:17,768 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 17:49:17,768 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 17:49:17,768 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-03-15 17:49:17,768 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-03-15 17:49:17,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 17:49:17,769 INFO L85 PathProgramCache]: Analyzing trace with hash -31090687, now seen corresponding path program 1 times [2022-03-15 17:49:17,773 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 17:49:17,773 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697880408] [2022-03-15 17:49:17,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 17:49:17,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 17:49:17,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 17:49:17,832 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 17:49:17,832 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 17:49:17,832 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697880408] [2022-03-15 17:49:17,832 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1697880408] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 17:49:17,833 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 17:49:17,833 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-03-15 17:49:17,833 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1438921614] [2022-03-15 17:49:17,833 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 17:49:17,834 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 17:49:17,836 INFO L252 McrAutomatonBuilder]: Finished intersection with 19 states and 22 transitions. [2022-03-15 17:49:17,836 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 17:49:17,992 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 17:49:17,993 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-03-15 17:49:17,993 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 17:49:17,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-03-15 17:49:17,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-03-15 17:49:17,993 INFO L87 Difference]: Start difference. First operand 5099 states and 19943 transitions. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 17:49:18,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 17:49:18,271 INFO L93 Difference]: Finished difference Result 7229 states and 27147 transitions. [2022-03-15 17:49:18,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-03-15 17:49:18,275 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-03-15 17:49:18,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 17:49:18,302 INFO L225 Difference]: With dead ends: 7229 [2022-03-15 17:49:18,303 INFO L226 Difference]: Without dead ends: 6275 [2022-03-15 17:49:18,303 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-03-15 17:49:18,304 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 76 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 17:49:18,304 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [76 Valid, 17 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 17:49:18,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6275 states. [2022-03-15 17:49:18,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6275 to 5003. [2022-03-15 17:49:18,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5003 states, 5002 states have (on average 3.8990403838464616) internal successors, (19503), 5002 states have internal predecessors, (19503), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 17:49:18,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5003 states to 5003 states and 19503 transitions. [2022-03-15 17:49:18,450 INFO L78 Accepts]: Start accepts. Automaton has 5003 states and 19503 transitions. Word has length 14 [2022-03-15 17:49:18,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 17:49:18,450 INFO L470 AbstractCegarLoop]: Abstraction has 5003 states and 19503 transitions. [2022-03-15 17:49:18,450 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 17:49:18,450 INFO L276 IsEmpty]: Start isEmpty. Operand 5003 states and 19503 transitions. [2022-03-15 17:49:18,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-03-15 17:49:18,453 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 17:49:18,453 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 17:49:18,453 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-03-15 17:49:18,454 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-03-15 17:49:18,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 17:49:18,454 INFO L85 PathProgramCache]: Analyzing trace with hash -85372401, now seen corresponding path program 1 times [2022-03-15 17:49:18,458 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 17:49:18,458 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503357638] [2022-03-15 17:49:18,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 17:49:18,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 17:49:18,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 17:49:18,508 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 17:49:18,509 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 17:49:18,509 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503357638] [2022-03-15 17:49:18,509 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [503357638] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 17:49:18,509 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 17:49:18,509 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-03-15 17:49:18,509 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1374677967] [2022-03-15 17:49:18,509 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 17:49:18,510 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 17:49:18,569 INFO L252 McrAutomatonBuilder]: Finished intersection with 32 states and 51 transitions. [2022-03-15 17:49:18,569 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 17:49:18,871 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [86257#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)))] [2022-03-15 17:49:18,871 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-15 17:49:18,872 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 17:49:18,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-15 17:49:18,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-03-15 17:49:18,873 INFO L87 Difference]: Start difference. First operand 5003 states and 19503 transitions. Second operand has 6 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 17:49:19,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 17:49:19,088 INFO L93 Difference]: Finished difference Result 6243 states and 23493 transitions. [2022-03-15 17:49:19,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-03-15 17:49:19,088 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-03-15 17:49:19,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 17:49:19,108 INFO L225 Difference]: With dead ends: 6243 [2022-03-15 17:49:19,108 INFO L226 Difference]: Without dead ends: 5499 [2022-03-15 17:49:19,109 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-03-15 17:49:19,112 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 81 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 17:49:19,112 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [81 Valid, 21 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 17:49:19,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5499 states. [2022-03-15 17:49:19,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5499 to 4275. [2022-03-15 17:49:19,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4275 states, 4274 states have (on average 3.864529714553112) internal successors, (16517), 4274 states have internal predecessors, (16517), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 17:49:19,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4275 states to 4275 states and 16517 transitions. [2022-03-15 17:49:19,317 INFO L78 Accepts]: Start accepts. Automaton has 4275 states and 16517 transitions. Word has length 15 [2022-03-15 17:49:19,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 17:49:19,318 INFO L470 AbstractCegarLoop]: Abstraction has 4275 states and 16517 transitions. [2022-03-15 17:49:19,318 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 17:49:19,318 INFO L276 IsEmpty]: Start isEmpty. Operand 4275 states and 16517 transitions. [2022-03-15 17:49:19,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-15 17:49:19,324 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 17:49:19,324 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 17:49:19,324 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-03-15 17:49:19,324 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-03-15 17:49:19,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 17:49:19,325 INFO L85 PathProgramCache]: Analyzing trace with hash -580510315, now seen corresponding path program 1 times [2022-03-15 17:49:19,326 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 17:49:19,326 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573932516] [2022-03-15 17:49:19,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 17:49:19,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 17:49:19,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 17:49:19,403 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 17:49:19,403 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 17:49:19,403 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573932516] [2022-03-15 17:49:19,404 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1573932516] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 17:49:19,404 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 17:49:19,404 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-03-15 17:49:19,404 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1537932942] [2022-03-15 17:49:19,404 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 17:49:19,405 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 17:49:19,413 INFO L252 McrAutomatonBuilder]: Finished intersection with 76 states and 173 transitions. [2022-03-15 17:49:19,413 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 17:49:19,897 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [101058#(not (= 4 ~__unbuffered_cnt~0))] [2022-03-15 17:49:19,898 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-15 17:49:19,898 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 17:49:19,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-15 17:49:19,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-03-15 17:49:19,898 INFO L87 Difference]: Start difference. First operand 4275 states and 16517 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 17:49:19,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 17:49:19,984 INFO L93 Difference]: Finished difference Result 1939 states and 6049 transitions. [2022-03-15 17:49:19,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-15 17:49:19,984 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-03-15 17:49:19,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 17:49:19,989 INFO L225 Difference]: With dead ends: 1939 [2022-03-15 17:49:19,989 INFO L226 Difference]: Without dead ends: 1939 [2022-03-15 17:49:19,989 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-03-15 17:49:19,990 INFO L933 BasicCegarLoop]: 5 mSDtfsCounter, 43 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 17:49:19,990 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [43 Valid, 15 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 17:49:19,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1939 states. [2022-03-15 17:49:20,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1939 to 1933. [2022-03-15 17:49:20,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1933 states, 1932 states have (on average 3.119565217391304) internal successors, (6027), 1932 states have internal predecessors, (6027), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 17:49:20,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1933 states to 1933 states and 6027 transitions. [2022-03-15 17:49:20,093 INFO L78 Accepts]: Start accepts. Automaton has 1933 states and 6027 transitions. Word has length 17 [2022-03-15 17:49:20,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 17:49:20,093 INFO L470 AbstractCegarLoop]: Abstraction has 1933 states and 6027 transitions. [2022-03-15 17:49:20,093 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 17:49:20,093 INFO L276 IsEmpty]: Start isEmpty. Operand 1933 states and 6027 transitions. [2022-03-15 17:49:20,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-03-15 17:49:20,097 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 17:49:20,097 INFO L514 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] [2022-03-15 17:49:20,097 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-03-15 17:49:20,097 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-03-15 17:49:20,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 17:49:20,098 INFO L85 PathProgramCache]: Analyzing trace with hash -221791628, now seen corresponding path program 1 times [2022-03-15 17:49:20,099 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 17:49:20,099 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153247943] [2022-03-15 17:49:20,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 17:49:20,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 17:49:20,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 17:49:20,149 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 17:49:20,149 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 17:49:20,149 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153247943] [2022-03-15 17:49:20,150 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [153247943] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 17:49:20,150 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 17:49:20,150 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-03-15 17:49:20,150 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [307452108] [2022-03-15 17:49:20,150 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 17:49:20,153 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 17:49:20,175 INFO L252 McrAutomatonBuilder]: Finished intersection with 115 states and 233 transitions. [2022-03-15 17:49:20,175 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 17:49:21,330 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 17:49:21,330 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-15 17:49:21,330 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 17:49:21,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-15 17:49:21,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-15 17:49:21,331 INFO L87 Difference]: Start difference. First operand 1933 states and 6027 transitions. Second operand has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 17:49:21,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 17:49:21,445 INFO L93 Difference]: Finished difference Result 2871 states and 8748 transitions. [2022-03-15 17:49:21,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-03-15 17:49:21,446 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-03-15 17:49:21,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 17:49:21,451 INFO L225 Difference]: With dead ends: 2871 [2022-03-15 17:49:21,451 INFO L226 Difference]: Without dead ends: 1819 [2022-03-15 17:49:21,451 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-03-15 17:49:21,451 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 28 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 17:49:21,452 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 27 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 17:49:21,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1819 states. [2022-03-15 17:49:21,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1819 to 1696. [2022-03-15 17:49:21,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1696 states, 1695 states have (on average 3.023008849557522) internal successors, (5124), 1695 states have internal predecessors, (5124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 17:49:21,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1696 states to 1696 states and 5124 transitions. [2022-03-15 17:49:21,484 INFO L78 Accepts]: Start accepts. Automaton has 1696 states and 5124 transitions. Word has length 23 [2022-03-15 17:49:21,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 17:49:21,484 INFO L470 AbstractCegarLoop]: Abstraction has 1696 states and 5124 transitions. [2022-03-15 17:49:21,484 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 17:49:21,485 INFO L276 IsEmpty]: Start isEmpty. Operand 1696 states and 5124 transitions. [2022-03-15 17:49:21,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-03-15 17:49:21,487 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 17:49:21,488 INFO L514 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] [2022-03-15 17:49:21,488 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-03-15 17:49:21,488 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-03-15 17:49:21,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 17:49:21,488 INFO L85 PathProgramCache]: Analyzing trace with hash -1093112380, now seen corresponding path program 1 times [2022-03-15 17:49:21,489 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 17:49:21,489 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013055519] [2022-03-15 17:49:21,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 17:49:21,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 17:49:21,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 17:49:21,550 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 17:49:21,550 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 17:49:21,550 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013055519] [2022-03-15 17:49:21,550 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2013055519] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 17:49:21,550 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 17:49:21,550 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-15 17:49:21,550 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [569978960] [2022-03-15 17:49:21,550 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 17:49:21,553 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 17:49:21,567 INFO L252 McrAutomatonBuilder]: Finished intersection with 100 states and 205 transitions. [2022-03-15 17:49:21,568 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 17:49:23,102 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [113140#(or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~y~0 0))), 113141#(or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~y~0 0)))] [2022-03-15 17:49:23,103 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-03-15 17:49:23,103 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 17:49:23,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-03-15 17:49:23,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-03-15 17:49:23,103 INFO L87 Difference]: Start difference. First operand 1696 states and 5124 transitions. Second operand has 8 states, 7 states have (on average 6.714285714285714) internal successors, (47), 8 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 17:49:23,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 17:49:23,373 INFO L93 Difference]: Finished difference Result 2830 states and 8338 transitions. [2022-03-15 17:49:23,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-15 17:49:23,373 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 6.714285714285714) internal successors, (47), 8 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-03-15 17:49:23,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 17:49:23,377 INFO L225 Difference]: With dead ends: 2830 [2022-03-15 17:49:23,378 INFO L226 Difference]: Without dead ends: 1968 [2022-03-15 17:49:23,378 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2022-03-15 17:49:23,378 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 151 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 272 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 272 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 17:49:23,378 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [151 Valid, 27 Invalid, 288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 272 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 17:49:23,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1968 states. [2022-03-15 17:49:23,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1968 to 1696. [2022-03-15 17:49:23,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1696 states, 1695 states have (on average 2.888495575221239) internal successors, (4896), 1695 states have internal predecessors, (4896), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 17:49:23,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1696 states to 1696 states and 4896 transitions. [2022-03-15 17:49:23,407 INFO L78 Accepts]: Start accepts. Automaton has 1696 states and 4896 transitions. Word has length 23 [2022-03-15 17:49:23,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 17:49:23,407 INFO L470 AbstractCegarLoop]: Abstraction has 1696 states and 4896 transitions. [2022-03-15 17:49:23,407 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 6.714285714285714) internal successors, (47), 8 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 17:49:23,407 INFO L276 IsEmpty]: Start isEmpty. Operand 1696 states and 4896 transitions. [2022-03-15 17:49:23,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-03-15 17:49:23,410 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 17:49:23,410 INFO L514 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] [2022-03-15 17:49:23,410 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-03-15 17:49:23,410 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-03-15 17:49:23,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 17:49:23,411 INFO L85 PathProgramCache]: Analyzing trace with hash 473639169, now seen corresponding path program 1 times [2022-03-15 17:49:23,411 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 17:49:23,411 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595735266] [2022-03-15 17:49:23,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 17:49:23,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 17:49:23,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 17:49:23,493 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 17:49:23,493 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 17:49:23,493 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595735266] [2022-03-15 17:49:23,493 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1595735266] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 17:49:23,493 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 17:49:23,493 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-15 17:49:23,494 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1929124908] [2022-03-15 17:49:23,494 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 17:49:23,496 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 17:49:23,511 INFO L252 McrAutomatonBuilder]: Finished intersection with 72 states and 135 transitions. [2022-03-15 17:49:23,512 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 17:49:24,388 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [119382#(<= ~__unbuffered_cnt~0 0)] [2022-03-15 17:49:24,388 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-15 17:49:24,388 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 17:49:24,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-15 17:49:24,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-15 17:49:24,389 INFO L87 Difference]: Start difference. First operand 1696 states and 4896 transitions. Second operand has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 17:49:24,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 17:49:24,476 INFO L93 Difference]: Finished difference Result 1328 states and 3844 transitions. [2022-03-15 17:49:24,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-03-15 17:49:24,477 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-03-15 17:49:24,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 17:49:24,479 INFO L225 Difference]: With dead ends: 1328 [2022-03-15 17:49:24,479 INFO L226 Difference]: Without dead ends: 1248 [2022-03-15 17:49:24,479 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-15 17:49:24,480 INFO L933 BasicCegarLoop]: 5 mSDtfsCounter, 103 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 17:49:24,480 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [103 Valid, 20 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 17:49:24,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1248 states. [2022-03-15 17:49:24,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1248 to 1248. [2022-03-15 17:49:24,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1248 states, 1247 states have (on average 2.8660785886126705) internal successors, (3574), 1247 states have internal predecessors, (3574), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 17:49:24,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1248 states to 1248 states and 3574 transitions. [2022-03-15 17:49:24,497 INFO L78 Accepts]: Start accepts. Automaton has 1248 states and 3574 transitions. Word has length 23 [2022-03-15 17:49:24,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 17:49:24,498 INFO L470 AbstractCegarLoop]: Abstraction has 1248 states and 3574 transitions. [2022-03-15 17:49:24,498 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 17:49:24,498 INFO L276 IsEmpty]: Start isEmpty. Operand 1248 states and 3574 transitions. [2022-03-15 17:49:24,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-03-15 17:49:24,500 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 17:49:24,500 INFO L514 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] [2022-03-15 17:49:24,500 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-03-15 17:49:24,500 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-03-15 17:49:24,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 17:49:24,501 INFO L85 PathProgramCache]: Analyzing trace with hash -1028692639, now seen corresponding path program 1 times [2022-03-15 17:49:24,501 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 17:49:24,501 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849795853] [2022-03-15 17:49:24,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 17:49:24,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 17:49:24,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 17:49:24,594 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 17:49:24,595 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 17:49:24,595 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1849795853] [2022-03-15 17:49:24,595 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1849795853] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 17:49:24,595 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 17:49:24,595 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-15 17:49:24,595 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1617368729] [2022-03-15 17:49:24,595 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 17:49:24,599 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 17:49:24,618 INFO L252 McrAutomatonBuilder]: Finished intersection with 88 states and 164 transitions. [2022-03-15 17:49:24,618 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 17:49:25,907 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [123213#(<= ~__unbuffered_cnt~0 0)] [2022-03-15 17:49:25,907 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-03-15 17:49:25,907 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 17:49:25,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-03-15 17:49:25,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-03-15 17:49:25,908 INFO L87 Difference]: Start difference. First operand 1248 states and 3574 transitions. Second operand has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 6 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 17:49:26,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 17:49:26,029 INFO L93 Difference]: Finished difference Result 1186 states and 3454 transitions. [2022-03-15 17:49:26,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-15 17:49:26,030 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 6 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-03-15 17:49:26,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 17:49:26,031 INFO L225 Difference]: With dead ends: 1186 [2022-03-15 17:49:26,031 INFO L226 Difference]: Without dead ends: 546 [2022-03-15 17:49:26,031 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-03-15 17:49:26,032 INFO L933 BasicCegarLoop]: 5 mSDtfsCounter, 100 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 17:49:26,032 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [100 Valid, 23 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 17:49:26,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 546 states. [2022-03-15 17:49:26,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 546 to 546. [2022-03-15 17:49:26,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 546 states, 545 states have (on average 2.8844036697247706) internal successors, (1572), 545 states have internal predecessors, (1572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 17:49:26,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 546 states to 546 states and 1572 transitions. [2022-03-15 17:49:26,041 INFO L78 Accepts]: Start accepts. Automaton has 546 states and 1572 transitions. Word has length 26 [2022-03-15 17:49:26,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 17:49:26,041 INFO L470 AbstractCegarLoop]: Abstraction has 546 states and 1572 transitions. [2022-03-15 17:49:26,041 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 6 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 17:49:26,041 INFO L276 IsEmpty]: Start isEmpty. Operand 546 states and 1572 transitions. [2022-03-15 17:49:26,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-03-15 17:49:26,042 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 17:49:26,042 INFO L514 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, 1, 1, 1] [2022-03-15 17:49:26,042 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-03-15 17:49:26,043 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-03-15 17:49:26,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 17:49:26,043 INFO L85 PathProgramCache]: Analyzing trace with hash -305996923, now seen corresponding path program 1 times [2022-03-15 17:49:26,046 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 17:49:26,046 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918454375] [2022-03-15 17:49:26,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 17:49:26,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 17:49:26,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 17:49:26,227 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 17:49:26,227 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 17:49:26,228 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918454375] [2022-03-15 17:49:26,228 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [918454375] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 17:49:26,228 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 17:49:26,228 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-03-15 17:49:26,228 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2046675727] [2022-03-15 17:49:26,228 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 17:49:26,234 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 17:49:26,327 INFO L252 McrAutomatonBuilder]: Finished intersection with 223 states and 490 transitions. [2022-03-15 17:49:26,327 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 17:49:47,524 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 8 new interpolants: [125505#(and (not (= ~a$w_buff0~0 0)) (= ~a$r_buff1_thd4~0 0) (or (= (mod ~a$r_buff1_thd2~0 256) 0) (= (mod ~a$r_buff0_thd1~0 256) 0)) (= ~a$r_buff1_thd3~0 0) (not (= (mod ~a$w_buff0_used~0 256) 0)) (or (not (= (mod ~a$r_buff0_thd2~0 256) 0)) (not (= (mod ~a$r_buff0_thd1~0 256) 0))) (= ~a$r_buff0_thd4~0 0)), 125504#(and (not (= ~a$w_buff0~0 0)) (= ~a$r_buff1_thd4~0 0) (or (= (mod ~a$r_buff1_thd2~0 256) 0) (= (mod ~a$r_buff0_thd1~0 256) 0)) (or (= (mod ~a$r_buff1_thd3~0 256) 0) (= (mod ~a$r_buff0_thd1~0 256) 0)) (or (not (= (mod ~a$r_buff0_thd2~0 256) 0)) (not (= (mod ~a$r_buff0_thd3~0 256) 0)) (not (= (mod ~a$r_buff0_thd1~0 256) 0))) (or (= (mod ~a$r_buff0_thd2~0 256) 0) (= (mod ~a$r_buff1_thd3~0 256) 0)) (not (= (mod ~a$w_buff0_used~0 256) 0)) (= ~a$r_buff0_thd4~0 0)), 125506#(and (not (= ~a$w_buff0~0 0)) (= ~a$r_buff1_thd4~0 0) (= ~a$r_buff1_thd2~0 0) (= ~a$r_buff1_thd3~0 0) (not (= (mod ~a$w_buff0_used~0 256) 0)) (not (= (mod ~a$r_buff0_thd1~0 256) 0)) (= ~a$r_buff0_thd4~0 0)), 125507#(and (or (= (mod ~a$r_buff0_thd2~0 256) 0) (not (= (mod ~a$w_buff0_used~0 256) 0))) (or (not (= (mod ~a$w_buff0_used~0 256) 0)) (= ~a$r_buff0_thd4~0 0)) (or (= (mod ~a$r_buff0_thd3~0 256) 0) (not (= (mod ~a$w_buff0_used~0 256) 0)))), 125508#(and (or (= ~a$r_buff0_thd3~0 0) (not (= (mod ~a$w_buff0_used~0 256) 0))) (or (= ~a$r_buff0_thd2~0 0) (not (= (mod ~a$w_buff0_used~0 256) 0))) (or (not (= (mod ~a$w_buff0_used~0 256) 0)) (= ~a$r_buff0_thd4~0 0))), 125501#(and (or (not (= ~a~0 0)) (not (= (mod ~a$w_buff0_used~0 256) 0))) (= ~a$r_buff1_thd4~0 0) (or (= (mod ~a$r_buff1_thd3~0 256) 0) (not (= (mod ~a$w_buff0_used~0 256) 0))) (or (= (mod ~a$r_buff1_thd3~0 256) 0) (not (= (mod ~a$r_buff0_thd3~0 256) 0))) (or (not (= (mod ~a$r_buff0_thd3~0 256) 0)) (not (= ~a~0 0))) (or (not (= ~a$w_buff0~0 0)) (= (mod ~a$r_buff0_thd3~0 256) 0) (= (mod ~a$w_buff0_used~0 256) 0)) (= ~a$r_buff0_thd4~0 0)), 125502#(and (or (not (= ~a$w_buff0~0 0)) (= (mod ~a$r_buff0_thd2~0 256) 0) (= (mod ~a$w_buff0_used~0 256) 0)) (or (not (= ~a~0 0)) (not (= (mod ~a$w_buff0_used~0 256) 0))) (= ~a$r_buff1_thd4~0 0) (or (not (= (mod ~a$r_buff0_thd2~0 256) 0)) (not (= (mod ~a$r_buff0_thd3~0 256) 0)) (not (= ~a~0 0))) (or (= (mod ~a$r_buff1_thd3~0 256) 0) (not (= (mod ~a$w_buff0_used~0 256) 0))) (or (= (mod ~a$r_buff1_thd2~0 256) 0) (not (= (mod ~a$r_buff0_thd2~0 256) 0)) (not (= (mod ~a$r_buff0_thd3~0 256) 0))) (or (= (mod ~a$r_buff1_thd2~0 256) 0) (not (= (mod ~a$w_buff0_used~0 256) 0))) (or (= (mod ~a$r_buff1_thd3~0 256) 0) (not (= (mod ~a$r_buff0_thd3~0 256) 0))) (or (= (mod ~a$r_buff0_thd2~0 256) 0) (= (mod ~a$r_buff1_thd3~0 256) 0)) (or (not (= ~a$w_buff0~0 0)) (= (mod ~a$r_buff0_thd3~0 256) 0) (= (mod ~a$w_buff0_used~0 256) 0)) (= ~a$r_buff0_thd4~0 0)), 125503#(and (not (= ~a$w_buff0~0 0)) (or (= ~a~0 ~a$w_buff0~0) (not (= (mod ~a$w_buff0_used~0 256) 0))) (= ~a$r_buff1_thd4~0 0) (or (= (mod ~a$r_buff1_thd2~0 256) 0) (not (= (mod ~a$r_buff0_thd2~0 256) 0))) (or (= (mod ~a$r_buff1_thd2~0 256) 0) (not (= (mod ~a$w_buff0_used~0 256) 0))) (or (not (= (mod ~a$r_buff0_thd2~0 256) 0)) (= ~a~0 ~a$w_buff0~0)) (= ~a$r_buff1_thd3~0 0) (= ~a$r_buff0_thd4~0 0))] [2022-03-15 17:49:47,524 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-03-15 17:49:47,524 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 17:49:47,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-03-15 17:49:47,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=216, Unknown=0, NotChecked=0, Total=272 [2022-03-15 17:49:47,525 INFO L87 Difference]: Start difference. First operand 546 states and 1572 transitions. Second operand has 17 states, 16 states have (on average 6.25) internal successors, (100), 16 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 17:49:47,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 17:49:47,968 INFO L93 Difference]: Finished difference Result 675 states and 1905 transitions. [2022-03-15 17:49:47,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-15 17:49:47,969 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 6.25) internal successors, (100), 16 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-03-15 17:49:47,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 17:49:47,970 INFO L225 Difference]: With dead ends: 675 [2022-03-15 17:49:47,970 INFO L226 Difference]: Without dead ends: 528 [2022-03-15 17:49:47,970 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 140 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=116, Invalid=390, Unknown=0, NotChecked=0, Total=506 [2022-03-15 17:49:47,970 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 240 mSDsluCounter, 232 mSDsCounter, 0 mSdLazyCounter, 355 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 240 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 420 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 355 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 17:49:47,971 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [240 Valid, 60 Invalid, 420 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 355 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 17:49:47,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2022-03-15 17:49:47,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 456. [2022-03-15 17:49:47,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 456 states, 455 states have (on average 2.7296703296703297) internal successors, (1242), 455 states have internal predecessors, (1242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 17:49:47,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456 states to 456 states and 1242 transitions. [2022-03-15 17:49:47,977 INFO L78 Accepts]: Start accepts. Automaton has 456 states and 1242 transitions. Word has length 30 [2022-03-15 17:49:47,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 17:49:47,977 INFO L470 AbstractCegarLoop]: Abstraction has 456 states and 1242 transitions. [2022-03-15 17:49:47,977 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 6.25) internal successors, (100), 16 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 17:49:47,977 INFO L276 IsEmpty]: Start isEmpty. Operand 456 states and 1242 transitions. [2022-03-15 17:49:47,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-03-15 17:49:47,978 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 17:49:47,978 INFO L514 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, 1, 1, 1] [2022-03-15 17:49:47,978 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-03-15 17:49:47,978 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-03-15 17:49:47,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 17:49:47,979 INFO L85 PathProgramCache]: Analyzing trace with hash -1406134979, now seen corresponding path program 2 times [2022-03-15 17:49:47,979 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 17:49:47,979 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316296353] [2022-03-15 17:49:47,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 17:49:47,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 17:49:48,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 17:49:48,090 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 17:49:48,091 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 17:49:48,091 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316296353] [2022-03-15 17:49:48,091 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1316296353] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 17:49:48,091 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 17:49:48,091 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-15 17:49:48,091 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [436751106] [2022-03-15 17:49:48,091 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 17:49:48,095 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 17:49:48,202 INFO L252 McrAutomatonBuilder]: Finished intersection with 271 states and 625 transitions. [2022-03-15 17:49:48,202 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 17:49:51,547 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [127113#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1))), 127114#(or (not (= ~z~0 1)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)))] [2022-03-15 17:49:51,548 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-03-15 17:49:51,548 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 17:49:51,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-03-15 17:49:51,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-03-15 17:49:51,548 INFO L87 Difference]: Start difference. First operand 456 states and 1242 transitions. Second operand has 7 states, 6 states have (on average 9.333333333333334) internal successors, (56), 7 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 17:49:51,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 17:49:51,774 INFO L93 Difference]: Finished difference Result 573 states and 1540 transitions. [2022-03-15 17:49:51,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-03-15 17:49:51,774 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 9.333333333333334) internal successors, (56), 7 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-03-15 17:49:51,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 17:49:51,774 INFO L225 Difference]: With dead ends: 573 [2022-03-15 17:49:51,775 INFO L226 Difference]: Without dead ends: 191 [2022-03-15 17:49:51,775 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 189 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-03-15 17:49:51,775 INFO L933 BasicCegarLoop]: 7 mSDtfsCounter, 51 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 233 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 17:49:51,776 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [51 Valid, 17 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 233 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 17:49:51,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2022-03-15 17:49:51,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 191. [2022-03-15 17:49:51,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 190 states have (on average 2.3473684210526318) internal successors, (446), 190 states have internal predecessors, (446), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 17:49:51,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 446 transitions. [2022-03-15 17:49:51,779 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 446 transitions. Word has length 30 [2022-03-15 17:49:51,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 17:49:51,779 INFO L470 AbstractCegarLoop]: Abstraction has 191 states and 446 transitions. [2022-03-15 17:49:51,779 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 9.333333333333334) internal successors, (56), 7 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 17:49:51,780 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 446 transitions. [2022-03-15 17:49:51,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-03-15 17:49:51,780 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 17:49:51,780 INFO L514 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, 1, 1, 1] [2022-03-15 17:49:51,780 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-03-15 17:49:51,780 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-03-15 17:49:51,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 17:49:51,781 INFO L85 PathProgramCache]: Analyzing trace with hash -608462843, now seen corresponding path program 3 times [2022-03-15 17:49:51,781 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 17:49:51,781 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259091162] [2022-03-15 17:49:51,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 17:49:51,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 17:49:51,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-03-15 17:49:51,865 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-03-15 17:49:51,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-03-15 17:49:51,981 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-03-15 17:49:51,981 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-03-15 17:49:51,982 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2022-03-15 17:49:51,984 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2022-03-15 17:49:51,984 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATION (4 of 7 remaining) [2022-03-15 17:49:51,984 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATION (3 of 7 remaining) [2022-03-15 17:49:51,984 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATION (2 of 7 remaining) [2022-03-15 17:49:51,984 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATION (1 of 7 remaining) [2022-03-15 17:49:51,984 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2022-03-15 17:49:51,984 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-03-15 17:49:51,986 INFO L732 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 17:49:51,990 INFO L230 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-03-15 17:49:51,990 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-03-15 17:49:52,091 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.03 05:49:52 BasicIcfg [2022-03-15 17:49:52,091 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-03-15 17:49:52,092 INFO L158 Benchmark]: Toolchain (without parser) took 41945.41ms. Allocated memory was 201.3MB in the beginning and 1.6GB in the end (delta: 1.4GB). Free memory was 146.7MB in the beginning and 1.1GB in the end (delta: -953.1MB). Peak memory consumption was 454.0MB. Max. memory is 8.0GB. [2022-03-15 17:49:52,092 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 201.3MB. Free memory is still 165.0MB. There was no memory consumed. Max. memory is 8.0GB. [2022-03-15 17:49:52,092 INFO L158 Benchmark]: CACSL2BoogieTranslator took 425.72ms. Allocated memory was 201.3MB in the beginning and 291.5MB in the end (delta: 90.2MB). Free memory was 146.5MB in the beginning and 253.2MB in the end (delta: -106.7MB). Peak memory consumption was 13.4MB. Max. memory is 8.0GB. [2022-03-15 17:49:52,092 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.30ms. Allocated memory is still 291.5MB. Free memory was 253.2MB in the beginning and 250.6MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-03-15 17:49:52,093 INFO L158 Benchmark]: Boogie Preprocessor took 46.12ms. Allocated memory is still 291.5MB. Free memory was 250.6MB in the beginning and 248.0MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-03-15 17:49:52,093 INFO L158 Benchmark]: RCFGBuilder took 845.32ms. Allocated memory is still 291.5MB. Free memory was 248.0MB in the beginning and 158.4MB in the end (delta: 89.7MB). Peak memory consumption was 90.2MB. Max. memory is 8.0GB. [2022-03-15 17:49:52,093 INFO L158 Benchmark]: TraceAbstraction took 40585.69ms. Allocated memory was 291.5MB in the beginning and 1.6GB in the end (delta: 1.3GB). Free memory was 157.8MB in the beginning and 1.1GB in the end (delta: -941.9MB). Peak memory consumption was 374.6MB. Max. memory is 8.0GB. [2022-03-15 17:49:52,094 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.12ms. Allocated memory is still 201.3MB. Free memory is still 165.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 425.72ms. Allocated memory was 201.3MB in the beginning and 291.5MB in the end (delta: 90.2MB). Free memory was 146.5MB in the beginning and 253.2MB in the end (delta: -106.7MB). Peak memory consumption was 13.4MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 36.30ms. Allocated memory is still 291.5MB. Free memory was 253.2MB in the beginning and 250.6MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 46.12ms. Allocated memory is still 291.5MB. Free memory was 250.6MB in the beginning and 248.0MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 845.32ms. Allocated memory is still 291.5MB. Free memory was 248.0MB in the beginning and 158.4MB in the end (delta: 89.7MB). Peak memory consumption was 90.2MB. Max. memory is 8.0GB. * TraceAbstraction took 40585.69ms. Allocated memory was 291.5MB in the beginning and 1.6GB in the end (delta: 1.3GB). Free memory was 157.8MB in the beginning and 1.1GB in the end (delta: -941.9MB). Peak memory consumption was 374.6MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.6s, 151 PlacesBefore, 50 PlacesAfterwards, 140 TransitionsBefore, 38 TransitionsAfterwards, 3534 CoEnabledTransitionPairs, 6 FixpointIterations, 47 TrivialSequentialCompositions, 61 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 1 ChoiceCompositions, 117 TotalNumberOfCompositions, 9664 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 4720, positive: 4493, positive conditional: 0, positive unconditional: 4493, negative: 227, negative conditional: 0, negative unconditional: 227, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1938, positive: 1897, positive conditional: 0, positive unconditional: 1897, negative: 41, negative conditional: 0, negative unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 4720, positive: 2596, positive conditional: 0, positive unconditional: 2596, negative: 186, negative conditional: 0, negative unconditional: 186, unknown: 1938, unknown conditional: 0, unknown unconditional: 1938] , Statistics on independence cache: Total cache size (in pairs): 183, Positive cache size: 165, Positive conditional cache size: 0, Positive unconditional cache size: 165, Negative cache size: 18, Negative conditional cache size: 0, Negative unconditional cache size: 18 - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_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_p2_EBX = 0; [L718] 0 int __unbuffered_p3_EAX = 0; [L720] 0 int __unbuffered_p3_EBX = 0; [L722] 0 int a = 0; [L723] 0 _Bool a$flush_delayed; [L724] 0 int a$mem_tmp; [L725] 0 _Bool a$r_buff0_thd0; [L726] 0 _Bool a$r_buff0_thd1; [L727] 0 _Bool a$r_buff0_thd2; [L728] 0 _Bool a$r_buff0_thd3; [L729] 0 _Bool a$r_buff0_thd4; [L730] 0 _Bool a$r_buff1_thd0; [L731] 0 _Bool a$r_buff1_thd1; [L732] 0 _Bool a$r_buff1_thd2; [L733] 0 _Bool a$r_buff1_thd3; [L734] 0 _Bool a$r_buff1_thd4; [L735] 0 _Bool a$read_delayed; [L736] 0 int *a$read_delayed_var; [L737] 0 int a$w_buff0; [L738] 0 _Bool a$w_buff0_used; [L739] 0 int a$w_buff1; [L740] 0 _Bool a$w_buff1_used; [L741] 0 _Bool main$tmp_guard0; [L742] 0 _Bool main$tmp_guard1; [L744] 0 int x = 0; [L746] 0 int y = 0; [L748] 0 int z = 0; [L749] 0 _Bool weak$$choice0; [L750] 0 _Bool weak$$choice2; [L871] 0 pthread_t t121; [L872] FCALL, FORK 0 pthread_create(&t121, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t121, ((void *)0), P0, ((void *)0))=-4, t121={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L754] 1 a$w_buff1 = a$w_buff0 [L755] 1 a$w_buff0 = 1 [L756] 1 a$w_buff1_used = a$w_buff0_used [L757] 1 a$w_buff0_used = (_Bool)1 [L758] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L758] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L759] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L760] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L761] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L762] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L763] 1 a$r_buff1_thd4 = a$r_buff0_thd4 [L764] 1 a$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L873] 0 pthread_t t122; [L874] FCALL, FORK 0 pthread_create(&t122, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t122, ((void *)0), P1, ((void *)0))=-3, t121={5:0}, t122={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L767] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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, y=0, z=0] [L875] 0 pthread_t t123; [L876] FCALL, FORK 0 pthread_create(&t123, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t123, ((void *)0), P2, ((void *)0))=-2, t121={5:0}, t122={6:0}, t123={7:0}, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L784] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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=2, y=0, z=0] [L787] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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=2, y=0, z=0] [L804] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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=2, y=1, z=0] [L790] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L790] EXPR 2 a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a [L790] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L790] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L791] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L791] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L792] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L792] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L793] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L793] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L794] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 [L794] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 [L807] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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=2, y=1, z=0] [L797] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L799] 2 return 0; [L810] 3 __unbuffered_p2_EBX = z VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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=2, y=1, z=0] [L813] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L813] EXPR 3 a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a [L813] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L813] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L814] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L814] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L815] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L815] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L816] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L816] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L817] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 [L817] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 [L820] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L822] 3 return 0; [L877] 0 pthread_t t124; [L878] FCALL, FORK 0 pthread_create(&t124, ((void *)0), P3, ((void *)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t124, ((void *)0), P3, ((void *)0))=-1, t121={5:0}, t122={6:0}, t123={7:0}, t124={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L827] 4 z = 1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, 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=2, y=1, z=1] [L830] 4 __unbuffered_p3_EAX = z VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, 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=2, y=1, z=1] [L833] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L834] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L835] 4 a$flush_delayed = weak$$choice2 [L836] 4 a$mem_tmp = a [L837] EXPR 4 !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff1) [L837] 4 a = !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff1) [L838] EXPR 4 weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0)) [L838] EXPR 4 !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0) [L838] EXPR 4 weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0)) [L838] 4 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0)) [L839] EXPR 4 weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1)) [L839] EXPR 4 !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1) [L839] EXPR 4 weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1)) [L839] 4 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1)) [L840] EXPR 4 weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used)) [L840] EXPR 4 !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used) [L840] EXPR 4 weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used)) [L840] 4 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used)) [L841] EXPR 4 weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L841] EXPR 4 !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0) [L841] EXPR 4 weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L841] 4 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L842] EXPR 4 weak$$choice2 ? a$r_buff0_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4)) [L842] EXPR 4 !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4) [L842] EXPR 4 weak$$choice2 ? a$r_buff0_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4)) [L842] 4 a$r_buff0_thd4 = weak$$choice2 ? a$r_buff0_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4)) [L843] EXPR 4 weak$$choice2 ? a$r_buff1_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L843] EXPR 4 !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0) [L843] EXPR 4 weak$$choice2 ? a$r_buff1_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L843] 4 a$r_buff1_thd4 = weak$$choice2 ? a$r_buff1_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L844] 4 __unbuffered_p3_EBX = a [L845] EXPR 4 a$flush_delayed ? a$mem_tmp : a [L845] 4 a = a$flush_delayed ? a$mem_tmp : a [L846] 4 a$flush_delayed = (_Bool)0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, 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=49, weak$$choice2=0, x=2, y=1, z=1] [L849] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L849] EXPR 4 a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a [L849] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L849] 4 a = a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L850] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used [L850] 4 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used [L851] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$w_buff1_used [L851] 4 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$w_buff1_used [L852] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4 [L852] 4 a$r_buff0_thd4 = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4 [L853] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$r_buff1_thd4 [L853] 4 a$r_buff1_thd4 = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$r_buff1_thd4 [L856] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L858] 4 return 0; [L770] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L770] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L771] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L771] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L772] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L772] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L773] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L773] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L774] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 [L774] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 [L777] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L779] 1 return 0; [L880] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L882] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=1, z=1] [L882] RET 0 assume_abort_if_not(main$tmp_guard0) [L884] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L884] EXPR 0 a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a [L884] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L884] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L885] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L885] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L886] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L886] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L887] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L887] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L888] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 [L888] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 [L891] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L893] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=1, z=1] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 872]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 878]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 876]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 874]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 178 locations, 7 error locations. Started 1 CEGAR loops. OverallTime: 40.3s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.1s, AutomataDifference: 2.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.9s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 979 SdHoareTripleChecker+Valid, 1.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 979 mSDsluCounter, 281 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1175 mSDsCounter, 136 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1837 IncrementalHoareTripleChecker+Invalid, 1973 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 136 mSolverCounterUnsat, 108 mSDtfsCounter, 1837 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 767 GetRequests, 692 SyntacticMatches, 2 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=7274occurred in iteration=0, InterpolantAutomatonStates: 73, 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, 12 MinimizatonAttempts, 4721 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 259 NumberOfCodeBlocks, 259 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 217 ConstructedInterpolants, 0 QuantifiedInterpolants, 1418 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 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! [2022-03-15 17:49:52,129 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...