/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/rfi006_rmo.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-27 10:12:41,403 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-27 10:12:41,481 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:12:41,486 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-27 10:12:41,487 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-27 10:12:41,517 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-27 10:12:41,518 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-27 10:12:41,518 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-27 10:12:41,519 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-27 10:12:41,522 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-27 10:12:41,523 INFO L153 SettingsManager]: * Use SBE=true [2023-08-27 10:12:41,523 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-27 10:12:41,523 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-27 10:12:41,524 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-27 10:12:41,524 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-27 10:12:41,525 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-27 10:12:41,525 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-27 10:12:41,525 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-27 10:12:41,525 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-27 10:12:41,525 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-27 10:12:41,526 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-27 10:12:41,526 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-27 10:12:41,527 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-27 10:12:41,527 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-27 10:12:41,527 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-27 10:12:41,527 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-27 10:12:41,528 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-27 10:12:41,528 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-27 10:12:41,528 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-27 10:12:41,528 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-27 10:12:41,529 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-27 10:12:41,529 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-27 10:12:41,529 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-27 10:12:41,530 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-27 10:12:41,530 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-27 10:12:41,530 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:12:41,837 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-27 10:12:41,860 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-27 10:12:41,862 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-27 10:12:41,863 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-27 10:12:41,863 INFO L274 PluginConnector]: CDTParser initialized [2023-08-27 10:12:41,864 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi006_rmo.i [2023-08-27 10:12:43,044 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-27 10:12:43,317 INFO L384 CDTParser]: Found 1 translation units. [2023-08-27 10:12:43,317 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi006_rmo.i [2023-08-27 10:12:43,343 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ec1738742/e80c7ffa3a2d4354a90cfa4066683653/FLAG9481e03b7 [2023-08-27 10:12:43,359 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ec1738742/e80c7ffa3a2d4354a90cfa4066683653 [2023-08-27 10:12:43,363 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-27 10:12:43,365 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-27 10:12:43,368 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-27 10:12:43,368 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-27 10:12:43,370 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-27 10:12:43,372 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 10:12:43" (1/1) ... [2023-08-27 10:12:43,372 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4c415f02 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:12:43, skipping insertion in model container [2023-08-27 10:12:43,372 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 10:12:43" (1/1) ... [2023-08-27 10:12:43,424 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-27 10:12:43,779 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-27 10:12:43,789 INFO L201 MainTranslator]: Completed pre-run [2023-08-27 10:12:43,805 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [268] [2023-08-27 10:12:43,807 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [268] [2023-08-27 10:12:43,860 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-27 10:12:43,907 WARN L669 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-27 10:12:43,907 WARN L669 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-27 10:12:43,913 INFO L206 MainTranslator]: Completed translation [2023-08-27 10:12:43,914 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:12:43 WrapperNode [2023-08-27 10:12:43,914 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-27 10:12:43,915 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-27 10:12:43,915 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-27 10:12:43,915 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-27 10:12:43,921 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:12:43" (1/1) ... [2023-08-27 10:12:43,935 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:12:43" (1/1) ... [2023-08-27 10:12:43,955 INFO L138 Inliner]: procedures = 176, calls = 74, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 140 [2023-08-27 10:12:43,956 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-27 10:12:43,957 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-27 10:12:43,957 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-27 10:12:43,957 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-27 10:12:43,965 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:12:43" (1/1) ... [2023-08-27 10:12:43,965 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:12:43" (1/1) ... [2023-08-27 10:12:43,968 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:12:43" (1/1) ... [2023-08-27 10:12:43,969 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:12:43" (1/1) ... [2023-08-27 10:12:43,980 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:12:43" (1/1) ... [2023-08-27 10:12:43,982 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:12:43" (1/1) ... [2023-08-27 10:12:43,985 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:12:43" (1/1) ... [2023-08-27 10:12:43,987 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:12:43" (1/1) ... [2023-08-27 10:12:43,991 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-27 10:12:43,991 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-27 10:12:43,991 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-27 10:12:43,992 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-27 10:12:43,992 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:12:43" (1/1) ... [2023-08-27 10:12:43,997 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-27 10:12:44,024 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 10:12:44,046 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:12:44,070 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:12:44,085 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-27 10:12:44,086 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-27 10:12:44,086 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-27 10:12:44,086 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-27 10:12:44,086 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-27 10:12:44,086 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-27 10:12:44,086 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-27 10:12:44,087 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-27 10:12:44,087 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-27 10:12:44,087 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-27 10:12:44,087 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-27 10:12:44,087 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-27 10:12:44,087 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-27 10:12:44,087 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-27 10:12:44,087 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-27 10:12:44,089 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-27 10:12:44,090 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:12:44,217 INFO L236 CfgBuilder]: Building ICFG [2023-08-27 10:12:44,219 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-27 10:12:44,626 INFO L277 CfgBuilder]: Performing block encoding [2023-08-27 10:12:44,853 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-27 10:12:44,853 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-27 10:12:44,857 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 10:12:44 BoogieIcfgContainer [2023-08-27 10:12:44,857 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-27 10:12:44,860 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-27 10:12:44,860 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-27 10:12:44,863 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-27 10:12:44,863 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.08 10:12:43" (1/3) ... [2023-08-27 10:12:44,863 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@421bf5a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.08 10:12:44, skipping insertion in model container [2023-08-27 10:12:44,864 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:12:43" (2/3) ... [2023-08-27 10:12:44,864 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@421bf5a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.08 10:12:44, skipping insertion in model container [2023-08-27 10:12:44,864 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 10:12:44" (3/3) ... [2023-08-27 10:12:44,865 INFO L112 eAbstractionObserver]: Analyzing ICFG rfi006_rmo.i [2023-08-27 10:12:44,880 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-27 10:12:44,881 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 7 error locations. [2023-08-27 10:12:44,881 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-27 10:12:44,954 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-27 10:12:44,996 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 141 places, 134 transitions, 283 flow [2023-08-27 10:12:45,051 INFO L124 PetriNetUnfolderBase]: 3/131 cut-off events. [2023-08-27 10:12:45,051 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-27 10:12:45,055 INFO L83 FinitePrefix]: Finished finitePrefix Result has 141 conditions, 131 events. 3/131 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 81 event pairs, 0 based on Foata normal form. 0/121 useless extension candidates. Maximal degree in co-relation 76. Up to 2 conditions per place. [2023-08-27 10:12:45,056 INFO L82 GeneralOperation]: Start removeDead. Operand has 141 places, 134 transitions, 283 flow [2023-08-27 10:12:45,064 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 138 places, 131 transitions, 271 flow [2023-08-27 10:12:45,068 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-27 10:12:45,078 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 138 places, 131 transitions, 271 flow [2023-08-27 10:12:45,081 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 138 places, 131 transitions, 271 flow [2023-08-27 10:12:45,082 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 138 places, 131 transitions, 271 flow [2023-08-27 10:12:45,124 INFO L124 PetriNetUnfolderBase]: 3/131 cut-off events. [2023-08-27 10:12:45,124 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-27 10:12:45,125 INFO L83 FinitePrefix]: Finished finitePrefix Result has 141 conditions, 131 events. 3/131 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 81 event pairs, 0 based on Foata normal form. 0/121 useless extension candidates. Maximal degree in co-relation 76. Up to 2 conditions per place. [2023-08-27 10:12:45,127 INFO L119 LiptonReduction]: Number of co-enabled transitions 2416 [2023-08-27 10:12:51,366 INFO L134 LiptonReduction]: Checked pairs total: 8678 [2023-08-27 10:12:51,366 INFO L136 LiptonReduction]: Total number of compositions: 123 [2023-08-27 10:12:51,377 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-27 10:12:51,382 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;@1c7e506, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-27 10:12:51,383 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2023-08-27 10:12:51,386 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-27 10:12:51,386 INFO L124 PetriNetUnfolderBase]: 0/6 cut-off events. [2023-08-27 10:12:51,386 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-27 10:12:51,387 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:12:51,387 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-27 10:12:51,387 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2023-08-27 10:12:51,391 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:12:51,391 INFO L85 PathProgramCache]: Analyzing trace with hash 717703772, now seen corresponding path program 1 times [2023-08-27 10:12:51,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:12:51,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551896744] [2023-08-27 10:12:51,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:12:51,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:12:51,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:12:51,710 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:12:51,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:12:51,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551896744] [2023-08-27 10:12:51,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1551896744] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:12:51,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:12:51,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-27 10:12:51,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494484067] [2023-08-27 10:12:51,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:12:51,720 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-27 10:12:51,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:12:51,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-27 10:12:51,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-27 10:12:51,748 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 257 [2023-08-27 10:12:51,752 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 26 transitions, 61 flow. Second operand has 3 states, 3 states have (on average 112.33333333333333) internal successors, (337), 3 states have internal predecessors, (337), 0 states have call successors, (0), 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:12:51,753 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:12:51,753 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 257 [2023-08-27 10:12:51,754 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:12:52,080 INFO L124 PetriNetUnfolderBase]: 939/1473 cut-off events. [2023-08-27 10:12:52,080 INFO L125 PetriNetUnfolderBase]: For 15/15 co-relation queries the response was YES. [2023-08-27 10:12:52,084 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2986 conditions, 1473 events. 939/1473 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 7129 event pairs, 259 based on Foata normal form. 0/1054 useless extension candidates. Maximal degree in co-relation 2975. Up to 1198 conditions per place. [2023-08-27 10:12:52,094 INFO L140 encePairwiseOnDemand]: 247/257 looper letters, 36 selfloop transitions, 4 changer transitions 0/42 dead transitions. [2023-08-27 10:12:52,094 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 42 transitions, 179 flow [2023-08-27 10:12:52,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-27 10:12:52,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-27 10:12:52,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 379 transitions. [2023-08-27 10:12:52,107 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4915693904020752 [2023-08-27 10:12:52,108 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 379 transitions. [2023-08-27 10:12:52,108 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 379 transitions. [2023-08-27 10:12:52,109 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:12:52,111 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 379 transitions. [2023-08-27 10:12:52,115 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 126.33333333333333) internal successors, (379), 3 states have internal predecessors, (379), 0 states have call successors, (0), 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:12:52,119 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 257.0) internal successors, (1028), 4 states have internal predecessors, (1028), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:12:52,120 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 257.0) internal successors, (1028), 4 states have internal predecessors, (1028), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:12:52,121 INFO L175 Difference]: Start difference. First operand has 36 places, 26 transitions, 61 flow. Second operand 3 states and 379 transitions. [2023-08-27 10:12:52,122 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 42 transitions, 179 flow [2023-08-27 10:12:52,124 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 42 transitions, 174 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-27 10:12:52,125 INFO L231 Difference]: Finished difference. Result has 36 places, 29 transitions, 94 flow [2023-08-27 10:12:52,127 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=257, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=94, PETRI_PLACES=36, PETRI_TRANSITIONS=29} [2023-08-27 10:12:52,130 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 0 predicate places. [2023-08-27 10:12:52,130 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 29 transitions, 94 flow [2023-08-27 10:12:52,131 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 112.33333333333333) internal successors, (337), 3 states have internal predecessors, (337), 0 states have call successors, (0), 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:12:52,131 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:12:52,131 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 10:12:52,131 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-27 10:12:52,131 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2023-08-27 10:12:52,132 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:12:52,132 INFO L85 PathProgramCache]: Analyzing trace with hash -852619629, now seen corresponding path program 1 times [2023-08-27 10:12:52,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:12:52,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949267739] [2023-08-27 10:12:52,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:12:52,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:12:52,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:12:52,433 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:12:52,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:12:52,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949267739] [2023-08-27 10:12:52,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1949267739] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:12:52,433 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:12:52,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-27 10:12:52,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616956432] [2023-08-27 10:12:52,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:12:52,435 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-27 10:12:52,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:12:52,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-27 10:12:52,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-27 10:12:52,436 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 257 [2023-08-27 10:12:52,437 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 29 transitions, 94 flow. Second operand has 3 states, 3 states have (on average 117.0) internal successors, (351), 3 states have internal predecessors, (351), 0 states have call successors, (0), 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:12:52,437 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:12:52,437 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 257 [2023-08-27 10:12:52,437 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:12:52,694 INFO L124 PetriNetUnfolderBase]: 866/1415 cut-off events. [2023-08-27 10:12:52,694 INFO L125 PetriNetUnfolderBase]: For 155/176 co-relation queries the response was YES. [2023-08-27 10:12:52,698 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3474 conditions, 1415 events. 866/1415 cut-off events. For 155/176 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 7484 event pairs, 298 based on Foata normal form. 0/1169 useless extension candidates. Maximal degree in co-relation 3463. Up to 965 conditions per place. [2023-08-27 10:12:52,704 INFO L140 encePairwiseOnDemand]: 254/257 looper letters, 37 selfloop transitions, 2 changer transitions 0/43 dead transitions. [2023-08-27 10:12:52,705 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 43 transitions, 216 flow [2023-08-27 10:12:52,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-27 10:12:52,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-27 10:12:52,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 377 transitions. [2023-08-27 10:12:52,710 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4889753566796368 [2023-08-27 10:12:52,710 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 377 transitions. [2023-08-27 10:12:52,710 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 377 transitions. [2023-08-27 10:12:52,711 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:12:52,711 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 377 transitions. [2023-08-27 10:12:52,713 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 125.66666666666667) internal successors, (377), 3 states have internal predecessors, (377), 0 states have call successors, (0), 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:12:52,715 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 257.0) internal successors, (1028), 4 states have internal predecessors, (1028), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:12:52,716 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 257.0) internal successors, (1028), 4 states have internal predecessors, (1028), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:12:52,716 INFO L175 Difference]: Start difference. First operand has 36 places, 29 transitions, 94 flow. Second operand 3 states and 377 transitions. [2023-08-27 10:12:52,716 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 43 transitions, 216 flow [2023-08-27 10:12:52,718 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 43 transitions, 210 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-27 10:12:52,719 INFO L231 Difference]: Finished difference. Result has 38 places, 29 transitions, 98 flow [2023-08-27 10:12:52,719 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=257, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=98, PETRI_PLACES=38, PETRI_TRANSITIONS=29} [2023-08-27 10:12:52,720 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 2 predicate places. [2023-08-27 10:12:52,720 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 29 transitions, 98 flow [2023-08-27 10:12:52,721 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 117.0) internal successors, (351), 3 states have internal predecessors, (351), 0 states have call successors, (0), 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:12:52,721 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:12:52,721 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 10:12:52,721 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-27 10:12:52,721 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2023-08-27 10:12:52,722 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:12:52,722 INFO L85 PathProgramCache]: Analyzing trace with hash 1101873551, now seen corresponding path program 1 times [2023-08-27 10:12:52,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:12:52,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616045426] [2023-08-27 10:12:52,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:12:52,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:12:52,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:12:52,790 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 10:12:52,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:12:52,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616045426] [2023-08-27 10:12:52,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [616045426] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:12:52,791 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:12:52,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-27 10:12:52,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125079824] [2023-08-27 10:12:52,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:12:52,792 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-27 10:12:52,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:12:52,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-27 10:12:52,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-27 10:12:52,793 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 257 [2023-08-27 10:12:52,794 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 29 transitions, 98 flow. Second operand has 4 states, 4 states have (on average 113.25) internal successors, (453), 4 states have internal predecessors, (453), 0 states have call successors, (0), 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:12:52,794 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:12:52,794 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 257 [2023-08-27 10:12:52,794 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:12:53,081 INFO L124 PetriNetUnfolderBase]: 665/1041 cut-off events. [2023-08-27 10:12:53,082 INFO L125 PetriNetUnfolderBase]: For 138/138 co-relation queries the response was YES. [2023-08-27 10:12:53,084 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2550 conditions, 1041 events. 665/1041 cut-off events. For 138/138 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 4598 event pairs, 186 based on Foata normal form. 0/911 useless extension candidates. Maximal degree in co-relation 2537. Up to 784 conditions per place. [2023-08-27 10:12:53,088 INFO L140 encePairwiseOnDemand]: 250/257 looper letters, 33 selfloop transitions, 4 changer transitions 0/39 dead transitions. [2023-08-27 10:12:53,089 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 39 transitions, 192 flow [2023-08-27 10:12:53,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-27 10:12:53,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-27 10:12:53,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 484 transitions. [2023-08-27 10:12:53,091 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4708171206225681 [2023-08-27 10:12:53,091 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 484 transitions. [2023-08-27 10:12:53,091 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 484 transitions. [2023-08-27 10:12:53,092 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:12:53,092 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 484 transitions. [2023-08-27 10:12:53,093 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 121.0) internal successors, (484), 4 states have internal predecessors, (484), 0 states have call successors, (0), 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:12:53,095 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 257.0) internal successors, (1285), 5 states have internal predecessors, (1285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:12:53,095 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 257.0) internal successors, (1285), 5 states have internal predecessors, (1285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:12:53,096 INFO L175 Difference]: Start difference. First operand has 38 places, 29 transitions, 98 flow. Second operand 4 states and 484 transitions. [2023-08-27 10:12:53,096 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 39 transitions, 192 flow [2023-08-27 10:12:53,097 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 39 transitions, 188 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-27 10:12:53,097 INFO L231 Difference]: Finished difference. Result has 36 places, 26 transitions, 90 flow [2023-08-27 10:12:53,098 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=257, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=90, PETRI_PLACES=36, PETRI_TRANSITIONS=26} [2023-08-27 10:12:53,098 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 0 predicate places. [2023-08-27 10:12:53,099 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 26 transitions, 90 flow [2023-08-27 10:12:53,099 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 113.25) internal successors, (453), 4 states have internal predecessors, (453), 0 states have call successors, (0), 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:12:53,099 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:12:53,099 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 10:12:53,099 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-27 10:12:53,100 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2023-08-27 10:12:53,100 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:12:53,100 INFO L85 PathProgramCache]: Analyzing trace with hash -465184222, now seen corresponding path program 1 times [2023-08-27 10:12:53,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:12:53,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865457207] [2023-08-27 10:12:53,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:12:53,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:12:53,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:12:53,167 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:12:53,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:12:53,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865457207] [2023-08-27 10:12:53,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1865457207] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:12:53,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:12:53,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-27 10:12:53,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436986023] [2023-08-27 10:12:53,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:12:53,169 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-27 10:12:53,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:12:53,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-27 10:12:53,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-27 10:12:53,170 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 257 [2023-08-27 10:12:53,171 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 26 transitions, 90 flow. Second operand has 4 states, 4 states have (on average 113.25) internal successors, (453), 4 states have internal predecessors, (453), 0 states have call successors, (0), 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:12:53,171 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:12:53,171 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 257 [2023-08-27 10:12:53,171 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:12:53,380 INFO L124 PetriNetUnfolderBase]: 494/773 cut-off events. [2023-08-27 10:12:53,380 INFO L125 PetriNetUnfolderBase]: For 323/323 co-relation queries the response was YES. [2023-08-27 10:12:53,381 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1959 conditions, 773 events. 494/773 cut-off events. For 323/323 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 3152 event pairs, 151 based on Foata normal form. 0/755 useless extension candidates. Maximal degree in co-relation 1946. Up to 331 conditions per place. [2023-08-27 10:12:53,384 INFO L140 encePairwiseOnDemand]: 250/257 looper letters, 44 selfloop transitions, 7 changer transitions 0/53 dead transitions. [2023-08-27 10:12:53,385 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 53 transitions, 262 flow [2023-08-27 10:12:53,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-27 10:12:53,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-27 10:12:53,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 498 transitions. [2023-08-27 10:12:53,387 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48443579766536965 [2023-08-27 10:12:53,387 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 498 transitions. [2023-08-27 10:12:53,387 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 498 transitions. [2023-08-27 10:12:53,387 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:12:53,387 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 498 transitions. [2023-08-27 10:12:53,388 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 124.5) internal successors, (498), 4 states have internal predecessors, (498), 0 states have call successors, (0), 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:12:53,390 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 257.0) internal successors, (1285), 5 states have internal predecessors, (1285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:12:53,391 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 257.0) internal successors, (1285), 5 states have internal predecessors, (1285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:12:53,391 INFO L175 Difference]: Start difference. First operand has 36 places, 26 transitions, 90 flow. Second operand 4 states and 498 transitions. [2023-08-27 10:12:53,391 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 53 transitions, 262 flow [2023-08-27 10:12:53,392 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 53 transitions, 257 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-27 10:12:53,393 INFO L231 Difference]: Finished difference. Result has 38 places, 29 transitions, 129 flow [2023-08-27 10:12:53,393 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=257, PETRI_DIFFERENCE_MINUEND_FLOW=85, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=129, PETRI_PLACES=38, PETRI_TRANSITIONS=29} [2023-08-27 10:12:53,394 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 2 predicate places. [2023-08-27 10:12:53,394 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 29 transitions, 129 flow [2023-08-27 10:12:53,394 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 113.25) internal successors, (453), 4 states have internal predecessors, (453), 0 states have call successors, (0), 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:12:53,394 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:12:53,394 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 10:12:53,395 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-27 10:12:53,395 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2023-08-27 10:12:53,395 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:12:53,395 INFO L85 PathProgramCache]: Analyzing trace with hash -2054413858, now seen corresponding path program 1 times [2023-08-27 10:12:53,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:12:53,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773549332] [2023-08-27 10:12:53,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:12:53,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:12:53,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:12:53,589 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:12:53,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:12:53,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773549332] [2023-08-27 10:12:53,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1773549332] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:12:53,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:12:53,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-27 10:12:53,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145585957] [2023-08-27 10:12:53,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:12:53,592 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-27 10:12:53,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:12:53,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-27 10:12:53,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-27 10:12:53,596 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 257 [2023-08-27 10:12:53,597 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 29 transitions, 129 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:12:53,597 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:12:53,601 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 257 [2023-08-27 10:12:53,601 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:12:53,790 INFO L124 PetriNetUnfolderBase]: 465/767 cut-off events. [2023-08-27 10:12:53,790 INFO L125 PetriNetUnfolderBase]: For 710/710 co-relation queries the response was YES. [2023-08-27 10:12:53,791 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2184 conditions, 767 events. 465/767 cut-off events. For 710/710 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 3353 event pairs, 128 based on Foata normal form. 12/763 useless extension candidates. Maximal degree in co-relation 2170. Up to 566 conditions per place. [2023-08-27 10:12:53,794 INFO L140 encePairwiseOnDemand]: 254/257 looper letters, 40 selfloop transitions, 2 changer transitions 0/44 dead transitions. [2023-08-27 10:12:53,794 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 44 transitions, 269 flow [2023-08-27 10:12:53,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-27 10:12:53,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-27 10:12:53,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 377 transitions. [2023-08-27 10:12:53,796 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4889753566796368 [2023-08-27 10:12:53,796 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 377 transitions. [2023-08-27 10:12:53,796 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 377 transitions. [2023-08-27 10:12:53,797 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:12:53,797 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 377 transitions. [2023-08-27 10:12:53,798 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 125.66666666666667) internal successors, (377), 3 states have internal predecessors, (377), 0 states have call successors, (0), 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:12:53,799 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 257.0) internal successors, (1028), 4 states have internal predecessors, (1028), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:12:53,800 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 257.0) internal successors, (1028), 4 states have internal predecessors, (1028), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:12:53,800 INFO L175 Difference]: Start difference. First operand has 38 places, 29 transitions, 129 flow. Second operand 3 states and 377 transitions. [2023-08-27 10:12:53,800 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 44 transitions, 269 flow [2023-08-27 10:12:53,803 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 44 transitions, 247 flow, removed 5 selfloop flow, removed 2 redundant places. [2023-08-27 10:12:53,805 INFO L231 Difference]: Finished difference. Result has 39 places, 29 transitions, 123 flow [2023-08-27 10:12:53,805 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=257, PETRI_DIFFERENCE_MINUEND_FLOW=115, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=123, PETRI_PLACES=39, PETRI_TRANSITIONS=29} [2023-08-27 10:12:53,807 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 3 predicate places. [2023-08-27 10:12:53,807 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 29 transitions, 123 flow [2023-08-27 10:12:53,807 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:12:53,808 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:12:53,808 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 10:12:53,808 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-27 10:12:53,808 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2023-08-27 10:12:53,808 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:12:53,808 INFO L85 PathProgramCache]: Analyzing trace with hash 737732533, now seen corresponding path program 1 times [2023-08-27 10:12:53,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:12:53,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792696453] [2023-08-27 10:12:53,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:12:53,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:12:53,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:12:54,707 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:12:54,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:12:54,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792696453] [2023-08-27 10:12:54,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [792696453] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:12:54,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:12:54,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-27 10:12:54,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90943957] [2023-08-27 10:12:54,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:12:54,708 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-27 10:12:54,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:12:54,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-27 10:12:54,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-08-27 10:12:54,710 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 257 [2023-08-27 10:12:54,710 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 29 transitions, 123 flow. Second operand has 7 states, 7 states have (on average 93.57142857142857) internal successors, (655), 7 states have internal predecessors, (655), 0 states have call successors, (0), 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:12:54,711 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:12:54,711 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 257 [2023-08-27 10:12:54,711 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:12:55,035 INFO L124 PetriNetUnfolderBase]: 550/890 cut-off events. [2023-08-27 10:12:55,035 INFO L125 PetriNetUnfolderBase]: For 577/577 co-relation queries the response was YES. [2023-08-27 10:12:55,037 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2569 conditions, 890 events. 550/890 cut-off events. For 577/577 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 4133 event pairs, 87 based on Foata normal form. 6/878 useless extension candidates. Maximal degree in co-relation 2554. Up to 573 conditions per place. [2023-08-27 10:12:55,041 INFO L140 encePairwiseOnDemand]: 250/257 looper letters, 56 selfloop transitions, 11 changer transitions 0/69 dead transitions. [2023-08-27 10:12:55,041 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 69 transitions, 407 flow [2023-08-27 10:12:55,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-27 10:12:55,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-27 10:12:55,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 606 transitions. [2023-08-27 10:12:55,043 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39299610894941633 [2023-08-27 10:12:55,043 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 606 transitions. [2023-08-27 10:12:55,043 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 606 transitions. [2023-08-27 10:12:55,044 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:12:55,044 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 606 transitions. [2023-08-27 10:12:55,045 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 101.0) internal successors, (606), 6 states have internal predecessors, (606), 0 states have call successors, (0), 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:12:55,047 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 257.0) internal successors, (1799), 7 states have internal predecessors, (1799), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:12:55,048 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 257.0) internal successors, (1799), 7 states have internal predecessors, (1799), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:12:55,048 INFO L175 Difference]: Start difference. First operand has 39 places, 29 transitions, 123 flow. Second operand 6 states and 606 transitions. [2023-08-27 10:12:55,048 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 69 transitions, 407 flow [2023-08-27 10:12:55,049 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 69 transitions, 399 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-27 10:12:55,050 INFO L231 Difference]: Finished difference. Result has 43 places, 38 transitions, 176 flow [2023-08-27 10:12:55,051 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=257, PETRI_DIFFERENCE_MINUEND_FLOW=119, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=176, PETRI_PLACES=43, PETRI_TRANSITIONS=38} [2023-08-27 10:12:55,051 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 7 predicate places. [2023-08-27 10:12:55,051 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 38 transitions, 176 flow [2023-08-27 10:12:55,052 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 93.57142857142857) internal successors, (655), 7 states have internal predecessors, (655), 0 states have call successors, (0), 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:12:55,052 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:12:55,052 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 10:12:55,052 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-27 10:12:55,052 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2023-08-27 10:12:55,053 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:12:55,053 INFO L85 PathProgramCache]: Analyzing trace with hash 254737719, now seen corresponding path program 2 times [2023-08-27 10:12:55,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:12:55,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499059316] [2023-08-27 10:12:55,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:12:55,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:12:55,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:12:55,859 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:12:55,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:12:55,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499059316] [2023-08-27 10:12:55,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1499059316] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:12:55,860 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:12:55,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-27 10:12:55,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049274534] [2023-08-27 10:12:55,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:12:55,860 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-27 10:12:55,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:12:55,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-27 10:12:55,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-08-27 10:12:55,862 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 257 [2023-08-27 10:12:55,862 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 38 transitions, 176 flow. Second operand has 7 states, 7 states have (on average 94.57142857142857) internal successors, (662), 7 states have internal predecessors, (662), 0 states have call successors, (0), 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:12:55,863 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:12:55,863 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 257 [2023-08-27 10:12:55,863 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:12:56,112 INFO L124 PetriNetUnfolderBase]: 547/891 cut-off events. [2023-08-27 10:12:56,112 INFO L125 PetriNetUnfolderBase]: For 737/737 co-relation queries the response was YES. [2023-08-27 10:12:56,114 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2792 conditions, 891 events. 547/891 cut-off events. For 737/737 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 4184 event pairs, 74 based on Foata normal form. 6/880 useless extension candidates. Maximal degree in co-relation 2776. Up to 596 conditions per place. [2023-08-27 10:12:56,119 INFO L140 encePairwiseOnDemand]: 252/257 looper letters, 52 selfloop transitions, 10 changer transitions 0/64 dead transitions. [2023-08-27 10:12:56,119 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 64 transitions, 399 flow [2023-08-27 10:12:56,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-27 10:12:56,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-27 10:12:56,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 512 transitions. [2023-08-27 10:12:56,121 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.398443579766537 [2023-08-27 10:12:56,121 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 512 transitions. [2023-08-27 10:12:56,121 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 512 transitions. [2023-08-27 10:12:56,121 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:12:56,121 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 512 transitions. [2023-08-27 10:12:56,123 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 102.4) internal successors, (512), 5 states have internal predecessors, (512), 0 states have call successors, (0), 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:12:56,124 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 257.0) internal successors, (1542), 6 states have internal predecessors, (1542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:12:56,125 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 257.0) internal successors, (1542), 6 states have internal predecessors, (1542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:12:56,125 INFO L175 Difference]: Start difference. First operand has 43 places, 38 transitions, 176 flow. Second operand 5 states and 512 transitions. [2023-08-27 10:12:56,125 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 64 transitions, 399 flow [2023-08-27 10:12:56,127 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 64 transitions, 399 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-27 10:12:56,128 INFO L231 Difference]: Finished difference. Result has 49 places, 42 transitions, 227 flow [2023-08-27 10:12:56,128 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=257, PETRI_DIFFERENCE_MINUEND_FLOW=176, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=227, PETRI_PLACES=49, PETRI_TRANSITIONS=42} [2023-08-27 10:12:56,129 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 13 predicate places. [2023-08-27 10:12:56,129 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 42 transitions, 227 flow [2023-08-27 10:12:56,129 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 94.57142857142857) internal successors, (662), 7 states have internal predecessors, (662), 0 states have call successors, (0), 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:12:56,129 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:12:56,129 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 10:12:56,129 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-27 10:12:56,130 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2023-08-27 10:12:56,130 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:12:56,130 INFO L85 PathProgramCache]: Analyzing trace with hash 1394926656, now seen corresponding path program 1 times [2023-08-27 10:12:56,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:12:56,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975307513] [2023-08-27 10:12:56,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:12:56,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:12:56,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:12:56,305 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:12:56,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:12:56,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975307513] [2023-08-27 10:12:56,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [975307513] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:12:56,306 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:12:56,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-27 10:12:56,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323328104] [2023-08-27 10:12:56,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:12:56,306 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-27 10:12:56,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:12:56,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-27 10:12:56,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-27 10:12:56,308 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 257 [2023-08-27 10:12:56,308 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 42 transitions, 227 flow. Second operand has 4 states, 4 states have (on average 112.0) internal successors, (448), 4 states have internal predecessors, (448), 0 states have call successors, (0), 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:12:56,308 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:12:56,308 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 257 [2023-08-27 10:12:56,308 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:12:56,534 INFO L124 PetriNetUnfolderBase]: 424/733 cut-off events. [2023-08-27 10:12:56,534 INFO L125 PetriNetUnfolderBase]: For 884/884 co-relation queries the response was YES. [2023-08-27 10:12:56,536 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2471 conditions, 733 events. 424/733 cut-off events. For 884/884 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 3397 event pairs, 74 based on Foata normal form. 59/770 useless extension candidates. Maximal degree in co-relation 2451. Up to 496 conditions per place. [2023-08-27 10:12:56,539 INFO L140 encePairwiseOnDemand]: 251/257 looper letters, 71 selfloop transitions, 8 changer transitions 3/84 dead transitions. [2023-08-27 10:12:56,540 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 84 transitions, 607 flow [2023-08-27 10:12:56,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-27 10:12:56,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-27 10:12:56,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 600 transitions. [2023-08-27 10:12:56,542 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4669260700389105 [2023-08-27 10:12:56,542 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 600 transitions. [2023-08-27 10:12:56,542 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 600 transitions. [2023-08-27 10:12:56,543 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:12:56,543 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 600 transitions. [2023-08-27 10:12:56,544 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 120.0) internal successors, (600), 5 states have internal predecessors, (600), 0 states have call successors, (0), 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:12:56,546 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 257.0) internal successors, (1542), 6 states have internal predecessors, (1542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:12:56,546 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 257.0) internal successors, (1542), 6 states have internal predecessors, (1542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:12:56,546 INFO L175 Difference]: Start difference. First operand has 49 places, 42 transitions, 227 flow. Second operand 5 states and 600 transitions. [2023-08-27 10:12:56,546 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 84 transitions, 607 flow [2023-08-27 10:12:56,549 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 84 transitions, 591 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-27 10:12:56,550 INFO L231 Difference]: Finished difference. Result has 55 places, 46 transitions, 277 flow [2023-08-27 10:12:56,550 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=257, PETRI_DIFFERENCE_MINUEND_FLOW=220, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=277, PETRI_PLACES=55, PETRI_TRANSITIONS=46} [2023-08-27 10:12:56,550 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 19 predicate places. [2023-08-27 10:12:56,551 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 46 transitions, 277 flow [2023-08-27 10:12:56,551 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 112.0) internal successors, (448), 4 states have internal predecessors, (448), 0 states have call successors, (0), 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:12:56,551 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:12:56,551 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 10:12:56,551 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-27 10:12:56,552 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2023-08-27 10:12:56,552 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:12:56,552 INFO L85 PathProgramCache]: Analyzing trace with hash -1922043067, now seen corresponding path program 1 times [2023-08-27 10:12:56,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:12:56,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925608621] [2023-08-27 10:12:56,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:12:56,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:12:56,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:12:56,708 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:12:56,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:12:56,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925608621] [2023-08-27 10:12:56,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1925608621] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:12:56,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:12:56,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-27 10:12:56,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092372553] [2023-08-27 10:12:56,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:12:56,710 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-27 10:12:56,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:12:56,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-27 10:12:56,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-27 10:12:56,714 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 257 [2023-08-27 10:12:56,716 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 46 transitions, 277 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:12:56,716 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:12:56,716 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 257 [2023-08-27 10:12:56,716 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:12:57,070 INFO L124 PetriNetUnfolderBase]: 1216/2070 cut-off events. [2023-08-27 10:12:57,070 INFO L125 PetriNetUnfolderBase]: For 3407/3407 co-relation queries the response was YES. [2023-08-27 10:12:57,076 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7479 conditions, 2070 events. 1216/2070 cut-off events. For 3407/3407 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 11305 event pairs, 319 based on Foata normal form. 34/2053 useless extension candidates. Maximal degree in co-relation 7455. Up to 995 conditions per place. [2023-08-27 10:12:57,086 INFO L140 encePairwiseOnDemand]: 253/257 looper letters, 105 selfloop transitions, 3 changer transitions 3/111 dead transitions. [2023-08-27 10:12:57,086 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 111 transitions, 899 flow [2023-08-27 10:12:57,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-27 10:12:57,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-27 10:12:57,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 501 transitions. [2023-08-27 10:12:57,088 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48735408560311283 [2023-08-27 10:12:57,088 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 501 transitions. [2023-08-27 10:12:57,089 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 501 transitions. [2023-08-27 10:12:57,089 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:12:57,089 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 501 transitions. [2023-08-27 10:12:57,090 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 125.25) internal successors, (501), 4 states have internal predecessors, (501), 0 states have call successors, (0), 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:12:57,091 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 257.0) internal successors, (1285), 5 states have internal predecessors, (1285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:12:57,092 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 257.0) internal successors, (1285), 5 states have internal predecessors, (1285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:12:57,092 INFO L175 Difference]: Start difference. First operand has 55 places, 46 transitions, 277 flow. Second operand 4 states and 501 transitions. [2023-08-27 10:12:57,092 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 111 transitions, 899 flow [2023-08-27 10:12:57,101 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 111 transitions, 870 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-27 10:12:57,104 INFO L231 Difference]: Finished difference. Result has 58 places, 48 transitions, 289 flow [2023-08-27 10:12:57,105 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=257, PETRI_DIFFERENCE_MINUEND_FLOW=266, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=289, PETRI_PLACES=58, PETRI_TRANSITIONS=48} [2023-08-27 10:12:57,106 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 22 predicate places. [2023-08-27 10:12:57,106 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 48 transitions, 289 flow [2023-08-27 10:12:57,106 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:12:57,106 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:12:57,106 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 10:12:57,106 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-27 10:12:57,106 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2023-08-27 10:12:57,107 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:12:57,107 INFO L85 PathProgramCache]: Analyzing trace with hash -1122687025, now seen corresponding path program 2 times [2023-08-27 10:12:57,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:12:57,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972195224] [2023-08-27 10:12:57,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:12:57,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:12:57,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:12:57,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:12:57,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:12:57,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972195224] [2023-08-27 10:12:57,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1972195224] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:12:57,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:12:57,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-27 10:12:57,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859496664] [2023-08-27 10:12:57,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:12:57,299 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-27 10:12:57,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:12:57,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-27 10:12:57,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-27 10:12:57,301 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 257 [2023-08-27 10:12:57,301 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 48 transitions, 289 flow. Second operand has 5 states, 5 states have (on average 111.6) internal successors, (558), 5 states have internal predecessors, (558), 0 states have call successors, (0), 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:12:57,301 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:12:57,301 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 257 [2023-08-27 10:12:57,302 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:12:57,575 INFO L124 PetriNetUnfolderBase]: 621/1179 cut-off events. [2023-08-27 10:12:57,576 INFO L125 PetriNetUnfolderBase]: For 1757/1759 co-relation queries the response was YES. [2023-08-27 10:12:57,579 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4456 conditions, 1179 events. 621/1179 cut-off events. For 1757/1759 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 6880 event pairs, 81 based on Foata normal form. 88/1181 useless extension candidates. Maximal degree in co-relation 4431. Up to 336 conditions per place. [2023-08-27 10:12:57,584 INFO L140 encePairwiseOnDemand]: 251/257 looper letters, 80 selfloop transitions, 15 changer transitions 3/101 dead transitions. [2023-08-27 10:12:57,584 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 101 transitions, 739 flow [2023-08-27 10:12:57,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-27 10:12:57,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-27 10:12:57,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 837 transitions. [2023-08-27 10:12:57,587 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4652584769316287 [2023-08-27 10:12:57,587 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 837 transitions. [2023-08-27 10:12:57,587 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 837 transitions. [2023-08-27 10:12:57,587 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:12:57,587 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 837 transitions. [2023-08-27 10:12:57,589 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 119.57142857142857) internal successors, (837), 7 states have internal predecessors, (837), 0 states have call successors, (0), 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:12:57,591 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 257.0) internal successors, (2056), 8 states have internal predecessors, (2056), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:12:57,592 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 257.0) internal successors, (2056), 8 states have internal predecessors, (2056), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:12:57,592 INFO L175 Difference]: Start difference. First operand has 58 places, 48 transitions, 289 flow. Second operand 7 states and 837 transitions. [2023-08-27 10:12:57,592 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 101 transitions, 739 flow [2023-08-27 10:12:57,596 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 101 transitions, 724 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-27 10:12:57,597 INFO L231 Difference]: Finished difference. Result has 64 places, 48 transitions, 326 flow [2023-08-27 10:12:57,597 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=257, PETRI_DIFFERENCE_MINUEND_FLOW=257, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=326, PETRI_PLACES=64, PETRI_TRANSITIONS=48} [2023-08-27 10:12:57,598 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 28 predicate places. [2023-08-27 10:12:57,598 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 48 transitions, 326 flow [2023-08-27 10:12:57,598 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 111.6) internal successors, (558), 5 states have internal predecessors, (558), 0 states have call successors, (0), 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:12:57,598 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:12:57,599 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:12:57,599 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-27 10:12:57,599 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting P2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2023-08-27 10:12:57,599 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:12:57,599 INFO L85 PathProgramCache]: Analyzing trace with hash -770855416, now seen corresponding path program 1 times [2023-08-27 10:12:57,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:12:57,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258577310] [2023-08-27 10:12:57,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:12:57,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:12:57,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:12:57,666 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 10:12:57,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:12:57,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258577310] [2023-08-27 10:12:57,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [258577310] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:12:57,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:12:57,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-27 10:12:57,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747460145] [2023-08-27 10:12:57,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:12:57,667 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-27 10:12:57,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:12:57,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-27 10:12:57,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-27 10:12:57,669 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 257 [2023-08-27 10:12:57,669 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 48 transitions, 326 flow. Second operand has 5 states, 5 states have (on average 113.8) internal successors, (569), 5 states have internal predecessors, (569), 0 states have call successors, (0), 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:12:57,669 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:12:57,669 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 257 [2023-08-27 10:12:57,669 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:12:57,879 INFO L124 PetriNetUnfolderBase]: 591/1091 cut-off events. [2023-08-27 10:12:57,879 INFO L125 PetriNetUnfolderBase]: For 2904/2906 co-relation queries the response was YES. [2023-08-27 10:12:57,883 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4752 conditions, 1091 events. 591/1091 cut-off events. For 2904/2906 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 6167 event pairs, 88 based on Foata normal form. 1/1064 useless extension candidates. Maximal degree in co-relation 4724. Up to 447 conditions per place. [2023-08-27 10:12:57,885 INFO L140 encePairwiseOnDemand]: 250/257 looper letters, 45 selfloop transitions, 10 changer transitions 14/72 dead transitions. [2023-08-27 10:12:57,885 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 72 transitions, 585 flow [2023-08-27 10:12:57,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-27 10:12:57,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-27 10:12:57,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 604 transitions. [2023-08-27 10:12:57,887 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47003891050583657 [2023-08-27 10:12:57,887 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 604 transitions. [2023-08-27 10:12:57,888 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 604 transitions. [2023-08-27 10:12:57,888 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:12:57,888 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 604 transitions. [2023-08-27 10:12:57,889 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 120.8) internal successors, (604), 5 states have internal predecessors, (604), 0 states have call successors, (0), 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:12:57,891 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 257.0) internal successors, (1542), 6 states have internal predecessors, (1542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:12:57,891 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 257.0) internal successors, (1542), 6 states have internal predecessors, (1542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:12:57,891 INFO L175 Difference]: Start difference. First operand has 64 places, 48 transitions, 326 flow. Second operand 5 states and 604 transitions. [2023-08-27 10:12:57,891 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 72 transitions, 585 flow [2023-08-27 10:12:57,900 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 72 transitions, 558 flow, removed 1 selfloop flow, removed 4 redundant places. [2023-08-27 10:12:57,901 INFO L231 Difference]: Finished difference. Result has 61 places, 32 transitions, 210 flow [2023-08-27 10:12:57,901 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=257, PETRI_DIFFERENCE_MINUEND_FLOW=281, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=210, PETRI_PLACES=61, PETRI_TRANSITIONS=32} [2023-08-27 10:12:57,902 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 25 predicate places. [2023-08-27 10:12:57,902 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 32 transitions, 210 flow [2023-08-27 10:12:57,902 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 113.8) internal successors, (569), 5 states have internal predecessors, (569), 0 states have call successors, (0), 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:12:57,902 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:12:57,902 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 10:12:57,902 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-27 10:12:57,902 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2023-08-27 10:12:57,903 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:12:57,903 INFO L85 PathProgramCache]: Analyzing trace with hash 229531192, now seen corresponding path program 1 times [2023-08-27 10:12:57,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:12:57,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104072453] [2023-08-27 10:12:57,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:12:57,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:12:57,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:12:58,118 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:12:58,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:12:58,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104072453] [2023-08-27 10:12:58,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [104072453] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:12:58,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:12:58,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-27 10:12:58,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584717863] [2023-08-27 10:12:58,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:12:58,120 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-27 10:12:58,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:12:58,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-27 10:12:58,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-27 10:12:58,122 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 257 [2023-08-27 10:12:58,122 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 32 transitions, 210 flow. Second operand has 6 states, 6 states have (on average 111.5) internal successors, (669), 6 states have internal predecessors, (669), 0 states have call successors, (0), 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:12:58,122 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:12:58,123 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 257 [2023-08-27 10:12:58,123 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:12:58,274 INFO L124 PetriNetUnfolderBase]: 270/527 cut-off events. [2023-08-27 10:12:58,275 INFO L125 PetriNetUnfolderBase]: For 1503/1503 co-relation queries the response was YES. [2023-08-27 10:12:58,276 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2286 conditions, 527 events. 270/527 cut-off events. For 1503/1503 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 2642 event pairs, 41 based on Foata normal form. 26/537 useless extension candidates. Maximal degree in co-relation 2258. Up to 221 conditions per place. [2023-08-27 10:12:58,278 INFO L140 encePairwiseOnDemand]: 251/257 looper letters, 37 selfloop transitions, 10 changer transitions 16/65 dead transitions. [2023-08-27 10:12:58,278 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 65 transitions, 495 flow [2023-08-27 10:12:58,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-27 10:12:58,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-27 10:12:58,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 813 transitions. [2023-08-27 10:12:58,280 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4519177320733741 [2023-08-27 10:12:58,280 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 813 transitions. [2023-08-27 10:12:58,280 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 813 transitions. [2023-08-27 10:12:58,281 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:12:58,281 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 813 transitions. [2023-08-27 10:12:58,282 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 116.14285714285714) internal successors, (813), 7 states have internal predecessors, (813), 0 states have call successors, (0), 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:12:58,284 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 257.0) internal successors, (2056), 8 states have internal predecessors, (2056), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:12:58,285 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 257.0) internal successors, (2056), 8 states have internal predecessors, (2056), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:12:58,285 INFO L175 Difference]: Start difference. First operand has 61 places, 32 transitions, 210 flow. Second operand 7 states and 813 transitions. [2023-08-27 10:12:58,285 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 65 transitions, 495 flow [2023-08-27 10:12:58,291 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 65 transitions, 408 flow, removed 20 selfloop flow, removed 12 redundant places. [2023-08-27 10:12:58,292 INFO L231 Difference]: Finished difference. Result has 51 places, 30 transitions, 171 flow [2023-08-27 10:12:58,292 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=257, PETRI_DIFFERENCE_MINUEND_FLOW=149, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=171, PETRI_PLACES=51, PETRI_TRANSITIONS=30} [2023-08-27 10:12:58,293 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 15 predicate places. [2023-08-27 10:12:58,293 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 30 transitions, 171 flow [2023-08-27 10:12:58,294 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 111.5) internal successors, (669), 6 states have internal predecessors, (669), 0 states have call successors, (0), 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:12:58,294 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:12:58,294 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:12:58,294 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-27 10:12:58,294 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2023-08-27 10:12:58,294 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:12:58,295 INFO L85 PathProgramCache]: Analyzing trace with hash -1752294179, now seen corresponding path program 1 times [2023-08-27 10:12:58,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:12:58,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660088751] [2023-08-27 10:12:58,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:12:58,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:12:58,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-27 10:12:58,350 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-27 10:12:58,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-27 10:12:58,447 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-27 10:12:58,447 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-27 10:12:58,448 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONASSERT (15 of 16 remaining) [2023-08-27 10:12:58,449 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 16 remaining) [2023-08-27 10:12:58,449 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 16 remaining) [2023-08-27 10:12:58,449 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 16 remaining) [2023-08-27 10:12:58,449 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 16 remaining) [2023-08-27 10:12:58,449 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 16 remaining) [2023-08-27 10:12:58,450 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 16 remaining) [2023-08-27 10:12:58,450 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 16 remaining) [2023-08-27 10:12:58,450 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (7 of 16 remaining) [2023-08-27 10:12:58,450 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 16 remaining) [2023-08-27 10:12:58,450 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 16 remaining) [2023-08-27 10:12:58,450 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 16 remaining) [2023-08-27 10:12:58,450 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 16 remaining) [2023-08-27 10:12:58,450 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 16 remaining) [2023-08-27 10:12:58,450 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 16 remaining) [2023-08-27 10:12:58,451 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 16 remaining) [2023-08-27 10:12:58,451 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-27 10:12:58,451 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 10:12:58,455 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-27 10:12:58,455 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-27 10:12:58,533 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.08 10:12:58 BasicIcfg [2023-08-27 10:12:58,533 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-27 10:12:58,534 INFO L158 Benchmark]: Toolchain (without parser) took 15169.11ms. Allocated memory was 356.5MB in the beginning and 645.9MB in the end (delta: 289.4MB). Free memory was 310.8MB in the beginning and 500.9MB in the end (delta: -190.1MB). Peak memory consumption was 101.3MB. Max. memory is 16.0GB. [2023-08-27 10:12:58,534 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 356.5MB. Free memory is still 333.7MB. There was no memory consumed. Max. memory is 16.0GB. [2023-08-27 10:12:58,534 INFO L158 Benchmark]: CACSL2BoogieTranslator took 546.55ms. Allocated memory is still 356.5MB. Free memory was 310.3MB in the beginning and 329.4MB in the end (delta: -19.0MB). Peak memory consumption was 27.7MB. Max. memory is 16.0GB. [2023-08-27 10:12:58,534 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.93ms. Allocated memory is still 356.5MB. Free memory was 329.4MB in the beginning and 327.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-27 10:12:58,534 INFO L158 Benchmark]: Boogie Preprocessor took 34.03ms. Allocated memory is still 356.5MB. Free memory was 327.3MB in the beginning and 325.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-27 10:12:58,535 INFO L158 Benchmark]: RCFGBuilder took 866.05ms. Allocated memory is still 356.5MB. Free memory was 324.5MB in the beginning and 325.1MB in the end (delta: -631.0kB). Peak memory consumption was 58.5MB. Max. memory is 16.0GB. [2023-08-27 10:12:58,535 INFO L158 Benchmark]: TraceAbstraction took 13673.43ms. Allocated memory was 356.5MB in the beginning and 645.9MB in the end (delta: 289.4MB). Free memory was 325.1MB in the beginning and 500.9MB in the end (delta: -175.8MB). Peak memory consumption was 113.6MB. Max. memory is 16.0GB. [2023-08-27 10:12:58,536 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.13ms. Allocated memory is still 356.5MB. Free memory is still 333.7MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 546.55ms. Allocated memory is still 356.5MB. Free memory was 310.3MB in the beginning and 329.4MB in the end (delta: -19.0MB). Peak memory consumption was 27.7MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 40.93ms. Allocated memory is still 356.5MB. Free memory was 329.4MB in the beginning and 327.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 34.03ms. Allocated memory is still 356.5MB. Free memory was 327.3MB in the beginning and 325.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 866.05ms. Allocated memory is still 356.5MB. Free memory was 324.5MB in the beginning and 325.1MB in the end (delta: -631.0kB). Peak memory consumption was 58.5MB. Max. memory is 16.0GB. * TraceAbstraction took 13673.43ms. Allocated memory was 356.5MB in the beginning and 645.9MB in the end (delta: 289.4MB). Free memory was 325.1MB in the beginning and 500.9MB in the end (delta: -175.8MB). Peak memory consumption was 113.6MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 268]: Unsoundness Warning unspecified type, defaulting to int C: short [268] - GenericResultAtLocation [Line: 268]: Unsoundness Warning unspecified type, defaulting to int C: short [268] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6.3s, 138 PlacesBefore, 36 PlacesAfterwards, 131 TransitionsBefore, 26 TransitionsAfterwards, 2416 CoEnabledTransitionPairs, 8 FixpointIterations, 57 TrivialSequentialCompositions, 51 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 12 ConcurrentYvCompositions, 3 ChoiceCompositions, 123 TotalNumberOfCompositions, 8678 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3151, independent: 2852, independent conditional: 0, independent unconditional: 2852, dependent: 299, dependent conditional: 0, dependent unconditional: 299, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1379, independent: 1326, independent conditional: 0, independent unconditional: 1326, dependent: 53, dependent conditional: 0, dependent unconditional: 53, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3151, independent: 1526, independent conditional: 0, independent unconditional: 1526, dependent: 246, dependent conditional: 0, dependent unconditional: 246, unknown: 1379, unknown conditional: 0, unknown unconditional: 1379] , Statistics on independence cache: Total cache size (in pairs): 119, Positive cache size: 100, Positive conditional cache size: 0, Positive unconditional cache size: 100, Negative cache size: 19, Negative conditional cache size: 0, Negative unconditional cache size: 19, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 18]: assertion can be violated assertion can be violated We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L713] 0 _Bool __unbuffered_p0_EAX$flush_delayed; [L714] 0 int __unbuffered_p0_EAX$mem_tmp; [L715] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd0; [L716] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd1; [L717] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd2; [L718] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd3; [L719] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd0; [L720] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd1; [L721] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd2; [L722] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd3; [L723] 0 _Bool __unbuffered_p0_EAX$read_delayed; [L724] 0 int *__unbuffered_p0_EAX$read_delayed_var; [L725] 0 int __unbuffered_p0_EAX$w_buff0; [L726] 0 _Bool __unbuffered_p0_EAX$w_buff0_used; [L727] 0 int __unbuffered_p0_EAX$w_buff1; [L728] 0 _Bool __unbuffered_p0_EAX$w_buff1_used; [L730] 0 int __unbuffered_p1_EAX = 0; [L732] 0 int __unbuffered_p1_EBX = 0; [L733] 0 _Bool main$tmp_guard0; [L734] 0 _Bool main$tmp_guard1; [L736] 0 int x = 0; [L737] 0 _Bool x$flush_delayed; [L738] 0 int x$mem_tmp; [L739] 0 _Bool x$r_buff0_thd0; [L740] 0 _Bool x$r_buff0_thd1; [L741] 0 _Bool x$r_buff0_thd2; [L742] 0 _Bool x$r_buff0_thd3; [L743] 0 _Bool x$r_buff1_thd0; [L744] 0 _Bool x$r_buff1_thd1; [L745] 0 _Bool x$r_buff1_thd2; [L746] 0 _Bool x$r_buff1_thd3; [L747] 0 _Bool x$read_delayed; [L748] 0 int *x$read_delayed_var; [L749] 0 int x$w_buff0; [L750] 0 _Bool x$w_buff0_used; [L751] 0 int x$w_buff1; [L752] 0 _Bool x$w_buff1_used; [L754] 0 int y = 0; [L755] 0 _Bool weak$$choice0; [L756] 0 _Bool weak$$choice1; [L757] 0 _Bool weak$$choice2; [L847] 0 pthread_t t1693; [L848] FCALL, FORK 0 pthread_create(&t1693, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1693, ((void *)0), P0, ((void *)0))=-3, t1693={7:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L849] 0 pthread_t t1694; [L850] FCALL, FORK 0 pthread_create(&t1694, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1694, ((void *)0), P1, ((void *)0))=-2, t1693={7:0}, t1694={5:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L851] 0 pthread_t t1695; [L761] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L762] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L763] 1 x$flush_delayed = weak$$choice2 [L764] EXPR 1 \read(x) [L764] 1 x$mem_tmp = x [L765] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L765] EXPR 1 \read(x) [L765] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L765] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L766] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L767] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L768] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L769] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L770] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L771] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L772] 1 __unbuffered_p0_EAX$read_delayed = (_Bool)1 [L773] 1 __unbuffered_p0_EAX$read_delayed_var = &x [L774] EXPR 1 \read(x) [L774] 1 __unbuffered_p0_EAX = x [L775] EXPR 1 x$flush_delayed ? x$mem_tmp : x [L775] EXPR 1 \read(x) [L775] EXPR 1 x$flush_delayed ? x$mem_tmp : x [L775] 1 x = x$flush_delayed ? x$mem_tmp : x [L776] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L779] 1 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L791] 2 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L794] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L797] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L798] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L799] 2 x$flush_delayed = weak$$choice2 [L800] EXPR 2 \read(x) [L800] 2 x$mem_tmp = x [L801] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L801] EXPR 2 \read(x) [L801] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L801] 2 x = !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L802] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L803] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L804] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L805] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L806] 2 x$r_buff0_thd2 = weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L807] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L808] EXPR 2 \read(x) [L808] 2 __unbuffered_p1_EBX = x [L809] EXPR 2 x$flush_delayed ? x$mem_tmp : x [L809] EXPR 2 \read(x) [L809] EXPR 2 x$flush_delayed ? x$mem_tmp : x [L809] 2 x = x$flush_delayed ? x$mem_tmp : x [L810] 2 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L852] FCALL, FORK 0 pthread_create(&t1695, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1695, ((void *)0), P2, ((void *)0))=-1, t1693={7:0}, t1694={5:0}, t1695={6:0}, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L822] 3 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L825] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L825] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L825] EXPR 3 \read(x) [L825] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L825] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L825] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L826] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L827] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L828] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L829] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L784] EXPR 1 __unbuffered_cnt + 1 [L784] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L786] 1 return 0; [L815] EXPR 2 __unbuffered_cnt + 1 [L815] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L817] 2 return 0; [L832] EXPR 3 __unbuffered_cnt + 1 [L832] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L834] 3 return 0; [L854] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L856] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L856] RET 0 assume_abort_if_not(main$tmp_guard0) [L858] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L858] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L858] EXPR 0 \read(x) [L858] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L858] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L858] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L859] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L860] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L861] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L862] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1693={7:0}, t1694={5:0}, t1695={6:0}, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L865] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L866] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L866] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L866] EXPR 0 \read(*__unbuffered_p0_EAX$read_delayed_var) [L866] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L866] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L866] 0 __unbuffered_p0_EAX = __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L867] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 1 && __unbuffered_p1_EAX == 2 && __unbuffered_p1_EBX == 0) [L869] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] CALL 0 reach_error() [L18] COND FALSE 0 !(0) [L18] 0 __assert_fail ("0", "rfi006_rmo.c", 9, __extension__ __PRETTY_FUNCTION__) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice1=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] - UnprovableResult [Line: 784]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 784]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 815]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 815]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 832]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 832]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 848]: 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: 852]: 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: 850]: 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 7 procedures, 163 locations, 16 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: 13.5s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 3.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 6.4s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 271 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 271 mSDsluCounter, 7 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1 mSDsCounter, 59 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 893 IncrementalHoareTripleChecker+Invalid, 952 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 59 mSolverCounterUnsat, 6 mSDtfsCounter, 893 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 44 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=326occurred in iteration=10, InterpolantAutomatonStates: 56, 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, 3.0s InterpolantComputationTime, 166 NumberOfCodeBlocks, 166 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 135 ConstructedInterpolants, 0 QuantifiedInterpolants, 871 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-08-27 10:12:58,557 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...