/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf --traceabstraction.order.of.the.error.locations.to.be.checked PROGRAM_FIRST -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --cacsl2boogietranslator.check.absence.of.signed.integer.overflows true -i ../../../trunk/examples/svcomp/pthread-wmm/safe019_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-27 10:17:07,551 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-27 10:17:07,623 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf [2023-08-27 10:17:07,633 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-27 10:17:07,633 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-27 10:17:07,663 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-27 10:17:07,664 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-27 10:17:07,664 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-27 10:17:07,665 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-27 10:17:07,669 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-27 10:17:07,669 INFO L153 SettingsManager]: * Use SBE=true [2023-08-27 10:17:07,670 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-27 10:17:07,670 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-27 10:17:07,671 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-27 10:17:07,671 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-27 10:17:07,671 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-27 10:17:07,671 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-27 10:17:07,671 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-27 10:17:07,672 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-27 10:17:07,672 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-27 10:17:07,672 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-27 10:17:07,673 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-27 10:17:07,673 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-27 10:17:07,673 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-27 10:17:07,674 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-27 10:17:07,674 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-27 10:17:07,674 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-27 10:17:07,674 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-27 10:17:07,674 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-27 10:17:07,674 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-27 10:17:07,675 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-27 10:17:07,675 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-27 10:17:07,675 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-27 10:17:07,675 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-27 10:17:07,675 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-27 10:17:07,676 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Order of the error locations to be checked -> PROGRAM_FIRST Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check absence of signed integer overflows -> true [2023-08-27 10:17:07,928 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-27 10:17:07,941 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-27 10:17:07,943 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-27 10:17:07,944 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-27 10:17:07,945 INFO L274 PluginConnector]: CDTParser initialized [2023-08-27 10:17:07,946 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe019_power.oepc.i [2023-08-27 10:17:08,929 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-27 10:17:09,143 INFO L384 CDTParser]: Found 1 translation units. [2023-08-27 10:17:09,143 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe019_power.oepc.i [2023-08-27 10:17:09,155 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aa27c86dc/e66c8664738746cf840e6707ac0c15d7/FLAGd6572639e [2023-08-27 10:17:09,165 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aa27c86dc/e66c8664738746cf840e6707ac0c15d7 [2023-08-27 10:17:09,167 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-27 10:17:09,168 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-27 10:17:09,169 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-27 10:17:09,169 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-27 10:17:09,171 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-27 10:17:09,171 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 10:17:09" (1/1) ... [2023-08-27 10:17:09,172 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4565896d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:17:09, skipping insertion in model container [2023-08-27 10:17:09,172 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 10:17:09" (1/1) ... [2023-08-27 10:17:09,206 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-27 10:17:09,508 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-27 10:17:09,520 INFO L201 MainTranslator]: Completed pre-run [2023-08-27 10:17:09,548 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [268] [2023-08-27 10:17:09,549 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [268] [2023-08-27 10:17:09,589 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-27 10:17:09,619 WARN L669 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-27 10:17:09,619 WARN L669 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-27 10:17:09,624 INFO L206 MainTranslator]: Completed translation [2023-08-27 10:17:09,624 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:17:09 WrapperNode [2023-08-27 10:17:09,625 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-27 10:17:09,626 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-27 10:17:09,626 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-27 10:17:09,626 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-27 10:17:09,631 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:17:09" (1/1) ... [2023-08-27 10:17:09,659 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:17:09" (1/1) ... [2023-08-27 10:17:09,691 INFO L138 Inliner]: procedures = 177, calls = 88, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 188 [2023-08-27 10:17:09,692 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-27 10:17:09,693 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-27 10:17:09,693 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-27 10:17:09,693 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-27 10:17:09,699 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:17:09" (1/1) ... [2023-08-27 10:17:09,700 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:17:09" (1/1) ... [2023-08-27 10:17:09,712 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:17:09" (1/1) ... [2023-08-27 10:17:09,712 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:17:09" (1/1) ... [2023-08-27 10:17:09,722 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:17:09" (1/1) ... [2023-08-27 10:17:09,724 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:17:09" (1/1) ... [2023-08-27 10:17:09,726 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:17:09" (1/1) ... [2023-08-27 10:17:09,728 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:17:09" (1/1) ... [2023-08-27 10:17:09,744 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-27 10:17:09,745 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-27 10:17:09,745 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-27 10:17:09,745 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-27 10:17:09,746 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:17:09" (1/1) ... [2023-08-27 10:17:09,750 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-27 10:17:09,763 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 10:17:09,773 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) [2023-08-27 10:17:09,780 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 [2023-08-27 10:17:09,802 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-27 10:17:09,802 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-27 10:17:09,802 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-27 10:17:09,802 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-27 10:17:09,802 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-27 10:17:09,803 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-27 10:17:09,803 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-27 10:17:09,803 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-27 10:17:09,803 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-27 10:17:09,803 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-27 10:17:09,803 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-27 10:17:09,803 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-27 10:17:09,803 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-08-27 10:17:09,803 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-08-27 10:17:09,803 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-27 10:17:09,803 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-27 10:17:09,804 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-27 10:17:09,804 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-27 10:17:09,805 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-27 10:17:09,947 INFO L236 CfgBuilder]: Building ICFG [2023-08-27 10:17:09,948 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-27 10:17:10,263 INFO L277 CfgBuilder]: Performing block encoding [2023-08-27 10:17:10,446 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-27 10:17:10,446 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-27 10:17:10,448 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 10:17:10 BoogieIcfgContainer [2023-08-27 10:17:10,448 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-27 10:17:10,450 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-27 10:17:10,451 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-27 10:17:10,453 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-27 10:17:10,453 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.08 10:17:09" (1/3) ... [2023-08-27 10:17:10,454 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26c14c4e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.08 10:17:10, skipping insertion in model container [2023-08-27 10:17:10,454 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:17:09" (2/3) ... [2023-08-27 10:17:10,454 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26c14c4e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.08 10:17:10, skipping insertion in model container [2023-08-27 10:17:10,455 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 10:17:10" (3/3) ... [2023-08-27 10:17:10,456 INFO L112 eAbstractionObserver]: Analyzing ICFG safe019_power.oepc.i [2023-08-27 10:17:10,469 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-27 10:17:10,470 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations. [2023-08-27 10:17:10,470 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-27 10:17:10,558 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-27 10:17:10,583 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 165 places, 155 transitions, 330 flow [2023-08-27 10:17:10,624 INFO L124 PetriNetUnfolderBase]: 3/151 cut-off events. [2023-08-27 10:17:10,624 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-27 10:17:10,638 INFO L83 FinitePrefix]: Finished finitePrefix Result has 164 conditions, 151 events. 3/151 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 94 event pairs, 0 based on Foata normal form. 0/139 useless extension candidates. Maximal degree in co-relation 94. Up to 2 conditions per place. [2023-08-27 10:17:10,638 INFO L82 GeneralOperation]: Start removeDead. Operand has 165 places, 155 transitions, 330 flow [2023-08-27 10:17:10,642 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 161 places, 151 transitions, 314 flow [2023-08-27 10:17:10,644 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-27 10:17:10,653 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 161 places, 151 transitions, 314 flow [2023-08-27 10:17:10,655 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 161 places, 151 transitions, 314 flow [2023-08-27 10:17:10,655 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 161 places, 151 transitions, 314 flow [2023-08-27 10:17:10,699 INFO L124 PetriNetUnfolderBase]: 3/151 cut-off events. [2023-08-27 10:17:10,699 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-27 10:17:10,700 INFO L83 FinitePrefix]: Finished finitePrefix Result has 164 conditions, 151 events. 3/151 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 94 event pairs, 0 based on Foata normal form. 0/139 useless extension candidates. Maximal degree in co-relation 94. Up to 2 conditions per place. [2023-08-27 10:17:10,702 INFO L119 LiptonReduction]: Number of co-enabled transitions 3664 [2023-08-27 10:17:17,765 INFO L134 LiptonReduction]: Checked pairs total: 13667 [2023-08-27 10:17:17,765 INFO L136 LiptonReduction]: Total number of compositions: 135 [2023-08-27 10:17:17,773 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-27 10:17:17,777 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, 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=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@a44f665, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-27 10:17:17,777 INFO L358 AbstractCegarLoop]: Starting to check reachability of 21 error locations. [2023-08-27 10:17:17,781 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-27 10:17:17,781 INFO L124 PetriNetUnfolderBase]: 0/6 cut-off events. [2023-08-27 10:17:17,781 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-27 10:17:17,781 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:17:17,781 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-27 10:17:17,781 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2023-08-27 10:17:17,784 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:17:17,785 INFO L85 PathProgramCache]: Analyzing trace with hash 898533823, now seen corresponding path program 1 times [2023-08-27 10:17:17,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:17:17,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [276761615] [2023-08-27 10:17:17,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:17:17,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:17:17,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:17:17,982 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 10:17:17,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:17:17,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [276761615] [2023-08-27 10:17:17,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [276761615] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:17:17,983 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:17:17,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-27 10:17:17,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345386221] [2023-08-27 10:17:17,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:17:17,990 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-27 10:17:17,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:17:18,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-27 10:17:18,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-27 10:17:18,008 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 290 [2023-08-27 10:17:18,012 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 35 transitions, 82 flow. Second operand has 3 states, 3 states have (on average 129.33333333333334) internal successors, (388), 3 states have internal predecessors, (388), 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) [2023-08-27 10:17:18,012 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:17:18,013 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 290 [2023-08-27 10:17:18,013 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:17:19,604 INFO L124 PetriNetUnfolderBase]: 8703/11721 cut-off events. [2023-08-27 10:17:19,604 INFO L125 PetriNetUnfolderBase]: For 40/40 co-relation queries the response was YES. [2023-08-27 10:17:19,615 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23633 conditions, 11721 events. 8703/11721 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 622. Compared 60716 event pairs, 8703 based on Foata normal form. 400/8654 useless extension candidates. Maximal degree in co-relation 23621. Up to 11704 conditions per place. [2023-08-27 10:17:19,651 INFO L140 encePairwiseOnDemand]: 284/290 looper letters, 27 selfloop transitions, 1 changer transitions 0/30 dead transitions. [2023-08-27 10:17:19,651 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 30 transitions, 128 flow [2023-08-27 10:17:19,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-27 10:17:19,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-27 10:17:19,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 417 transitions. [2023-08-27 10:17:19,660 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4793103448275862 [2023-08-27 10:17:19,660 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 417 transitions. [2023-08-27 10:17:19,660 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 417 transitions. [2023-08-27 10:17:19,661 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:17:19,663 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 417 transitions. [2023-08-27 10:17:19,667 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 139.0) internal successors, (417), 3 states have internal predecessors, (417), 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) [2023-08-27 10:17:19,671 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 290.0) internal successors, (1160), 4 states have internal predecessors, (1160), 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) [2023-08-27 10:17:19,671 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 290.0) internal successors, (1160), 4 states have internal predecessors, (1160), 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) [2023-08-27 10:17:19,672 INFO L175 Difference]: Start difference. First operand has 47 places, 35 transitions, 82 flow. Second operand 3 states and 417 transitions. [2023-08-27 10:17:19,673 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 30 transitions, 128 flow [2023-08-27 10:17:19,677 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 30 transitions, 124 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-27 10:17:19,678 INFO L231 Difference]: Finished difference. Result has 41 places, 30 transitions, 70 flow [2023-08-27 10:17:19,679 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=290, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=70, PETRI_PLACES=41, PETRI_TRANSITIONS=30} [2023-08-27 10:17:19,681 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, -6 predicate places. [2023-08-27 10:17:19,682 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 30 transitions, 70 flow [2023-08-27 10:17:19,682 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 129.33333333333334) internal successors, (388), 3 states have internal predecessors, (388), 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) [2023-08-27 10:17:19,682 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:17:19,682 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-27 10:17:19,682 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-27 10:17:19,682 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2023-08-27 10:17:19,686 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:17:19,686 INFO L85 PathProgramCache]: Analyzing trace with hash 898533824, now seen corresponding path program 1 times [2023-08-27 10:17:19,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:17:19,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166434501] [2023-08-27 10:17:19,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:17:19,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:17:19,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:17:19,760 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 10:17:19,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:17:19,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166434501] [2023-08-27 10:17:19,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [166434501] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:17:19,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:17:19,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-27 10:17:19,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532561152] [2023-08-27 10:17:19,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:17:19,762 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-27 10:17:19,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:17:19,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-27 10:17:19,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-27 10:17:19,763 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 290 [2023-08-27 10:17:19,763 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 30 transitions, 70 flow. Second operand has 3 states, 3 states have (on average 129.33333333333334) internal successors, (388), 3 states have internal predecessors, (388), 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) [2023-08-27 10:17:19,763 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:17:19,763 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 290 [2023-08-27 10:17:19,763 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:17:20,619 INFO L124 PetriNetUnfolderBase]: 4901/6911 cut-off events. [2023-08-27 10:17:20,619 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-27 10:17:20,626 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13963 conditions, 6911 events. 4901/6911 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 412. Compared 36547 event pairs, 1877 based on Foata normal form. 0/5000 useless extension candidates. Maximal degree in co-relation 13957. Up to 6615 conditions per place. [2023-08-27 10:17:20,652 INFO L140 encePairwiseOnDemand]: 280/290 looper letters, 40 selfloop transitions, 5 changer transitions 0/47 dead transitions. [2023-08-27 10:17:20,653 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 47 transitions, 200 flow [2023-08-27 10:17:20,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-27 10:17:20,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-27 10:17:20,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 434 transitions. [2023-08-27 10:17:20,657 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49885057471264366 [2023-08-27 10:17:20,657 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 434 transitions. [2023-08-27 10:17:20,657 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 434 transitions. [2023-08-27 10:17:20,657 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:17:20,657 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 434 transitions. [2023-08-27 10:17:20,658 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 144.66666666666666) internal successors, (434), 3 states have internal predecessors, (434), 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) [2023-08-27 10:17:20,660 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 290.0) internal successors, (1160), 4 states have internal predecessors, (1160), 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) [2023-08-27 10:17:20,660 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 290.0) internal successors, (1160), 4 states have internal predecessors, (1160), 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) [2023-08-27 10:17:20,661 INFO L175 Difference]: Start difference. First operand has 41 places, 30 transitions, 70 flow. Second operand 3 states and 434 transitions. [2023-08-27 10:17:20,661 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 47 transitions, 200 flow [2023-08-27 10:17:20,662 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 47 transitions, 199 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-27 10:17:20,663 INFO L231 Difference]: Finished difference. Result has 43 places, 34 transitions, 110 flow [2023-08-27 10:17:20,664 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=290, PETRI_DIFFERENCE_MINUEND_FLOW=69, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=110, PETRI_PLACES=43, PETRI_TRANSITIONS=34} [2023-08-27 10:17:20,666 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, -4 predicate places. [2023-08-27 10:17:20,666 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 34 transitions, 110 flow [2023-08-27 10:17:20,666 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 129.33333333333334) internal successors, (388), 3 states have internal predecessors, (388), 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) [2023-08-27 10:17:20,670 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:17:20,670 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 10:17:20,670 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-27 10:17:20,671 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2023-08-27 10:17:20,672 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:17:20,672 INFO L85 PathProgramCache]: Analyzing trace with hash 1374432007, now seen corresponding path program 1 times [2023-08-27 10:17:20,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:17:20,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941509656] [2023-08-27 10:17:20,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:17:20,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:17:20,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:17:20,790 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 10:17:20,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:17:20,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941509656] [2023-08-27 10:17:20,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [941509656] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:17:20,791 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:17:20,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-27 10:17:20,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927381696] [2023-08-27 10:17:20,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:17:20,792 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-27 10:17:20,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:17:20,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-27 10:17:20,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-27 10:17:20,793 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 290 [2023-08-27 10:17:20,794 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 34 transitions, 110 flow. Second operand has 4 states, 4 states have (on average 130.0) internal successors, (520), 4 states have internal predecessors, (520), 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) [2023-08-27 10:17:20,794 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:17:20,794 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 290 [2023-08-27 10:17:20,794 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:17:21,169 INFO L124 PetriNetUnfolderBase]: 1769/2685 cut-off events. [2023-08-27 10:17:21,169 INFO L125 PetriNetUnfolderBase]: For 310/310 co-relation queries the response was YES. [2023-08-27 10:17:21,173 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6723 conditions, 2685 events. 1769/2685 cut-off events. For 310/310 co-relation queries the response was YES. Maximal size of possible extension queue 145. Compared 13234 event pairs, 515 based on Foata normal form. 60/2324 useless extension candidates. Maximal degree in co-relation 6715. Up to 1873 conditions per place. [2023-08-27 10:17:21,180 INFO L140 encePairwiseOnDemand]: 280/290 looper letters, 51 selfloop transitions, 9 changer transitions 0/62 dead transitions. [2023-08-27 10:17:21,181 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 62 transitions, 304 flow [2023-08-27 10:17:21,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-27 10:17:21,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-27 10:17:21,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 577 transitions. [2023-08-27 10:17:21,182 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4974137931034483 [2023-08-27 10:17:21,182 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 577 transitions. [2023-08-27 10:17:21,182 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 577 transitions. [2023-08-27 10:17:21,183 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:17:21,183 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 577 transitions. [2023-08-27 10:17:21,184 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 144.25) internal successors, (577), 4 states have internal predecessors, (577), 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) [2023-08-27 10:17:21,185 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 290.0) internal successors, (1450), 5 states have internal predecessors, (1450), 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) [2023-08-27 10:17:21,186 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 290.0) internal successors, (1450), 5 states have internal predecessors, (1450), 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) [2023-08-27 10:17:21,186 INFO L175 Difference]: Start difference. First operand has 43 places, 34 transitions, 110 flow. Second operand 4 states and 577 transitions. [2023-08-27 10:17:21,186 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 62 transitions, 304 flow [2023-08-27 10:17:21,187 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 62 transitions, 299 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-27 10:17:21,187 INFO L231 Difference]: Finished difference. Result has 46 places, 38 transitions, 165 flow [2023-08-27 10:17:21,188 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=290, PETRI_DIFFERENCE_MINUEND_FLOW=105, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=165, PETRI_PLACES=46, PETRI_TRANSITIONS=38} [2023-08-27 10:17:21,188 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, -1 predicate places. [2023-08-27 10:17:21,188 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 38 transitions, 165 flow [2023-08-27 10:17:21,189 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 130.0) internal successors, (520), 4 states have internal predecessors, (520), 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) [2023-08-27 10:17:21,189 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:17:21,189 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 10:17:21,189 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-27 10:17:21,189 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting P2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2023-08-27 10:17:21,189 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:17:21,189 INFO L85 PathProgramCache]: Analyzing trace with hash -1948980483, now seen corresponding path program 1 times [2023-08-27 10:17:21,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:17:21,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087359631] [2023-08-27 10:17:21,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:17:21,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:17:21,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:17:21,302 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 10:17:21,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:17:21,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087359631] [2023-08-27 10:17:21,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2087359631] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:17:21,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:17:21,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-27 10:17:21,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074746192] [2023-08-27 10:17:21,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:17:21,303 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-27 10:17:21,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:17:21,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-27 10:17:21,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-27 10:17:21,305 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 290 [2023-08-27 10:17:21,306 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 38 transitions, 165 flow. Second operand has 5 states, 5 states have (on average 130.6) internal successors, (653), 5 states have internal predecessors, (653), 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) [2023-08-27 10:17:21,306 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:17:21,306 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 290 [2023-08-27 10:17:21,306 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:17:21,607 INFO L124 PetriNetUnfolderBase]: 925/1398 cut-off events. [2023-08-27 10:17:21,607 INFO L125 PetriNetUnfolderBase]: For 930/930 co-relation queries the response was YES. [2023-08-27 10:17:21,610 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4035 conditions, 1398 events. 925/1398 cut-off events. For 930/930 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 5944 event pairs, 208 based on Foata normal form. 37/1387 useless extension candidates. Maximal degree in co-relation 4025. Up to 516 conditions per place. [2023-08-27 10:17:21,616 INFO L140 encePairwiseOnDemand]: 280/290 looper letters, 60 selfloop transitions, 13 changer transitions 0/75 dead transitions. [2023-08-27 10:17:21,616 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 75 transitions, 413 flow [2023-08-27 10:17:21,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-27 10:17:21,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-27 10:17:21,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 718 transitions. [2023-08-27 10:17:21,618 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49517241379310345 [2023-08-27 10:17:21,618 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 718 transitions. [2023-08-27 10:17:21,618 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 718 transitions. [2023-08-27 10:17:21,618 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:17:21,618 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 718 transitions. [2023-08-27 10:17:21,619 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 143.6) internal successors, (718), 5 states have internal predecessors, (718), 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) [2023-08-27 10:17:21,621 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 290.0) internal successors, (1740), 6 states have internal predecessors, (1740), 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) [2023-08-27 10:17:21,622 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 290.0) internal successors, (1740), 6 states have internal predecessors, (1740), 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) [2023-08-27 10:17:21,622 INFO L175 Difference]: Start difference. First operand has 46 places, 38 transitions, 165 flow. Second operand 5 states and 718 transitions. [2023-08-27 10:17:21,622 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 75 transitions, 413 flow [2023-08-27 10:17:21,626 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 75 transitions, 395 flow, removed 4 selfloop flow, removed 2 redundant places. [2023-08-27 10:17:21,628 INFO L231 Difference]: Finished difference. Result has 49 places, 42 transitions, 223 flow [2023-08-27 10:17:21,628 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=290, PETRI_DIFFERENCE_MINUEND_FLOW=147, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=223, PETRI_PLACES=49, PETRI_TRANSITIONS=42} [2023-08-27 10:17:21,629 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, 2 predicate places. [2023-08-27 10:17:21,629 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 42 transitions, 223 flow [2023-08-27 10:17:21,630 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 130.6) internal successors, (653), 5 states have internal predecessors, (653), 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) [2023-08-27 10:17:21,630 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:17:21,630 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 10:17:21,630 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-27 10:17:21,630 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting P3Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2023-08-27 10:17:21,630 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:17:21,630 INFO L85 PathProgramCache]: Analyzing trace with hash 1305095444, now seen corresponding path program 1 times [2023-08-27 10:17:21,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:17:21,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187925987] [2023-08-27 10:17:21,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:17:21,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:17:21,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:17:21,750 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 10:17:21,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:17:21,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [187925987] [2023-08-27 10:17:21,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [187925987] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:17:21,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:17:21,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-27 10:17:21,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122144939] [2023-08-27 10:17:21,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:17:21,754 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-27 10:17:21,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:17:21,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-27 10:17:21,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-08-27 10:17:21,755 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 290 [2023-08-27 10:17:21,756 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 42 transitions, 223 flow. Second operand has 6 states, 6 states have (on average 131.0) internal successors, (786), 6 states have internal predecessors, (786), 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) [2023-08-27 10:17:21,756 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:17:21,756 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 290 [2023-08-27 10:17:21,756 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:17:22,048 INFO L124 PetriNetUnfolderBase]: 851/1246 cut-off events. [2023-08-27 10:17:22,048 INFO L125 PetriNetUnfolderBase]: For 1128/1128 co-relation queries the response was YES. [2023-08-27 10:17:22,051 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3731 conditions, 1246 events. 851/1246 cut-off events. For 1128/1128 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 5176 event pairs, 183 based on Foata normal form. 10/1250 useless extension candidates. Maximal degree in co-relation 3720. Up to 516 conditions per place. [2023-08-27 10:17:22,053 INFO L140 encePairwiseOnDemand]: 280/290 looper letters, 47 selfloop transitions, 17 changer transitions 6/72 dead transitions. [2023-08-27 10:17:22,054 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 72 transitions, 411 flow [2023-08-27 10:17:22,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-27 10:17:22,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-27 10:17:22,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 843 transitions. [2023-08-27 10:17:22,056 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4844827586206897 [2023-08-27 10:17:22,056 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 843 transitions. [2023-08-27 10:17:22,056 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 843 transitions. [2023-08-27 10:17:22,056 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:17:22,056 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 843 transitions. [2023-08-27 10:17:22,057 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 140.5) internal successors, (843), 6 states have internal predecessors, (843), 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) [2023-08-27 10:17:22,060 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 290.0) internal successors, (2030), 7 states have internal predecessors, (2030), 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) [2023-08-27 10:17:22,060 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 290.0) internal successors, (2030), 7 states have internal predecessors, (2030), 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) [2023-08-27 10:17:22,060 INFO L175 Difference]: Start difference. First operand has 49 places, 42 transitions, 223 flow. Second operand 6 states and 843 transitions. [2023-08-27 10:17:22,060 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 72 transitions, 411 flow [2023-08-27 10:17:22,067 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 72 transitions, 377 flow, removed 8 selfloop flow, removed 3 redundant places. [2023-08-27 10:17:22,068 INFO L231 Difference]: Finished difference. Result has 48 places, 36 transitions, 197 flow [2023-08-27 10:17:22,069 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=290, PETRI_DIFFERENCE_MINUEND_FLOW=157, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=197, PETRI_PLACES=48, PETRI_TRANSITIONS=36} [2023-08-27 10:17:22,069 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, 1 predicate places. [2023-08-27 10:17:22,069 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 36 transitions, 197 flow [2023-08-27 10:17:22,070 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 131.0) internal successors, (786), 6 states have internal predecessors, (786), 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) [2023-08-27 10:17:22,070 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:17:22,070 INFO L208 CegarLoopForPetriNet]: 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] [2023-08-27 10:17:22,070 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-27 10:17:22,070 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2023-08-27 10:17:22,070 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:17:22,070 INFO L85 PathProgramCache]: Analyzing trace with hash -2131786564, now seen corresponding path program 1 times [2023-08-27 10:17:22,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:17:22,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578723367] [2023-08-27 10:17:22,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:17:22,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:17:22,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:17:22,327 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 10:17:22,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:17:22,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578723367] [2023-08-27 10:17:22,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1578723367] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:17:22,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:17:22,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-27 10:17:22,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951722723] [2023-08-27 10:17:22,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:17:22,328 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-27 10:17:22,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:17:22,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-27 10:17:22,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-27 10:17:22,329 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 290 [2023-08-27 10:17:22,330 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 36 transitions, 197 flow. Second operand has 5 states, 5 states have (on average 131.6) internal successors, (658), 5 states have internal predecessors, (658), 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) [2023-08-27 10:17:22,330 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:17:22,330 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 290 [2023-08-27 10:17:22,330 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:17:22,605 INFO L124 PetriNetUnfolderBase]: 777/1213 cut-off events. [2023-08-27 10:17:22,606 INFO L125 PetriNetUnfolderBase]: For 1525/1525 co-relation queries the response was YES. [2023-08-27 10:17:22,608 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3901 conditions, 1213 events. 777/1213 cut-off events. For 1525/1525 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 5356 event pairs, 153 based on Foata normal form. 1/1210 useless extension candidates. Maximal degree in co-relation 3889. Up to 636 conditions per place. [2023-08-27 10:17:22,610 INFO L140 encePairwiseOnDemand]: 286/290 looper letters, 51 selfloop transitions, 1 changer transitions 29/82 dead transitions. [2023-08-27 10:17:22,610 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 82 transitions, 622 flow [2023-08-27 10:17:22,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-27 10:17:22,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-27 10:17:22,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 687 transitions. [2023-08-27 10:17:22,612 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47379310344827585 [2023-08-27 10:17:22,612 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 687 transitions. [2023-08-27 10:17:22,612 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 687 transitions. [2023-08-27 10:17:22,612 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:17:22,612 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 687 transitions. [2023-08-27 10:17:22,613 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 137.4) internal successors, (687), 5 states have internal predecessors, (687), 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) [2023-08-27 10:17:22,615 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 290.0) internal successors, (1740), 6 states have internal predecessors, (1740), 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) [2023-08-27 10:17:22,615 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 290.0) internal successors, (1740), 6 states have internal predecessors, (1740), 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) [2023-08-27 10:17:22,615 INFO L175 Difference]: Start difference. First operand has 48 places, 36 transitions, 197 flow. Second operand 5 states and 687 transitions. [2023-08-27 10:17:22,615 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 82 transitions, 622 flow [2023-08-27 10:17:22,622 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 82 transitions, 509 flow, removed 24 selfloop flow, removed 4 redundant places. [2023-08-27 10:17:22,623 INFO L231 Difference]: Finished difference. Result has 49 places, 36 transitions, 156 flow [2023-08-27 10:17:22,623 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=290, PETRI_DIFFERENCE_MINUEND_FLOW=147, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=156, PETRI_PLACES=49, PETRI_TRANSITIONS=36} [2023-08-27 10:17:22,624 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, 2 predicate places. [2023-08-27 10:17:22,624 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 36 transitions, 156 flow [2023-08-27 10:17:22,624 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 131.6) internal successors, (658), 5 states have internal predecessors, (658), 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) [2023-08-27 10:17:22,624 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:17:22,624 INFO L208 CegarLoopForPetriNet]: 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] [2023-08-27 10:17:22,624 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-27 10:17:22,624 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2023-08-27 10:17:22,625 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:17:22,625 INFO L85 PathProgramCache]: Analyzing trace with hash 588185640, now seen corresponding path program 2 times [2023-08-27 10:17:22,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:17:22,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442549872] [2023-08-27 10:17:22,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:17:22,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:17:22,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:17:22,849 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 10:17:22,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:17:22,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442549872] [2023-08-27 10:17:22,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1442549872] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:17:22,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:17:22,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-27 10:17:22,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335436579] [2023-08-27 10:17:22,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:17:22,851 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-27 10:17:22,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:17:22,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-27 10:17:22,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-27 10:17:22,852 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 290 [2023-08-27 10:17:22,852 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 36 transitions, 156 flow. Second operand has 5 states, 5 states have (on average 131.6) internal successors, (658), 5 states have internal predecessors, (658), 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) [2023-08-27 10:17:22,852 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:17:22,852 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 290 [2023-08-27 10:17:22,852 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:17:23,070 INFO L124 PetriNetUnfolderBase]: 781/1305 cut-off events. [2023-08-27 10:17:23,070 INFO L125 PetriNetUnfolderBase]: For 1193/1193 co-relation queries the response was YES. [2023-08-27 10:17:23,073 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3851 conditions, 1305 events. 781/1305 cut-off events. For 1193/1193 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 6403 event pairs, 153 based on Foata normal form. 1/1302 useless extension candidates. Maximal degree in co-relation 3838. Up to 586 conditions per place. [2023-08-27 10:17:23,075 INFO L140 encePairwiseOnDemand]: 285/290 looper letters, 55 selfloop transitions, 3 changer transitions 20/79 dead transitions. [2023-08-27 10:17:23,075 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 79 transitions, 506 flow [2023-08-27 10:17:23,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-27 10:17:23,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-27 10:17:23,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 684 transitions. [2023-08-27 10:17:23,077 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47172413793103446 [2023-08-27 10:17:23,077 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 684 transitions. [2023-08-27 10:17:23,077 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 684 transitions. [2023-08-27 10:17:23,077 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:17:23,077 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 684 transitions. [2023-08-27 10:17:23,078 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 136.8) internal successors, (684), 5 states have internal predecessors, (684), 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) [2023-08-27 10:17:23,080 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 290.0) internal successors, (1740), 6 states have internal predecessors, (1740), 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) [2023-08-27 10:17:23,080 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 290.0) internal successors, (1740), 6 states have internal predecessors, (1740), 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) [2023-08-27 10:17:23,080 INFO L175 Difference]: Start difference. First operand has 49 places, 36 transitions, 156 flow. Second operand 5 states and 684 transitions. [2023-08-27 10:17:23,080 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 79 transitions, 506 flow [2023-08-27 10:17:23,085 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 79 transitions, 499 flow, removed 3 selfloop flow, removed 3 redundant places. [2023-08-27 10:17:23,086 INFO L231 Difference]: Finished difference. Result has 50 places, 36 transitions, 163 flow [2023-08-27 10:17:23,086 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=290, PETRI_DIFFERENCE_MINUEND_FLOW=151, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=163, PETRI_PLACES=50, PETRI_TRANSITIONS=36} [2023-08-27 10:17:23,087 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, 3 predicate places. [2023-08-27 10:17:23,087 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 36 transitions, 163 flow [2023-08-27 10:17:23,087 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 131.6) internal successors, (658), 5 states have internal predecessors, (658), 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) [2023-08-27 10:17:23,087 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:17:23,087 INFO L208 CegarLoopForPetriNet]: 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] [2023-08-27 10:17:23,087 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-27 10:17:23,087 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2023-08-27 10:17:23,088 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:17:23,088 INFO L85 PathProgramCache]: Analyzing trace with hash -1075248926, now seen corresponding path program 3 times [2023-08-27 10:17:23,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:17:23,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217203581] [2023-08-27 10:17:23,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:17:23,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:17:23,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:17:24,600 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 10:17:24,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:17:24,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [217203581] [2023-08-27 10:17:24,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [217203581] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:17:24,601 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:17:24,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-27 10:17:24,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470759695] [2023-08-27 10:17:24,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:17:24,602 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-27 10:17:24,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:17:24,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-27 10:17:24,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2023-08-27 10:17:24,603 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 290 [2023-08-27 10:17:24,603 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 36 transitions, 163 flow. Second operand has 9 states, 9 states have (on average 116.55555555555556) internal successors, (1049), 9 states have internal predecessors, (1049), 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) [2023-08-27 10:17:24,604 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:17:24,604 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 290 [2023-08-27 10:17:24,604 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:17:25,059 INFO L124 PetriNetUnfolderBase]: 749/1263 cut-off events. [2023-08-27 10:17:25,060 INFO L125 PetriNetUnfolderBase]: For 1536/1536 co-relation queries the response was YES. [2023-08-27 10:17:25,061 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4034 conditions, 1263 events. 749/1263 cut-off events. For 1536/1536 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 6076 event pairs, 122 based on Foata normal form. 1/1256 useless extension candidates. Maximal degree in co-relation 4021. Up to 477 conditions per place. [2023-08-27 10:17:25,063 INFO L140 encePairwiseOnDemand]: 281/290 looper letters, 53 selfloop transitions, 7 changer transitions 34/95 dead transitions. [2023-08-27 10:17:25,063 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 95 transitions, 635 flow [2023-08-27 10:17:25,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-27 10:17:25,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-27 10:17:25,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 855 transitions. [2023-08-27 10:17:25,065 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4211822660098522 [2023-08-27 10:17:25,065 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 855 transitions. [2023-08-27 10:17:25,065 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 855 transitions. [2023-08-27 10:17:25,065 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:17:25,066 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 855 transitions. [2023-08-27 10:17:25,067 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 122.14285714285714) internal successors, (855), 7 states have internal predecessors, (855), 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) [2023-08-27 10:17:25,068 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 290.0) internal successors, (2320), 8 states have internal predecessors, (2320), 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) [2023-08-27 10:17:25,069 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 290.0) internal successors, (2320), 8 states have internal predecessors, (2320), 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) [2023-08-27 10:17:25,069 INFO L175 Difference]: Start difference. First operand has 50 places, 36 transitions, 163 flow. Second operand 7 states and 855 transitions. [2023-08-27 10:17:25,069 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 95 transitions, 635 flow [2023-08-27 10:17:25,072 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 95 transitions, 619 flow, removed 3 selfloop flow, removed 4 redundant places. [2023-08-27 10:17:25,073 INFO L231 Difference]: Finished difference. Result has 55 places, 38 transitions, 191 flow [2023-08-27 10:17:25,073 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=290, PETRI_DIFFERENCE_MINUEND_FLOW=153, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=191, PETRI_PLACES=55, PETRI_TRANSITIONS=38} [2023-08-27 10:17:25,074 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, 8 predicate places. [2023-08-27 10:17:25,074 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 38 transitions, 191 flow [2023-08-27 10:17:25,074 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 116.55555555555556) internal successors, (1049), 9 states have internal predecessors, (1049), 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) [2023-08-27 10:17:25,074 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:17:25,074 INFO L208 CegarLoopForPetriNet]: 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] [2023-08-27 10:17:25,075 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-27 10:17:25,075 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2023-08-27 10:17:25,075 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:17:25,075 INFO L85 PathProgramCache]: Analyzing trace with hash 397654718, now seen corresponding path program 4 times [2023-08-27 10:17:25,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:17:25,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446140203] [2023-08-27 10:17:25,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:17:25,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:17:25,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-27 10:17:25,140 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-27 10:17:25,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-27 10:17:25,229 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-27 10:17:25,229 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-27 10:17:25,230 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONASSERT (20 of 21 remaining) [2023-08-27 10:17:25,231 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 21 remaining) [2023-08-27 10:17:25,231 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 21 remaining) [2023-08-27 10:17:25,231 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 21 remaining) [2023-08-27 10:17:25,231 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 21 remaining) [2023-08-27 10:17:25,233 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 21 remaining) [2023-08-27 10:17:25,234 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 21 remaining) [2023-08-27 10:17:25,234 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 21 remaining) [2023-08-27 10:17:25,234 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 21 remaining) [2023-08-27 10:17:25,235 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (11 of 21 remaining) [2023-08-27 10:17:25,235 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (10 of 21 remaining) [2023-08-27 10:17:25,235 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (9 of 21 remaining) [2023-08-27 10:17:25,235 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 21 remaining) [2023-08-27 10:17:25,235 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 21 remaining) [2023-08-27 10:17:25,235 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 21 remaining) [2023-08-27 10:17:25,235 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 21 remaining) [2023-08-27 10:17:25,235 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 21 remaining) [2023-08-27 10:17:25,235 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 21 remaining) [2023-08-27 10:17:25,236 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 21 remaining) [2023-08-27 10:17:25,236 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 21 remaining) [2023-08-27 10:17:25,236 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 21 remaining) [2023-08-27 10:17:25,236 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-27 10:17:25,236 INFO L445 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1] [2023-08-27 10:17:25,240 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-27 10:17:25,240 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-27 10:17:25,325 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.08 10:17:25 BasicIcfg [2023-08-27 10:17:25,326 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-27 10:17:25,326 INFO L158 Benchmark]: Toolchain (without parser) took 16158.02ms. Allocated memory was 352.3MB in the beginning and 1.1GB in the end (delta: 782.2MB). Free memory was 327.5MB in the beginning and 893.5MB in the end (delta: -566.0MB). Peak memory consumption was 216.7MB. Max. memory is 16.0GB. [2023-08-27 10:17:25,326 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 352.3MB. Free memory is still 328.9MB. There was no memory consumed. Max. memory is 16.0GB. [2023-08-27 10:17:25,326 INFO L158 Benchmark]: CACSL2BoogieTranslator took 456.37ms. Allocated memory is still 352.3MB. Free memory was 327.5MB in the beginning and 301.8MB in the end (delta: 25.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.0GB. [2023-08-27 10:17:25,326 INFO L158 Benchmark]: Boogie Procedure Inliner took 66.19ms. Allocated memory is still 352.3MB. Free memory was 301.8MB in the beginning and 299.3MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-27 10:17:25,327 INFO L158 Benchmark]: Boogie Preprocessor took 51.85ms. Allocated memory is still 352.3MB. Free memory was 299.3MB in the beginning and 296.7MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-27 10:17:25,327 INFO L158 Benchmark]: RCFGBuilder took 703.20ms. Allocated memory is still 352.3MB. Free memory was 296.7MB in the beginning and 258.7MB in the end (delta: 37.9MB). Peak memory consumption was 40.0MB. Max. memory is 16.0GB. [2023-08-27 10:17:25,327 INFO L158 Benchmark]: TraceAbstraction took 14875.10ms. Allocated memory was 352.3MB in the beginning and 1.1GB in the end (delta: 782.2MB). Free memory was 258.7MB in the beginning and 893.5MB in the end (delta: -634.8MB). Peak memory consumption was 147.3MB. Max. memory is 16.0GB. [2023-08-27 10:17:25,328 INFO L338 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 352.3MB. Free memory is still 328.9MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 456.37ms. Allocated memory is still 352.3MB. Free memory was 327.5MB in the beginning and 301.8MB in the end (delta: 25.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 66.19ms. Allocated memory is still 352.3MB. Free memory was 301.8MB in the beginning and 299.3MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 51.85ms. Allocated memory is still 352.3MB. Free memory was 299.3MB in the beginning and 296.7MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 703.20ms. Allocated memory is still 352.3MB. Free memory was 296.7MB in the beginning and 258.7MB in the end (delta: 37.9MB). Peak memory consumption was 40.0MB. Max. memory is 16.0GB. * TraceAbstraction took 14875.10ms. Allocated memory was 352.3MB in the beginning and 1.1GB in the end (delta: 782.2MB). Free memory was 258.7MB in the beginning and 893.5MB in the end (delta: -634.8MB). Peak memory consumption was 147.3MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 268]: Unsoundness Warning unspecified type, defaulting to int C: short [268] - GenericResultAtLocation [Line: 268]: Unsoundness Warning unspecified type, defaulting to int C: short [268] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 7.1s, 161 PlacesBefore, 47 PlacesAfterwards, 151 TransitionsBefore, 35 TransitionsAfterwards, 3664 CoEnabledTransitionPairs, 8 FixpointIterations, 61 TrivialSequentialCompositions, 58 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 14 ConcurrentYvCompositions, 2 ChoiceCompositions, 135 TotalNumberOfCompositions, 13667 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 4463, independent: 4098, independent conditional: 0, independent unconditional: 4098, dependent: 365, dependent conditional: 0, dependent unconditional: 365, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1871, independent: 1822, independent conditional: 0, independent unconditional: 1822, dependent: 49, dependent conditional: 0, dependent unconditional: 49, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 4463, independent: 2276, independent conditional: 0, independent unconditional: 2276, dependent: 316, dependent conditional: 0, dependent unconditional: 316, unknown: 1871, unknown conditional: 0, unknown unconditional: 1871] , Statistics on independence cache: Total cache size (in pairs): 170, Positive cache size: 145, Positive conditional cache size: 0, Positive unconditional cache size: 145, Negative cache size: 25, Negative conditional cache size: 0, Negative unconditional cache size: 25, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 18]: assertion can be violated assertion can be violated We found a FailurePath: [L711] 0 int __unbuffered_cnt = 0; [L713] 0 int __unbuffered_p0_EAX = 0; [L714] 0 _Bool __unbuffered_p0_EAX$flush_delayed; [L715] 0 int __unbuffered_p0_EAX$mem_tmp; [L716] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd0; [L717] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd1; [L718] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd2; [L719] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd3; [L720] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd4; [L721] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd0; [L722] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd1; [L723] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd2; [L724] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd3; [L725] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd4; [L726] 0 _Bool __unbuffered_p0_EAX$read_delayed; [L727] 0 int *__unbuffered_p0_EAX$read_delayed_var; [L728] 0 int __unbuffered_p0_EAX$w_buff0; [L729] 0 _Bool __unbuffered_p0_EAX$w_buff0_used; [L730] 0 int __unbuffered_p0_EAX$w_buff1; [L731] 0 _Bool __unbuffered_p0_EAX$w_buff1_used; [L733] 0 int __unbuffered_p0_EBX = 0; [L735] 0 int __unbuffered_p2_EAX = 0; [L736] 0 _Bool main$tmp_guard0; [L737] 0 _Bool main$tmp_guard1; [L739] 0 int x = 0; [L741] 0 int y = 0; [L742] 0 _Bool y$flush_delayed; [L743] 0 int y$mem_tmp; [L744] 0 _Bool y$r_buff0_thd0; [L745] 0 _Bool y$r_buff0_thd1; [L746] 0 _Bool y$r_buff0_thd2; [L747] 0 _Bool y$r_buff0_thd3; [L748] 0 _Bool y$r_buff0_thd4; [L749] 0 _Bool y$r_buff1_thd0; [L750] 0 _Bool y$r_buff1_thd1; [L751] 0 _Bool y$r_buff1_thd2; [L752] 0 _Bool y$r_buff1_thd3; [L753] 0 _Bool y$r_buff1_thd4; [L754] 0 _Bool y$read_delayed; [L755] 0 int *y$read_delayed_var; [L756] 0 int y$w_buff0; [L757] 0 _Bool y$w_buff0_used; [L758] 0 int y$w_buff1; [L759] 0 _Bool y$w_buff1_used; [L760] 0 _Bool weak$$choice0; [L761] 0 _Bool weak$$choice1; [L762] 0 _Bool weak$$choice2; [L854] 0 pthread_t t2225; [L855] FCALL, FORK 0 pthread_create(&t2225, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2225, ((void *)0), P0, ((void *)0))=-4, t2225={7:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L766] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L767] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L768] 1 y$flush_delayed = weak$$choice2 [L769] EXPR 1 \read(y) [L769] 1 y$mem_tmp = y [L770] 1 weak$$choice1 = __VERIFIER_nondet_bool() [L771] EXPR 1 !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L771] EXPR 1 \read(y) [L771] EXPR 1 !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L771] 1 y = !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L772] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)))) [L773] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)))) [L774] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 || !weak$$choice1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 : weak$$choice0)))) [L775] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L776] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L777] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$r_buff1_thd1 : (_Bool)0) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L778] 1 __unbuffered_p0_EAX$read_delayed = (_Bool)1 [L779] 1 __unbuffered_p0_EAX$read_delayed_var = &y [L780] EXPR 1 \read(y) [L780] 1 __unbuffered_p0_EAX = y [L781] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L781] 1 y = y$flush_delayed ? y$mem_tmp : y [L782] 1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice1=1, weak$$choice2=1, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L856] 0 pthread_t t2226; [L857] FCALL, FORK 0 pthread_create(&t2226, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2226, ((void *)0), P1, ((void *)0))=-3, t2225={7:0}, t2226={9:0}, weak$$choice0=6, weak$$choice1=1, weak$$choice2=1, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L785] 1 __unbuffered_p0_EBX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice1=1, weak$$choice2=1, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L790] EXPR 1 __unbuffered_cnt + 1 [L790] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L792] 1 return 0; [L797] 2 x = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice1=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L858] 0 pthread_t t2227; [L859] FCALL, FORK 0 pthread_create(&t2227, ((void *)0), P2, ((void *)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=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(&t2227, ((void *)0), P2, ((void *)0))=-2, t2225={7:0}, t2226={9:0}, t2227={5:0}, weak$$choice0=6, weak$$choice1=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L860] 0 pthread_t t2228; [L809] 3 __unbuffered_p2_EAX = x VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice1=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L861] FCALL, FORK 0 pthread_create(&t2228, ((void *)0), P3, ((void *)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0: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, pthread_create(&t2228, ((void *)0), P3, ((void *)0))=-1, t2225={7:0}, t2226={9:0}, t2227={5:0}, t2228={8:0}, weak$$choice0=6, weak$$choice1=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L802] EXPR 2 __unbuffered_cnt + 1 [L802] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L804] 2 return 0; [L812] 3 y = 1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0: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=6, weak$$choice1=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L815] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L815] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L815] EXPR 3 \read(y) [L815] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L815] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L815] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L816] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L817] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L818] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L819] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0: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=6, weak$$choice1=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L822] EXPR 3 __unbuffered_cnt + 1 [L822] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L824] 3 return 0; [L829] 4 y = 2 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0: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=6, weak$$choice1=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L832] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L832] EXPR 4 y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y [L832] EXPR 4 \read(y) [L832] EXPR 4 y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y [L832] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L832] 4 y = y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L833] 4 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L834] 4 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L835] 4 y$r_buff0_thd4 = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L836] 4 y$r_buff1_thd4 = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$r_buff1_thd4 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0: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=6, weak$$choice1=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L839] EXPR 4 __unbuffered_cnt + 1 [L839] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L841] 4 return 0; [L863] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L865] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) VAL [\old(cond)=1, \result={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0: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=6, weak$$choice1=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L865] RET 0 assume_abort_if_not(main$tmp_guard0) [L867] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L867] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L867] EXPR 0 \read(y) [L867] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L867] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L867] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L868] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L869] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L870] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L871] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2225={7:0}, t2226={9:0}, t2227={5:0}, t2228={8:0}, weak$$choice0=6, weak$$choice1=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L874] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L875] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L876] 0 y$flush_delayed = weak$$choice2 [L877] EXPR 0 \read(y) [L877] 0 y$mem_tmp = y [L878] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L878] EXPR 0 \read(y) [L878] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L878] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L879] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L880] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L881] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L882] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L883] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L884] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L885] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L886] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L886] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L886] EXPR 0 \read(*__unbuffered_p0_EAX$read_delayed_var) [L886] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L886] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L886] 0 __unbuffered_p0_EAX = __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L887] EXPR 0 \read(y) [L887] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 2 && __unbuffered_p0_EBX == 0 && __unbuffered_p2_EAX == 1) [L888] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L888] EXPR 0 \read(y) [L888] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L888] 0 y = y$flush_delayed ? y$mem_tmp : y [L889] 0 y$flush_delayed = (_Bool)0 [L891] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] CALL 0 reach_error() [L18] COND FALSE 0 !(0) [L18] 0 __assert_fail ("0", "safe019_power.oepc.c", 9, __extension__ __PRETTY_FUNCTION__) VAL [\result={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice1=1, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] - UnprovableResult [Line: 790]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 790]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 802]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 802]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 822]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 822]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 839]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 839]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 855]: 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: 859]: 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: 861]: 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: 857]: 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, 193 locations, 21 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 14.7s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 4.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 7.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 208 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 208 mSDsluCounter, 4 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2 mSDsCounter, 62 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 758 IncrementalHoareTripleChecker+Invalid, 820 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 62 mSolverCounterUnsat, 2 mSDtfsCounter, 758 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=223occurred in iteration=4, InterpolantAutomatonStates: 38, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 150 NumberOfCodeBlocks, 150 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 118 ConstructedInterpolants, 0 QuantifiedInterpolants, 940 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 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! [2023-08-27 10:17:25,365 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...