/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/mix008.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-27 10:00:12,888 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-27 10:00:12,935 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:00:12,939 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-27 10:00:12,940 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-27 10:00:12,960 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-27 10:00:12,961 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-27 10:00:12,961 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-27 10:00:12,962 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-27 10:00:12,962 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-27 10:00:12,962 INFO L153 SettingsManager]: * Use SBE=true [2023-08-27 10:00:12,963 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-27 10:00:12,963 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-27 10:00:12,963 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-27 10:00:12,963 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-27 10:00:12,964 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-27 10:00:12,964 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-27 10:00:12,964 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-27 10:00:12,965 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-27 10:00:12,965 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-27 10:00:12,965 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-27 10:00:12,966 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-27 10:00:12,966 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-27 10:00:12,966 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-27 10:00:12,967 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-27 10:00:12,967 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-27 10:00:12,967 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-27 10:00:12,967 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-27 10:00:12,968 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-27 10:00:12,968 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-27 10:00:12,968 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-27 10:00:12,969 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-27 10:00:12,969 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-27 10:00:12,969 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-27 10:00:12,969 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-27 10:00:12,970 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:00:13,251 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-27 10:00:13,271 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-27 10:00:13,274 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-27 10:00:13,275 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-27 10:00:13,277 INFO L274 PluginConnector]: CDTParser initialized [2023-08-27 10:00:13,278 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix008.opt.i [2023-08-27 10:00:14,523 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-27 10:00:14,817 INFO L384 CDTParser]: Found 1 translation units. [2023-08-27 10:00:14,817 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix008.opt.i [2023-08-27 10:00:14,835 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7c7aa934a/23c54ef4511a461abb4d97f846157841/FLAGcea61afbe [2023-08-27 10:00:14,847 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7c7aa934a/23c54ef4511a461abb4d97f846157841 [2023-08-27 10:00:14,849 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-27 10:00:14,850 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-27 10:00:14,851 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-27 10:00:14,851 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-27 10:00:14,853 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-27 10:00:14,854 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 10:00:14" (1/1) ... [2023-08-27 10:00:14,855 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@15afd1ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:00:14, skipping insertion in model container [2023-08-27 10:00:14,855 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 10:00:14" (1/1) ... [2023-08-27 10:00:14,898 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-27 10:00:15,249 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-27 10:00:15,265 INFO L201 MainTranslator]: Completed pre-run [2023-08-27 10:00:15,295 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-27 10:00:15,297 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-27 10:00:15,332 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-27 10:00:15,368 WARN L669 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-27 10:00:15,368 WARN L669 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-27 10:00:15,374 INFO L206 MainTranslator]: Completed translation [2023-08-27 10:00:15,375 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:00:15 WrapperNode [2023-08-27 10:00:15,375 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-27 10:00:15,376 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-27 10:00:15,376 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-27 10:00:15,376 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-27 10:00:15,382 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:00:15" (1/1) ... [2023-08-27 10:00:15,415 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:00:15" (1/1) ... [2023-08-27 10:00:15,457 INFO L138 Inliner]: procedures = 177, calls = 72, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 173 [2023-08-27 10:00:15,458 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-27 10:00:15,459 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-27 10:00:15,459 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-27 10:00:15,459 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-27 10:00:15,466 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:00:15" (1/1) ... [2023-08-27 10:00:15,467 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:00:15" (1/1) ... [2023-08-27 10:00:15,481 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:00:15" (1/1) ... [2023-08-27 10:00:15,481 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:00:15" (1/1) ... [2023-08-27 10:00:15,491 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:00:15" (1/1) ... [2023-08-27 10:00:15,503 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:00:15" (1/1) ... [2023-08-27 10:00:15,505 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:00:15" (1/1) ... [2023-08-27 10:00:15,506 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:00:15" (1/1) ... [2023-08-27 10:00:15,509 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-27 10:00:15,510 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-27 10:00:15,510 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-27 10:00:15,510 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-27 10:00:15,525 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:00:15" (1/1) ... [2023-08-27 10:00:15,530 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-27 10:00:15,542 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 10:00:15,558 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:00:15,585 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:00:15,598 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-27 10:00:15,598 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-27 10:00:15,598 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-27 10:00:15,598 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-27 10:00:15,599 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-27 10:00:15,599 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-27 10:00:15,599 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-27 10:00:15,599 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-27 10:00:15,599 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-27 10:00:15,599 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-27 10:00:15,599 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-27 10:00:15,599 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-08-27 10:00:15,599 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-08-27 10:00:15,599 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-27 10:00:15,600 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-27 10:00:15,602 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-27 10:00:15,602 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-27 10:00:15,603 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:00:15,771 INFO L236 CfgBuilder]: Building ICFG [2023-08-27 10:00:15,773 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-27 10:00:16,114 INFO L277 CfgBuilder]: Performing block encoding [2023-08-27 10:00:16,259 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-27 10:00:16,259 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-27 10:00:16,261 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 10:00:16 BoogieIcfgContainer [2023-08-27 10:00:16,261 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-27 10:00:16,263 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-27 10:00:16,263 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-27 10:00:16,266 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-27 10:00:16,266 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.08 10:00:14" (1/3) ... [2023-08-27 10:00:16,267 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7758158 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.08 10:00:16, skipping insertion in model container [2023-08-27 10:00:16,267 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:00:15" (2/3) ... [2023-08-27 10:00:16,267 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7758158 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.08 10:00:16, skipping insertion in model container [2023-08-27 10:00:16,267 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 10:00:16" (3/3) ... [2023-08-27 10:00:16,268 INFO L112 eAbstractionObserver]: Analyzing ICFG mix008.opt.i [2023-08-27 10:00:16,282 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-27 10:00:16,283 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 10 error locations. [2023-08-27 10:00:16,283 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-27 10:00:16,336 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-27 10:00:16,374 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 151 places, 141 transitions, 302 flow [2023-08-27 10:00:16,438 INFO L124 PetriNetUnfolderBase]: 3/137 cut-off events. [2023-08-27 10:00:16,439 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-27 10:00:16,448 INFO L83 FinitePrefix]: Finished finitePrefix Result has 150 conditions, 137 events. 3/137 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 103 event pairs, 0 based on Foata normal form. 0/124 useless extension candidates. Maximal degree in co-relation 98. Up to 2 conditions per place. [2023-08-27 10:00:16,448 INFO L82 GeneralOperation]: Start removeDead. Operand has 151 places, 141 transitions, 302 flow [2023-08-27 10:00:16,457 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 147 places, 137 transitions, 286 flow [2023-08-27 10:00:16,460 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-27 10:00:16,467 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 147 places, 137 transitions, 286 flow [2023-08-27 10:00:16,470 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 147 places, 137 transitions, 286 flow [2023-08-27 10:00:16,470 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 147 places, 137 transitions, 286 flow [2023-08-27 10:00:16,495 INFO L124 PetriNetUnfolderBase]: 3/137 cut-off events. [2023-08-27 10:00:16,496 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-27 10:00:16,497 INFO L83 FinitePrefix]: Finished finitePrefix Result has 150 conditions, 137 events. 3/137 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 104 event pairs, 0 based on Foata normal form. 0/124 useless extension candidates. Maximal degree in co-relation 98. Up to 2 conditions per place. [2023-08-27 10:00:16,499 INFO L119 LiptonReduction]: Number of co-enabled transitions 4172 [2023-08-27 10:00:20,571 INFO L134 LiptonReduction]: Checked pairs total: 14914 [2023-08-27 10:00:20,571 INFO L136 LiptonReduction]: Total number of compositions: 116 [2023-08-27 10:00:20,583 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-27 10:00:20,588 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;@36dbeef2, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-27 10:00:20,588 INFO L358 AbstractCegarLoop]: Starting to check reachability of 23 error locations. [2023-08-27 10:00:20,591 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-27 10:00:20,591 INFO L124 PetriNetUnfolderBase]: 0/8 cut-off events. [2023-08-27 10:00:20,591 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-27 10:00:20,592 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:00:20,592 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-27 10:00:20,593 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-27 10:00:20,597 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:00:20,597 INFO L85 PathProgramCache]: Analyzing trace with hash 603438794, now seen corresponding path program 1 times [2023-08-27 10:00:20,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:00:20,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017303782] [2023-08-27 10:00:20,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:00:20,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:00:20,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:00:20,839 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:00:20,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:00:20,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017303782] [2023-08-27 10:00:20,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1017303782] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:00:20,841 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:00:20,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-27 10:00:20,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623612084] [2023-08-27 10:00:20,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:00:20,851 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-27 10:00:20,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:00:20,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-27 10:00:20,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-27 10:00:20,884 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 257 [2023-08-27 10:00:20,888 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 38 transitions, 88 flow. Second operand has 3 states, 3 states have (on average 114.33333333333333) internal successors, (343), 3 states have internal predecessors, (343), 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:00:20,889 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:00:20,889 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 257 [2023-08-27 10:00:20,890 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:00:22,599 INFO L124 PetriNetUnfolderBase]: 11479/15921 cut-off events. [2023-08-27 10:00:22,599 INFO L125 PetriNetUnfolderBase]: For 82/82 co-relation queries the response was YES. [2023-08-27 10:00:22,630 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32001 conditions, 15921 events. 11479/15921 cut-off events. For 82/82 co-relation queries the response was YES. Maximal size of possible extension queue 840. Compared 94385 event pairs, 3065 based on Foata normal form. 0/10290 useless extension candidates. Maximal degree in co-relation 31989. Up to 14601 conditions per place. [2023-08-27 10:00:22,714 INFO L140 encePairwiseOnDemand]: 243/257 looper letters, 51 selfloop transitions, 5 changer transitions 0/60 dead transitions. [2023-08-27 10:00:22,714 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 60 transitions, 253 flow [2023-08-27 10:00:22,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-27 10:00:22,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-27 10:00:22,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 405 transitions. [2023-08-27 10:00:22,726 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5252918287937743 [2023-08-27 10:00:22,727 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 405 transitions. [2023-08-27 10:00:22,728 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 405 transitions. [2023-08-27 10:00:22,729 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:00:22,731 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 405 transitions. [2023-08-27 10:00:22,738 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 135.0) internal successors, (405), 3 states have internal predecessors, (405), 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:00:22,743 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 257.0) internal successors, (1028), 4 states have internal predecessors, (1028), 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:00:22,743 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 257.0) internal successors, (1028), 4 states have internal predecessors, (1028), 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:00:22,745 INFO L175 Difference]: Start difference. First operand has 50 places, 38 transitions, 88 flow. Second operand 3 states and 405 transitions. [2023-08-27 10:00:22,746 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 60 transitions, 253 flow [2023-08-27 10:00:22,750 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 60 transitions, 246 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-27 10:00:22,752 INFO L231 Difference]: Finished difference. Result has 49 places, 41 transitions, 129 flow [2023-08-27 10:00:22,753 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=257, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=129, PETRI_PLACES=49, PETRI_TRANSITIONS=41} [2023-08-27 10:00:22,756 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, -1 predicate places. [2023-08-27 10:00:22,756 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 129 flow [2023-08-27 10:00:22,757 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 114.33333333333333) internal successors, (343), 3 states have internal predecessors, (343), 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:00:22,757 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:00:22,757 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 10:00:22,757 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-27 10:00:22,758 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P3Err0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-27 10:00:22,758 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:00:22,758 INFO L85 PathProgramCache]: Analyzing trace with hash 68006717, now seen corresponding path program 1 times [2023-08-27 10:00:22,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:00:22,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319317758] [2023-08-27 10:00:22,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:00:22,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:00:22,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:00:23,018 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:00:23,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:00:23,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1319317758] [2023-08-27 10:00:23,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1319317758] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:00:23,019 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:00:23,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-27 10:00:23,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705360217] [2023-08-27 10:00:23,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:00:23,020 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-27 10:00:23,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:00:23,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-27 10:00:23,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-27 10:00:23,022 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 257 [2023-08-27 10:00:23,022 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 129 flow. Second operand has 3 states, 3 states have (on average 121.0) internal successors, (363), 3 states have internal predecessors, (363), 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:00:23,022 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:00:23,022 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 257 [2023-08-27 10:00:23,022 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:00:24,156 INFO L124 PetriNetUnfolderBase]: 7854/11723 cut-off events. [2023-08-27 10:00:24,157 INFO L125 PetriNetUnfolderBase]: For 1459/2033 co-relation queries the response was YES. [2023-08-27 10:00:24,174 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28383 conditions, 11723 events. 7854/11723 cut-off events. For 1459/2033 co-relation queries the response was YES. Maximal size of possible extension queue 824. Compared 80248 event pairs, 1763 based on Foata normal form. 0/8779 useless extension candidates. Maximal degree in co-relation 28372. Up to 8465 conditions per place. [2023-08-27 10:00:24,227 INFO L140 encePairwiseOnDemand]: 254/257 looper letters, 48 selfloop transitions, 2 changer transitions 0/58 dead transitions. [2023-08-27 10:00:24,228 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 58 transitions, 284 flow [2023-08-27 10:00:24,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-27 10:00:24,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-27 10:00:24,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 398 transitions. [2023-08-27 10:00:24,232 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.51621271076524 [2023-08-27 10:00:24,232 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 398 transitions. [2023-08-27 10:00:24,233 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 398 transitions. [2023-08-27 10:00:24,233 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:00:24,233 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 398 transitions. [2023-08-27 10:00:24,234 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 132.66666666666666) internal successors, (398), 3 states have internal predecessors, (398), 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:00:24,237 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 257.0) internal successors, (1028), 4 states have internal predecessors, (1028), 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:00:24,238 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 257.0) internal successors, (1028), 4 states have internal predecessors, (1028), 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:00:24,238 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 129 flow. Second operand 3 states and 398 transitions. [2023-08-27 10:00:24,238 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 58 transitions, 284 flow [2023-08-27 10:00:24,240 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 276 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-27 10:00:24,242 INFO L231 Difference]: Finished difference. Result has 49 places, 40 transitions, 126 flow [2023-08-27 10:00:24,243 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=257, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=126, PETRI_PLACES=49, PETRI_TRANSITIONS=40} [2023-08-27 10:00:24,245 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, -1 predicate places. [2023-08-27 10:00:24,246 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 40 transitions, 126 flow [2023-08-27 10:00:24,246 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 121.0) internal successors, (363), 3 states have internal predecessors, (363), 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:00:24,247 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:00:24,250 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 10:00:24,252 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-27 10:00:24,252 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-27 10:00:24,254 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:00:24,254 INFO L85 PathProgramCache]: Analyzing trace with hash 576089413, now seen corresponding path program 1 times [2023-08-27 10:00:24,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:00:24,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491315397] [2023-08-27 10:00:24,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:00:24,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:00:24,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:00:24,341 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:00:24,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:00:24,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491315397] [2023-08-27 10:00:24,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1491315397] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:00:24,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:00:24,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-27 10:00:24,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [762215135] [2023-08-27 10:00:24,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:00:24,342 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-27 10:00:24,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:00:24,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-27 10:00:24,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-27 10:00:24,343 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 257 [2023-08-27 10:00:24,344 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 40 transitions, 126 flow. Second operand has 4 states, 4 states have (on average 115.0) internal successors, (460), 4 states have internal predecessors, (460), 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:00:24,344 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:00:24,344 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 257 [2023-08-27 10:00:24,344 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:00:25,230 INFO L124 PetriNetUnfolderBase]: 5765/8027 cut-off events. [2023-08-27 10:00:25,230 INFO L125 PetriNetUnfolderBase]: For 794/794 co-relation queries the response was YES. [2023-08-27 10:00:25,243 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19683 conditions, 8027 events. 5765/8027 cut-off events. For 794/794 co-relation queries the response was YES. Maximal size of possible extension queue 415. Compared 42871 event pairs, 1355 based on Foata normal form. 0/6320 useless extension candidates. Maximal degree in co-relation 19671. Up to 6970 conditions per place. [2023-08-27 10:00:25,278 INFO L140 encePairwiseOnDemand]: 248/257 looper letters, 45 selfloop transitions, 5 changer transitions 0/54 dead transitions. [2023-08-27 10:00:25,279 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 54 transitions, 254 flow [2023-08-27 10:00:25,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-27 10:00:25,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-27 10:00:25,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 506 transitions. [2023-08-27 10:00:25,281 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49221789883268485 [2023-08-27 10:00:25,281 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 506 transitions. [2023-08-27 10:00:25,281 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 506 transitions. [2023-08-27 10:00:25,282 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:00:25,282 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 506 transitions. [2023-08-27 10:00:25,283 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 126.5) internal successors, (506), 4 states have internal predecessors, (506), 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:00:25,285 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 257.0) internal successors, (1285), 5 states have internal predecessors, (1285), 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:00:25,286 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 257.0) internal successors, (1285), 5 states have internal predecessors, (1285), 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:00:25,286 INFO L175 Difference]: Start difference. First operand has 49 places, 40 transitions, 126 flow. Second operand 4 states and 506 transitions. [2023-08-27 10:00:25,286 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 54 transitions, 254 flow [2023-08-27 10:00:25,289 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 54 transitions, 248 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-27 10:00:25,290 INFO L231 Difference]: Finished difference. Result has 46 places, 36 transitions, 116 flow [2023-08-27 10:00:25,290 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=257, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=116, PETRI_PLACES=46, PETRI_TRANSITIONS=36} [2023-08-27 10:00:25,291 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, -4 predicate places. [2023-08-27 10:00:25,292 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 36 transitions, 116 flow [2023-08-27 10:00:25,292 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 115.0) internal successors, (460), 4 states have internal predecessors, (460), 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:00:25,292 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:00:25,292 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 10:00:25,292 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-27 10:00:25,296 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-27 10:00:25,296 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:00:25,296 INFO L85 PathProgramCache]: Analyzing trace with hash 1289545424, now seen corresponding path program 1 times [2023-08-27 10:00:25,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:00:25,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446764854] [2023-08-27 10:00:25,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:00:25,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:00:25,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:00:25,365 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:00:25,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:00:25,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446764854] [2023-08-27 10:00:25,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1446764854] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:00:25,365 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:00:25,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-27 10:00:25,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945954350] [2023-08-27 10:00:25,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:00:25,366 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-27 10:00:25,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:00:25,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-27 10:00:25,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-27 10:00:25,369 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 257 [2023-08-27 10:00:25,369 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 36 transitions, 116 flow. Second operand has 4 states, 4 states have (on average 115.0) internal successors, (460), 4 states have internal predecessors, (460), 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:00:25,369 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:00:25,370 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 257 [2023-08-27 10:00:25,370 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:00:25,983 INFO L124 PetriNetUnfolderBase]: 3568/5054 cut-off events. [2023-08-27 10:00:25,984 INFO L125 PetriNetUnfolderBase]: For 1414/1414 co-relation queries the response was YES. [2023-08-27 10:00:25,989 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12329 conditions, 5054 events. 3568/5054 cut-off events. For 1414/1414 co-relation queries the response was YES. Maximal size of possible extension queue 237. Compared 25087 event pairs, 765 based on Foata normal form. 0/4512 useless extension candidates. Maximal degree in co-relation 12317. Up to 2186 conditions per place. [2023-08-27 10:00:26,004 INFO L140 encePairwiseOnDemand]: 248/257 looper letters, 61 selfloop transitions, 9 changer transitions 0/74 dead transitions. [2023-08-27 10:00:26,004 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 74 transitions, 350 flow [2023-08-27 10:00:26,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-27 10:00:26,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-27 10:00:26,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 526 transitions. [2023-08-27 10:00:26,006 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5116731517509727 [2023-08-27 10:00:26,006 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 526 transitions. [2023-08-27 10:00:26,006 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 526 transitions. [2023-08-27 10:00:26,007 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:00:26,007 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 526 transitions. [2023-08-27 10:00:26,008 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 131.5) internal successors, (526), 4 states have internal predecessors, (526), 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:00:26,010 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 257.0) internal successors, (1285), 5 states have internal predecessors, (1285), 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:00:26,011 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 257.0) internal successors, (1285), 5 states have internal predecessors, (1285), 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:00:26,011 INFO L175 Difference]: Start difference. First operand has 46 places, 36 transitions, 116 flow. Second operand 4 states and 526 transitions. [2023-08-27 10:00:26,011 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 74 transitions, 350 flow [2023-08-27 10:00:26,013 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 74 transitions, 344 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-27 10:00:26,014 INFO L231 Difference]: Finished difference. Result has 48 places, 40 transitions, 168 flow [2023-08-27 10:00:26,015 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=257, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=168, PETRI_PLACES=48, PETRI_TRANSITIONS=40} [2023-08-27 10:00:26,016 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, -2 predicate places. [2023-08-27 10:00:26,016 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 40 transitions, 168 flow [2023-08-27 10:00:26,016 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 115.0) internal successors, (460), 4 states have internal predecessors, (460), 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:00:26,016 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:00:26,017 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 10:00:26,017 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-27 10:00:26,017 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-27 10:00:26,017 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:00:26,017 INFO L85 PathProgramCache]: Analyzing trace with hash -1234511699, now seen corresponding path program 1 times [2023-08-27 10:00:26,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:00:26,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275174611] [2023-08-27 10:00:26,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:00:26,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:00:26,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:00:26,187 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:00:26,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:00:26,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275174611] [2023-08-27 10:00:26,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1275174611] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:00:26,188 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:00:26,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-27 10:00:26,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198289958] [2023-08-27 10:00:26,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:00:26,189 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-27 10:00:26,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:00:26,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-27 10:00:26,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-27 10:00:26,193 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 257 [2023-08-27 10:00:26,195 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 40 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 115.0) internal successors, (460), 4 states have internal predecessors, (460), 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:00:26,195 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:00:26,195 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 257 [2023-08-27 10:00:26,195 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:00:26,885 INFO L124 PetriNetUnfolderBase]: 4883/6945 cut-off events. [2023-08-27 10:00:26,885 INFO L125 PetriNetUnfolderBase]: For 5942/5942 co-relation queries the response was YES. [2023-08-27 10:00:26,897 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19984 conditions, 6945 events. 4883/6945 cut-off events. For 5942/5942 co-relation queries the response was YES. Maximal size of possible extension queue 326. Compared 37698 event pairs, 1118 based on Foata normal form. 0/6362 useless extension candidates. Maximal degree in co-relation 19971. Up to 3936 conditions per place. [2023-08-27 10:00:26,925 INFO L140 encePairwiseOnDemand]: 253/257 looper letters, 98 selfloop transitions, 4 changer transitions 0/105 dead transitions. [2023-08-27 10:00:26,926 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 105 transitions, 694 flow [2023-08-27 10:00:26,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-27 10:00:26,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-27 10:00:26,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 636 transitions. [2023-08-27 10:00:26,928 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49494163424124515 [2023-08-27 10:00:26,928 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 636 transitions. [2023-08-27 10:00:26,928 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 636 transitions. [2023-08-27 10:00:26,929 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:00:26,929 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 636 transitions. [2023-08-27 10:00:26,931 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 127.2) internal successors, (636), 5 states have internal predecessors, (636), 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:00:26,933 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 257.0) internal successors, (1542), 6 states have internal predecessors, (1542), 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:00:26,934 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 257.0) internal successors, (1542), 6 states have internal predecessors, (1542), 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:00:26,934 INFO L175 Difference]: Start difference. First operand has 48 places, 40 transitions, 168 flow. Second operand 5 states and 636 transitions. [2023-08-27 10:00:26,934 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 105 transitions, 694 flow [2023-08-27 10:00:26,942 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 105 transitions, 636 flow, removed 14 selfloop flow, removed 2 redundant places. [2023-08-27 10:00:26,944 INFO L231 Difference]: Finished difference. Result has 53 places, 42 transitions, 174 flow [2023-08-27 10:00:26,944 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=257, PETRI_DIFFERENCE_MINUEND_FLOW=150, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=174, PETRI_PLACES=53, PETRI_TRANSITIONS=42} [2023-08-27 10:00:26,946 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 3 predicate places. [2023-08-27 10:00:26,946 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 42 transitions, 174 flow [2023-08-27 10:00:26,946 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 115.0) internal successors, (460), 4 states have internal predecessors, (460), 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:00:26,946 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:00:26,947 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 10:00:26,947 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-27 10:00:26,947 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-27 10:00:26,947 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:00:26,947 INFO L85 PathProgramCache]: Analyzing trace with hash -807567585, now seen corresponding path program 1 times [2023-08-27 10:00:26,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:00:26,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262954583] [2023-08-27 10:00:26,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:00:26,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:00:26,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:00:27,142 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:00:27,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:00:27,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1262954583] [2023-08-27 10:00:27,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1262954583] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:00:27,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:00:27,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-27 10:00:27,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489547224] [2023-08-27 10:00:27,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:00:27,144 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-27 10:00:27,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:00:27,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-27 10:00:27,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-27 10:00:27,149 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 257 [2023-08-27 10:00:27,150 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 42 transitions, 174 flow. Second operand has 5 states, 5 states have (on average 104.8) internal successors, (524), 5 states have internal predecessors, (524), 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:00:27,150 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:00:27,150 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 257 [2023-08-27 10:00:27,151 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:00:29,579 INFO L124 PetriNetUnfolderBase]: 23475/32801 cut-off events. [2023-08-27 10:00:29,580 INFO L125 PetriNetUnfolderBase]: For 17753/17753 co-relation queries the response was YES. [2023-08-27 10:00:29,653 INFO L83 FinitePrefix]: Finished finitePrefix Result has 90197 conditions, 32801 events. 23475/32801 cut-off events. For 17753/17753 co-relation queries the response was YES. Maximal size of possible extension queue 1093. Compared 195004 event pairs, 2216 based on Foata normal form. 582/31982 useless extension candidates. Maximal degree in co-relation 90181. Up to 12956 conditions per place. [2023-08-27 10:00:29,792 INFO L140 encePairwiseOnDemand]: 246/257 looper letters, 149 selfloop transitions, 26 changer transitions 0/175 dead transitions. [2023-08-27 10:00:29,792 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 175 transitions, 1046 flow [2023-08-27 10:00:29,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-27 10:00:29,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-27 10:00:29,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 851 transitions. [2023-08-27 10:00:29,795 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47304057809894384 [2023-08-27 10:00:29,795 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 851 transitions. [2023-08-27 10:00:29,795 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 851 transitions. [2023-08-27 10:00:29,796 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:00:29,796 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 851 transitions. [2023-08-27 10:00:29,798 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 121.57142857142857) internal successors, (851), 7 states have internal predecessors, (851), 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:00:29,801 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 257.0) internal successors, (2056), 8 states have internal predecessors, (2056), 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:00:29,801 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 257.0) internal successors, (2056), 8 states have internal predecessors, (2056), 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:00:29,801 INFO L175 Difference]: Start difference. First operand has 53 places, 42 transitions, 174 flow. Second operand 7 states and 851 transitions. [2023-08-27 10:00:29,801 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 175 transitions, 1046 flow [2023-08-27 10:00:29,884 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 175 transitions, 1042 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-27 10:00:29,887 INFO L231 Difference]: Finished difference. Result has 63 places, 69 transitions, 391 flow [2023-08-27 10:00:29,887 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=257, PETRI_DIFFERENCE_MINUEND_FLOW=172, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=391, PETRI_PLACES=63, PETRI_TRANSITIONS=69} [2023-08-27 10:00:29,889 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 13 predicate places. [2023-08-27 10:00:29,889 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 69 transitions, 391 flow [2023-08-27 10:00:29,890 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 104.8) internal successors, (524), 5 states have internal predecessors, (524), 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:00:29,890 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:00:29,890 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 10:00:29,890 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-27 10:00:29,890 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-27 10:00:29,890 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:00:29,893 INFO L85 PathProgramCache]: Analyzing trace with hash -1303752673, now seen corresponding path program 1 times [2023-08-27 10:00:29,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:00:29,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338835338] [2023-08-27 10:00:29,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:00:29,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:00:29,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:00:30,024 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:00:30,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:00:30,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338835338] [2023-08-27 10:00:30,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1338835338] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:00:30,025 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:00:30,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-27 10:00:30,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978733061] [2023-08-27 10:00:30,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:00:30,026 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-27 10:00:30,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:00:30,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-27 10:00:30,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-27 10:00:30,027 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 257 [2023-08-27 10:00:30,027 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 69 transitions, 391 flow. Second operand has 4 states, 4 states have (on average 116.5) internal successors, (466), 4 states have internal predecessors, (466), 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:00:30,027 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:00:30,027 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 257 [2023-08-27 10:00:30,027 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:00:33,120 INFO L124 PetriNetUnfolderBase]: 22917/34575 cut-off events. [2023-08-27 10:00:33,120 INFO L125 PetriNetUnfolderBase]: For 49634/51178 co-relation queries the response was YES. [2023-08-27 10:00:33,206 INFO L83 FinitePrefix]: Finished finitePrefix Result has 115858 conditions, 34575 events. 22917/34575 cut-off events. For 49634/51178 co-relation queries the response was YES. Maximal size of possible extension queue 1831. Compared 254695 event pairs, 5697 based on Foata normal form. 668/32095 useless extension candidates. Maximal degree in co-relation 115836. Up to 15520 conditions per place. [2023-08-27 10:00:33,340 INFO L140 encePairwiseOnDemand]: 253/257 looper letters, 124 selfloop transitions, 12 changer transitions 0/153 dead transitions. [2023-08-27 10:00:33,340 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 153 transitions, 1122 flow [2023-08-27 10:00:33,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-27 10:00:33,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-27 10:00:33,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 635 transitions. [2023-08-27 10:00:33,343 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49416342412451364 [2023-08-27 10:00:33,343 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 635 transitions. [2023-08-27 10:00:33,343 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 635 transitions. [2023-08-27 10:00:33,343 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:00:33,343 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 635 transitions. [2023-08-27 10:00:33,345 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 127.0) internal successors, (635), 5 states have internal predecessors, (635), 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:00:33,347 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 257.0) internal successors, (1542), 6 states have internal predecessors, (1542), 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:00:33,347 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 257.0) internal successors, (1542), 6 states have internal predecessors, (1542), 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:00:33,347 INFO L175 Difference]: Start difference. First operand has 63 places, 69 transitions, 391 flow. Second operand 5 states and 635 transitions. [2023-08-27 10:00:33,347 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 153 transitions, 1122 flow [2023-08-27 10:00:33,455 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 153 transitions, 1122 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-27 10:00:33,458 INFO L231 Difference]: Finished difference. Result has 70 places, 77 transitions, 512 flow [2023-08-27 10:00:33,458 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=257, PETRI_DIFFERENCE_MINUEND_FLOW=391, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=512, PETRI_PLACES=70, PETRI_TRANSITIONS=77} [2023-08-27 10:00:33,459 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 20 predicate places. [2023-08-27 10:00:33,459 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 77 transitions, 512 flow [2023-08-27 10:00:33,460 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 116.5) internal successors, (466), 4 states have internal predecessors, (466), 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:00:33,460 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:00:33,460 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 10:00:33,460 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-27 10:00:33,460 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting P2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-27 10:00:33,460 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:00:33,460 INFO L85 PathProgramCache]: Analyzing trace with hash 1334983670, now seen corresponding path program 1 times [2023-08-27 10:00:33,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:00:33,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190594016] [2023-08-27 10:00:33,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:00:33,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:00:33,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:00:33,519 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:00:33,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:00:33,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190594016] [2023-08-27 10:00:33,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [190594016] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:00:33,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:00:33,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-27 10:00:33,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199460042] [2023-08-27 10:00:33,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:00:33,520 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-27 10:00:33,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:00:33,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-27 10:00:33,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-27 10:00:33,522 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 257 [2023-08-27 10:00:33,522 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 77 transitions, 512 flow. Second operand has 5 states, 5 states have (on average 115.6) internal successors, (578), 5 states have internal predecessors, (578), 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:00:33,522 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:00:33,522 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 257 [2023-08-27 10:00:33,522 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:00:36,576 INFO L124 PetriNetUnfolderBase]: 20406/29844 cut-off events. [2023-08-27 10:00:36,576 INFO L125 PetriNetUnfolderBase]: For 53488/56699 co-relation queries the response was YES. [2023-08-27 10:00:36,659 INFO L83 FinitePrefix]: Finished finitePrefix Result has 103396 conditions, 29844 events. 20406/29844 cut-off events. For 53488/56699 co-relation queries the response was YES. Maximal size of possible extension queue 1819. Compared 212260 event pairs, 2910 based on Foata normal form. 1218/29830 useless extension candidates. Maximal degree in co-relation 103369. Up to 11717 conditions per place. [2023-08-27 10:00:36,747 INFO L140 encePairwiseOnDemand]: 248/257 looper letters, 159 selfloop transitions, 13 changer transitions 0/189 dead transitions. [2023-08-27 10:00:36,748 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 189 transitions, 1612 flow [2023-08-27 10:00:36,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-27 10:00:36,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-27 10:00:36,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 657 transitions. [2023-08-27 10:00:36,756 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.511284046692607 [2023-08-27 10:00:36,756 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 657 transitions. [2023-08-27 10:00:36,756 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 657 transitions. [2023-08-27 10:00:36,756 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:00:36,757 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 657 transitions. [2023-08-27 10:00:36,758 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 131.4) internal successors, (657), 5 states have internal predecessors, (657), 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:00:36,760 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 257.0) internal successors, (1542), 6 states have internal predecessors, (1542), 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:00:36,762 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 257.0) internal successors, (1542), 6 states have internal predecessors, (1542), 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:00:36,762 INFO L175 Difference]: Start difference. First operand has 70 places, 77 transitions, 512 flow. Second operand 5 states and 657 transitions. [2023-08-27 10:00:36,762 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 189 transitions, 1612 flow [2023-08-27 10:00:36,827 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 189 transitions, 1603 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-27 10:00:36,829 INFO L231 Difference]: Finished difference. Result has 74 places, 81 transitions, 583 flow [2023-08-27 10:00:36,829 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=257, PETRI_DIFFERENCE_MINUEND_FLOW=509, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=583, PETRI_PLACES=74, PETRI_TRANSITIONS=81} [2023-08-27 10:00:36,831 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 24 predicate places. [2023-08-27 10:00:36,831 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 81 transitions, 583 flow [2023-08-27 10:00:36,832 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 115.6) internal successors, (578), 5 states have internal predecessors, (578), 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:00:36,832 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:00:36,832 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 10:00:36,832 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-27 10:00:36,832 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-27 10:00:36,833 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:00:36,833 INFO L85 PathProgramCache]: Analyzing trace with hash -1595669135, now seen corresponding path program 1 times [2023-08-27 10:00:36,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:00:36,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402212915] [2023-08-27 10:00:36,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:00:36,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:00:36,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:00:37,051 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:00:37,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:00:37,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402212915] [2023-08-27 10:00:37,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1402212915] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:00:37,052 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:00:37,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-27 10:00:37,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998164951] [2023-08-27 10:00:37,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:00:37,052 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-27 10:00:37,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:00:37,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-27 10:00:37,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-27 10:00:37,053 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 257 [2023-08-27 10:00:37,055 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 81 transitions, 583 flow. Second operand has 4 states, 4 states have (on average 115.0) internal successors, (460), 4 states have internal predecessors, (460), 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:00:37,055 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:00:37,055 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 257 [2023-08-27 10:00:37,055 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:00:38,932 INFO L124 PetriNetUnfolderBase]: 11998/18579 cut-off events. [2023-08-27 10:00:38,932 INFO L125 PetriNetUnfolderBase]: For 49068/50173 co-relation queries the response was YES. [2023-08-27 10:00:38,992 INFO L83 FinitePrefix]: Finished finitePrefix Result has 69442 conditions, 18579 events. 11998/18579 cut-off events. For 49068/50173 co-relation queries the response was YES. Maximal size of possible extension queue 1016. Compared 132419 event pairs, 2775 based on Foata normal form. 854/18575 useless extension candidates. Maximal degree in co-relation 69413. Up to 14466 conditions per place. [2023-08-27 10:00:39,049 INFO L140 encePairwiseOnDemand]: 250/257 looper letters, 112 selfloop transitions, 10 changer transitions 4/143 dead transitions. [2023-08-27 10:00:39,049 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 143 transitions, 1189 flow [2023-08-27 10:00:39,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-27 10:00:39,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-27 10:00:39,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 629 transitions. [2023-08-27 10:00:39,051 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4894941634241245 [2023-08-27 10:00:39,051 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 629 transitions. [2023-08-27 10:00:39,051 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 629 transitions. [2023-08-27 10:00:39,052 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:00:39,052 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 629 transitions. [2023-08-27 10:00:39,053 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 125.8) internal successors, (629), 5 states have internal predecessors, (629), 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:00:39,055 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 257.0) internal successors, (1542), 6 states have internal predecessors, (1542), 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:00:39,056 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 257.0) internal successors, (1542), 6 states have internal predecessors, (1542), 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:00:39,056 INFO L175 Difference]: Start difference. First operand has 74 places, 81 transitions, 583 flow. Second operand 5 states and 629 transitions. [2023-08-27 10:00:39,056 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 143 transitions, 1189 flow [2023-08-27 10:00:39,540 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 143 transitions, 1123 flow, removed 16 selfloop flow, removed 3 redundant places. [2023-08-27 10:00:39,541 INFO L231 Difference]: Finished difference. Result has 78 places, 85 transitions, 607 flow [2023-08-27 10:00:39,542 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=257, PETRI_DIFFERENCE_MINUEND_FLOW=536, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=607, PETRI_PLACES=78, PETRI_TRANSITIONS=85} [2023-08-27 10:00:39,542 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 28 predicate places. [2023-08-27 10:00:39,542 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 85 transitions, 607 flow [2023-08-27 10:00:39,543 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 115.0) internal successors, (460), 4 states have internal predecessors, (460), 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:00:39,543 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:00:39,543 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 10:00:39,543 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-27 10:00:39,543 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-27 10:00:39,543 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:00:39,543 INFO L85 PathProgramCache]: Analyzing trace with hash 1263399283, now seen corresponding path program 1 times [2023-08-27 10:00:39,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:00:39,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213050263] [2023-08-27 10:00:39,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:00:39,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:00:39,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:00:39,666 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:00:39,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:00:39,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213050263] [2023-08-27 10:00:39,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1213050263] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:00:39,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:00:39,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-27 10:00:39,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557754869] [2023-08-27 10:00:39,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:00:39,668 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-27 10:00:39,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:00:39,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-27 10:00:39,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-27 10:00:39,669 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 257 [2023-08-27 10:00:39,669 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 85 transitions, 607 flow. Second operand has 4 states, 4 states have (on average 115.5) internal successors, (462), 4 states have internal predecessors, (462), 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:00:39,669 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:00:39,669 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 257 [2023-08-27 10:00:39,669 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:00:41,151 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([467] L786-->L802: Formula: (let ((.cse9 (= (mod v_~z$r_buff1_thd3~0_40 256) 0)) (.cse10 (= (mod v_~z$r_buff0_thd3~0_40 256) 0))) (let ((.cse11 (not .cse10)) (.cse3 (and .cse9 .cse10)) (.cse4 (and (= (mod v_~z$w_buff1_used~0_111 256) 0) .cse10)) (.cse12 (= 0 (mod v_~z$w_buff0_used~0_114 256)))) (let ((.cse1 (or .cse3 .cse4 .cse12)) (.cse2 (and (not .cse12) .cse11))) (let ((.cse6 (ite .cse1 v_~z~0_102 (ite .cse2 v_~z$w_buff0~0_69 v_~z$w_buff1~0_56))) (.cse0 (not (= (mod v_~weak$$choice2~0_52 256) 0))) (.cse8 (= (mod v_~z$w_buff1_used~0_110 256) 0)) (.cse5 (= (mod v_~z$w_buff0_used~0_113 256) 0))) (and (= v_~z$w_buff0~0_69 v_~z$w_buff0~0_68) (= v_~z$w_buff0_used~0_113 (ite .cse0 v_~z$w_buff0_used~0_114 (ite .cse1 v_~z$w_buff0_used~0_114 (ite .cse2 0 v_~z$w_buff0_used~0_114)))) (= v_~z$w_buff1_used~0_110 (ite .cse0 v_~z$w_buff1_used~0_111 (ite (or .cse3 .cse4 .cse5) v_~z$w_buff1_used~0_111 0))) (= v_~z~0_100 (ite .cse0 v_~z$mem_tmp~0_38 .cse6)) (= v_~z$flush_delayed~0_46 0) (= v_~z$mem_tmp~0_38 v_~z~0_102) (= (ite .cse0 v_~z$r_buff1_thd3~0_40 (ite (let ((.cse7 (= (mod v_~z$r_buff0_thd3~0_39 256) 0))) (or .cse5 (and .cse7 .cse8) (and .cse9 .cse7))) v_~z$r_buff1_thd3~0_40 0)) v_~z$r_buff1_thd3~0_39) (= v_~__unbuffered_p2_EBX~0_12 .cse6) (= v_~z$r_buff0_thd3~0_39 (ite .cse0 v_~z$r_buff0_thd3~0_40 (ite (or .cse3 .cse5 (and .cse10 .cse8)) v_~z$r_buff0_thd3~0_40 (ite (and (not .cse5) .cse11) 0 v_~z$r_buff0_thd3~0_40)))) (= v_~z$w_buff1~0_56 v_~z$w_buff1~0_55)))))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_114, ~z$w_buff0~0=v_~z$w_buff0~0_69, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_40, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_111, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_40, ~z$w_buff1~0=v_~z$w_buff1~0_56, ~z~0=v_~z~0_102} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_38, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_12, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_113, ~z$w_buff0~0=v_~z$w_buff0~0_68, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_39, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_110, ~z$w_buff1~0=v_~z$w_buff1~0_55, P2Thread1of1ForFork2_#t~nondet4=|v_P2Thread1of1ForFork2_#t~nondet4_1|, ~z$flush_delayed~0=v_~z$flush_delayed~0_46, P2Thread1of1ForFork2_#t~nondet3=|v_P2Thread1of1ForFork2_#t~nondet3_1|, ~weak$$choice0~0=v_~weak$$choice0~0_14, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_39, ~z~0=v_~z~0_100, ~weak$$choice2~0=v_~weak$$choice2~0_52} AuxVars[] AssignedVars[~z$mem_tmp~0, ~__unbuffered_p2_EBX~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ~z$w_buff1_used~0, ~z$w_buff1~0, P2Thread1of1ForFork2_#t~nondet4, ~z$flush_delayed~0, P2Thread1of1ForFork2_#t~nondet3, ~weak$$choice0~0, ~z$r_buff0_thd3~0, ~z~0, ~weak$$choice2~0][42], [Black: 190#(and (<= ~x~0 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|)), Black: 192#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|)), Black: 187#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 188#(<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|), 63#L885true, 79#L771true, 166#(<= 1 ~__unbuffered_cnt~0), Black: 201#(= ~__unbuffered_p3_EAX~0 0), Black: 204#(and (= ~__unbuffered_p3_EAX~0 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|)), Black: 202#(<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|), P1Thread1of1ForFork1InUse, P0Thread1of1ForFork3InUse, P3Thread1of1ForFork0InUse, Black: 213#(<= ~__unbuffered_cnt~0 2), P2Thread1of1ForFork2InUse, 48#L843true, 228#(= ~x~0 1), Black: 156#(= ~__unbuffered_cnt~0 0), Black: 221#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 218#(= ~__unbuffered_cnt~0 0), 120#P0EXITtrue, Black: 219#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), 36#L802true, Black: 177#(<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|), Black: 179#(and (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (= ~__unbuffered_p2_EAX~0 0)), Black: 176#(= ~__unbuffered_p2_EAX~0 0), 184#true, 216#true, 212#(<= ~__unbuffered_cnt~0 1)]) [2023-08-27 10:00:41,151 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is cut-off event [2023-08-27 10:00:41,151 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-27 10:00:41,151 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-27 10:00:41,151 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-27 10:00:43,069 INFO L124 PetriNetUnfolderBase]: 21811/34962 cut-off events. [2023-08-27 10:00:43,069 INFO L125 PetriNetUnfolderBase]: For 70399/71502 co-relation queries the response was YES. [2023-08-27 10:00:43,195 INFO L83 FinitePrefix]: Finished finitePrefix Result has 124306 conditions, 34962 events. 21811/34962 cut-off events. For 70399/71502 co-relation queries the response was YES. Maximal size of possible extension queue 2045. Compared 285527 event pairs, 7172 based on Foata normal form. 473/33829 useless extension candidates. Maximal degree in co-relation 124274. Up to 12975 conditions per place. [2023-08-27 10:00:43,297 INFO L140 encePairwiseOnDemand]: 253/257 looper letters, 160 selfloop transitions, 21 changer transitions 8/200 dead transitions. [2023-08-27 10:00:43,298 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 200 transitions, 1765 flow [2023-08-27 10:00:43,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-27 10:00:43,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-27 10:00:43,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 640 transitions. [2023-08-27 10:00:43,300 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4980544747081712 [2023-08-27 10:00:43,300 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 640 transitions. [2023-08-27 10:00:43,300 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 640 transitions. [2023-08-27 10:00:43,300 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:00:43,301 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 640 transitions. [2023-08-27 10:00:43,302 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 128.0) internal successors, (640), 5 states have internal predecessors, (640), 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:00:43,304 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 257.0) internal successors, (1542), 6 states have internal predecessors, (1542), 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:00:43,304 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 257.0) internal successors, (1542), 6 states have internal predecessors, (1542), 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:00:43,304 INFO L175 Difference]: Start difference. First operand has 78 places, 85 transitions, 607 flow. Second operand 5 states and 640 transitions. [2023-08-27 10:00:43,304 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 200 transitions, 1765 flow [2023-08-27 10:00:44,002 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 200 transitions, 1739 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-27 10:00:44,005 INFO L231 Difference]: Finished difference. Result has 83 places, 96 transitions, 789 flow [2023-08-27 10:00:44,005 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=257, PETRI_DIFFERENCE_MINUEND_FLOW=593, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=789, PETRI_PLACES=83, PETRI_TRANSITIONS=96} [2023-08-27 10:00:44,006 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 33 predicate places. [2023-08-27 10:00:44,006 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 96 transitions, 789 flow [2023-08-27 10:00:44,006 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 115.5) internal successors, (462), 4 states have internal predecessors, (462), 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:00:44,006 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:00:44,006 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 10:00:44,006 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-27 10:00:44,007 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-27 10:00:44,007 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:00:44,007 INFO L85 PathProgramCache]: Analyzing trace with hash -165686765, now seen corresponding path program 1 times [2023-08-27 10:00:44,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:00:44,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863321387] [2023-08-27 10:00:44,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:00:44,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:00:44,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:00:44,189 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:00:44,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:00:44,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863321387] [2023-08-27 10:00:44,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1863321387] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:00:44,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:00:44,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-27 10:00:44,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001225580] [2023-08-27 10:00:44,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:00:44,190 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-27 10:00:44,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:00:44,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-27 10:00:44,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-27 10:00:44,192 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 257 [2023-08-27 10:00:44,192 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 96 transitions, 789 flow. Second operand has 4 states, 4 states have (on average 114.75) internal successors, (459), 4 states have internal predecessors, (459), 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:00:44,192 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:00:44,192 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 257 [2023-08-27 10:00:44,193 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:00:49,925 INFO L124 PetriNetUnfolderBase]: 35807/56835 cut-off events. [2023-08-27 10:00:49,926 INFO L125 PetriNetUnfolderBase]: For 128466/129062 co-relation queries the response was YES. [2023-08-27 10:00:50,351 INFO L83 FinitePrefix]: Finished finitePrefix Result has 208046 conditions, 56835 events. 35807/56835 cut-off events. For 128466/129062 co-relation queries the response was YES. Maximal size of possible extension queue 3186. Compared 482909 event pairs, 11223 based on Foata normal form. 302/55126 useless extension candidates. Maximal degree in co-relation 208012. Up to 20386 conditions per place. [2023-08-27 10:00:50,538 INFO L140 encePairwiseOnDemand]: 253/257 looper letters, 178 selfloop transitions, 23 changer transitions 8/218 dead transitions. [2023-08-27 10:00:50,538 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 218 transitions, 2091 flow [2023-08-27 10:00:50,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-27 10:00:50,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-27 10:00:50,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 636 transitions. [2023-08-27 10:00:50,540 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49494163424124515 [2023-08-27 10:00:50,540 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 636 transitions. [2023-08-27 10:00:50,540 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 636 transitions. [2023-08-27 10:00:50,541 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:00:50,541 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 636 transitions. [2023-08-27 10:00:50,542 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 127.2) internal successors, (636), 5 states have internal predecessors, (636), 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:00:50,544 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 257.0) internal successors, (1542), 6 states have internal predecessors, (1542), 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:00:50,545 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 257.0) internal successors, (1542), 6 states have internal predecessors, (1542), 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:00:50,545 INFO L175 Difference]: Start difference. First operand has 83 places, 96 transitions, 789 flow. Second operand 5 states and 636 transitions. [2023-08-27 10:00:50,545 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 218 transitions, 2091 flow [2023-08-27 10:00:52,777 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 218 transitions, 2081 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-27 10:00:52,779 INFO L231 Difference]: Finished difference. Result has 88 places, 112 transitions, 1064 flow [2023-08-27 10:00:52,779 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=257, PETRI_DIFFERENCE_MINUEND_FLOW=779, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1064, PETRI_PLACES=88, PETRI_TRANSITIONS=112} [2023-08-27 10:00:52,780 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 38 predicate places. [2023-08-27 10:00:52,780 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 112 transitions, 1064 flow [2023-08-27 10:00:52,780 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 114.75) internal successors, (459), 4 states have internal predecessors, (459), 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:00:52,781 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:00:52,781 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:00:52,781 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-27 10:00:52,781 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-27 10:00:52,781 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:00:52,781 INFO L85 PathProgramCache]: Analyzing trace with hash -1158571918, now seen corresponding path program 1 times [2023-08-27 10:00:52,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:00:52,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517557771] [2023-08-27 10:00:52,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:00:52,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:00:52,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:00:53,018 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:00:53,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:00:53,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517557771] [2023-08-27 10:00:53,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [517557771] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:00:53,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:00:53,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-27 10:00:53,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53517834] [2023-08-27 10:00:53,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:00:53,019 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-27 10:00:53,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:00:53,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-27 10:00:53,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-27 10:00:53,020 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 257 [2023-08-27 10:00:53,021 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 112 transitions, 1064 flow. Second operand has 5 states, 5 states have (on average 114.4) internal successors, (572), 5 states have internal predecessors, (572), 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:00:53,021 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:00:53,021 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 257 [2023-08-27 10:00:53,021 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:00:55,109 INFO L124 PetriNetUnfolderBase]: 11323/19593 cut-off events. [2023-08-27 10:00:55,109 INFO L125 PetriNetUnfolderBase]: For 50592/52444 co-relation queries the response was YES. [2023-08-27 10:00:55,168 INFO L83 FinitePrefix]: Finished finitePrefix Result has 75245 conditions, 19593 events. 11323/19593 cut-off events. For 50592/52444 co-relation queries the response was YES. Maximal size of possible extension queue 956. Compared 165692 event pairs, 2353 based on Foata normal form. 1445/19701 useless extension candidates. Maximal degree in co-relation 75209. Up to 10572 conditions per place. [2023-08-27 10:00:55,217 INFO L140 encePairwiseOnDemand]: 250/257 looper letters, 166 selfloop transitions, 19 changer transitions 4/206 dead transitions. [2023-08-27 10:00:55,217 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 206 transitions, 1987 flow [2023-08-27 10:00:55,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-27 10:00:55,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-27 10:00:55,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 878 transitions. [2023-08-27 10:00:55,219 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48804891606448025 [2023-08-27 10:00:55,219 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 878 transitions. [2023-08-27 10:00:55,220 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 878 transitions. [2023-08-27 10:00:55,220 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:00:55,220 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 878 transitions. [2023-08-27 10:00:55,222 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 125.42857142857143) internal successors, (878), 7 states have internal predecessors, (878), 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:00:55,224 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 257.0) internal successors, (2056), 8 states have internal predecessors, (2056), 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:00:55,224 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 257.0) internal successors, (2056), 8 states have internal predecessors, (2056), 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:00:55,225 INFO L175 Difference]: Start difference. First operand has 88 places, 112 transitions, 1064 flow. Second operand 7 states and 878 transitions. [2023-08-27 10:00:55,225 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 206 transitions, 1987 flow [2023-08-27 10:00:55,596 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 206 transitions, 1987 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-27 10:00:55,599 INFO L231 Difference]: Finished difference. Result has 97 places, 114 transitions, 1130 flow [2023-08-27 10:00:55,599 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=257, PETRI_DIFFERENCE_MINUEND_FLOW=1036, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1130, PETRI_PLACES=97, PETRI_TRANSITIONS=114} [2023-08-27 10:00:55,599 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 47 predicate places. [2023-08-27 10:00:55,599 INFO L495 AbstractCegarLoop]: Abstraction has has 97 places, 114 transitions, 1130 flow [2023-08-27 10:00:55,600 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 114.4) internal successors, (572), 5 states have internal predecessors, (572), 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:00:55,600 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:00:55,600 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] [2023-08-27 10:00:55,600 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-27 10:00:55,600 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-27 10:00:55,600 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:00:55,600 INFO L85 PathProgramCache]: Analyzing trace with hash -1803114114, now seen corresponding path program 1 times [2023-08-27 10:00:55,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:00:55,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075838848] [2023-08-27 10:00:55,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:00:55,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:00:55,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:00:55,806 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:00:55,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:00:55,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075838848] [2023-08-27 10:00:55,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2075838848] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:00:55,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:00:55,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-27 10:00:55,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354188010] [2023-08-27 10:00:55,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:00:55,807 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-27 10:00:55,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:00:55,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-27 10:00:55,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-27 10:00:55,809 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 257 [2023-08-27 10:00:55,809 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 114 transitions, 1130 flow. Second operand has 6 states, 6 states have (on average 114.16666666666667) internal successors, (685), 6 states have internal predecessors, (685), 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:00:55,809 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:00:55,809 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 257 [2023-08-27 10:00:55,809 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:00:57,411 INFO L124 PetriNetUnfolderBase]: 7414/12118 cut-off events. [2023-08-27 10:00:57,411 INFO L125 PetriNetUnfolderBase]: For 42586/44335 co-relation queries the response was YES. [2023-08-27 10:00:57,441 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54504 conditions, 12118 events. 7414/12118 cut-off events. For 42586/44335 co-relation queries the response was YES. Maximal size of possible extension queue 833. Compared 89813 event pairs, 620 based on Foata normal form. 952/12336 useless extension candidates. Maximal degree in co-relation 54463. Up to 3277 conditions per place. [2023-08-27 10:00:57,472 INFO L140 encePairwiseOnDemand]: 250/257 looper letters, 169 selfloop transitions, 28 changer transitions 4/215 dead transitions. [2023-08-27 10:00:57,472 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 215 transitions, 2036 flow [2023-08-27 10:00:57,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-27 10:00:57,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-27 10:00:57,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1125 transitions. [2023-08-27 10:00:57,475 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48638132295719844 [2023-08-27 10:00:57,475 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1125 transitions. [2023-08-27 10:00:57,475 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1125 transitions. [2023-08-27 10:00:57,476 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:00:57,476 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1125 transitions. [2023-08-27 10:00:57,478 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 125.0) internal successors, (1125), 9 states have internal predecessors, (1125), 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:00:57,481 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 257.0) internal successors, (2570), 10 states have internal predecessors, (2570), 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:00:57,481 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 257.0) internal successors, (2570), 10 states have internal predecessors, (2570), 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:00:57,481 INFO L175 Difference]: Start difference. First operand has 97 places, 114 transitions, 1130 flow. Second operand 9 states and 1125 transitions. [2023-08-27 10:00:57,481 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 215 transitions, 2036 flow [2023-08-27 10:00:58,162 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 215 transitions, 1998 flow, removed 3 selfloop flow, removed 5 redundant places. [2023-08-27 10:00:58,164 INFO L231 Difference]: Finished difference. Result has 102 places, 103 transitions, 1013 flow [2023-08-27 10:00:58,164 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=257, PETRI_DIFFERENCE_MINUEND_FLOW=907, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1013, PETRI_PLACES=102, PETRI_TRANSITIONS=103} [2023-08-27 10:00:58,165 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 52 predicate places. [2023-08-27 10:00:58,165 INFO L495 AbstractCegarLoop]: Abstraction has has 102 places, 103 transitions, 1013 flow [2023-08-27 10:00:58,165 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 114.16666666666667) internal successors, (685), 6 states have internal predecessors, (685), 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:00:58,166 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:00:58,166 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] [2023-08-27 10:00:58,166 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-27 10:00:58,166 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting P3Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-27 10:00:58,166 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:00:58,166 INFO L85 PathProgramCache]: Analyzing trace with hash 1153177154, now seen corresponding path program 1 times [2023-08-27 10:00:58,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:00:58,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191546098] [2023-08-27 10:00:58,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:00:58,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:00:58,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:00:58,271 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:00:58,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:00:58,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191546098] [2023-08-27 10:00:58,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [191546098] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:00:58,271 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:00:58,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-27 10:00:58,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618238036] [2023-08-27 10:00:58,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:00:58,272 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-27 10:00:58,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:00:58,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-27 10:00:58,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-08-27 10:00:58,273 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 257 [2023-08-27 10:00:58,274 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 103 transitions, 1013 flow. Second operand has 6 states, 6 states have (on average 116.16666666666667) internal successors, (697), 6 states have internal predecessors, (697), 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:00:58,274 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:00:58,274 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 257 [2023-08-27 10:00:58,274 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:00:59,731 INFO L124 PetriNetUnfolderBase]: 7159/11627 cut-off events. [2023-08-27 10:00:59,732 INFO L125 PetriNetUnfolderBase]: For 44353/45816 co-relation queries the response was YES. [2023-08-27 10:00:59,768 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55869 conditions, 11627 events. 7159/11627 cut-off events. For 44353/45816 co-relation queries the response was YES. Maximal size of possible extension queue 810. Compared 85351 event pairs, 839 based on Foata normal form. 402/11603 useless extension candidates. Maximal degree in co-relation 55826. Up to 3861 conditions per place. [2023-08-27 10:00:59,785 INFO L140 encePairwiseOnDemand]: 248/257 looper letters, 84 selfloop transitions, 27 changer transitions 41/161 dead transitions. [2023-08-27 10:00:59,786 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 161 transitions, 1701 flow [2023-08-27 10:00:59,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-27 10:00:59,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-27 10:00:59,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 759 transitions. [2023-08-27 10:00:59,787 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49221789883268485 [2023-08-27 10:00:59,788 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 759 transitions. [2023-08-27 10:00:59,788 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 759 transitions. [2023-08-27 10:00:59,788 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:00:59,788 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 759 transitions. [2023-08-27 10:00:59,790 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 126.5) internal successors, (759), 6 states have internal predecessors, (759), 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:00:59,791 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 257.0) internal successors, (1799), 7 states have internal predecessors, (1799), 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:00:59,792 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 257.0) internal successors, (1799), 7 states have internal predecessors, (1799), 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:00:59,792 INFO L175 Difference]: Start difference. First operand has 102 places, 103 transitions, 1013 flow. Second operand 6 states and 759 transitions. [2023-08-27 10:00:59,792 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 161 transitions, 1701 flow [2023-08-27 10:01:00,993 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 161 transitions, 1647 flow, removed 2 selfloop flow, removed 6 redundant places. [2023-08-27 10:01:00,995 INFO L231 Difference]: Finished difference. Result has 97 places, 67 transitions, 552 flow [2023-08-27 10:01:00,995 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=257, PETRI_DIFFERENCE_MINUEND_FLOW=927, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=552, PETRI_PLACES=97, PETRI_TRANSITIONS=67} [2023-08-27 10:01:00,995 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 47 predicate places. [2023-08-27 10:01:00,996 INFO L495 AbstractCegarLoop]: Abstraction has has 97 places, 67 transitions, 552 flow [2023-08-27 10:01:00,996 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 116.16666666666667) internal successors, (697), 6 states have internal predecessors, (697), 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:01:00,996 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:01:00,996 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:01:00,996 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-27 10:01:00,996 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-27 10:01:00,997 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:01:00,997 INFO L85 PathProgramCache]: Analyzing trace with hash -2135016084, now seen corresponding path program 1 times [2023-08-27 10:01:00,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:01:00,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625830578] [2023-08-27 10:01:00,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:01:00,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:01:01,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:01:01,381 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:01:01,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:01:01,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625830578] [2023-08-27 10:01:01,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [625830578] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:01:01,382 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:01:01,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-27 10:01:01,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812015537] [2023-08-27 10:01:01,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:01:01,382 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-27 10:01:01,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:01:01,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-27 10:01:01,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-08-27 10:01:01,384 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 257 [2023-08-27 10:01:01,385 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 67 transitions, 552 flow. Second operand has 7 states, 7 states have (on average 114.0) internal successors, (798), 7 states have internal predecessors, (798), 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:01:01,385 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:01:01,385 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 257 [2023-08-27 10:01:01,385 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:01:02,565 INFO L124 PetriNetUnfolderBase]: 6576/10401 cut-off events. [2023-08-27 10:01:02,565 INFO L125 PetriNetUnfolderBase]: For 39294/40829 co-relation queries the response was YES. [2023-08-27 10:01:02,617 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49358 conditions, 10401 events. 6576/10401 cut-off events. For 39294/40829 co-relation queries the response was YES. Maximal size of possible extension queue 779. Compared 74762 event pairs, 372 based on Foata normal form. 506/10489 useless extension candidates. Maximal degree in co-relation 49316. Up to 3054 conditions per place. [2023-08-27 10:01:02,631 INFO L140 encePairwiseOnDemand]: 250/257 looper letters, 86 selfloop transitions, 29 changer transitions 56/176 dead transitions. [2023-08-27 10:01:02,632 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 176 transitions, 1537 flow [2023-08-27 10:01:02,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-08-27 10:01:02,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-08-27 10:01:02,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1338 transitions. [2023-08-27 10:01:02,635 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4732932437212593 [2023-08-27 10:01:02,635 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1338 transitions. [2023-08-27 10:01:02,635 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1338 transitions. [2023-08-27 10:01:02,635 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:01:02,635 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1338 transitions. [2023-08-27 10:01:02,638 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 121.63636363636364) internal successors, (1338), 11 states have internal predecessors, (1338), 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:01:02,641 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 257.0) internal successors, (3084), 12 states have internal predecessors, (3084), 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:01:02,642 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 257.0) internal successors, (3084), 12 states have internal predecessors, (3084), 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:01:02,642 INFO L175 Difference]: Start difference. First operand has 97 places, 67 transitions, 552 flow. Second operand 11 states and 1338 transitions. [2023-08-27 10:01:02,642 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 176 transitions, 1537 flow [2023-08-27 10:01:03,812 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 176 transitions, 1338 flow, removed 38 selfloop flow, removed 17 redundant places. [2023-08-27 10:01:03,814 INFO L231 Difference]: Finished difference. Result has 85 places, 55 transitions, 403 flow [2023-08-27 10:01:03,814 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=257, PETRI_DIFFERENCE_MINUEND_FLOW=409, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=403, PETRI_PLACES=85, PETRI_TRANSITIONS=55} [2023-08-27 10:01:03,814 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 35 predicate places. [2023-08-27 10:01:03,814 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 55 transitions, 403 flow [2023-08-27 10:01:03,815 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 114.0) internal successors, (798), 7 states have internal predecessors, (798), 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:01:03,815 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:01:03,815 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, 1, 1, 1] [2023-08-27 10:01:03,815 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-27 10:01:03,815 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-27 10:01:03,815 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:01:03,815 INFO L85 PathProgramCache]: Analyzing trace with hash 682144271, now seen corresponding path program 1 times [2023-08-27 10:01:03,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:01:03,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478240217] [2023-08-27 10:01:03,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:01:03,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:01:03,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:01:03,983 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:01:03,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:01:03,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478240217] [2023-08-27 10:01:03,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1478240217] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:01:03,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:01:03,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-27 10:01:03,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080268908] [2023-08-27 10:01:03,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:01:03,984 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-27 10:01:03,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:01:03,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-27 10:01:03,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-27 10:01:03,985 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 257 [2023-08-27 10:01:03,986 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 55 transitions, 403 flow. Second operand has 5 states, 5 states have (on average 114.8) internal successors, (574), 5 states have internal predecessors, (574), 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:01:03,986 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:01:03,986 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 257 [2023-08-27 10:01:03,986 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:01:04,227 INFO L124 PetriNetUnfolderBase]: 1032/1807 cut-off events. [2023-08-27 10:01:04,227 INFO L125 PetriNetUnfolderBase]: For 6222/6300 co-relation queries the response was YES. [2023-08-27 10:01:04,232 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8528 conditions, 1807 events. 1032/1807 cut-off events. For 6222/6300 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 10023 event pairs, 205 based on Foata normal form. 27/1809 useless extension candidates. Maximal degree in co-relation 8501. Up to 990 conditions per place. [2023-08-27 10:01:04,233 INFO L140 encePairwiseOnDemand]: 253/257 looper letters, 37 selfloop transitions, 1 changer transitions 64/105 dead transitions. [2023-08-27 10:01:04,233 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 105 transitions, 984 flow [2023-08-27 10:01:04,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-27 10:01:04,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-27 10:01:04,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 598 transitions. [2023-08-27 10:01:04,235 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4653696498054475 [2023-08-27 10:01:04,235 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 598 transitions. [2023-08-27 10:01:04,235 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 598 transitions. [2023-08-27 10:01:04,235 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:01:04,235 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 598 transitions. [2023-08-27 10:01:04,236 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 119.6) internal successors, (598), 5 states have internal predecessors, (598), 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:01:04,238 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 257.0) internal successors, (1542), 6 states have internal predecessors, (1542), 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:01:04,238 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 257.0) internal successors, (1542), 6 states have internal predecessors, (1542), 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:01:04,238 INFO L175 Difference]: Start difference. First operand has 85 places, 55 transitions, 403 flow. Second operand 5 states and 598 transitions. [2023-08-27 10:01:04,238 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 105 transitions, 984 flow [2023-08-27 10:01:04,258 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 105 transitions, 785 flow, removed 26 selfloop flow, removed 18 redundant places. [2023-08-27 10:01:04,259 INFO L231 Difference]: Finished difference. Result has 70 places, 39 transitions, 201 flow [2023-08-27 10:01:04,259 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=257, PETRI_DIFFERENCE_MINUEND_FLOW=299, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=201, PETRI_PLACES=70, PETRI_TRANSITIONS=39} [2023-08-27 10:01:04,259 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 20 predicate places. [2023-08-27 10:01:04,259 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 39 transitions, 201 flow [2023-08-27 10:01:04,260 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 114.8) internal successors, (574), 5 states have internal predecessors, (574), 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:01:04,260 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:01:04,260 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, 1, 1, 1] [2023-08-27 10:01:04,260 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-08-27 10:01:04,260 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-27 10:01:04,260 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:01:04,260 INFO L85 PathProgramCache]: Analyzing trace with hash -2041240125, now seen corresponding path program 2 times [2023-08-27 10:01:04,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:01:04,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334248023] [2023-08-27 10:01:04,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:01:04,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:01:04,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:01:05,325 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:01:05,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:01:05,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334248023] [2023-08-27 10:01:05,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [334248023] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:01:05,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:01:05,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-27 10:01:05,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894312506] [2023-08-27 10:01:05,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:01:05,326 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-27 10:01:05,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:01:05,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-27 10:01:05,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-08-27 10:01:05,328 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 257 [2023-08-27 10:01:05,328 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 39 transitions, 201 flow. Second operand has 8 states, 8 states have (on average 106.875) internal successors, (855), 8 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:01:05,328 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:01:05,329 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 257 [2023-08-27 10:01:05,329 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:01:05,600 INFO L124 PetriNetUnfolderBase]: 257/483 cut-off events. [2023-08-27 10:01:05,601 INFO L125 PetriNetUnfolderBase]: For 716/731 co-relation queries the response was YES. [2023-08-27 10:01:05,602 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1775 conditions, 483 events. 257/483 cut-off events. For 716/731 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1928 event pairs, 86 based on Foata normal form. 5/485 useless extension candidates. Maximal degree in co-relation 1754. Up to 176 conditions per place. [2023-08-27 10:01:05,603 INFO L140 encePairwiseOnDemand]: 249/257 looper letters, 39 selfloop transitions, 5 changer transitions 49/97 dead transitions. [2023-08-27 10:01:05,603 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 97 transitions, 741 flow [2023-08-27 10:01:05,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-27 10:01:05,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-27 10:01:05,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 988 transitions. [2023-08-27 10:01:05,605 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42715088629485515 [2023-08-27 10:01:05,605 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 988 transitions. [2023-08-27 10:01:05,605 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 988 transitions. [2023-08-27 10:01:05,606 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:01:05,606 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 988 transitions. [2023-08-27 10:01:05,620 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 109.77777777777777) internal successors, (988), 9 states have internal predecessors, (988), 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:01:05,623 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 257.0) internal successors, (2570), 10 states have internal predecessors, (2570), 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:01:05,623 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 257.0) internal successors, (2570), 10 states have internal predecessors, (2570), 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:01:05,623 INFO L175 Difference]: Start difference. First operand has 70 places, 39 transitions, 201 flow. Second operand 9 states and 988 transitions. [2023-08-27 10:01:05,623 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 97 transitions, 741 flow [2023-08-27 10:01:05,626 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 97 transitions, 687 flow, removed 15 selfloop flow, removed 11 redundant places. [2023-08-27 10:01:05,627 INFO L231 Difference]: Finished difference. Result has 61 places, 39 transitions, 194 flow [2023-08-27 10:01:05,627 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=257, PETRI_DIFFERENCE_MINUEND_FLOW=176, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=194, PETRI_PLACES=61, PETRI_TRANSITIONS=39} [2023-08-27 10:01:05,627 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 11 predicate places. [2023-08-27 10:01:05,627 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 39 transitions, 194 flow [2023-08-27 10:01:05,628 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 106.875) internal successors, (855), 8 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:01:05,628 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:01:05,628 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, 1, 1, 1] [2023-08-27 10:01:05,628 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-08-27 10:01:05,628 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-27 10:01:05,628 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:01:05,628 INFO L85 PathProgramCache]: Analyzing trace with hash -760989941, now seen corresponding path program 3 times [2023-08-27 10:01:05,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:01:05,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725947269] [2023-08-27 10:01:05,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:01:05,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:01:05,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-27 10:01:05,677 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-27 10:01:05,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-27 10:01:05,739 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-27 10:01:05,740 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-27 10:01:05,741 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONASSERT (22 of 23 remaining) [2023-08-27 10:01:05,744 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 23 remaining) [2023-08-27 10:01:05,744 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 23 remaining) [2023-08-27 10:01:05,744 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 23 remaining) [2023-08-27 10:01:05,744 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 23 remaining) [2023-08-27 10:01:05,744 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 23 remaining) [2023-08-27 10:01:05,744 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 23 remaining) [2023-08-27 10:01:05,744 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONASSERT (15 of 23 remaining) [2023-08-27 10:01:05,745 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 23 remaining) [2023-08-27 10:01:05,745 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 23 remaining) [2023-08-27 10:01:05,745 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (12 of 23 remaining) [2023-08-27 10:01:05,745 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (11 of 23 remaining) [2023-08-27 10:01:05,745 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (10 of 23 remaining) [2023-08-27 10:01:05,745 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (9 of 23 remaining) [2023-08-27 10:01:05,746 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 23 remaining) [2023-08-27 10:01:05,746 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 23 remaining) [2023-08-27 10:01:05,746 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 23 remaining) [2023-08-27 10:01:05,746 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 23 remaining) [2023-08-27 10:01:05,746 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 23 remaining) [2023-08-27 10:01:05,746 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 23 remaining) [2023-08-27 10:01:05,746 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONASSERT (2 of 23 remaining) [2023-08-27 10:01:05,746 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 23 remaining) [2023-08-27 10:01:05,746 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 23 remaining) [2023-08-27 10:01:05,747 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-08-27 10:01:05,747 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 10:01:05,752 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-27 10:01:05,752 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-27 10:01:05,839 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.08 10:01:05 BasicIcfg [2023-08-27 10:01:05,839 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-27 10:01:05,839 INFO L158 Benchmark]: Toolchain (without parser) took 50989.52ms. Allocated memory was 379.6MB in the beginning and 13.2GB in the end (delta: 12.9GB). Free memory was 354.1MB in the beginning and 8.5GB in the end (delta: -8.1GB). Peak memory consumption was 4.7GB. Max. memory is 16.0GB. [2023-08-27 10:01:05,839 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 379.6MB. Free memory is still 356.9MB. There was no memory consumed. Max. memory is 16.0GB. [2023-08-27 10:01:05,840 INFO L158 Benchmark]: CACSL2BoogieTranslator took 524.19ms. Allocated memory is still 379.6MB. Free memory was 354.1MB in the beginning and 329.6MB in the end (delta: 24.5MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. [2023-08-27 10:01:05,840 INFO L158 Benchmark]: Boogie Procedure Inliner took 82.09ms. Allocated memory is still 379.6MB. Free memory was 329.6MB in the beginning and 326.9MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. [2023-08-27 10:01:05,840 INFO L158 Benchmark]: Boogie Preprocessor took 50.41ms. Allocated memory is still 379.6MB. Free memory was 326.9MB in the beginning and 324.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-27 10:01:05,840 INFO L158 Benchmark]: RCFGBuilder took 751.73ms. Allocated memory is still 379.6MB. Free memory was 324.8MB in the beginning and 330.7MB in the end (delta: -5.9MB). Peak memory consumption was 21.0MB. Max. memory is 16.0GB. [2023-08-27 10:01:05,841 INFO L158 Benchmark]: TraceAbstraction took 49575.73ms. Allocated memory was 379.6MB in the beginning and 13.2GB in the end (delta: 12.9GB). Free memory was 329.6MB in the beginning and 8.5GB in the end (delta: -8.2GB). Peak memory consumption was 4.7GB. Max. memory is 16.0GB. [2023-08-27 10:01:05,845 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.17ms. Allocated memory is still 379.6MB. Free memory is still 356.9MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 524.19ms. Allocated memory is still 379.6MB. Free memory was 354.1MB in the beginning and 329.6MB in the end (delta: 24.5MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 82.09ms. Allocated memory is still 379.6MB. Free memory was 329.6MB in the beginning and 326.9MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. * Boogie Preprocessor took 50.41ms. Allocated memory is still 379.6MB. Free memory was 326.9MB in the beginning and 324.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 751.73ms. Allocated memory is still 379.6MB. Free memory was 324.8MB in the beginning and 330.7MB in the end (delta: -5.9MB). Peak memory consumption was 21.0MB. Max. memory is 16.0GB. * TraceAbstraction took 49575.73ms. Allocated memory was 379.6MB in the beginning and 13.2GB in the end (delta: 12.9GB). Free memory was 329.6MB in the beginning and 8.5GB in the end (delta: -8.2GB). Peak memory consumption was 4.7GB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 267]: Unsoundness Warning unspecified type, defaulting to int C: short [267] - GenericResultAtLocation [Line: 267]: Unsoundness Warning unspecified type, defaulting to int C: short [267] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.1s, 147 PlacesBefore, 50 PlacesAfterwards, 137 TransitionsBefore, 38 TransitionsAfterwards, 4172 CoEnabledTransitionPairs, 7 FixpointIterations, 43 TrivialSequentialCompositions, 57 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 14 ConcurrentYvCompositions, 2 ChoiceCompositions, 116 TotalNumberOfCompositions, 14914 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 5534, independent: 5199, independent conditional: 0, independent unconditional: 5199, dependent: 335, dependent conditional: 0, dependent unconditional: 335, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 2336, independent: 2272, independent conditional: 0, independent unconditional: 2272, dependent: 64, dependent conditional: 0, dependent unconditional: 64, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 5534, independent: 2927, independent conditional: 0, independent unconditional: 2927, dependent: 271, dependent conditional: 0, dependent unconditional: 271, unknown: 2336, unknown conditional: 0, unknown unconditional: 2336] , Statistics on independence cache: Total cache size (in pairs): 245, Positive cache size: 220, Positive conditional cache size: 0, Positive unconditional cache size: 220, 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: 17]: assertion can be violated assertion can be violated We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p2_EAX = 0; [L714] 0 int __unbuffered_p2_EBX = 0; [L716] 0 int __unbuffered_p3_EAX = 0; [L718] 0 int __unbuffered_p3_EBX = 0; [L720] 0 int a = 0; [L721] 0 _Bool main$tmp_guard0; [L722] 0 _Bool main$tmp_guard1; [L724] 0 int x = 0; [L726] 0 int y = 0; [L728] 0 int z = 0; [L729] 0 _Bool z$flush_delayed; [L730] 0 int z$mem_tmp; [L731] 0 _Bool z$r_buff0_thd0; [L732] 0 _Bool z$r_buff0_thd1; [L733] 0 _Bool z$r_buff0_thd2; [L734] 0 _Bool z$r_buff0_thd3; [L735] 0 _Bool z$r_buff0_thd4; [L736] 0 _Bool z$r_buff1_thd0; [L737] 0 _Bool z$r_buff1_thd1; [L738] 0 _Bool z$r_buff1_thd2; [L739] 0 _Bool z$r_buff1_thd3; [L740] 0 _Bool z$r_buff1_thd4; [L741] 0 _Bool z$read_delayed; [L742] 0 int *z$read_delayed_var; [L743] 0 int z$w_buff0; [L744] 0 _Bool z$w_buff0_used; [L745] 0 int z$w_buff1; [L746] 0 _Bool z$w_buff1_used; [L747] 0 _Bool weak$$choice0; [L748] 0 _Bool weak$$choice2; [L867] 0 pthread_t t213; [L868] FCALL, FORK 0 pthread_create(&t213, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t213, ((void *)0), P0, ((void *)0))=-2, t213={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L869] 0 pthread_t t214; [L870] FCALL, FORK 0 pthread_create(&t214, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t214, ((void *)0), P1, ((void *)0))=-1, t213={5:0}, t214={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L871] 0 pthread_t t215; [L872] FCALL, FORK 0 pthread_create(&t215, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t215, ((void *)0), P2, ((void *)0))=0, t213={5:0}, t214={6:0}, t215={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L873] 0 pthread_t t216; [L874] FCALL, FORK 0 pthread_create(&t216, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t216, ((void *)0), P3, ((void *)0))=1, t213={5:0}, t214={6:0}, t215={7:0}, t216={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L813] 4 z$w_buff1 = z$w_buff0 [L814] 4 z$w_buff0 = 1 [L815] 4 z$w_buff1_used = z$w_buff0_used [L816] 4 z$w_buff0_used = (_Bool)1 [L817] CALL 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 4 !(!expression) [L817] RET 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L818] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L819] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L820] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L821] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L822] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L823] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L826] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L827] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L828] 4 z$flush_delayed = weak$$choice2 [L829] 4 z$mem_tmp = z [L830] 4 z = !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1) [L831] 4 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff0)) [L832] 4 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff1 : z$w_buff1)) [L833] 4 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used)) [L834] 4 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L835] 4 z$r_buff0_thd4 = weak$$choice2 ? z$r_buff0_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff0_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4)) [L836] 4 z$r_buff1_thd4 = weak$$choice2 ? z$r_buff1_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff1_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L837] 4 __unbuffered_p3_EAX = z [L838] 4 z = z$flush_delayed ? z$mem_tmp : z [L839] 4 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L842] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L752] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L755] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L760] EXPR 1 __unbuffered_cnt + 1 [L760] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L762] 1 return 0; [L767] 2 x = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L770] 2 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L782] 3 y = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L785] 3 __unbuffered_p2_EAX = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L788] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L789] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L790] 3 z$flush_delayed = weak$$choice2 [L791] 3 z$mem_tmp = z [L792] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L793] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L794] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L795] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L796] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L797] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L798] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L799] 3 __unbuffered_p2_EBX = z [L800] 3 z = z$flush_delayed ? z$mem_tmp : z [L801] 3 z$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L775] EXPR 2 __unbuffered_cnt + 1 [L775] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L777] 2 return 0; [L845] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L846] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L847] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L848] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L849] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=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$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L852] EXPR 4 __unbuffered_cnt + 1 [L852] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L854] 4 return 0; [L806] EXPR 3 __unbuffered_cnt + 1 [L806] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L808] 3 return 0; [L876] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L878] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L878] RET 0 assume_abort_if_not(main$tmp_guard0) [L880] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L881] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L882] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L883] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L884] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t213={5:0}, t214={6:0}, t215={7:0}, t216={3:0}, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L887] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 2 && __unbuffered_p2_EBX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L889] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] CALL 0 reach_error() [L17] COND FALSE 0 !(0) [L17] 0 __assert_fail ("0", "mix008.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\read(__PRETTY_FUNCTION__)={50:49}, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] - UnprovableResult [Line: 760]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 760]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 775]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 775]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 806]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 806]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 17]: Unable to prove that assertion always holds Unable to prove that assertion always holds Reason: Not analyzed. - UnprovableResult [Line: 852]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 852]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 870]: 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: 868]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 874]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 872]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 183 locations, 23 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: 49.4s, OverallIterations: 18, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 41.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 814 SdHoareTripleChecker+Valid, 2.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 814 mSDsluCounter, 40 SdHoareTripleChecker+Invalid, 1.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 20 mSDsCounter, 84 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2101 IncrementalHoareTripleChecker+Invalid, 2185 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 84 mSolverCounterUnsat, 20 mSDtfsCounter, 2101 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 77 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1130occurred in iteration=12, InterpolantAutomatonStates: 98, 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.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.2s InterpolantComputationTime, 315 NumberOfCodeBlocks, 315 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 271 ConstructedInterpolants, 0 QuantifiedInterpolants, 1166 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 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:01:05,876 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...