/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/mix036_pso.opt_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-27 10:07:07,533 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-27 10:07:07,604 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:07:07,607 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-27 10:07:07,608 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-27 10:07:07,625 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-27 10:07:07,625 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-27 10:07:07,626 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-27 10:07:07,626 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-27 10:07:07,629 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-27 10:07:07,630 INFO L153 SettingsManager]: * Use SBE=true [2023-08-27 10:07:07,630 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-27 10:07:07,630 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-27 10:07:07,631 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-27 10:07:07,631 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-27 10:07:07,631 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-27 10:07:07,631 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-27 10:07:07,631 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-27 10:07:07,632 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-27 10:07:07,632 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-27 10:07:07,632 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-27 10:07:07,632 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-27 10:07:07,633 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-27 10:07:07,633 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-27 10:07:07,633 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-27 10:07:07,633 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-27 10:07:07,633 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-27 10:07:07,634 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-27 10:07:07,634 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-27 10:07:07,634 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-27 10:07:07,635 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-27 10:07:07,635 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-27 10:07:07,635 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-27 10:07:07,635 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-27 10:07:07,635 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-27 10:07:07,635 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:07:07,896 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-27 10:07:07,913 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-27 10:07:07,915 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-27 10:07:07,916 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-27 10:07:07,916 INFO L274 PluginConnector]: CDTParser initialized [2023-08-27 10:07:07,917 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix036_pso.opt_tso.opt.i [2023-08-27 10:07:08,933 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-27 10:07:09,150 INFO L384 CDTParser]: Found 1 translation units. [2023-08-27 10:07:09,150 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix036_pso.opt_tso.opt.i [2023-08-27 10:07:09,187 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2ae42f7d0/136801afb25740b784cab743e4a7204d/FLAG906248637 [2023-08-27 10:07:09,197 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2ae42f7d0/136801afb25740b784cab743e4a7204d [2023-08-27 10:07:09,201 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-27 10:07:09,202 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-27 10:07:09,203 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-27 10:07:09,203 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-27 10:07:09,207 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-27 10:07:09,209 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 10:07:09" (1/1) ... [2023-08-27 10:07:09,209 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3959c90b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:07:09, skipping insertion in model container [2023-08-27 10:07:09,209 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 10:07:09" (1/1) ... [2023-08-27 10:07:09,255 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-27 10:07:09,547 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-27 10:07:09,566 INFO L201 MainTranslator]: Completed pre-run [2023-08-27 10:07:09,578 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-27 10:07:09,580 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-27 10:07:09,600 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-27 10:07:09,642 WARN L669 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-27 10:07:09,643 WARN L669 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-27 10:07:09,647 INFO L206 MainTranslator]: Completed translation [2023-08-27 10:07:09,648 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:07:09 WrapperNode [2023-08-27 10:07:09,648 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-27 10:07:09,648 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-27 10:07:09,649 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-27 10:07:09,649 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-27 10:07:09,653 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:07:09" (1/1) ... [2023-08-27 10:07:09,663 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:07:09" (1/1) ... [2023-08-27 10:07:09,679 INFO L138 Inliner]: procedures = 177, calls = 72, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 161 [2023-08-27 10:07:09,679 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-27 10:07:09,680 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-27 10:07:09,680 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-27 10:07:09,680 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-27 10:07:09,686 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:07:09" (1/1) ... [2023-08-27 10:07:09,686 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:07:09" (1/1) ... [2023-08-27 10:07:09,689 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:07:09" (1/1) ... [2023-08-27 10:07:09,689 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:07:09" (1/1) ... [2023-08-27 10:07:09,695 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:07:09" (1/1) ... [2023-08-27 10:07:09,697 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:07:09" (1/1) ... [2023-08-27 10:07:09,698 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:07:09" (1/1) ... [2023-08-27 10:07:09,699 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:07:09" (1/1) ... [2023-08-27 10:07:09,702 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-27 10:07:09,702 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-27 10:07:09,702 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-27 10:07:09,702 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-27 10:07:09,703 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:07:09" (1/1) ... [2023-08-27 10:07:09,707 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-27 10:07:09,716 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 10:07:09,739 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:07:09,752 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:07:09,775 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-27 10:07:09,776 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-27 10:07:09,776 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-27 10:07:09,776 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-27 10:07:09,776 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-27 10:07:09,777 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-27 10:07:09,777 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-27 10:07:09,777 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-27 10:07:09,777 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-27 10:07:09,777 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-27 10:07:09,777 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-27 10:07:09,777 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-08-27 10:07:09,777 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-08-27 10:07:09,777 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-27 10:07:09,778 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-27 10:07:09,779 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-27 10:07:09,779 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-27 10:07:09,780 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:07:09,918 INFO L236 CfgBuilder]: Building ICFG [2023-08-27 10:07:09,919 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-27 10:07:10,136 INFO L277 CfgBuilder]: Performing block encoding [2023-08-27 10:07:10,215 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-27 10:07:10,215 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-27 10:07:10,216 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 10:07:10 BoogieIcfgContainer [2023-08-27 10:07:10,217 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-27 10:07:10,218 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-27 10:07:10,218 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-27 10:07:10,220 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-27 10:07:10,220 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.08 10:07:09" (1/3) ... [2023-08-27 10:07:10,220 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@243f9346 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.08 10:07:10, skipping insertion in model container [2023-08-27 10:07:10,220 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:07:09" (2/3) ... [2023-08-27 10:07:10,221 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@243f9346 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.08 10:07:10, skipping insertion in model container [2023-08-27 10:07:10,221 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 10:07:10" (3/3) ... [2023-08-27 10:07:10,221 INFO L112 eAbstractionObserver]: Analyzing ICFG mix036_pso.opt_tso.opt.i [2023-08-27 10:07:10,232 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-27 10:07:10,233 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 10 error locations. [2023-08-27 10:07:10,233 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-27 10:07:10,277 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-27 10:07:10,307 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 153 places, 143 transitions, 306 flow [2023-08-27 10:07:10,364 INFO L124 PetriNetUnfolderBase]: 3/139 cut-off events. [2023-08-27 10:07:10,364 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-27 10:07:10,369 INFO L83 FinitePrefix]: Finished finitePrefix Result has 152 conditions, 139 events. 3/139 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 106 event pairs, 0 based on Foata normal form. 0/126 useless extension candidates. Maximal degree in co-relation 98. Up to 2 conditions per place. [2023-08-27 10:07:10,369 INFO L82 GeneralOperation]: Start removeDead. Operand has 153 places, 143 transitions, 306 flow [2023-08-27 10:07:10,375 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 149 places, 139 transitions, 290 flow [2023-08-27 10:07:10,377 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-27 10:07:10,387 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 149 places, 139 transitions, 290 flow [2023-08-27 10:07:10,389 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 149 places, 139 transitions, 290 flow [2023-08-27 10:07:10,389 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 149 places, 139 transitions, 290 flow [2023-08-27 10:07:10,432 INFO L124 PetriNetUnfolderBase]: 3/139 cut-off events. [2023-08-27 10:07:10,433 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-27 10:07:10,434 INFO L83 FinitePrefix]: Finished finitePrefix Result has 152 conditions, 139 events. 3/139 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 107 event pairs, 0 based on Foata normal form. 0/126 useless extension candidates. Maximal degree in co-relation 98. Up to 2 conditions per place. [2023-08-27 10:07:10,436 INFO L119 LiptonReduction]: Number of co-enabled transitions 4152 [2023-08-27 10:07:13,653 INFO L134 LiptonReduction]: Checked pairs total: 14328 [2023-08-27 10:07:13,654 INFO L136 LiptonReduction]: Total number of compositions: 123 [2023-08-27 10:07:13,663 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-27 10:07:13,667 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;@9dcce9e, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-27 10:07:13,667 INFO L358 AbstractCegarLoop]: Starting to check reachability of 23 error locations. [2023-08-27 10:07:13,670 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-27 10:07:13,670 INFO L124 PetriNetUnfolderBase]: 0/6 cut-off events. [2023-08-27 10:07:13,670 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-27 10:07:13,670 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:07:13,670 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-27 10:07:13,670 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:07:13,693 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:07:13,693 INFO L85 PathProgramCache]: Analyzing trace with hash 582199734, now seen corresponding path program 1 times [2023-08-27 10:07:13,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:07:13,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041665683] [2023-08-27 10:07:13,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:07:13,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:07:13,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:07:13,861 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:07:13,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:07:13,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041665683] [2023-08-27 10:07:13,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2041665683] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:07:13,862 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:07:13,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-27 10:07:13,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270198527] [2023-08-27 10:07:13,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:07:13,867 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-27 10:07:13,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:07:13,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-27 10:07:13,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-27 10:07:13,909 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 266 [2023-08-27 10:07:13,910 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 36 transitions, 84 flow. Second operand has 3 states, 3 states have (on average 117.33333333333333) internal successors, (352), 3 states have internal predecessors, (352), 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:07:13,910 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:07:13,910 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 266 [2023-08-27 10:07:13,911 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:07:14,978 INFO L124 PetriNetUnfolderBase]: 9509/13235 cut-off events. [2023-08-27 10:07:14,979 INFO L125 PetriNetUnfolderBase]: For 86/86 co-relation queries the response was YES. [2023-08-27 10:07:14,996 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26645 conditions, 13235 events. 9509/13235 cut-off events. For 86/86 co-relation queries the response was YES. Maximal size of possible extension queue 761. Compared 76514 event pairs, 2559 based on Foata normal form. 0/8406 useless extension candidates. Maximal degree in co-relation 26633. Up to 12139 conditions per place. [2023-08-27 10:07:15,051 INFO L140 encePairwiseOnDemand]: 252/266 looper letters, 49 selfloop transitions, 5 changer transitions 0/57 dead transitions. [2023-08-27 10:07:15,052 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 57 transitions, 243 flow [2023-08-27 10:07:15,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-27 10:07:15,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-27 10:07:15,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 412 transitions. [2023-08-27 10:07:15,065 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5162907268170426 [2023-08-27 10:07:15,066 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 412 transitions. [2023-08-27 10:07:15,066 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 412 transitions. [2023-08-27 10:07:15,069 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:07:15,070 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 412 transitions. [2023-08-27 10:07:15,074 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 137.33333333333334) internal successors, (412), 3 states have internal predecessors, (412), 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:07:15,077 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 266.0) internal successors, (1064), 4 states have internal predecessors, (1064), 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:07:15,078 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 266.0) internal successors, (1064), 4 states have internal predecessors, (1064), 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:07:15,079 INFO L175 Difference]: Start difference. First operand has 48 places, 36 transitions, 84 flow. Second operand 3 states and 412 transitions. [2023-08-27 10:07:15,080 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 57 transitions, 243 flow [2023-08-27 10:07:15,084 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 57 transitions, 236 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-27 10:07:15,085 INFO L231 Difference]: Finished difference. Result has 47 places, 39 transitions, 125 flow [2023-08-27 10:07:15,086 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=125, PETRI_PLACES=47, PETRI_TRANSITIONS=39} [2023-08-27 10:07:15,090 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, -1 predicate places. [2023-08-27 10:07:15,090 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 39 transitions, 125 flow [2023-08-27 10:07:15,091 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 117.33333333333333) internal successors, (352), 3 states have internal predecessors, (352), 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:07:15,091 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:07:15,091 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 10:07:15,091 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-27 10:07:15,091 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:07:15,098 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:07:15,098 INFO L85 PathProgramCache]: Analyzing trace with hash -289368066, now seen corresponding path program 1 times [2023-08-27 10:07:15,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:07:15,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133115952] [2023-08-27 10:07:15,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:07:15,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:07:15,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:07:15,302 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 10:07:15,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:07:15,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133115952] [2023-08-27 10:07:15,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1133115952] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:07:15,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:07:15,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-27 10:07:15,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275035381] [2023-08-27 10:07:15,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:07:15,303 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-27 10:07:15,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:07:15,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-27 10:07:15,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-27 10:07:15,304 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 266 [2023-08-27 10:07:15,305 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 39 transitions, 125 flow. Second operand has 3 states, 3 states have (on average 124.0) internal successors, (372), 3 states have internal predecessors, (372), 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:07:15,305 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:07:15,305 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 266 [2023-08-27 10:07:15,305 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:07:15,886 INFO L124 PetriNetUnfolderBase]: 6528/9778 cut-off events. [2023-08-27 10:07:15,887 INFO L125 PetriNetUnfolderBase]: For 1218/1690 co-relation queries the response was YES. [2023-08-27 10:07:15,896 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23733 conditions, 9778 events. 6528/9778 cut-off events. For 1218/1690 co-relation queries the response was YES. Maximal size of possible extension queue 763. Compared 65651 event pairs, 1504 based on Foata normal form. 0/7251 useless extension candidates. Maximal degree in co-relation 23722. Up to 6998 conditions per place. [2023-08-27 10:07:15,926 INFO L140 encePairwiseOnDemand]: 263/266 looper letters, 46 selfloop transitions, 2 changer transitions 0/55 dead transitions. [2023-08-27 10:07:15,926 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 55 transitions, 274 flow [2023-08-27 10:07:15,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-27 10:07:15,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-27 10:07:15,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 405 transitions. [2023-08-27 10:07:15,927 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5075187969924813 [2023-08-27 10:07:15,927 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 405 transitions. [2023-08-27 10:07:15,928 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 405 transitions. [2023-08-27 10:07:15,928 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:07:15,928 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 405 transitions. [2023-08-27 10:07:15,929 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:07:15,930 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 266.0) internal successors, (1064), 4 states have internal predecessors, (1064), 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:07:15,930 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 266.0) internal successors, (1064), 4 states have internal predecessors, (1064), 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:07:15,930 INFO L175 Difference]: Start difference. First operand has 47 places, 39 transitions, 125 flow. Second operand 3 states and 405 transitions. [2023-08-27 10:07:15,930 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 55 transitions, 274 flow [2023-08-27 10:07:15,931 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 55 transitions, 266 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-27 10:07:15,932 INFO L231 Difference]: Finished difference. Result has 47 places, 38 transitions, 122 flow [2023-08-27 10:07:15,932 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=122, PETRI_PLACES=47, PETRI_TRANSITIONS=38} [2023-08-27 10:07:15,933 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, -1 predicate places. [2023-08-27 10:07:15,933 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 38 transitions, 122 flow [2023-08-27 10:07:15,933 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 124.0) internal successors, (372), 3 states have internal predecessors, (372), 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:07:15,933 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:07:15,933 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 10:07:15,933 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-27 10:07:15,934 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:07:15,934 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:07:15,934 INFO L85 PathProgramCache]: Analyzing trace with hash -2873728, now seen corresponding path program 1 times [2023-08-27 10:07:15,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:07:15,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503881164] [2023-08-27 10:07:15,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:07:15,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:07:15,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:07:15,984 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:07:15,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:07:15,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503881164] [2023-08-27 10:07:15,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [503881164] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:07:15,985 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:07:15,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-27 10:07:15,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403589802] [2023-08-27 10:07:15,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:07:15,985 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-27 10:07:15,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:07:15,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-27 10:07:15,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-27 10:07:15,986 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 266 [2023-08-27 10:07:15,987 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 38 transitions, 122 flow. Second operand has 4 states, 4 states have (on average 118.0) internal successors, (472), 4 states have internal predecessors, (472), 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:07:15,987 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:07:15,987 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 266 [2023-08-27 10:07:15,987 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:07:16,434 INFO L124 PetriNetUnfolderBase]: 4789/6711 cut-off events. [2023-08-27 10:07:16,435 INFO L125 PetriNetUnfolderBase]: For 646/646 co-relation queries the response was YES. [2023-08-27 10:07:16,440 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16481 conditions, 6711 events. 4789/6711 cut-off events. For 646/646 co-relation queries the response was YES. Maximal size of possible extension queue 366. Compared 34728 event pairs, 1132 based on Foata normal form. 0/5211 useless extension candidates. Maximal degree in co-relation 16469. Up to 5810 conditions per place. [2023-08-27 10:07:16,458 INFO L140 encePairwiseOnDemand]: 257/266 looper letters, 43 selfloop transitions, 5 changer transitions 0/51 dead transitions. [2023-08-27 10:07:16,458 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 51 transitions, 244 flow [2023-08-27 10:07:16,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-27 10:07:16,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-27 10:07:16,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 516 transitions. [2023-08-27 10:07:16,460 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4849624060150376 [2023-08-27 10:07:16,460 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 516 transitions. [2023-08-27 10:07:16,460 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 516 transitions. [2023-08-27 10:07:16,460 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:07:16,460 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 516 transitions. [2023-08-27 10:07:16,461 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 129.0) internal successors, (516), 4 states have internal predecessors, (516), 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:07:16,462 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 266.0) internal successors, (1330), 5 states have internal predecessors, (1330), 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:07:16,463 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 266.0) internal successors, (1330), 5 states have internal predecessors, (1330), 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:07:16,463 INFO L175 Difference]: Start difference. First operand has 47 places, 38 transitions, 122 flow. Second operand 4 states and 516 transitions. [2023-08-27 10:07:16,463 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 51 transitions, 244 flow [2023-08-27 10:07:16,465 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 51 transitions, 238 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-27 10:07:16,466 INFO L231 Difference]: Finished difference. Result has 44 places, 34 transitions, 112 flow [2023-08-27 10:07:16,466 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=112, PETRI_PLACES=44, PETRI_TRANSITIONS=34} [2023-08-27 10:07:16,467 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, -4 predicate places. [2023-08-27 10:07:16,467 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 34 transitions, 112 flow [2023-08-27 10:07:16,468 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 118.0) internal successors, (472), 4 states have internal predecessors, (472), 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:07:16,468 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:07:16,468 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 10:07:16,468 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-27 10:07:16,471 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:07:16,471 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:07:16,471 INFO L85 PathProgramCache]: Analyzing trace with hash 876787233, now seen corresponding path program 1 times [2023-08-27 10:07:16,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:07:16,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820459672] [2023-08-27 10:07:16,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:07:16,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:07:16,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:07:16,534 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:07:16,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:07:16,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820459672] [2023-08-27 10:07:16,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1820459672] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:07:16,536 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:07:16,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-27 10:07:16,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597683444] [2023-08-27 10:07:16,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:07:16,536 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-27 10:07:16,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:07:16,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-27 10:07:16,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-27 10:07:16,538 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 266 [2023-08-27 10:07:16,538 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 34 transitions, 112 flow. Second operand has 4 states, 4 states have (on average 118.0) internal successors, (472), 4 states have internal predecessors, (472), 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:07:16,539 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:07:16,539 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 266 [2023-08-27 10:07:16,539 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:07:16,890 INFO L124 PetriNetUnfolderBase]: 2967/4214 cut-off events. [2023-08-27 10:07:16,890 INFO L125 PetriNetUnfolderBase]: For 1202/1202 co-relation queries the response was YES. [2023-08-27 10:07:16,894 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10327 conditions, 4214 events. 2967/4214 cut-off events. For 1202/1202 co-relation queries the response was YES. Maximal size of possible extension queue 208. Compared 20098 event pairs, 638 based on Foata normal form. 0/3725 useless extension candidates. Maximal degree in co-relation 10315. Up to 1818 conditions per place. [2023-08-27 10:07:16,903 INFO L140 encePairwiseOnDemand]: 257/266 looper letters, 58 selfloop transitions, 9 changer transitions 0/70 dead transitions. [2023-08-27 10:07:16,904 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 70 transitions, 336 flow [2023-08-27 10:07:16,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-27 10:07:16,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-27 10:07:16,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 535 transitions. [2023-08-27 10:07:16,905 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5028195488721805 [2023-08-27 10:07:16,906 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 535 transitions. [2023-08-27 10:07:16,906 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 535 transitions. [2023-08-27 10:07:16,906 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:07:16,906 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 535 transitions. [2023-08-27 10:07:16,907 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 133.75) internal successors, (535), 4 states have internal predecessors, (535), 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:07:16,908 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 266.0) internal successors, (1330), 5 states have internal predecessors, (1330), 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:07:16,909 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 266.0) internal successors, (1330), 5 states have internal predecessors, (1330), 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:07:16,909 INFO L175 Difference]: Start difference. First operand has 44 places, 34 transitions, 112 flow. Second operand 4 states and 535 transitions. [2023-08-27 10:07:16,909 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 70 transitions, 336 flow [2023-08-27 10:07:16,911 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 70 transitions, 330 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-27 10:07:16,912 INFO L231 Difference]: Finished difference. Result has 46 places, 38 transitions, 164 flow [2023-08-27 10:07:16,912 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=164, PETRI_PLACES=46, PETRI_TRANSITIONS=38} [2023-08-27 10:07:16,913 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, -2 predicate places. [2023-08-27 10:07:16,913 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 38 transitions, 164 flow [2023-08-27 10:07:16,914 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 118.0) internal successors, (472), 4 states have internal predecessors, (472), 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:07:16,914 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:07:16,914 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 10:07:16,914 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-27 10:07:16,914 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:07:16,914 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:07:16,914 INFO L85 PathProgramCache]: Analyzing trace with hash 1090238430, now seen corresponding path program 1 times [2023-08-27 10:07:16,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:07:16,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162411547] [2023-08-27 10:07:16,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:07:16,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:07:16,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:07:17,040 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:07:17,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:07:17,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162411547] [2023-08-27 10:07:17,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1162411547] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:07:17,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:07:17,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-27 10:07:17,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507621661] [2023-08-27 10:07:17,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:07:17,041 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-27 10:07:17,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:07:17,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-27 10:07:17,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-27 10:07:17,042 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 266 [2023-08-27 10:07:17,042 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 38 transitions, 164 flow. Second operand has 3 states, 3 states have (on average 122.66666666666667) internal successors, (368), 3 states have internal predecessors, (368), 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:07:17,043 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:07:17,043 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 266 [2023-08-27 10:07:17,043 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:07:17,394 INFO L124 PetriNetUnfolderBase]: 2733/4036 cut-off events. [2023-08-27 10:07:17,395 INFO L125 PetriNetUnfolderBase]: For 3271/3271 co-relation queries the response was YES. [2023-08-27 10:07:17,400 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11502 conditions, 4036 events. 2733/4036 cut-off events. For 3271/3271 co-relation queries the response was YES. Maximal size of possible extension queue 200. Compared 21041 event pairs, 916 based on Foata normal form. 0/3642 useless extension candidates. Maximal degree in co-relation 11489. Up to 2572 conditions per place. [2023-08-27 10:07:17,412 INFO L140 encePairwiseOnDemand]: 263/266 looper letters, 52 selfloop transitions, 2 changer transitions 0/57 dead transitions. [2023-08-27 10:07:17,413 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 57 transitions, 367 flow [2023-08-27 10:07:17,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-27 10:07:17,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-27 10:07:17,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 398 transitions. [2023-08-27 10:07:17,414 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49874686716791977 [2023-08-27 10:07:17,415 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 398 transitions. [2023-08-27 10:07:17,415 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 398 transitions. [2023-08-27 10:07:17,415 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:07:17,415 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 398 transitions. [2023-08-27 10:07:17,416 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:07:17,417 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 266.0) internal successors, (1064), 4 states have internal predecessors, (1064), 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:07:17,418 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 266.0) internal successors, (1064), 4 states have internal predecessors, (1064), 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:07:17,418 INFO L175 Difference]: Start difference. First operand has 46 places, 38 transitions, 164 flow. Second operand 3 states and 398 transitions. [2023-08-27 10:07:17,418 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 57 transitions, 367 flow [2023-08-27 10:07:17,421 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 57 transitions, 337 flow, removed 7 selfloop flow, removed 2 redundant places. [2023-08-27 10:07:17,421 INFO L231 Difference]: Finished difference. Result has 47 places, 38 transitions, 154 flow [2023-08-27 10:07:17,422 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=146, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=154, PETRI_PLACES=47, PETRI_TRANSITIONS=38} [2023-08-27 10:07:17,423 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, -1 predicate places. [2023-08-27 10:07:17,423 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 38 transitions, 154 flow [2023-08-27 10:07:17,423 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 122.66666666666667) internal successors, (368), 3 states have internal predecessors, (368), 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:07:17,424 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:07:17,424 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 10:07:17,424 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-27 10:07:17,424 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:07:17,424 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:07:17,424 INFO L85 PathProgramCache]: Analyzing trace with hash -307662112, now seen corresponding path program 1 times [2023-08-27 10:07:17,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:07:17,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696104242] [2023-08-27 10:07:17,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:07:17,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:07:17,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:07:17,573 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:07:17,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:07:17,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696104242] [2023-08-27 10:07:17,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [696104242] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:07:17,573 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:07:17,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-27 10:07:17,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498986498] [2023-08-27 10:07:17,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:07:17,574 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-27 10:07:17,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:07:17,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-27 10:07:17,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-27 10:07:17,578 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 266 [2023-08-27 10:07:17,579 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 38 transitions, 154 flow. Second operand has 4 states, 4 states have (on average 115.25) internal successors, (461), 4 states have internal predecessors, (461), 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:07:17,579 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:07:17,579 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 266 [2023-08-27 10:07:17,579 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:07:17,858 INFO L124 PetriNetUnfolderBase]: 2487/3699 cut-off events. [2023-08-27 10:07:17,859 INFO L125 PetriNetUnfolderBase]: For 1475/1475 co-relation queries the response was YES. [2023-08-27 10:07:17,862 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10222 conditions, 3699 events. 2487/3699 cut-off events. For 1475/1475 co-relation queries the response was YES. Maximal size of possible extension queue 197. Compared 19150 event pairs, 559 based on Foata normal form. 223/3625 useless extension candidates. Maximal degree in co-relation 10208. Up to 2830 conditions per place. [2023-08-27 10:07:17,871 INFO L140 encePairwiseOnDemand]: 259/266 looper letters, 69 selfloop transitions, 10 changer transitions 0/82 dead transitions. [2023-08-27 10:07:17,871 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 82 transitions, 475 flow [2023-08-27 10:07:17,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-27 10:07:17,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-27 10:07:17,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 633 transitions. [2023-08-27 10:07:17,873 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47593984962406016 [2023-08-27 10:07:17,873 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 633 transitions. [2023-08-27 10:07:17,873 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 633 transitions. [2023-08-27 10:07:17,873 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:07:17,873 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 633 transitions. [2023-08-27 10:07:17,874 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 126.6) internal successors, (633), 5 states have internal predecessors, (633), 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:07:17,876 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 266.0) internal successors, (1596), 6 states have internal predecessors, (1596), 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:07:17,877 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 266.0) internal successors, (1596), 6 states have internal predecessors, (1596), 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:07:17,877 INFO L175 Difference]: Start difference. First operand has 47 places, 38 transitions, 154 flow. Second operand 5 states and 633 transitions. [2023-08-27 10:07:17,877 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 82 transitions, 475 flow [2023-08-27 10:07:17,878 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 82 transitions, 465 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-27 10:07:17,879 INFO L231 Difference]: Finished difference. Result has 52 places, 43 transitions, 221 flow [2023-08-27 10:07:17,879 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=150, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=221, PETRI_PLACES=52, PETRI_TRANSITIONS=43} [2023-08-27 10:07:17,880 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, 4 predicate places. [2023-08-27 10:07:17,880 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 43 transitions, 221 flow [2023-08-27 10:07:17,880 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 115.25) internal successors, (461), 4 states have internal predecessors, (461), 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:07:17,880 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:07:17,880 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 10:07:17,880 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-27 10:07:17,880 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting P2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-27 10:07:17,880 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:07:17,881 INFO L85 PathProgramCache]: Analyzing trace with hash 452830852, now seen corresponding path program 1 times [2023-08-27 10:07:17,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:07:17,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969337474] [2023-08-27 10:07:17,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:07:17,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:07:17,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:07:17,921 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:07:17,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:07:17,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969337474] [2023-08-27 10:07:17,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [969337474] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:07:17,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:07:17,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-27 10:07:17,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552130514] [2023-08-27 10:07:17,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:07:17,922 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-27 10:07:17,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:07:17,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-27 10:07:17,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-27 10:07:17,923 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 266 [2023-08-27 10:07:17,923 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 43 transitions, 221 flow. Second operand has 5 states, 5 states have (on average 118.6) internal successors, (593), 5 states have internal predecessors, (593), 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:07:17,924 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:07:17,924 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 266 [2023-08-27 10:07:17,924 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:07:18,183 INFO L124 PetriNetUnfolderBase]: 2103/3093 cut-off events. [2023-08-27 10:07:18,183 INFO L125 PetriNetUnfolderBase]: For 2234/2234 co-relation queries the response was YES. [2023-08-27 10:07:18,187 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8996 conditions, 3093 events. 2103/3093 cut-off events. For 2234/2234 co-relation queries the response was YES. Maximal size of possible extension queue 177. Compared 15179 event pairs, 235 based on Foata normal form. 0/3066 useless extension candidates. Maximal degree in co-relation 8979. Up to 1320 conditions per place. [2023-08-27 10:07:18,195 INFO L140 encePairwiseOnDemand]: 257/266 looper letters, 68 selfloop transitions, 17 changer transitions 0/88 dead transitions. [2023-08-27 10:07:18,195 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 88 transitions, 528 flow [2023-08-27 10:07:18,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-27 10:07:18,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-27 10:07:18,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 665 transitions. [2023-08-27 10:07:18,197 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5 [2023-08-27 10:07:18,197 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 665 transitions. [2023-08-27 10:07:18,197 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 665 transitions. [2023-08-27 10:07:18,197 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:07:18,197 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 665 transitions. [2023-08-27 10:07:18,198 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 133.0) internal successors, (665), 5 states have internal predecessors, (665), 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:07:18,200 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 266.0) internal successors, (1596), 6 states have internal predecessors, (1596), 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:07:18,200 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 266.0) internal successors, (1596), 6 states have internal predecessors, (1596), 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:07:18,200 INFO L175 Difference]: Start difference. First operand has 52 places, 43 transitions, 221 flow. Second operand 5 states and 665 transitions. [2023-08-27 10:07:18,200 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 88 transitions, 528 flow [2023-08-27 10:07:18,204 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 88 transitions, 514 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-27 10:07:18,205 INFO L231 Difference]: Finished difference. Result has 55 places, 47 transitions, 289 flow [2023-08-27 10:07:18,205 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=207, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=289, PETRI_PLACES=55, PETRI_TRANSITIONS=47} [2023-08-27 10:07:18,205 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, 7 predicate places. [2023-08-27 10:07:18,205 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 47 transitions, 289 flow [2023-08-27 10:07:18,205 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 118.6) internal successors, (593), 5 states have internal predecessors, (593), 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:07:18,206 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:07:18,206 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:07:18,206 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-27 10:07:18,206 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-27 10:07:18,206 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:07:18,206 INFO L85 PathProgramCache]: Analyzing trace with hash 1311386264, now seen corresponding path program 1 times [2023-08-27 10:07:18,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:07:18,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448619917] [2023-08-27 10:07:18,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:07:18,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:07:18,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:07:18,298 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:07:18,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:07:18,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448619917] [2023-08-27 10:07:18,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [448619917] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:07:18,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:07:18,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-27 10:07:18,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250417759] [2023-08-27 10:07:18,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:07:18,299 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-27 10:07:18,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:07:18,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-27 10:07:18,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-27 10:07:18,299 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 266 [2023-08-27 10:07:18,300 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 47 transitions, 289 flow. Second operand has 5 states, 5 states have (on average 115.0) internal successors, (575), 5 states have internal predecessors, (575), 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:07:18,300 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:07:18,300 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 266 [2023-08-27 10:07:18,300 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:07:18,546 INFO L124 PetriNetUnfolderBase]: 1558/2400 cut-off events. [2023-08-27 10:07:18,546 INFO L125 PetriNetUnfolderBase]: For 3275/3275 co-relation queries the response was YES. [2023-08-27 10:07:18,549 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8139 conditions, 2400 events. 1558/2400 cut-off events. For 3275/3275 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 11897 event pairs, 181 based on Foata normal form. 136/2505 useless extension candidates. Maximal degree in co-relation 8121. Up to 862 conditions per place. [2023-08-27 10:07:18,555 INFO L140 encePairwiseOnDemand]: 259/266 looper letters, 83 selfloop transitions, 19 changer transitions 4/109 dead transitions. [2023-08-27 10:07:18,555 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 109 transitions, 738 flow [2023-08-27 10:07:18,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-27 10:07:18,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-27 10:07:18,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 884 transitions. [2023-08-27 10:07:18,557 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4747583243823845 [2023-08-27 10:07:18,557 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 884 transitions. [2023-08-27 10:07:18,557 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 884 transitions. [2023-08-27 10:07:18,557 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:07:18,557 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 884 transitions. [2023-08-27 10:07:18,559 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 126.28571428571429) internal successors, (884), 7 states have internal predecessors, (884), 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:07:18,560 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 266.0) internal successors, (2128), 8 states have internal predecessors, (2128), 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:07:18,561 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 266.0) internal successors, (2128), 8 states have internal predecessors, (2128), 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:07:18,561 INFO L175 Difference]: Start difference. First operand has 55 places, 47 transitions, 289 flow. Second operand 7 states and 884 transitions. [2023-08-27 10:07:18,561 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 109 transitions, 738 flow [2023-08-27 10:07:18,575 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 109 transitions, 672 flow, removed 16 selfloop flow, removed 3 redundant places. [2023-08-27 10:07:18,576 INFO L231 Difference]: Finished difference. Result has 61 places, 52 transitions, 341 flow [2023-08-27 10:07:18,576 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=247, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=341, PETRI_PLACES=61, PETRI_TRANSITIONS=52} [2023-08-27 10:07:18,576 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, 13 predicate places. [2023-08-27 10:07:18,576 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 52 transitions, 341 flow [2023-08-27 10:07:18,577 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 115.0) internal successors, (575), 5 states have internal predecessors, (575), 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:07:18,577 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:07:18,577 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:07:18,577 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-27 10:07:18,577 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:07:18,577 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:07:18,577 INFO L85 PathProgramCache]: Analyzing trace with hash 1802727874, now seen corresponding path program 1 times [2023-08-27 10:07:18,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:07:18,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497402351] [2023-08-27 10:07:18,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:07:18,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:07:18,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:07:18,709 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:07:18,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:07:18,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497402351] [2023-08-27 10:07:18,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1497402351] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:07:18,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:07:18,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-27 10:07:18,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454272387] [2023-08-27 10:07:18,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:07:18,710 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-27 10:07:18,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:07:18,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-27 10:07:18,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-27 10:07:18,710 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 266 [2023-08-27 10:07:18,711 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 52 transitions, 341 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:07:18,711 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:07:18,711 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 266 [2023-08-27 10:07:18,711 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:07:19,161 INFO L124 PetriNetUnfolderBase]: 4409/6624 cut-off events. [2023-08-27 10:07:19,161 INFO L125 PetriNetUnfolderBase]: For 13055/13055 co-relation queries the response was YES. [2023-08-27 10:07:19,172 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22661 conditions, 6624 events. 4409/6624 cut-off events. For 13055/13055 co-relation queries the response was YES. Maximal size of possible extension queue 245. Compared 35724 event pairs, 437 based on Foata normal form. 43/6611 useless extension candidates. Maximal degree in co-relation 22640. Up to 4008 conditions per place. [2023-08-27 10:07:19,190 INFO L140 encePairwiseOnDemand]: 257/266 looper letters, 136 selfloop transitions, 14 changer transitions 0/150 dead transitions. [2023-08-27 10:07:19,190 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 150 transitions, 1223 flow [2023-08-27 10:07:19,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-27 10:07:19,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-27 10:07:19,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 643 transitions. [2023-08-27 10:07:19,191 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48345864661654137 [2023-08-27 10:07:19,192 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 643 transitions. [2023-08-27 10:07:19,192 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 643 transitions. [2023-08-27 10:07:19,192 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:07:19,192 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 643 transitions. [2023-08-27 10:07:19,193 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 128.6) internal successors, (643), 5 states have internal predecessors, (643), 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:07:19,194 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 266.0) internal successors, (1596), 6 states have internal predecessors, (1596), 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:07:19,194 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 266.0) internal successors, (1596), 6 states have internal predecessors, (1596), 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:07:19,195 INFO L175 Difference]: Start difference. First operand has 61 places, 52 transitions, 341 flow. Second operand 5 states and 643 transitions. [2023-08-27 10:07:19,195 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 150 transitions, 1223 flow [2023-08-27 10:07:19,358 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 150 transitions, 1130 flow, removed 3 selfloop flow, removed 4 redundant places. [2023-08-27 10:07:19,360 INFO L231 Difference]: Finished difference. Result has 64 places, 64 transitions, 404 flow [2023-08-27 10:07:19,360 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=307, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=404, PETRI_PLACES=64, PETRI_TRANSITIONS=64} [2023-08-27 10:07:19,360 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, 16 predicate places. [2023-08-27 10:07:19,360 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 64 transitions, 404 flow [2023-08-27 10:07:19,361 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:07:19,361 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:07:19,361 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:07:19,361 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-27 10:07:19,361 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:07:19,361 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:07:19,361 INFO L85 PathProgramCache]: Analyzing trace with hash -1959629486, now seen corresponding path program 2 times [2023-08-27 10:07:19,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:07:19,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116930698] [2023-08-27 10:07:19,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:07:19,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:07:19,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:07:19,456 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:07:19,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:07:19,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116930698] [2023-08-27 10:07:19,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [116930698] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:07:19,456 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:07:19,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-27 10:07:19,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155694248] [2023-08-27 10:07:19,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:07:19,457 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-27 10:07:19,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:07:19,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-27 10:07:19,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-27 10:07:19,457 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 266 [2023-08-27 10:07:19,458 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 64 transitions, 404 flow. Second operand has 6 states, 6 states have (on average 114.83333333333333) internal successors, (689), 6 states have internal predecessors, (689), 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:07:19,458 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:07:19,458 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 266 [2023-08-27 10:07:19,458 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:07:19,860 INFO L124 PetriNetUnfolderBase]: 2722/4305 cut-off events. [2023-08-27 10:07:19,861 INFO L125 PetriNetUnfolderBase]: For 9030/9286 co-relation queries the response was YES. [2023-08-27 10:07:19,869 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16773 conditions, 4305 events. 2722/4305 cut-off events. For 9030/9286 co-relation queries the response was YES. Maximal size of possible extension queue 287. Compared 25194 event pairs, 217 based on Foata normal form. 269/4392 useless extension candidates. Maximal degree in co-relation 16749. Up to 920 conditions per place. [2023-08-27 10:07:19,883 INFO L140 encePairwiseOnDemand]: 259/266 looper letters, 116 selfloop transitions, 28 changer transitions 4/155 dead transitions. [2023-08-27 10:07:19,883 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 155 transitions, 1113 flow [2023-08-27 10:07:19,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-27 10:07:19,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-27 10:07:19,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1133 transitions. [2023-08-27 10:07:19,885 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47326649958228906 [2023-08-27 10:07:19,885 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1133 transitions. [2023-08-27 10:07:19,885 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1133 transitions. [2023-08-27 10:07:19,886 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:07:19,886 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1133 transitions. [2023-08-27 10:07:19,887 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 125.88888888888889) internal successors, (1133), 9 states have internal predecessors, (1133), 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:07:19,890 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 266.0) internal successors, (2660), 10 states have internal predecessors, (2660), 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:07:19,890 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 266.0) internal successors, (2660), 10 states have internal predecessors, (2660), 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:07:19,890 INFO L175 Difference]: Start difference. First operand has 64 places, 64 transitions, 404 flow. Second operand 9 states and 1133 transitions. [2023-08-27 10:07:19,890 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 155 transitions, 1113 flow [2023-08-27 10:07:20,026 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 155 transitions, 1113 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-27 10:07:20,027 INFO L231 Difference]: Finished difference. Result has 75 places, 68 transitions, 505 flow [2023-08-27 10:07:20,028 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=505, PETRI_PLACES=75, PETRI_TRANSITIONS=68} [2023-08-27 10:07:20,028 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, 27 predicate places. [2023-08-27 10:07:20,028 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 68 transitions, 505 flow [2023-08-27 10:07:20,028 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 114.83333333333333) internal successors, (689), 6 states have internal predecessors, (689), 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:07:20,029 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:07:20,029 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] [2023-08-27 10:07:20,029 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-27 10:07:20,029 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting P3Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-27 10:07:20,029 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:07:20,029 INFO L85 PathProgramCache]: Analyzing trace with hash -2025757459, now seen corresponding path program 1 times [2023-08-27 10:07:20,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:07:20,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037151228] [2023-08-27 10:07:20,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:07:20,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:07:20,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:07:20,087 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:07:20,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:07:20,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037151228] [2023-08-27 10:07:20,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1037151228] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:07:20,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:07:20,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-27 10:07:20,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457992599] [2023-08-27 10:07:20,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:07:20,087 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-27 10:07:20,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:07:20,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-27 10:07:20,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-08-27 10:07:20,088 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 266 [2023-08-27 10:07:20,089 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 68 transitions, 505 flow. Second operand has 6 states, 6 states have (on average 119.16666666666667) internal successors, (715), 6 states have internal predecessors, (715), 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:07:20,089 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:07:20,089 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 266 [2023-08-27 10:07:20,089 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:07:20,481 INFO L124 PetriNetUnfolderBase]: 2675/4221 cut-off events. [2023-08-27 10:07:20,481 INFO L125 PetriNetUnfolderBase]: For 12431/12650 co-relation queries the response was YES. [2023-08-27 10:07:20,492 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18481 conditions, 4221 events. 2675/4221 cut-off events. For 12431/12650 co-relation queries the response was YES. Maximal size of possible extension queue 275. Compared 24573 event pairs, 392 based on Foata normal form. 106/4212 useless extension candidates. Maximal degree in co-relation 18452. Up to 1528 conditions per place. [2023-08-27 10:07:20,502 INFO L140 encePairwiseOnDemand]: 257/266 looper letters, 67 selfloop transitions, 27 changer transitions 8/109 dead transitions. [2023-08-27 10:07:20,502 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 109 transitions, 874 flow [2023-08-27 10:07:20,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-27 10:07:20,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-27 10:07:20,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 775 transitions. [2023-08-27 10:07:20,504 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4855889724310777 [2023-08-27 10:07:20,504 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 775 transitions. [2023-08-27 10:07:20,504 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 775 transitions. [2023-08-27 10:07:20,504 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:07:20,504 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 775 transitions. [2023-08-27 10:07:20,505 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 129.16666666666666) internal successors, (775), 6 states have internal predecessors, (775), 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:07:20,507 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 266.0) internal successors, (1862), 7 states have internal predecessors, (1862), 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:07:20,507 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 266.0) internal successors, (1862), 7 states have internal predecessors, (1862), 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:07:20,507 INFO L175 Difference]: Start difference. First operand has 75 places, 68 transitions, 505 flow. Second operand 6 states and 775 transitions. [2023-08-27 10:07:20,507 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 109 transitions, 874 flow [2023-08-27 10:07:20,687 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 109 transitions, 820 flow, removed 2 selfloop flow, removed 6 redundant places. [2023-08-27 10:07:20,688 INFO L231 Difference]: Finished difference. Result has 70 places, 59 transitions, 436 flow [2023-08-27 10:07:20,688 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=419, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=436, PETRI_PLACES=70, PETRI_TRANSITIONS=59} [2023-08-27 10:07:20,688 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, 22 predicate places. [2023-08-27 10:07:20,688 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 59 transitions, 436 flow [2023-08-27 10:07:20,689 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 119.16666666666667) internal successors, (715), 6 states have internal predecessors, (715), 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:07:20,689 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:07:20,689 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] [2023-08-27 10:07:20,689 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-27 10:07:20,689 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:07:20,689 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:07:20,689 INFO L85 PathProgramCache]: Analyzing trace with hash 240559361, now seen corresponding path program 1 times [2023-08-27 10:07:20,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:07:20,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515557051] [2023-08-27 10:07:20,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:07:20,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:07:20,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:07:20,809 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:07:20,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:07:20,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515557051] [2023-08-27 10:07:20,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1515557051] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:07:20,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:07:20,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-27 10:07:20,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523156050] [2023-08-27 10:07:20,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:07:20,809 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-27 10:07:20,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:07:20,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-27 10:07:20,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-27 10:07:20,810 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 266 [2023-08-27 10:07:20,810 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 59 transitions, 436 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:07:20,811 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:07:20,811 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 266 [2023-08-27 10:07:20,811 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:07:21,403 INFO L124 PetriNetUnfolderBase]: 4329/6568 cut-off events. [2023-08-27 10:07:21,403 INFO L125 PetriNetUnfolderBase]: For 20642/20642 co-relation queries the response was YES. [2023-08-27 10:07:21,420 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28197 conditions, 6568 events. 4329/6568 cut-off events. For 20642/20642 co-relation queries the response was YES. Maximal size of possible extension queue 280. Compared 36535 event pairs, 326 based on Foata normal form. 10/6578 useless extension candidates. Maximal degree in co-relation 28168. Up to 4208 conditions per place. [2023-08-27 10:07:21,444 INFO L140 encePairwiseOnDemand]: 258/266 looper letters, 95 selfloop transitions, 20 changer transitions 40/155 dead transitions. [2023-08-27 10:07:21,444 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 155 transitions, 1447 flow [2023-08-27 10:07:21,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-27 10:07:21,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-27 10:07:21,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 623 transitions. [2023-08-27 10:07:21,462 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46842105263157896 [2023-08-27 10:07:21,462 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 623 transitions. [2023-08-27 10:07:21,462 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 623 transitions. [2023-08-27 10:07:21,462 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:07:21,462 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 623 transitions. [2023-08-27 10:07:21,463 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 124.6) internal successors, (623), 5 states have internal predecessors, (623), 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:07:21,465 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 266.0) internal successors, (1596), 6 states have internal predecessors, (1596), 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:07:21,465 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 266.0) internal successors, (1596), 6 states have internal predecessors, (1596), 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:07:21,465 INFO L175 Difference]: Start difference. First operand has 70 places, 59 transitions, 436 flow. Second operand 5 states and 623 transitions. [2023-08-27 10:07:21,465 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 155 transitions, 1447 flow [2023-08-27 10:07:21,727 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 155 transitions, 1192 flow, removed 24 selfloop flow, removed 7 redundant places. [2023-08-27 10:07:21,729 INFO L231 Difference]: Finished difference. Result has 69 places, 61 transitions, 422 flow [2023-08-27 10:07:21,729 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=333, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=422, PETRI_PLACES=69, PETRI_TRANSITIONS=61} [2023-08-27 10:07:21,729 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, 21 predicate places. [2023-08-27 10:07:21,730 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 61 transitions, 422 flow [2023-08-27 10:07:21,730 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:07:21,730 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:07:21,730 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] [2023-08-27 10:07:21,730 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-27 10:07:21,730 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:07:21,732 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:07:21,732 INFO L85 PathProgramCache]: Analyzing trace with hash -1915771863, now seen corresponding path program 2 times [2023-08-27 10:07:21,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:07:21,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313568178] [2023-08-27 10:07:21,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:07:21,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:07:21,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:07:21,948 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:07:21,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:07:21,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313568178] [2023-08-27 10:07:21,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [313568178] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:07:21,949 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:07:21,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-27 10:07:21,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045580818] [2023-08-27 10:07:21,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:07:21,949 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-27 10:07:21,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:07:21,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-27 10:07:21,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-08-27 10:07:21,950 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 266 [2023-08-27 10:07:21,951 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 61 transitions, 422 flow. Second operand has 7 states, 7 states have (on average 114.85714285714286) internal successors, (804), 7 states have internal predecessors, (804), 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:07:21,951 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:07:21,951 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 266 [2023-08-27 10:07:21,951 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:07:22,252 INFO L124 PetriNetUnfolderBase]: 1338/2142 cut-off events. [2023-08-27 10:07:22,253 INFO L125 PetriNetUnfolderBase]: For 5205/5487 co-relation queries the response was YES. [2023-08-27 10:07:22,258 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8425 conditions, 2142 events. 1338/2142 cut-off events. For 5205/5487 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 11316 event pairs, 176 based on Foata normal form. 137/2224 useless extension candidates. Maximal degree in co-relation 8396. Up to 797 conditions per place. [2023-08-27 10:07:22,266 INFO L140 encePairwiseOnDemand]: 259/266 looper letters, 74 selfloop transitions, 18 changer transitions 15/122 dead transitions. [2023-08-27 10:07:22,266 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 122 transitions, 984 flow [2023-08-27 10:07:22,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-27 10:07:22,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-27 10:07:22,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 977 transitions. [2023-08-27 10:07:22,281 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4591165413533835 [2023-08-27 10:07:22,281 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 977 transitions. [2023-08-27 10:07:22,281 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 977 transitions. [2023-08-27 10:07:22,282 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:07:22,282 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 977 transitions. [2023-08-27 10:07:22,286 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 122.125) internal successors, (977), 8 states have internal predecessors, (977), 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:07:22,290 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 266.0) internal successors, (2394), 9 states have internal predecessors, (2394), 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:07:22,290 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 266.0) internal successors, (2394), 9 states have internal predecessors, (2394), 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:07:22,290 INFO L175 Difference]: Start difference. First operand has 69 places, 61 transitions, 422 flow. Second operand 8 states and 977 transitions. [2023-08-27 10:07:22,290 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 122 transitions, 984 flow [2023-08-27 10:07:22,313 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 122 transitions, 948 flow, removed 8 selfloop flow, removed 7 redundant places. [2023-08-27 10:07:22,314 INFO L231 Difference]: Finished difference. Result has 66 places, 62 transitions, 458 flow [2023-08-27 10:07:22,314 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=398, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=458, PETRI_PLACES=66, PETRI_TRANSITIONS=62} [2023-08-27 10:07:22,315 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, 18 predicate places. [2023-08-27 10:07:22,315 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 62 transitions, 458 flow [2023-08-27 10:07:22,316 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 114.85714285714286) internal successors, (804), 7 states have internal predecessors, (804), 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:07:22,316 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:07:22,316 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] [2023-08-27 10:07:22,316 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-27 10:07:22,316 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-27 10:07:22,316 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:07:22,316 INFO L85 PathProgramCache]: Analyzing trace with hash -1725692229, now seen corresponding path program 1 times [2023-08-27 10:07:22,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:07:22,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913913576] [2023-08-27 10:07:22,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:07:22,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:07:22,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:07:22,473 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:07:22,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:07:22,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913913576] [2023-08-27 10:07:22,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [913913576] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:07:22,473 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:07:22,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-27 10:07:22,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651310642] [2023-08-27 10:07:22,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:07:22,474 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-27 10:07:22,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:07:22,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-27 10:07:22,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-27 10:07:22,475 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 266 [2023-08-27 10:07:22,475 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 62 transitions, 458 flow. Second operand has 4 states, 4 states have (on average 122.75) internal successors, (491), 4 states have internal predecessors, (491), 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:07:22,475 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:07:22,475 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 266 [2023-08-27 10:07:22,475 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:07:22,733 INFO L124 PetriNetUnfolderBase]: 1808/2966 cut-off events. [2023-08-27 10:07:22,733 INFO L125 PetriNetUnfolderBase]: For 9264/9420 co-relation queries the response was YES. [2023-08-27 10:07:22,739 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12970 conditions, 2966 events. 1808/2966 cut-off events. For 9264/9420 co-relation queries the response was YES. Maximal size of possible extension queue 164. Compared 16670 event pairs, 293 based on Foata normal form. 16/2970 useless extension candidates. Maximal degree in co-relation 12943. Up to 1694 conditions per place. [2023-08-27 10:07:22,743 INFO L140 encePairwiseOnDemand]: 263/266 looper letters, 61 selfloop transitions, 1 changer transitions 49/121 dead transitions. [2023-08-27 10:07:22,744 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 121 transitions, 1106 flow [2023-08-27 10:07:22,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-27 10:07:22,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-27 10:07:22,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 519 transitions. [2023-08-27 10:07:22,745 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48778195488721804 [2023-08-27 10:07:22,745 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 519 transitions. [2023-08-27 10:07:22,745 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 519 transitions. [2023-08-27 10:07:22,746 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:07:22,746 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 519 transitions. [2023-08-27 10:07:22,747 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 129.75) internal successors, (519), 4 states have internal predecessors, (519), 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:07:22,748 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 266.0) internal successors, (1330), 5 states have internal predecessors, (1330), 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:07:22,748 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 266.0) internal successors, (1330), 5 states have internal predecessors, (1330), 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:07:22,748 INFO L175 Difference]: Start difference. First operand has 66 places, 62 transitions, 458 flow. Second operand 4 states and 519 transitions. [2023-08-27 10:07:22,748 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 121 transitions, 1106 flow [2023-08-27 10:07:22,779 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 121 transitions, 1000 flow, removed 11 selfloop flow, removed 6 redundant places. [2023-08-27 10:07:22,780 INFO L231 Difference]: Finished difference. Result has 64 places, 55 transitions, 365 flow [2023-08-27 10:07:22,780 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=416, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=365, PETRI_PLACES=64, PETRI_TRANSITIONS=55} [2023-08-27 10:07:22,780 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, 16 predicate places. [2023-08-27 10:07:22,780 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 55 transitions, 365 flow [2023-08-27 10:07:22,781 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 122.75) internal successors, (491), 4 states have internal predecessors, (491), 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:07:22,781 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:07:22,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, 1, 1, 1, 1, 1] [2023-08-27 10:07:22,781 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-27 10:07:22,781 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:07:22,781 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:07:22,781 INFO L85 PathProgramCache]: Analyzing trace with hash -1494105921, now seen corresponding path program 2 times [2023-08-27 10:07:22,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:07:22,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102413977] [2023-08-27 10:07:22,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:07:22,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:07:22,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:07:23,389 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:07:23,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:07:23,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [102413977] [2023-08-27 10:07:23,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [102413977] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:07:23,389 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:07:23,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-27 10:07:23,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736036974] [2023-08-27 10:07:23,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:07:23,390 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-27 10:07:23,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:07:23,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-27 10:07:23,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-08-27 10:07:23,391 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 266 [2023-08-27 10:07:23,392 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 55 transitions, 365 flow. Second operand has 8 states, 8 states have (on average 114.875) internal successors, (919), 8 states have internal predecessors, (919), 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:07:23,392 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:07:23,392 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 266 [2023-08-27 10:07:23,392 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:07:23,869 INFO L124 PetriNetUnfolderBase]: 2318/3860 cut-off events. [2023-08-27 10:07:23,869 INFO L125 PetriNetUnfolderBase]: For 9539/9637 co-relation queries the response was YES. [2023-08-27 10:07:23,876 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15763 conditions, 3860 events. 2318/3860 cut-off events. For 9539/9637 co-relation queries the response was YES. Maximal size of possible extension queue 229. Compared 23000 event pairs, 401 based on Foata normal form. 26/3854 useless extension candidates. Maximal degree in co-relation 15740. Up to 1310 conditions per place. [2023-08-27 10:07:23,879 INFO L140 encePairwiseOnDemand]: 258/266 looper letters, 45 selfloop transitions, 2 changer transitions 170/224 dead transitions. [2023-08-27 10:07:23,880 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 224 transitions, 1866 flow [2023-08-27 10:07:23,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-08-27 10:07:23,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-08-27 10:07:23,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1332 transitions. [2023-08-27 10:07:23,882 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45522898154477104 [2023-08-27 10:07:23,882 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1332 transitions. [2023-08-27 10:07:23,882 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1332 transitions. [2023-08-27 10:07:23,883 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:07:23,883 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1332 transitions. [2023-08-27 10:07:23,885 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 121.0909090909091) internal successors, (1332), 11 states have internal predecessors, (1332), 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:07:23,887 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 266.0) internal successors, (3192), 12 states have internal predecessors, (3192), 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:07:23,888 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 266.0) internal successors, (3192), 12 states have internal predecessors, (3192), 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:07:23,888 INFO L175 Difference]: Start difference. First operand has 64 places, 55 transitions, 365 flow. Second operand 11 states and 1332 transitions. [2023-08-27 10:07:23,888 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 224 transitions, 1866 flow [2023-08-27 10:07:23,947 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 224 transitions, 1851 flow, removed 5 selfloop flow, removed 3 redundant places. [2023-08-27 10:07:23,949 INFO L231 Difference]: Finished difference. Result has 77 places, 53 transitions, 387 flow [2023-08-27 10:07:23,949 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=360, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=387, PETRI_PLACES=77, PETRI_TRANSITIONS=53} [2023-08-27 10:07:23,949 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, 29 predicate places. [2023-08-27 10:07:23,949 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 53 transitions, 387 flow [2023-08-27 10:07:23,950 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 114.875) internal successors, (919), 8 states have internal predecessors, (919), 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:07:23,950 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:07:23,950 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] [2023-08-27 10:07:23,950 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-27 10:07:23,950 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:07:23,950 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:07:23,950 INFO L85 PathProgramCache]: Analyzing trace with hash -157054045, now seen corresponding path program 3 times [2023-08-27 10:07:23,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:07:23,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487741654] [2023-08-27 10:07:23,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:07:23,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:07:23,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:07:24,091 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:07:24,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:07:24,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1487741654] [2023-08-27 10:07:24,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1487741654] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:07:24,094 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:07:24,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-27 10:07:24,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700696226] [2023-08-27 10:07:24,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:07:24,096 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-27 10:07:24,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:07:24,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-27 10:07:24,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-27 10:07:24,097 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 266 [2023-08-27 10:07:24,098 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 53 transitions, 387 flow. Second operand has 5 states, 5 states have (on average 115.0) internal successors, (575), 5 states have internal predecessors, (575), 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:07:24,098 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:07:24,098 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 266 [2023-08-27 10:07:24,098 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:07:24,279 INFO L124 PetriNetUnfolderBase]: 1005/1665 cut-off events. [2023-08-27 10:07:24,279 INFO L125 PetriNetUnfolderBase]: For 6704/6704 co-relation queries the response was YES. [2023-08-27 10:07:24,282 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7831 conditions, 1665 events. 1005/1665 cut-off events. For 6704/6704 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 8247 event pairs, 218 based on Foata normal form. 1/1666 useless extension candidates. Maximal degree in co-relation 7802. Up to 823 conditions per place. [2023-08-27 10:07:24,284 INFO L140 encePairwiseOnDemand]: 260/266 looper letters, 43 selfloop transitions, 4 changer transitions 48/95 dead transitions. [2023-08-27 10:07:24,284 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 95 transitions, 856 flow [2023-08-27 10:07:24,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-27 10:07:24,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-27 10:07:24,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 714 transitions. [2023-08-27 10:07:24,286 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4473684210526316 [2023-08-27 10:07:24,286 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 714 transitions. [2023-08-27 10:07:24,286 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 714 transitions. [2023-08-27 10:07:24,287 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:07:24,287 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 714 transitions. [2023-08-27 10:07:24,288 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 119.0) internal successors, (714), 6 states have internal predecessors, (714), 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:07:24,290 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 266.0) internal successors, (1862), 7 states have internal predecessors, (1862), 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:07:24,291 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 266.0) internal successors, (1862), 7 states have internal predecessors, (1862), 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:07:24,291 INFO L175 Difference]: Start difference. First operand has 77 places, 53 transitions, 387 flow. Second operand 6 states and 714 transitions. [2023-08-27 10:07:24,291 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 95 transitions, 856 flow [2023-08-27 10:07:24,304 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 95 transitions, 832 flow, removed 10 selfloop flow, removed 7 redundant places. [2023-08-27 10:07:24,305 INFO L231 Difference]: Finished difference. Result has 68 places, 41 transitions, 259 flow [2023-08-27 10:07:24,305 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=367, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=259, PETRI_PLACES=68, PETRI_TRANSITIONS=41} [2023-08-27 10:07:24,306 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, 20 predicate places. [2023-08-27 10:07:24,306 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 41 transitions, 259 flow [2023-08-27 10:07:24,306 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 115.0) internal successors, (575), 5 states have internal predecessors, (575), 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:07:24,306 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:07:24,306 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] [2023-08-27 10:07:24,306 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-08-27 10:07:24,306 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:07:24,306 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:07:24,306 INFO L85 PathProgramCache]: Analyzing trace with hash -237218379, now seen corresponding path program 4 times [2023-08-27 10:07:24,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:07:24,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803985836] [2023-08-27 10:07:24,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:07:24,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:07:24,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:07:24,429 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:07:24,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:07:24,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803985836] [2023-08-27 10:07:24,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [803985836] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:07:24,430 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:07:24,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-27 10:07:24,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073358419] [2023-08-27 10:07:24,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:07:24,430 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-27 10:07:24,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:07:24,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-27 10:07:24,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-27 10:07:24,431 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 266 [2023-08-27 10:07:24,431 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 41 transitions, 259 flow. Second operand has 5 states, 5 states have (on average 115.0) internal successors, (575), 5 states have internal predecessors, (575), 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:07:24,431 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:07:24,432 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 266 [2023-08-27 10:07:24,432 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:07:24,571 INFO L124 PetriNetUnfolderBase]: 617/1065 cut-off events. [2023-08-27 10:07:24,571 INFO L125 PetriNetUnfolderBase]: For 3451/3451 co-relation queries the response was YES. [2023-08-27 10:07:24,573 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4694 conditions, 1065 events. 617/1065 cut-off events. For 3451/3451 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 5016 event pairs, 177 based on Foata normal form. 1/1066 useless extension candidates. Maximal degree in co-relation 4669. Up to 509 conditions per place. [2023-08-27 10:07:24,574 INFO L140 encePairwiseOnDemand]: 261/266 looper letters, 44 selfloop transitions, 3 changer transitions 34/81 dead transitions. [2023-08-27 10:07:24,574 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 81 transitions, 656 flow [2023-08-27 10:07:24,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-27 10:07:24,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-27 10:07:24,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 712 transitions. [2023-08-27 10:07:24,576 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44611528822055135 [2023-08-27 10:07:24,576 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 712 transitions. [2023-08-27 10:07:24,576 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 712 transitions. [2023-08-27 10:07:24,576 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:07:24,576 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 712 transitions. [2023-08-27 10:07:24,586 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 118.66666666666667) internal successors, (712), 6 states have internal predecessors, (712), 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:07:24,588 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 266.0) internal successors, (1862), 7 states have internal predecessors, (1862), 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:07:24,588 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 266.0) internal successors, (1862), 7 states have internal predecessors, (1862), 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:07:24,588 INFO L175 Difference]: Start difference. First operand has 68 places, 41 transitions, 259 flow. Second operand 6 states and 712 transitions. [2023-08-27 10:07:24,588 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 81 transitions, 656 flow [2023-08-27 10:07:24,596 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 81 transitions, 619 flow, removed 10 selfloop flow, removed 7 redundant places. [2023-08-27 10:07:24,596 INFO L231 Difference]: Finished difference. Result has 64 places, 37 transitions, 207 flow [2023-08-27 10:07:24,596 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=230, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=207, PETRI_PLACES=64, PETRI_TRANSITIONS=37} [2023-08-27 10:07:24,597 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, 16 predicate places. [2023-08-27 10:07:24,597 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 37 transitions, 207 flow [2023-08-27 10:07:24,598 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 115.0) internal successors, (575), 5 states have internal predecessors, (575), 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:07:24,598 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:07:24,598 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] [2023-08-27 10:07:24,598 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-08-27 10:07:24,598 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:07:24,598 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:07:24,598 INFO L85 PathProgramCache]: Analyzing trace with hash 81499377, now seen corresponding path program 5 times [2023-08-27 10:07:24,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:07:24,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524917733] [2023-08-27 10:07:24,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:07:24,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:07:24,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:07:24,846 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:07:24,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:07:24,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524917733] [2023-08-27 10:07:24,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1524917733] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:07:24,847 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:07:24,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-27 10:07:24,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191553726] [2023-08-27 10:07:24,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:07:24,847 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-27 10:07:24,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:07:24,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-27 10:07:24,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-27 10:07:24,848 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 266 [2023-08-27 10:07:24,848 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 37 transitions, 207 flow. Second operand has 5 states, 5 states have (on average 113.0) internal successors, (565), 5 states have internal predecessors, (565), 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:07:24,848 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:07:24,848 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 266 [2023-08-27 10:07:24,848 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:07:24,987 INFO L124 PetriNetUnfolderBase]: 461/819 cut-off events. [2023-08-27 10:07:24,987 INFO L125 PetriNetUnfolderBase]: For 2101/2101 co-relation queries the response was YES. [2023-08-27 10:07:24,988 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3440 conditions, 819 events. 461/819 cut-off events. For 2101/2101 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 3764 event pairs, 70 based on Foata normal form. 1/820 useless extension candidates. Maximal degree in co-relation 3419. Up to 308 conditions per place. [2023-08-27 10:07:24,988 INFO L140 encePairwiseOnDemand]: 258/266 looper letters, 37 selfloop transitions, 4 changer transitions 46/87 dead transitions. [2023-08-27 10:07:24,988 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 87 transitions, 686 flow [2023-08-27 10:07:24,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-27 10:07:24,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-27 10:07:24,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 810 transitions. [2023-08-27 10:07:24,991 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43501611170784105 [2023-08-27 10:07:24,991 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 810 transitions. [2023-08-27 10:07:24,991 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 810 transitions. [2023-08-27 10:07:24,991 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:07:24,991 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 810 transitions. [2023-08-27 10:07:24,992 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 115.71428571428571) internal successors, (810), 7 states have internal predecessors, (810), 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:07:24,994 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 266.0) internal successors, (2128), 8 states have internal predecessors, (2128), 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:07:24,994 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 266.0) internal successors, (2128), 8 states have internal predecessors, (2128), 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:07:24,994 INFO L175 Difference]: Start difference. First operand has 64 places, 37 transitions, 207 flow. Second operand 7 states and 810 transitions. [2023-08-27 10:07:24,994 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 87 transitions, 686 flow [2023-08-27 10:07:24,999 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 87 transitions, 674 flow, removed 2 selfloop flow, removed 4 redundant places. [2023-08-27 10:07:24,999 INFO L231 Difference]: Finished difference. Result has 66 places, 37 transitions, 216 flow [2023-08-27 10:07:24,999 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=196, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=216, PETRI_PLACES=66, PETRI_TRANSITIONS=37} [2023-08-27 10:07:25,000 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, 18 predicate places. [2023-08-27 10:07:25,000 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 37 transitions, 216 flow [2023-08-27 10:07:25,000 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 113.0) internal successors, (565), 5 states have internal predecessors, (565), 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:07:25,000 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:07:25,000 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] [2023-08-27 10:07:25,000 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-08-27 10:07:25,000 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-27 10:07:25,001 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:07:25,001 INFO L85 PathProgramCache]: Analyzing trace with hash -1154920055, now seen corresponding path program 6 times [2023-08-27 10:07:25,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:07:25,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403778727] [2023-08-27 10:07:25,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:07:25,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:07:25,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-27 10:07:25,033 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-27 10:07:25,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-27 10:07:25,102 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-27 10:07:25,102 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-27 10:07:25,102 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONASSERT (22 of 23 remaining) [2023-08-27 10:07:25,104 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 23 remaining) [2023-08-27 10:07:25,104 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 23 remaining) [2023-08-27 10:07:25,104 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 23 remaining) [2023-08-27 10:07:25,104 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 23 remaining) [2023-08-27 10:07:25,104 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 23 remaining) [2023-08-27 10:07:25,104 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 23 remaining) [2023-08-27 10:07:25,104 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONASSERT (15 of 23 remaining) [2023-08-27 10:07:25,104 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 23 remaining) [2023-08-27 10:07:25,104 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 23 remaining) [2023-08-27 10:07:25,104 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (12 of 23 remaining) [2023-08-27 10:07:25,104 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (11 of 23 remaining) [2023-08-27 10:07:25,105 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (10 of 23 remaining) [2023-08-27 10:07:25,105 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (9 of 23 remaining) [2023-08-27 10:07:25,105 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 23 remaining) [2023-08-27 10:07:25,105 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 23 remaining) [2023-08-27 10:07:25,105 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 23 remaining) [2023-08-27 10:07:25,105 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 23 remaining) [2023-08-27 10:07:25,105 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 23 remaining) [2023-08-27 10:07:25,105 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 23 remaining) [2023-08-27 10:07:25,105 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONASSERT (2 of 23 remaining) [2023-08-27 10:07:25,105 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 23 remaining) [2023-08-27 10:07:25,105 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 23 remaining) [2023-08-27 10:07:25,105 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-08-27 10:07:25,106 INFO L445 BasicCegarLoop]: Path program histogram: [6, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 10:07:25,109 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-27 10:07:25,109 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-27 10:07:25,178 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.08 10:07:25 BasicIcfg [2023-08-27 10:07:25,178 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-27 10:07:25,179 INFO L158 Benchmark]: Toolchain (without parser) took 15976.29ms. Allocated memory was 320.9MB in the beginning and 1.5GB in the end (delta: 1.1GB). Free memory was 295.4MB in the beginning and 1.2GB in the end (delta: -934.5MB). Peak memory consumption was 214.9MB. Max. memory is 16.0GB. [2023-08-27 10:07:25,179 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 320.9MB. Free memory is still 297.2MB. There was no memory consumed. Max. memory is 16.0GB. [2023-08-27 10:07:25,179 INFO L158 Benchmark]: CACSL2BoogieTranslator took 444.90ms. Allocated memory is still 320.9MB. Free memory was 295.4MB in the beginning and 272.4MB in the end (delta: 22.9MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. [2023-08-27 10:07:25,179 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.08ms. Allocated memory is still 320.9MB. Free memory was 272.4MB in the beginning and 269.8MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-27 10:07:25,179 INFO L158 Benchmark]: Boogie Preprocessor took 21.78ms. Allocated memory is still 320.9MB. Free memory was 269.8MB in the beginning and 267.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-27 10:07:25,179 INFO L158 Benchmark]: RCFGBuilder took 514.50ms. Allocated memory is still 320.9MB. Free memory was 267.7MB in the beginning and 285.0MB in the end (delta: -17.3MB). Peak memory consumption was 31.5MB. Max. memory is 16.0GB. [2023-08-27 10:07:25,179 INFO L158 Benchmark]: TraceAbstraction took 14960.44ms. Allocated memory was 320.9MB in the beginning and 1.5GB in the end (delta: 1.1GB). Free memory was 284.0MB in the beginning and 1.2GB in the end (delta: -945.9MB). Peak memory consumption was 202.2MB. Max. memory is 16.0GB. [2023-08-27 10:07:25,181 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.10ms. Allocated memory is still 320.9MB. Free memory is still 297.2MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 444.90ms. Allocated memory is still 320.9MB. Free memory was 295.4MB in the beginning and 272.4MB in the end (delta: 22.9MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 31.08ms. Allocated memory is still 320.9MB. Free memory was 272.4MB in the beginning and 269.8MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 21.78ms. Allocated memory is still 320.9MB. Free memory was 269.8MB in the beginning and 267.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 514.50ms. Allocated memory is still 320.9MB. Free memory was 267.7MB in the beginning and 285.0MB in the end (delta: -17.3MB). Peak memory consumption was 31.5MB. Max. memory is 16.0GB. * TraceAbstraction took 14960.44ms. Allocated memory was 320.9MB in the beginning and 1.5GB in the end (delta: 1.1GB). Free memory was 284.0MB in the beginning and 1.2GB in the end (delta: -945.9MB). Peak memory consumption was 202.2MB. 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: 3.3s, 149 PlacesBefore, 48 PlacesAfterwards, 139 TransitionsBefore, 36 TransitionsAfterwards, 4152 CoEnabledTransitionPairs, 7 FixpointIterations, 45 TrivialSequentialCompositions, 60 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 16 ConcurrentYvCompositions, 2 ChoiceCompositions, 123 TotalNumberOfCompositions, 14328 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 5675, independent: 5340, independent conditional: 0, independent unconditional: 5340, 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: 2337, independent: 2274, independent conditional: 0, independent unconditional: 2274, dependent: 63, dependent conditional: 0, dependent unconditional: 63, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 5675, independent: 3066, independent conditional: 0, independent unconditional: 3066, dependent: 272, dependent conditional: 0, dependent unconditional: 272, unknown: 2337, unknown conditional: 0, unknown unconditional: 2337] , Statistics on independence cache: Total cache size (in pairs): 216, Positive cache size: 191, Positive conditional cache size: 0, Positive unconditional cache size: 191, 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_p0_EAX = 0; [L714] 0 int __unbuffered_p1_EAX = 0; [L716] 0 int __unbuffered_p2_EAX = 0; [L718] 0 int __unbuffered_p3_EAX = 0; [L720] 0 int __unbuffered_p3_EBX = 0; [L722] 0 int a = 0; [L724] 0 int b = 0; [L725] 0 _Bool main$tmp_guard0; [L726] 0 _Bool main$tmp_guard1; [L728] 0 int x = 0; [L730] 0 int y = 0; [L732] 0 int z = 0; [L733] 0 _Bool z$flush_delayed; [L734] 0 int z$mem_tmp; [L735] 0 _Bool z$r_buff0_thd0; [L736] 0 _Bool z$r_buff0_thd1; [L737] 0 _Bool z$r_buff0_thd2; [L738] 0 _Bool z$r_buff0_thd3; [L739] 0 _Bool z$r_buff0_thd4; [L740] 0 _Bool z$r_buff1_thd0; [L741] 0 _Bool z$r_buff1_thd1; [L742] 0 _Bool z$r_buff1_thd2; [L743] 0 _Bool z$r_buff1_thd3; [L744] 0 _Bool z$r_buff1_thd4; [L745] 0 _Bool z$read_delayed; [L746] 0 int *z$read_delayed_var; [L747] 0 int z$w_buff0; [L748] 0 _Bool z$w_buff0_used; [L749] 0 int z$w_buff1; [L750] 0 _Bool z$w_buff1_used; [L751] 0 _Bool weak$$choice0; [L752] 0 _Bool weak$$choice2; [L858] 0 pthread_t t949; [L859] FCALL, FORK 0 pthread_create(&t949, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t949, ((void *)0), P0, ((void *)0))=-2, t949={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] [L860] 0 pthread_t t950; [L861] FCALL, FORK 0 pthread_create(&t950, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t950, ((void *)0), P1, ((void *)0))=-1, t949={5:0}, t950={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] [L862] 0 pthread_t t951; [L863] FCALL, FORK 0 pthread_create(&t951, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t951, ((void *)0), P2, ((void *)0))=0, t949={5:0}, t950={6:0}, t951={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] [L864] 0 pthread_t t952; [L865] FCALL, FORK 0 pthread_create(&t952, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t952, ((void *)0), P3, ((void *)0))=1, t949={5:0}, t950={6:0}, t951={7:0}, t952={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] [L814] 4 z$w_buff1 = z$w_buff0 [L815] 4 z$w_buff0 = 1 [L816] 4 z$w_buff1_used = z$w_buff0_used [L817] 4 z$w_buff0_used = (_Bool)1 [L818] CALL 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 4 !(!expression) [L818] RET 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L819] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L820] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L821] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L822] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L823] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L824] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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}, b=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] [L827] 4 a = 1 [L830] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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}, b=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] [L833] 4 __unbuffered_p3_EBX = b VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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}, b=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] [L756] 1 b = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, 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] [L759] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, 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] [L771] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, 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] [L774] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, 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] [L786] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, 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] [L764] EXPR 1 __unbuffered_cnt + 1 [L764] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L766] 1 return 0; [L789] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L790] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L791] 3 z$flush_delayed = weak$$choice2 [L792] 3 z$mem_tmp = z [L793] 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) [L794] 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)) [L795] 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)) [L796] 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)) [L797] 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)) [L798] 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)) [L799] 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)) [L800] 3 __unbuffered_p2_EAX = z [L801] 3 z = z$flush_delayed ? z$mem_tmp : z [L802] 3 z$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, 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] [L836] 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) [L837] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L838] 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 [L839] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L840] 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}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, 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=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L807] EXPR 3 __unbuffered_cnt + 1 [L807] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L809] 3 return 0; [L779] EXPR 2 __unbuffered_cnt + 1 [L779] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L781] 2 return 0; [L843] EXPR 4 __unbuffered_cnt + 1 [L843] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L845] 4 return 0; [L867] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L869] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L869] RET 0 assume_abort_if_not(main$tmp_guard0) [L871] 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) [L872] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L873] 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 [L874] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L875] 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_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t949={5:0}, t950={6:0}, t951={7:0}, t952={3:0}, weak$$choice2=0, x=1, 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=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L878] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L880] 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", "mix036_pso.opt_tso.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_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=1, 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=0, z$w_buff1=0, z$w_buff1_used=0, z=1] - UnprovableResult [Line: 764]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 764]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 779]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 779]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 807]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 807]: 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: 843]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 843]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 865]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 861]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 863]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 859]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 185 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: 14.8s, OverallIterations: 19, TraceHistogramMax: 1, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 8.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.4s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 665 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 665 mSDsluCounter, 57 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 23 mSDsCounter, 84 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2150 IncrementalHoareTripleChecker+Invalid, 2234 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 84 mSolverCounterUnsat, 34 mSDtfsCounter, 2150 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 81 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=505occurred in iteration=10, InterpolantAutomatonStates: 101, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 343 NumberOfCodeBlocks, 343 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 300 ConstructedInterpolants, 0 QuantifiedInterpolants, 1645 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 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:07:25,194 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...