/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 INSUFFICIENT_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/mix052_tso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-27 03:49:12,632 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-27 03:49:12,666 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 03:49:12,669 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-27 03:49:12,669 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-27 03:49:12,690 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-27 03:49:12,691 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-27 03:49:12,691 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-27 03:49:12,691 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-27 03:49:12,694 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-27 03:49:12,694 INFO L153 SettingsManager]: * Use SBE=true [2023-08-27 03:49:12,695 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-27 03:49:12,695 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-27 03:49:12,696 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-27 03:49:12,696 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-27 03:49:12,696 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-27 03:49:12,696 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-27 03:49:12,696 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-27 03:49:12,696 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-27 03:49:12,697 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-27 03:49:12,697 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-27 03:49:12,697 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-27 03:49:12,698 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-27 03:49:12,698 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-27 03:49:12,698 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-27 03:49:12,698 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-27 03:49:12,698 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-27 03:49:12,699 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-27 03:49:12,699 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-27 03:49:12,699 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-27 03:49:12,700 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-27 03:49:12,700 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-27 03:49:12,700 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-27 03:49:12,700 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-27 03:49:12,700 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-27 03:49:12,701 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 -> INSUFFICIENT_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 03:49:12,942 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-27 03:49:12,956 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-27 03:49:12,958 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-27 03:49:12,958 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-27 03:49:12,959 INFO L274 PluginConnector]: CDTParser initialized [2023-08-27 03:49:12,960 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix052_tso.oepc.i [2023-08-27 03:49:14,001 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-27 03:49:14,225 INFO L384 CDTParser]: Found 1 translation units. [2023-08-27 03:49:14,225 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix052_tso.oepc.i [2023-08-27 03:49:14,262 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/85c2e327d/829ed8dadb9b4411be7956f70a5eebb4/FLAG1f0dfa594 [2023-08-27 03:49:14,275 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/85c2e327d/829ed8dadb9b4411be7956f70a5eebb4 [2023-08-27 03:49:14,279 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-27 03:49:14,280 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-27 03:49:14,282 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-27 03:49:14,282 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-27 03:49:14,284 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-27 03:49:14,285 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 03:49:14" (1/1) ... [2023-08-27 03:49:14,286 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@152a2423 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:49:14, skipping insertion in model container [2023-08-27 03:49:14,286 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 03:49:14" (1/1) ... [2023-08-27 03:49:14,334 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-27 03:49:14,636 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-27 03:49:14,647 INFO L201 MainTranslator]: Completed pre-run [2023-08-27 03:49:14,671 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-27 03:49:14,673 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-27 03:49:14,704 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-27 03:49:14,726 WARN L669 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-27 03:49:14,726 WARN L669 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-27 03:49:14,731 INFO L206 MainTranslator]: Completed translation [2023-08-27 03:49:14,733 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:49:14 WrapperNode [2023-08-27 03:49:14,733 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-27 03:49:14,734 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-27 03:49:14,734 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-27 03:49:14,734 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-27 03:49:14,740 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:49:14" (1/1) ... [2023-08-27 03:49:14,761 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:49:14" (1/1) ... [2023-08-27 03:49:14,780 INFO L138 Inliner]: procedures = 176, calls = 55, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 153 [2023-08-27 03:49:14,780 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-27 03:49:14,786 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-27 03:49:14,786 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-27 03:49:14,786 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-27 03:49:14,792 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:49:14" (1/1) ... [2023-08-27 03:49:14,792 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:49:14" (1/1) ... [2023-08-27 03:49:14,803 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:49:14" (1/1) ... [2023-08-27 03:49:14,803 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:49:14" (1/1) ... [2023-08-27 03:49:14,809 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:49:14" (1/1) ... [2023-08-27 03:49:14,810 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:49:14" (1/1) ... [2023-08-27 03:49:14,812 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:49:14" (1/1) ... [2023-08-27 03:49:14,829 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:49:14" (1/1) ... [2023-08-27 03:49:14,832 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-27 03:49:14,832 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-27 03:49:14,833 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-27 03:49:14,833 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-27 03:49:14,833 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:49:14" (1/1) ... [2023-08-27 03:49:14,837 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-27 03:49:14,846 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 03:49:14,856 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 03:49:14,906 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 03:49:14,915 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-27 03:49:14,916 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-27 03:49:14,916 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-27 03:49:14,916 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-27 03:49:14,916 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-27 03:49:14,916 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-27 03:49:14,916 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-27 03:49:14,917 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-27 03:49:14,917 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-27 03:49:14,917 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-27 03:49:14,917 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-27 03:49:14,917 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-27 03:49:14,917 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-27 03:49:14,917 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-27 03:49:14,917 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-27 03:49:14,919 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 03:49:15,009 INFO L236 CfgBuilder]: Building ICFG [2023-08-27 03:49:15,010 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-27 03:49:15,209 INFO L277 CfgBuilder]: Performing block encoding [2023-08-27 03:49:15,279 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-27 03:49:15,279 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-27 03:49:15,281 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 03:49:15 BoogieIcfgContainer [2023-08-27 03:49:15,281 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-27 03:49:15,282 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-27 03:49:15,282 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-27 03:49:15,284 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-27 03:49:15,284 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.08 03:49:14" (1/3) ... [2023-08-27 03:49:15,285 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d699b34 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.08 03:49:15, skipping insertion in model container [2023-08-27 03:49:15,285 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:49:14" (2/3) ... [2023-08-27 03:49:15,285 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d699b34 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.08 03:49:15, skipping insertion in model container [2023-08-27 03:49:15,285 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 03:49:15" (3/3) ... [2023-08-27 03:49:15,286 INFO L112 eAbstractionObserver]: Analyzing ICFG mix052_tso.oepc.i [2023-08-27 03:49:15,297 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-27 03:49:15,297 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations. [2023-08-27 03:49:15,298 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-27 03:49:15,347 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-27 03:49:15,378 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 125 places, 118 transitions, 251 flow [2023-08-27 03:49:15,426 INFO L124 PetriNetUnfolderBase]: 3/115 cut-off events. [2023-08-27 03:49:15,427 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-27 03:49:15,431 INFO L83 FinitePrefix]: Finished finitePrefix Result has 125 conditions, 115 events. 3/115 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 91 event pairs, 0 based on Foata normal form. 0/104 useless extension candidates. Maximal degree in co-relation 79. Up to 2 conditions per place. [2023-08-27 03:49:15,431 INFO L82 GeneralOperation]: Start removeDead. Operand has 125 places, 118 transitions, 251 flow [2023-08-27 03:49:15,434 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 122 places, 115 transitions, 239 flow [2023-08-27 03:49:15,437 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-27 03:49:15,446 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 122 places, 115 transitions, 239 flow [2023-08-27 03:49:15,449 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 122 places, 115 transitions, 239 flow [2023-08-27 03:49:15,449 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 122 places, 115 transitions, 239 flow [2023-08-27 03:49:15,480 INFO L124 PetriNetUnfolderBase]: 3/115 cut-off events. [2023-08-27 03:49:15,480 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-27 03:49:15,480 INFO L83 FinitePrefix]: Finished finitePrefix Result has 125 conditions, 115 events. 3/115 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 91 event pairs, 0 based on Foata normal form. 0/104 useless extension candidates. Maximal degree in co-relation 79. Up to 2 conditions per place. [2023-08-27 03:49:15,482 INFO L119 LiptonReduction]: Number of co-enabled transitions 2762 [2023-08-27 03:49:18,506 INFO L134 LiptonReduction]: Checked pairs total: 10167 [2023-08-27 03:49:18,506 INFO L136 LiptonReduction]: Total number of compositions: 101 [2023-08-27 03:49:18,521 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-27 03:49:18,525 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;@76d4dd3b, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-27 03:49:18,526 INFO L358 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2023-08-27 03:49:18,532 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-27 03:49:18,532 INFO L124 PetriNetUnfolderBase]: 0/7 cut-off events. [2023-08-27 03:49:18,533 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-27 03:49:18,533 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:49:18,533 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-27 03:49:18,533 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-27 03:49:18,537 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:49:18,537 INFO L85 PathProgramCache]: Analyzing trace with hash 514164562, now seen corresponding path program 1 times [2023-08-27 03:49:18,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:49:18,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518238987] [2023-08-27 03:49:18,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:49:18,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:49:18,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:49:18,883 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 03:49:18,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:49:18,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518238987] [2023-08-27 03:49:18,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [518238987] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:49:18,884 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:49:18,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-27 03:49:18,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415443042] [2023-08-27 03:49:18,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:49:18,891 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-27 03:49:18,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:49:18,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-27 03:49:18,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-27 03:49:18,911 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 219 [2023-08-27 03:49:18,914 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 31 transitions, 71 flow. Second operand has 3 states, 3 states have (on average 98.66666666666667) internal successors, (296), 3 states have internal predecessors, (296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:49:18,914 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:49:18,914 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 219 [2023-08-27 03:49:18,915 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:49:19,257 INFO L124 PetriNetUnfolderBase]: 1764/2909 cut-off events. [2023-08-27 03:49:19,257 INFO L125 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES. [2023-08-27 03:49:19,263 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5551 conditions, 2909 events. 1764/2909 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 174. Compared 17416 event pairs, 232 based on Foata normal form. 0/2306 useless extension candidates. Maximal degree in co-relation 5540. Up to 2173 conditions per place. [2023-08-27 03:49:19,275 INFO L140 encePairwiseOnDemand]: 215/219 looper letters, 36 selfloop transitions, 2 changer transitions 0/44 dead transitions. [2023-08-27 03:49:19,275 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 44 transitions, 176 flow [2023-08-27 03:49:19,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-27 03:49:19,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-27 03:49:19,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 332 transitions. [2023-08-27 03:49:19,287 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5053272450532724 [2023-08-27 03:49:19,287 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 332 transitions. [2023-08-27 03:49:19,287 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 332 transitions. [2023-08-27 03:49:19,289 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:49:19,291 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 332 transitions. [2023-08-27 03:49:19,295 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 110.66666666666667) internal successors, (332), 3 states have internal predecessors, (332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:49:19,298 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 219.0) internal successors, (876), 4 states have internal predecessors, (876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:49:19,298 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 219.0) internal successors, (876), 4 states have internal predecessors, (876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:49:19,299 INFO L175 Difference]: Start difference. First operand has 40 places, 31 transitions, 71 flow. Second operand 3 states and 332 transitions. [2023-08-27 03:49:19,300 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 44 transitions, 176 flow [2023-08-27 03:49:19,302 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 44 transitions, 172 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-27 03:49:19,303 INFO L231 Difference]: Finished difference. Result has 38 places, 29 transitions, 68 flow [2023-08-27 03:49:19,304 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=219, PETRI_DIFFERENCE_MINUEND_FLOW=64, 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=68, PETRI_PLACES=38, PETRI_TRANSITIONS=29} [2023-08-27 03:49:19,307 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, -2 predicate places. [2023-08-27 03:49:19,307 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 29 transitions, 68 flow [2023-08-27 03:49:19,307 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 98.66666666666667) internal successors, (296), 3 states have internal predecessors, (296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:49:19,307 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:49:19,308 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-08-27 03:49:19,308 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-27 03:49:19,308 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-27 03:49:19,314 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:49:19,314 INFO L85 PathProgramCache]: Analyzing trace with hash -1242020802, now seen corresponding path program 1 times [2023-08-27 03:49:19,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:49:19,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608771165] [2023-08-27 03:49:19,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:49:19,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:49:19,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:49:19,378 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 03:49:19,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:49:19,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608771165] [2023-08-27 03:49:19,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [608771165] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:49:19,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:49:19,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-27 03:49:19,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345718416] [2023-08-27 03:49:19,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:49:19,379 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-27 03:49:19,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:49:19,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-27 03:49:19,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-27 03:49:19,380 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 219 [2023-08-27 03:49:19,380 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 29 transitions, 68 flow. Second operand has 3 states, 3 states have (on average 94.66666666666667) internal successors, (284), 3 states have internal predecessors, (284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:49:19,381 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:49:19,381 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 219 [2023-08-27 03:49:19,381 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:49:19,613 INFO L124 PetriNetUnfolderBase]: 1421/2192 cut-off events. [2023-08-27 03:49:19,613 INFO L125 PetriNetUnfolderBase]: For 125/125 co-relation queries the response was YES. [2023-08-27 03:49:19,615 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4552 conditions, 2192 events. 1421/2192 cut-off events. For 125/125 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 11053 event pairs, 440 based on Foata normal form. 0/1656 useless extension candidates. Maximal degree in co-relation 4542. Up to 1666 conditions per place. [2023-08-27 03:49:19,621 INFO L140 encePairwiseOnDemand]: 209/219 looper letters, 40 selfloop transitions, 4 changer transitions 0/47 dead transitions. [2023-08-27 03:49:19,621 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 47 transitions, 198 flow [2023-08-27 03:49:19,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-27 03:49:19,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-27 03:49:19,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 329 transitions. [2023-08-27 03:49:19,624 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5007610350076104 [2023-08-27 03:49:19,624 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 329 transitions. [2023-08-27 03:49:19,624 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 329 transitions. [2023-08-27 03:49:19,624 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:49:19,624 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 329 transitions. [2023-08-27 03:49:19,625 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 109.66666666666667) internal successors, (329), 3 states have internal predecessors, (329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:49:19,627 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 219.0) internal successors, (876), 4 states have internal predecessors, (876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:49:19,627 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 219.0) internal successors, (876), 4 states have internal predecessors, (876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:49:19,627 INFO L175 Difference]: Start difference. First operand has 38 places, 29 transitions, 68 flow. Second operand 3 states and 329 transitions. [2023-08-27 03:49:19,628 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 47 transitions, 198 flow [2023-08-27 03:49:19,629 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 47 transitions, 192 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-27 03:49:19,630 INFO L231 Difference]: Finished difference. Result has 39 places, 32 transitions, 100 flow [2023-08-27 03:49:19,630 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=219, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=100, PETRI_PLACES=39, PETRI_TRANSITIONS=32} [2023-08-27 03:49:19,631 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, -1 predicate places. [2023-08-27 03:49:19,631 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 32 transitions, 100 flow [2023-08-27 03:49:19,633 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 94.66666666666667) internal successors, (284), 3 states have internal predecessors, (284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:49:19,634 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:49:19,634 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:49:19,634 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-27 03:49:19,638 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-27 03:49:19,638 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:49:19,638 INFO L85 PathProgramCache]: Analyzing trace with hash -1985969404, now seen corresponding path program 1 times [2023-08-27 03:49:19,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:49:19,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244257402] [2023-08-27 03:49:19,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:49:19,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:49:19,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:49:19,987 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 03:49:19,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:49:19,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244257402] [2023-08-27 03:49:19,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1244257402] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:49:19,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:49:19,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-27 03:49:19,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366513851] [2023-08-27 03:49:19,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:49:19,989 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-27 03:49:19,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:49:19,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-27 03:49:19,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-27 03:49:19,990 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 219 [2023-08-27 03:49:19,991 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 32 transitions, 100 flow. Second operand has 4 states, 4 states have (on average 92.5) internal successors, (370), 4 states have internal predecessors, (370), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:49:19,991 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:49:19,991 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 219 [2023-08-27 03:49:19,991 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:49:20,285 INFO L124 PetriNetUnfolderBase]: 1665/2668 cut-off events. [2023-08-27 03:49:20,286 INFO L125 PetriNetUnfolderBase]: For 287/339 co-relation queries the response was YES. [2023-08-27 03:49:20,289 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6304 conditions, 2668 events. 1665/2668 cut-off events. For 287/339 co-relation queries the response was YES. Maximal size of possible extension queue 144. Compared 14468 event pairs, 478 based on Foata normal form. 0/2286 useless extension candidates. Maximal degree in co-relation 6293. Up to 1675 conditions per place. [2023-08-27 03:49:20,299 INFO L140 encePairwiseOnDemand]: 213/219 looper letters, 57 selfloop transitions, 7 changer transitions 0/69 dead transitions. [2023-08-27 03:49:20,299 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 69 transitions, 333 flow [2023-08-27 03:49:20,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-27 03:49:20,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-27 03:49:20,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 510 transitions. [2023-08-27 03:49:20,301 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4657534246575342 [2023-08-27 03:49:20,301 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 510 transitions. [2023-08-27 03:49:20,301 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 510 transitions. [2023-08-27 03:49:20,301 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:49:20,301 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 510 transitions. [2023-08-27 03:49:20,302 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 102.0) internal successors, (510), 5 states have internal predecessors, (510), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:49:20,303 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 219.0) internal successors, (1314), 6 states have internal predecessors, (1314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:49:20,304 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 219.0) internal successors, (1314), 6 states have internal predecessors, (1314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:49:20,304 INFO L175 Difference]: Start difference. First operand has 39 places, 32 transitions, 100 flow. Second operand 5 states and 510 transitions. [2023-08-27 03:49:20,304 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 69 transitions, 333 flow [2023-08-27 03:49:20,307 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 69 transitions, 324 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-27 03:49:20,308 INFO L231 Difference]: Finished difference. Result has 46 places, 38 transitions, 152 flow [2023-08-27 03:49:20,308 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=219, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=152, PETRI_PLACES=46, PETRI_TRANSITIONS=38} [2023-08-27 03:49:20,308 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 6 predicate places. [2023-08-27 03:49:20,308 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 38 transitions, 152 flow [2023-08-27 03:49:20,309 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 92.5) internal successors, (370), 4 states have internal predecessors, (370), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:49:20,309 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:49:20,309 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:49:20,309 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-27 03:49:20,309 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-27 03:49:20,309 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:49:20,309 INFO L85 PathProgramCache]: Analyzing trace with hash -1435530466, now seen corresponding path program 1 times [2023-08-27 03:49:20,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:49:20,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267621257] [2023-08-27 03:49:20,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:49:20,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:49:20,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:49:20,681 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 03:49:20,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:49:20,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267621257] [2023-08-27 03:49:20,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [267621257] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:49:20,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:49:20,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-27 03:49:20,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532271046] [2023-08-27 03:49:20,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:49:20,683 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-27 03:49:20,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:49:20,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-27 03:49:20,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-08-27 03:49:20,684 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 219 [2023-08-27 03:49:20,684 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 38 transitions, 152 flow. Second operand has 6 states, 6 states have (on average 89.83333333333333) internal successors, (539), 6 states have internal predecessors, (539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:49:20,684 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:49:20,684 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 219 [2023-08-27 03:49:20,684 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:49:21,058 INFO L124 PetriNetUnfolderBase]: 1972/3145 cut-off events. [2023-08-27 03:49:21,058 INFO L125 PetriNetUnfolderBase]: For 2181/2239 co-relation queries the response was YES. [2023-08-27 03:49:21,063 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8684 conditions, 3145 events. 1972/3145 cut-off events. For 2181/2239 co-relation queries the response was YES. Maximal size of possible extension queue 182. Compared 17331 event pairs, 657 based on Foata normal form. 91/2879 useless extension candidates. Maximal degree in co-relation 8668. Up to 1754 conditions per place. [2023-08-27 03:49:21,077 INFO L140 encePairwiseOnDemand]: 211/219 looper letters, 71 selfloop transitions, 17 changer transitions 0/93 dead transitions. [2023-08-27 03:49:21,077 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 93 transitions, 522 flow [2023-08-27 03:49:21,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-27 03:49:21,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-27 03:49:21,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 690 transitions. [2023-08-27 03:49:21,079 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4500978473581213 [2023-08-27 03:49:21,079 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 690 transitions. [2023-08-27 03:49:21,079 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 690 transitions. [2023-08-27 03:49:21,080 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:49:21,080 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 690 transitions. [2023-08-27 03:49:21,081 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 98.57142857142857) internal successors, (690), 7 states have internal predecessors, (690), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:49:21,083 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 219.0) internal successors, (1752), 8 states have internal predecessors, (1752), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:49:21,083 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 219.0) internal successors, (1752), 8 states have internal predecessors, (1752), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:49:21,083 INFO L175 Difference]: Start difference. First operand has 46 places, 38 transitions, 152 flow. Second operand 7 states and 690 transitions. [2023-08-27 03:49:21,083 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 93 transitions, 522 flow [2023-08-27 03:49:21,087 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 93 transitions, 522 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-27 03:49:21,088 INFO L231 Difference]: Finished difference. Result has 58 places, 55 transitions, 322 flow [2023-08-27 03:49:21,088 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=219, PETRI_DIFFERENCE_MINUEND_FLOW=152, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=322, PETRI_PLACES=58, PETRI_TRANSITIONS=55} [2023-08-27 03:49:21,089 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 18 predicate places. [2023-08-27 03:49:21,089 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 55 transitions, 322 flow [2023-08-27 03:49:21,089 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 89.83333333333333) internal successors, (539), 6 states have internal predecessors, (539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:49:21,089 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:49:21,089 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:49:21,089 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-27 03:49:21,090 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-27 03:49:21,090 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:49:21,090 INFO L85 PathProgramCache]: Analyzing trace with hash 2142259998, now seen corresponding path program 1 times [2023-08-27 03:49:21,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:49:21,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140164765] [2023-08-27 03:49:21,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:49:21,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:49:21,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:49:21,234 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 03:49:21,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:49:21,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140164765] [2023-08-27 03:49:21,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1140164765] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:49:21,235 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:49:21,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-27 03:49:21,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188293482] [2023-08-27 03:49:21,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:49:21,235 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-27 03:49:21,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:49:21,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-27 03:49:21,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-27 03:49:21,236 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 219 [2023-08-27 03:49:21,237 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 55 transitions, 322 flow. Second operand has 5 states, 5 states have (on average 92.4) internal successors, (462), 5 states have internal predecessors, (462), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:49:21,237 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:49:21,237 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 219 [2023-08-27 03:49:21,237 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:49:21,644 INFO L124 PetriNetUnfolderBase]: 2167/3506 cut-off events. [2023-08-27 03:49:21,644 INFO L125 PetriNetUnfolderBase]: For 7105/7173 co-relation queries the response was YES. [2023-08-27 03:49:21,651 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11602 conditions, 3506 events. 2167/3506 cut-off events. For 7105/7173 co-relation queries the response was YES. Maximal size of possible extension queue 206. Compared 20066 event pairs, 434 based on Foata normal form. 82/3190 useless extension candidates. Maximal degree in co-relation 11578. Up to 1981 conditions per place. [2023-08-27 03:49:21,667 INFO L140 encePairwiseOnDemand]: 210/219 looper letters, 95 selfloop transitions, 33 changer transitions 0/133 dead transitions. [2023-08-27 03:49:21,667 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 133 transitions, 936 flow [2023-08-27 03:49:21,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-27 03:49:21,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-27 03:49:21,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 714 transitions. [2023-08-27 03:49:21,669 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4657534246575342 [2023-08-27 03:49:21,669 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 714 transitions. [2023-08-27 03:49:21,669 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 714 transitions. [2023-08-27 03:49:21,669 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:49:21,670 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 714 transitions. [2023-08-27 03:49:21,671 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 102.0) internal successors, (714), 7 states have internal predecessors, (714), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:49:21,672 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 219.0) internal successors, (1752), 8 states have internal predecessors, (1752), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:49:21,673 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 219.0) internal successors, (1752), 8 states have internal predecessors, (1752), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:49:21,673 INFO L175 Difference]: Start difference. First operand has 58 places, 55 transitions, 322 flow. Second operand 7 states and 714 transitions. [2023-08-27 03:49:21,673 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 133 transitions, 936 flow [2023-08-27 03:49:21,685 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 133 transitions, 922 flow, removed 7 selfloop flow, removed 0 redundant places. [2023-08-27 03:49:21,687 INFO L231 Difference]: Finished difference. Result has 70 places, 75 transitions, 592 flow [2023-08-27 03:49:21,687 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=219, PETRI_DIFFERENCE_MINUEND_FLOW=312, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=592, PETRI_PLACES=70, PETRI_TRANSITIONS=75} [2023-08-27 03:49:21,688 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 30 predicate places. [2023-08-27 03:49:21,688 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 75 transitions, 592 flow [2023-08-27 03:49:21,688 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 92.4) internal successors, (462), 5 states have internal predecessors, (462), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:49:21,688 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:49:21,688 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:49:21,688 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-27 03:49:21,688 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-27 03:49:21,689 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:49:21,689 INFO L85 PathProgramCache]: Analyzing trace with hash 2139059868, now seen corresponding path program 2 times [2023-08-27 03:49:21,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:49:21,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468183507] [2023-08-27 03:49:21,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:49:21,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:49:21,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:49:21,975 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 03:49:21,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:49:21,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468183507] [2023-08-27 03:49:21,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1468183507] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:49:21,975 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:49:21,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-27 03:49:21,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639232568] [2023-08-27 03:49:21,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:49:21,976 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-27 03:49:21,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:49:21,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-27 03:49:21,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-08-27 03:49:21,995 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 219 [2023-08-27 03:49:21,996 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 75 transitions, 592 flow. Second operand has 6 states, 6 states have (on average 92.0) internal successors, (552), 6 states have internal predecessors, (552), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:49:21,996 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:49:21,996 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 219 [2023-08-27 03:49:21,996 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:49:22,435 INFO L124 PetriNetUnfolderBase]: 2580/4077 cut-off events. [2023-08-27 03:49:22,435 INFO L125 PetriNetUnfolderBase]: For 18210/18307 co-relation queries the response was YES. [2023-08-27 03:49:22,444 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16580 conditions, 4077 events. 2580/4077 cut-off events. For 18210/18307 co-relation queries the response was YES. Maximal size of possible extension queue 230. Compared 23296 event pairs, 1062 based on Foata normal form. 95/3721 useless extension candidates. Maximal degree in co-relation 16548. Up to 2216 conditions per place. [2023-08-27 03:49:22,530 INFO L140 encePairwiseOnDemand]: 211/219 looper letters, 93 selfloop transitions, 40 changer transitions 0/138 dead transitions. [2023-08-27 03:49:22,530 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 138 transitions, 1260 flow [2023-08-27 03:49:22,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-27 03:49:22,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-27 03:49:22,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 608 transitions. [2023-08-27 03:49:22,532 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4627092846270928 [2023-08-27 03:49:22,533 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 608 transitions. [2023-08-27 03:49:22,533 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 608 transitions. [2023-08-27 03:49:22,533 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:49:22,533 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 608 transitions. [2023-08-27 03:49:22,534 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 101.33333333333333) internal successors, (608), 6 states have internal predecessors, (608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:49:22,536 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 219.0) internal successors, (1533), 7 states have internal predecessors, (1533), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:49:22,536 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 219.0) internal successors, (1533), 7 states have internal predecessors, (1533), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:49:22,536 INFO L175 Difference]: Start difference. First operand has 70 places, 75 transitions, 592 flow. Second operand 6 states and 608 transitions. [2023-08-27 03:49:22,536 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 138 transitions, 1260 flow [2023-08-27 03:49:22,592 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 138 transitions, 1242 flow, removed 9 selfloop flow, removed 0 redundant places. [2023-08-27 03:49:22,609 INFO L231 Difference]: Finished difference. Result has 79 places, 92 transitions, 915 flow [2023-08-27 03:49:22,610 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=219, PETRI_DIFFERENCE_MINUEND_FLOW=576, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=915, PETRI_PLACES=79, PETRI_TRANSITIONS=92} [2023-08-27 03:49:22,611 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 39 predicate places. [2023-08-27 03:49:22,613 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 92 transitions, 915 flow [2023-08-27 03:49:22,615 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 92.0) internal successors, (552), 6 states have internal predecessors, (552), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:49:22,615 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:49:22,615 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:49:22,615 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-27 03:49:22,615 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-27 03:49:22,615 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:49:22,616 INFO L85 PathProgramCache]: Analyzing trace with hash -987930256, now seen corresponding path program 1 times [2023-08-27 03:49:22,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:49:22,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409039975] [2023-08-27 03:49:22,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:49:22,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:49:22,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:49:22,698 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 03:49:22,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:49:22,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409039975] [2023-08-27 03:49:22,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1409039975] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:49:22,698 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:49:22,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-27 03:49:22,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062294070] [2023-08-27 03:49:22,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:49:22,699 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-27 03:49:22,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:49:22,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-27 03:49:22,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-27 03:49:22,700 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 219 [2023-08-27 03:49:22,700 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 92 transitions, 915 flow. Second operand has 4 states, 4 states have (on average 95.5) internal successors, (382), 4 states have internal predecessors, (382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:49:22,700 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:49:22,700 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 219 [2023-08-27 03:49:22,700 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:49:23,088 INFO L124 PetriNetUnfolderBase]: 2275/3446 cut-off events. [2023-08-27 03:49:23,089 INFO L125 PetriNetUnfolderBase]: For 28682/28846 co-relation queries the response was YES. [2023-08-27 03:49:23,097 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17322 conditions, 3446 events. 2275/3446 cut-off events. For 28682/28846 co-relation queries the response was YES. Maximal size of possible extension queue 201. Compared 18406 event pairs, 400 based on Foata normal form. 81/3187 useless extension candidates. Maximal degree in co-relation 17284. Up to 2389 conditions per place. [2023-08-27 03:49:23,111 INFO L140 encePairwiseOnDemand]: 212/219 looper letters, 123 selfloop transitions, 4 changer transitions 0/140 dead transitions. [2023-08-27 03:49:23,111 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 140 transitions, 1709 flow [2023-08-27 03:49:23,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-27 03:49:23,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-27 03:49:23,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 416 transitions. [2023-08-27 03:49:23,113 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4748858447488584 [2023-08-27 03:49:23,113 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 416 transitions. [2023-08-27 03:49:23,113 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 416 transitions. [2023-08-27 03:49:23,113 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:49:23,113 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 416 transitions. [2023-08-27 03:49:23,114 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 104.0) internal successors, (416), 4 states have internal predecessors, (416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:49:23,115 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 219.0) internal successors, (1095), 5 states have internal predecessors, (1095), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:49:23,115 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 219.0) internal successors, (1095), 5 states have internal predecessors, (1095), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:49:23,115 INFO L175 Difference]: Start difference. First operand has 79 places, 92 transitions, 915 flow. Second operand 4 states and 416 transitions. [2023-08-27 03:49:23,115 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 140 transitions, 1709 flow [2023-08-27 03:49:23,149 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 140 transitions, 1672 flow, removed 18 selfloop flow, removed 1 redundant places. [2023-08-27 03:49:23,151 INFO L231 Difference]: Finished difference. Result has 78 places, 89 transitions, 892 flow [2023-08-27 03:49:23,151 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=219, PETRI_DIFFERENCE_MINUEND_FLOW=884, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=892, PETRI_PLACES=78, PETRI_TRANSITIONS=89} [2023-08-27 03:49:23,151 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 38 predicate places. [2023-08-27 03:49:23,151 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 89 transitions, 892 flow [2023-08-27 03:49:23,151 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 95.5) internal successors, (382), 4 states have internal predecessors, (382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:49:23,152 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:49:23,152 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:49:23,152 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-27 03:49:23,152 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting P1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-27 03:49:23,152 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:49:23,152 INFO L85 PathProgramCache]: Analyzing trace with hash -1748485137, now seen corresponding path program 1 times [2023-08-27 03:49:23,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:49:23,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979923037] [2023-08-27 03:49:23,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:49:23,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:49:23,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:49:23,187 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 03:49:23,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:49:23,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979923037] [2023-08-27 03:49:23,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1979923037] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:49:23,187 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:49:23,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-27 03:49:23,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587995622] [2023-08-27 03:49:23,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:49:23,188 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-27 03:49:23,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:49:23,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-27 03:49:23,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-27 03:49:23,189 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 219 [2023-08-27 03:49:23,189 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 89 transitions, 892 flow. Second operand has 4 states, 4 states have (on average 95.5) internal successors, (382), 4 states have internal predecessors, (382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:49:23,189 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:49:23,189 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 219 [2023-08-27 03:49:23,189 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:49:23,523 INFO L124 PetriNetUnfolderBase]: 1798/2718 cut-off events. [2023-08-27 03:49:23,523 INFO L125 PetriNetUnfolderBase]: For 22315/22435 co-relation queries the response was YES. [2023-08-27 03:49:23,530 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13942 conditions, 2718 events. 1798/2718 cut-off events. For 22315/22435 co-relation queries the response was YES. Maximal size of possible extension queue 185. Compared 14029 event pairs, 285 based on Foata normal form. 64/2725 useless extension candidates. Maximal degree in co-relation 13903. Up to 1170 conditions per place. [2023-08-27 03:49:23,541 INFO L140 encePairwiseOnDemand]: 212/219 looper letters, 154 selfloop transitions, 7 changer transitions 0/174 dead transitions. [2023-08-27 03:49:23,541 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 174 transitions, 2114 flow [2023-08-27 03:49:23,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-27 03:49:23,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-27 03:49:23,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 432 transitions. [2023-08-27 03:49:23,542 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4931506849315068 [2023-08-27 03:49:23,542 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 432 transitions. [2023-08-27 03:49:23,542 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 432 transitions. [2023-08-27 03:49:23,543 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:49:23,543 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 432 transitions. [2023-08-27 03:49:23,543 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 108.0) internal successors, (432), 4 states have internal predecessors, (432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:49:23,544 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 219.0) internal successors, (1095), 5 states have internal predecessors, (1095), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:49:23,545 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 219.0) internal successors, (1095), 5 states have internal predecessors, (1095), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:49:23,545 INFO L175 Difference]: Start difference. First operand has 78 places, 89 transitions, 892 flow. Second operand 4 states and 432 transitions. [2023-08-27 03:49:23,545 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 174 transitions, 2114 flow [2023-08-27 03:49:23,572 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 174 transitions, 2097 flow, removed 6 selfloop flow, removed 2 redundant places. [2023-08-27 03:49:23,576 INFO L231 Difference]: Finished difference. Result has 80 places, 92 transitions, 927 flow [2023-08-27 03:49:23,576 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=219, PETRI_DIFFERENCE_MINUEND_FLOW=883, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=927, PETRI_PLACES=80, PETRI_TRANSITIONS=92} [2023-08-27 03:49:23,577 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 40 predicate places. [2023-08-27 03:49:23,578 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 92 transitions, 927 flow [2023-08-27 03:49:23,578 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 95.5) internal successors, (382), 4 states have internal predecessors, (382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:49:23,578 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:49:23,578 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:49:23,578 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-27 03:49:23,578 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-27 03:49:23,578 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:49:23,579 INFO L85 PathProgramCache]: Analyzing trace with hash 1985460220, now seen corresponding path program 1 times [2023-08-27 03:49:23,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:49:23,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408172600] [2023-08-27 03:49:23,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:49:23,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:49:23,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:49:23,816 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 03:49:23,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:49:23,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408172600] [2023-08-27 03:49:23,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [408172600] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:49:23,816 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:49:23,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-27 03:49:23,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082166193] [2023-08-27 03:49:23,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:49:23,817 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-27 03:49:23,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:49:23,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-27 03:49:23,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-08-27 03:49:23,819 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 219 [2023-08-27 03:49:23,820 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 92 transitions, 927 flow. Second operand has 6 states, 6 states have (on average 91.16666666666667) internal successors, (547), 6 states have internal predecessors, (547), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:49:23,820 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:49:23,820 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 219 [2023-08-27 03:49:23,820 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:49:24,240 INFO L124 PetriNetUnfolderBase]: 2029/3121 cut-off events. [2023-08-27 03:49:24,241 INFO L125 PetriNetUnfolderBase]: For 26028/26048 co-relation queries the response was YES. [2023-08-27 03:49:24,249 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16877 conditions, 3121 events. 2029/3121 cut-off events. For 26028/26048 co-relation queries the response was YES. Maximal size of possible extension queue 191. Compared 16065 event pairs, 295 based on Foata normal form. 57/3135 useless extension candidates. Maximal degree in co-relation 16837. Up to 1470 conditions per place. [2023-08-27 03:49:24,261 INFO L140 encePairwiseOnDemand]: 210/219 looper letters, 122 selfloop transitions, 36 changer transitions 3/163 dead transitions. [2023-08-27 03:49:24,262 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 163 transitions, 1756 flow [2023-08-27 03:49:24,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-27 03:49:24,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-27 03:49:24,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 701 transitions. [2023-08-27 03:49:24,263 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4572733202870189 [2023-08-27 03:49:24,263 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 701 transitions. [2023-08-27 03:49:24,263 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 701 transitions. [2023-08-27 03:49:24,264 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:49:24,264 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 701 transitions. [2023-08-27 03:49:24,265 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 100.14285714285714) internal successors, (701), 7 states have internal predecessors, (701), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:49:24,267 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 219.0) internal successors, (1752), 8 states have internal predecessors, (1752), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:49:24,268 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 219.0) internal successors, (1752), 8 states have internal predecessors, (1752), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:49:24,268 INFO L175 Difference]: Start difference. First operand has 80 places, 92 transitions, 927 flow. Second operand 7 states and 701 transitions. [2023-08-27 03:49:24,268 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 163 transitions, 1756 flow [2023-08-27 03:49:24,307 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 163 transitions, 1712 flow, removed 10 selfloop flow, removed 2 redundant places. [2023-08-27 03:49:24,309 INFO L231 Difference]: Finished difference. Result has 88 places, 99 transitions, 1134 flow [2023-08-27 03:49:24,309 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=219, PETRI_DIFFERENCE_MINUEND_FLOW=913, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1134, PETRI_PLACES=88, PETRI_TRANSITIONS=99} [2023-08-27 03:49:24,310 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 48 predicate places. [2023-08-27 03:49:24,310 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 99 transitions, 1134 flow [2023-08-27 03:49:24,311 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 91.16666666666667) internal successors, (547), 6 states have internal predecessors, (547), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:49:24,311 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:49:24,311 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:49:24,311 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-27 03:49:24,311 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-27 03:49:24,311 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:49:24,311 INFO L85 PathProgramCache]: Analyzing trace with hash -862886977, now seen corresponding path program 1 times [2023-08-27 03:49:24,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:49:24,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141338528] [2023-08-27 03:49:24,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:49:24,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:49:24,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:49:24,426 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 03:49:24,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:49:24,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141338528] [2023-08-27 03:49:24,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1141338528] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:49:24,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:49:24,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-27 03:49:24,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790956946] [2023-08-27 03:49:24,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:49:24,428 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-27 03:49:24,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:49:24,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-27 03:49:24,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-27 03:49:24,429 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 219 [2023-08-27 03:49:24,429 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 99 transitions, 1134 flow. Second operand has 4 states, 4 states have (on average 94.0) internal successors, (376), 4 states have internal predecessors, (376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:49:24,429 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:49:24,429 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 219 [2023-08-27 03:49:24,429 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:49:24,626 INFO L124 PetriNetUnfolderBase]: 879/1477 cut-off events. [2023-08-27 03:49:24,626 INFO L125 PetriNetUnfolderBase]: For 13592/13685 co-relation queries the response was YES. [2023-08-27 03:49:24,630 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7773 conditions, 1477 events. 879/1477 cut-off events. For 13592/13685 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 7683 event pairs, 116 based on Foata normal form. 144/1567 useless extension candidates. Maximal degree in co-relation 7729. Up to 884 conditions per place. [2023-08-27 03:49:24,635 INFO L140 encePairwiseOnDemand]: 213/219 looper letters, 103 selfloop transitions, 5 changer transitions 0/117 dead transitions. [2023-08-27 03:49:24,635 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 117 transitions, 1362 flow [2023-08-27 03:49:24,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-27 03:49:24,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-27 03:49:24,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 415 transitions. [2023-08-27 03:49:24,636 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4737442922374429 [2023-08-27 03:49:24,636 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 415 transitions. [2023-08-27 03:49:24,636 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 415 transitions. [2023-08-27 03:49:24,636 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:49:24,637 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 415 transitions. [2023-08-27 03:49:24,637 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 103.75) internal successors, (415), 4 states have internal predecessors, (415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:49:24,638 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 219.0) internal successors, (1095), 5 states have internal predecessors, (1095), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:49:24,638 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 219.0) internal successors, (1095), 5 states have internal predecessors, (1095), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:49:24,638 INFO L175 Difference]: Start difference. First operand has 88 places, 99 transitions, 1134 flow. Second operand 4 states and 415 transitions. [2023-08-27 03:49:24,639 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 117 transitions, 1362 flow [2023-08-27 03:49:24,652 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 117 transitions, 1292 flow, removed 16 selfloop flow, removed 4 redundant places. [2023-08-27 03:49:24,653 INFO L231 Difference]: Finished difference. Result has 87 places, 80 transitions, 832 flow [2023-08-27 03:49:24,653 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=219, PETRI_DIFFERENCE_MINUEND_FLOW=802, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=832, PETRI_PLACES=87, PETRI_TRANSITIONS=80} [2023-08-27 03:49:24,654 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 47 predicate places. [2023-08-27 03:49:24,654 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 80 transitions, 832 flow [2023-08-27 03:49:24,654 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 94.0) internal successors, (376), 4 states have internal predecessors, (376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:49:24,654 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:49:24,654 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:49:24,654 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-27 03:49:24,654 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-27 03:49:24,655 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:49:24,655 INFO L85 PathProgramCache]: Analyzing trace with hash 459495402, now seen corresponding path program 1 times [2023-08-27 03:49:24,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:49:24,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74366558] [2023-08-27 03:49:24,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:49:24,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:49:24,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:49:24,763 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 03:49:24,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:49:24,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74366558] [2023-08-27 03:49:24,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [74366558] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:49:24,764 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:49:24,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-27 03:49:24,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889218149] [2023-08-27 03:49:24,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:49:24,764 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-27 03:49:24,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:49:24,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-27 03:49:24,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-27 03:49:24,765 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 219 [2023-08-27 03:49:24,765 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 80 transitions, 832 flow. Second operand has 5 states, 5 states have (on average 93.6) internal successors, (468), 5 states have internal predecessors, (468), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:49:24,765 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:49:24,765 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 219 [2023-08-27 03:49:24,765 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:49:24,913 INFO L124 PetriNetUnfolderBase]: 461/835 cut-off events. [2023-08-27 03:49:24,913 INFO L125 PetriNetUnfolderBase]: For 5262/5332 co-relation queries the response was YES. [2023-08-27 03:49:24,915 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4089 conditions, 835 events. 461/835 cut-off events. For 5262/5332 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 4069 event pairs, 108 based on Foata normal form. 101/889 useless extension candidates. Maximal degree in co-relation 4045. Up to 296 conditions per place. [2023-08-27 03:49:24,918 INFO L140 encePairwiseOnDemand]: 213/219 looper letters, 82 selfloop transitions, 8 changer transitions 0/97 dead transitions. [2023-08-27 03:49:24,918 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 97 transitions, 1005 flow [2023-08-27 03:49:24,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-27 03:49:24,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-27 03:49:24,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 518 transitions. [2023-08-27 03:49:24,919 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4730593607305936 [2023-08-27 03:49:24,919 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 518 transitions. [2023-08-27 03:49:24,919 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 518 transitions. [2023-08-27 03:49:24,919 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:49:24,919 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 518 transitions. [2023-08-27 03:49:24,920 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 103.6) internal successors, (518), 5 states have internal predecessors, (518), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:49:24,921 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 219.0) internal successors, (1314), 6 states have internal predecessors, (1314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:49:24,922 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 219.0) internal successors, (1314), 6 states have internal predecessors, (1314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:49:24,922 INFO L175 Difference]: Start difference. First operand has 87 places, 80 transitions, 832 flow. Second operand 5 states and 518 transitions. [2023-08-27 03:49:24,922 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 97 transitions, 1005 flow [2023-08-27 03:49:24,927 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 97 transitions, 915 flow, removed 7 selfloop flow, removed 10 redundant places. [2023-08-27 03:49:24,928 INFO L231 Difference]: Finished difference. Result has 80 places, 59 transitions, 517 flow [2023-08-27 03:49:24,928 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=219, PETRI_DIFFERENCE_MINUEND_FLOW=481, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=517, PETRI_PLACES=80, PETRI_TRANSITIONS=59} [2023-08-27 03:49:24,929 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 40 predicate places. [2023-08-27 03:49:24,929 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 59 transitions, 517 flow [2023-08-27 03:49:24,929 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 93.6) internal successors, (468), 5 states have internal predecessors, (468), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:49:24,929 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:49:24,929 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:49:24,929 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-27 03:49:24,929 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting P2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-27 03:49:24,930 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:49:24,930 INFO L85 PathProgramCache]: Analyzing trace with hash -1492055887, now seen corresponding path program 1 times [2023-08-27 03:49:24,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:49:24,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979436207] [2023-08-27 03:49:24,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:49:24,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:49:24,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:49:24,975 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 03:49:24,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:49:24,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979436207] [2023-08-27 03:49:24,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [979436207] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:49:24,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:49:24,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-27 03:49:24,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084412071] [2023-08-27 03:49:24,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:49:24,976 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-27 03:49:24,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:49:24,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-27 03:49:24,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-27 03:49:24,977 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 219 [2023-08-27 03:49:24,977 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 59 transitions, 517 flow. Second operand has 5 states, 5 states have (on average 96.0) internal successors, (480), 5 states have internal predecessors, (480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:49:24,977 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:49:24,978 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 219 [2023-08-27 03:49:24,978 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:49:25,108 INFO L124 PetriNetUnfolderBase]: 444/792 cut-off events. [2023-08-27 03:49:25,108 INFO L125 PetriNetUnfolderBase]: For 4346/4412 co-relation queries the response was YES. [2023-08-27 03:49:25,110 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3955 conditions, 792 events. 444/792 cut-off events. For 4346/4412 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 3789 event pairs, 108 based on Foata normal form. 50/821 useless extension candidates. Maximal degree in co-relation 3916. Up to 296 conditions per place. [2023-08-27 03:49:25,112 INFO L140 encePairwiseOnDemand]: 212/219 looper letters, 56 selfloop transitions, 10 changer transitions 16/88 dead transitions. [2023-08-27 03:49:25,112 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 88 transitions, 913 flow [2023-08-27 03:49:25,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-27 03:49:25,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-27 03:49:25,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 519 transitions. [2023-08-27 03:49:25,113 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.473972602739726 [2023-08-27 03:49:25,113 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 519 transitions. [2023-08-27 03:49:25,113 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 519 transitions. [2023-08-27 03:49:25,114 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:49:25,114 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 519 transitions. [2023-08-27 03:49:25,115 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 103.8) internal successors, (519), 5 states have internal predecessors, (519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:49:25,116 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 219.0) internal successors, (1314), 6 states have internal predecessors, (1314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:49:25,116 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 219.0) internal successors, (1314), 6 states have internal predecessors, (1314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:49:25,116 INFO L175 Difference]: Start difference. First operand has 80 places, 59 transitions, 517 flow. Second operand 5 states and 519 transitions. [2023-08-27 03:49:25,116 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 88 transitions, 913 flow [2023-08-27 03:49:25,121 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 88 transitions, 892 flow, removed 4 selfloop flow, removed 4 redundant places. [2023-08-27 03:49:25,122 INFO L231 Difference]: Finished difference. Result has 77 places, 43 transitions, 364 flow [2023-08-27 03:49:25,122 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=219, PETRI_DIFFERENCE_MINUEND_FLOW=481, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=364, PETRI_PLACES=77, PETRI_TRANSITIONS=43} [2023-08-27 03:49:25,123 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 37 predicate places. [2023-08-27 03:49:25,123 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 43 transitions, 364 flow [2023-08-27 03:49:25,123 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 96.0) internal successors, (480), 5 states have internal predecessors, (480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:49:25,123 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:49:25,123 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:49:25,123 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-27 03:49:25,123 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-27 03:49:25,124 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:49:25,124 INFO L85 PathProgramCache]: Analyzing trace with hash -1595540349, now seen corresponding path program 1 times [2023-08-27 03:49:25,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:49:25,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678342216] [2023-08-27 03:49:25,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:49:25,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:49:25,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:49:25,282 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 03:49:25,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:49:25,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678342216] [2023-08-27 03:49:25,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1678342216] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:49:25,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:49:25,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-27 03:49:25,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967407145] [2023-08-27 03:49:25,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:49:25,283 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-27 03:49:25,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:49:25,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-27 03:49:25,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-27 03:49:25,284 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 219 [2023-08-27 03:49:25,285 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 43 transitions, 364 flow. Second operand has 6 states, 6 states have (on average 93.66666666666667) internal successors, (562), 6 states have internal predecessors, (562), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:49:25,285 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:49:25,285 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 219 [2023-08-27 03:49:25,285 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:49:25,400 INFO L124 PetriNetUnfolderBase]: 327/579 cut-off events. [2023-08-27 03:49:25,401 INFO L125 PetriNetUnfolderBase]: For 3160/3211 co-relation queries the response was YES. [2023-08-27 03:49:25,402 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2873 conditions, 579 events. 327/579 cut-off events. For 3160/3211 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 2661 event pairs, 99 based on Foata normal form. 52/610 useless extension candidates. Maximal degree in co-relation 2842. Up to 246 conditions per place. [2023-08-27 03:49:25,404 INFO L140 encePairwiseOnDemand]: 213/219 looper letters, 51 selfloop transitions, 11 changer transitions 1/69 dead transitions. [2023-08-27 03:49:25,404 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 69 transitions, 660 flow [2023-08-27 03:49:25,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-27 03:49:25,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-27 03:49:25,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 593 transitions. [2023-08-27 03:49:25,405 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4512937595129376 [2023-08-27 03:49:25,406 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 593 transitions. [2023-08-27 03:49:25,406 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 593 transitions. [2023-08-27 03:49:25,406 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:49:25,406 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 593 transitions. [2023-08-27 03:49:25,407 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 98.83333333333333) internal successors, (593), 6 states have internal predecessors, (593), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:49:25,408 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 219.0) internal successors, (1533), 7 states have internal predecessors, (1533), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:49:25,408 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 219.0) internal successors, (1533), 7 states have internal predecessors, (1533), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:49:25,408 INFO L175 Difference]: Start difference. First operand has 77 places, 43 transitions, 364 flow. Second operand 6 states and 593 transitions. [2023-08-27 03:49:25,408 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 69 transitions, 660 flow [2023-08-27 03:49:25,413 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 69 transitions, 499 flow, removed 20 selfloop flow, removed 18 redundant places. [2023-08-27 03:49:25,413 INFO L231 Difference]: Finished difference. Result has 57 places, 43 transitions, 273 flow [2023-08-27 03:49:25,413 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=219, PETRI_DIFFERENCE_MINUEND_FLOW=237, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=273, PETRI_PLACES=57, PETRI_TRANSITIONS=43} [2023-08-27 03:49:25,414 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 17 predicate places. [2023-08-27 03:49:25,414 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 43 transitions, 273 flow [2023-08-27 03:49:25,415 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 93.66666666666667) internal successors, (562), 6 states have internal predecessors, (562), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:49:25,415 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:49:25,415 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:49:25,415 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-27 03:49:25,415 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-27 03:49:25,415 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:49:25,415 INFO L85 PathProgramCache]: Analyzing trace with hash 903687137, now seen corresponding path program 1 times [2023-08-27 03:49:25,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:49:25,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445099393] [2023-08-27 03:49:25,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:49:25,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:49:25,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:49:25,742 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 03:49:25,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:49:25,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445099393] [2023-08-27 03:49:25,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1445099393] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:49:25,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:49:25,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-27 03:49:25,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302453772] [2023-08-27 03:49:25,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:49:25,743 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-27 03:49:25,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:49:25,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-27 03:49:25,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-08-27 03:49:25,744 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 219 [2023-08-27 03:49:25,744 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 43 transitions, 273 flow. Second operand has 8 states, 8 states have (on average 80.75) internal successors, (646), 8 states have internal predecessors, (646), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:49:25,744 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:49:25,744 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 219 [2023-08-27 03:49:25,744 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:49:26,261 INFO L124 PetriNetUnfolderBase]: 769/1271 cut-off events. [2023-08-27 03:49:26,261 INFO L125 PetriNetUnfolderBase]: For 3538/3538 co-relation queries the response was YES. [2023-08-27 03:49:26,263 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5274 conditions, 1271 events. 769/1271 cut-off events. For 3538/3538 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 5847 event pairs, 25 based on Foata normal form. 1/1272 useless extension candidates. Maximal degree in co-relation 5248. Up to 521 conditions per place. [2023-08-27 03:49:26,265 INFO L140 encePairwiseOnDemand]: 210/219 looper letters, 52 selfloop transitions, 6 changer transitions 66/124 dead transitions. [2023-08-27 03:49:26,265 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 124 transitions, 1024 flow [2023-08-27 03:49:26,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-08-27 03:49:26,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-08-27 03:49:26,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 940 transitions. [2023-08-27 03:49:26,267 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39020340390203406 [2023-08-27 03:49:26,267 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 940 transitions. [2023-08-27 03:49:26,267 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 940 transitions. [2023-08-27 03:49:26,268 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:49:26,268 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 940 transitions. [2023-08-27 03:49:26,269 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 85.45454545454545) internal successors, (940), 11 states have internal predecessors, (940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:49:26,271 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 219.0) internal successors, (2628), 12 states have internal predecessors, (2628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:49:26,271 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 219.0) internal successors, (2628), 12 states have internal predecessors, (2628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:49:26,272 INFO L175 Difference]: Start difference. First operand has 57 places, 43 transitions, 273 flow. Second operand 11 states and 940 transitions. [2023-08-27 03:49:26,272 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 124 transitions, 1024 flow [2023-08-27 03:49:26,277 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 124 transitions, 882 flow, removed 20 selfloop flow, removed 9 redundant places. [2023-08-27 03:49:26,278 INFO L231 Difference]: Finished difference. Result has 64 places, 38 transitions, 218 flow [2023-08-27 03:49:26,278 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=219, PETRI_DIFFERENCE_MINUEND_FLOW=227, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=218, PETRI_PLACES=64, PETRI_TRANSITIONS=38} [2023-08-27 03:49:26,278 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 24 predicate places. [2023-08-27 03:49:26,278 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 38 transitions, 218 flow [2023-08-27 03:49:26,279 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 80.75) internal successors, (646), 8 states have internal predecessors, (646), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:49:26,279 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:49:26,279 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:49:26,279 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-27 03:49:26,279 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-27 03:49:26,280 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:49:26,280 INFO L85 PathProgramCache]: Analyzing trace with hash -1020978493, now seen corresponding path program 2 times [2023-08-27 03:49:26,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:49:26,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153984625] [2023-08-27 03:49:26,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:49:26,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:49:26,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:49:26,404 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 03:49:26,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:49:26,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153984625] [2023-08-27 03:49:26,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1153984625] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:49:26,404 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:49:26,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-27 03:49:26,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849205122] [2023-08-27 03:49:26,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:49:26,404 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-27 03:49:26,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:49:26,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-27 03:49:26,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-27 03:49:26,405 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 219 [2023-08-27 03:49:26,406 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 38 transitions, 218 flow. Second operand has 5 states, 5 states have (on average 94.0) internal successors, (470), 5 states have internal predecessors, (470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:49:26,406 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:49:26,406 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 219 [2023-08-27 03:49:26,406 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:49:26,505 INFO L124 PetriNetUnfolderBase]: 232/464 cut-off events. [2023-08-27 03:49:26,505 INFO L125 PetriNetUnfolderBase]: For 911/927 co-relation queries the response was YES. [2023-08-27 03:49:26,506 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1828 conditions, 464 events. 232/464 cut-off events. For 911/927 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 2017 event pairs, 38 based on Foata normal form. 15/477 useless extension candidates. Maximal degree in co-relation 1808. Up to 268 conditions per place. [2023-08-27 03:49:26,507 INFO L140 encePairwiseOnDemand]: 215/219 looper letters, 38 selfloop transitions, 1 changer transitions 31/73 dead transitions. [2023-08-27 03:49:26,507 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 73 transitions, 547 flow [2023-08-27 03:49:26,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-27 03:49:26,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-27 03:49:26,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 491 transitions. [2023-08-27 03:49:26,508 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4484018264840183 [2023-08-27 03:49:26,509 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 491 transitions. [2023-08-27 03:49:26,509 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 491 transitions. [2023-08-27 03:49:26,509 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:49:26,509 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 491 transitions. [2023-08-27 03:49:26,510 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 98.2) internal successors, (491), 5 states have internal predecessors, (491), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:49:26,511 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 219.0) internal successors, (1314), 6 states have internal predecessors, (1314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:49:26,511 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 219.0) internal successors, (1314), 6 states have internal predecessors, (1314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:49:26,511 INFO L175 Difference]: Start difference. First operand has 64 places, 38 transitions, 218 flow. Second operand 5 states and 491 transitions. [2023-08-27 03:49:26,511 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 73 transitions, 547 flow [2023-08-27 03:49:26,512 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 73 transitions, 478 flow, removed 17 selfloop flow, removed 11 redundant places. [2023-08-27 03:49:26,513 INFO L231 Difference]: Finished difference. Result has 54 places, 34 transitions, 161 flow [2023-08-27 03:49:26,513 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=219, PETRI_DIFFERENCE_MINUEND_FLOW=181, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=161, PETRI_PLACES=54, PETRI_TRANSITIONS=34} [2023-08-27 03:49:26,513 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 14 predicate places. [2023-08-27 03:49:26,514 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 34 transitions, 161 flow [2023-08-27 03:49:26,514 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 94.0) internal successors, (470), 5 states have internal predecessors, (470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:49:26,514 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:49:26,514 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:49:26,514 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-27 03:49:26,514 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-27 03:49:26,514 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:49:26,514 INFO L85 PathProgramCache]: Analyzing trace with hash -305383821, now seen corresponding path program 3 times [2023-08-27 03:49:26,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:49:26,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996415005] [2023-08-27 03:49:26,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:49:26,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:49:26,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-27 03:49:26,558 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-27 03:49:26,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-27 03:49:26,625 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-27 03:49:26,626 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-27 03:49:26,627 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONASSERT (17 of 18 remaining) [2023-08-27 03:49:26,628 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 18 remaining) [2023-08-27 03:49:26,628 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 18 remaining) [2023-08-27 03:49:26,628 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONASSERT (14 of 18 remaining) [2023-08-27 03:49:26,628 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 18 remaining) [2023-08-27 03:49:26,629 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 18 remaining) [2023-08-27 03:49:26,629 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 18 remaining) [2023-08-27 03:49:26,629 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 18 remaining) [2023-08-27 03:49:26,629 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (9 of 18 remaining) [2023-08-27 03:49:26,629 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 18 remaining) [2023-08-27 03:49:26,629 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (7 of 18 remaining) [2023-08-27 03:49:26,629 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 18 remaining) [2023-08-27 03:49:26,629 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 18 remaining) [2023-08-27 03:49:26,629 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONASSERT (4 of 18 remaining) [2023-08-27 03:49:26,629 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 18 remaining) [2023-08-27 03:49:26,630 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 18 remaining) [2023-08-27 03:49:26,630 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 18 remaining) [2023-08-27 03:49:26,630 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 18 remaining) [2023-08-27 03:49:26,630 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-08-27 03:49:26,630 INFO L445 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:49:26,633 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-27 03:49:26,633 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-27 03:49:26,687 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.08 03:49:26 BasicIcfg [2023-08-27 03:49:26,687 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-27 03:49:26,687 INFO L158 Benchmark]: Toolchain (without parser) took 12407.51ms. Allocated memory was 356.5MB in the beginning and 664.8MB in the end (delta: 308.3MB). Free memory was 331.6MB in the beginning and 501.4MB in the end (delta: -169.8MB). Peak memory consumption was 139.0MB. Max. memory is 16.0GB. [2023-08-27 03:49:26,687 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 356.5MB. Free memory is still 333.9MB. There was no memory consumed. Max. memory is 16.0GB. [2023-08-27 03:49:26,688 INFO L158 Benchmark]: CACSL2BoogieTranslator took 451.42ms. Allocated memory is still 356.5MB. Free memory was 331.6MB in the beginning and 308.6MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. [2023-08-27 03:49:26,688 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.41ms. Allocated memory is still 356.5MB. Free memory was 308.6MB in the beginning and 305.5MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-27 03:49:26,688 INFO L158 Benchmark]: Boogie Preprocessor took 45.76ms. Allocated memory is still 356.5MB. Free memory was 305.5MB in the beginning and 303.9MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-27 03:49:26,688 INFO L158 Benchmark]: RCFGBuilder took 448.31ms. Allocated memory is still 356.5MB. Free memory was 303.9MB in the beginning and 313.4MB in the end (delta: -9.6MB). Peak memory consumption was 27.3MB. Max. memory is 16.0GB. [2023-08-27 03:49:26,688 INFO L158 Benchmark]: TraceAbstraction took 11405.00ms. Allocated memory was 356.5MB in the beginning and 664.8MB in the end (delta: 308.3MB). Free memory was 313.4MB in the beginning and 501.4MB in the end (delta: -188.0MB). Peak memory consumption was 120.2MB. Max. memory is 16.0GB. [2023-08-27 03:49:26,693 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 356.5MB. Free memory is still 333.9MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 451.42ms. Allocated memory is still 356.5MB. Free memory was 331.6MB in the beginning and 308.6MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 51.41ms. Allocated memory is still 356.5MB. Free memory was 308.6MB in the beginning and 305.5MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 45.76ms. Allocated memory is still 356.5MB. Free memory was 305.5MB in the beginning and 303.9MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 448.31ms. Allocated memory is still 356.5MB. Free memory was 303.9MB in the beginning and 313.4MB in the end (delta: -9.6MB). Peak memory consumption was 27.3MB. Max. memory is 16.0GB. * TraceAbstraction took 11405.00ms. Allocated memory was 356.5MB in the beginning and 664.8MB in the end (delta: 308.3MB). Free memory was 313.4MB in the beginning and 501.4MB in the end (delta: -188.0MB). Peak memory consumption was 120.2MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 267]: Unsoundness Warning unspecified type, defaulting to int C: short [267] - GenericResultAtLocation [Line: 267]: Unsoundness Warning unspecified type, defaulting to int C: short [267] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.1s, 122 PlacesBefore, 40 PlacesAfterwards, 115 TransitionsBefore, 31 TransitionsAfterwards, 2762 CoEnabledTransitionPairs, 7 FixpointIterations, 38 TrivialSequentialCompositions, 45 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 16 ConcurrentYvCompositions, 2 ChoiceCompositions, 101 TotalNumberOfCompositions, 10167 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3320, independent: 3043, independent conditional: 0, independent unconditional: 3043, dependent: 277, dependent conditional: 0, dependent unconditional: 277, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1473, independent: 1430, independent conditional: 0, independent unconditional: 1430, dependent: 43, dependent conditional: 0, dependent unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3320, independent: 1613, independent conditional: 0, independent unconditional: 1613, dependent: 234, dependent conditional: 0, dependent unconditional: 234, unknown: 1473, unknown conditional: 0, unknown unconditional: 1473] , Statistics on independence cache: Total cache size (in pairs): 151, Positive cache size: 134, Positive conditional cache size: 0, Positive unconditional cache size: 134, Negative cache size: 17, Negative conditional cache size: 0, Negative unconditional cache size: 17, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 17]: assertion can be violated assertion can be violated We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p1_EAX = 0; [L713] 0 int __unbuffered_p2_EAX = 0; [L714] 0 _Bool main$tmp_guard0; [L715] 0 _Bool main$tmp_guard1; [L717] 0 int x = 0; [L718] 0 _Bool x$flush_delayed; [L719] 0 int x$mem_tmp; [L720] 0 _Bool x$r_buff0_thd0; [L721] 0 _Bool x$r_buff0_thd1; [L722] 0 _Bool x$r_buff0_thd2; [L723] 0 _Bool x$r_buff0_thd3; [L724] 0 _Bool x$r_buff1_thd0; [L725] 0 _Bool x$r_buff1_thd1; [L726] 0 _Bool x$r_buff1_thd2; [L727] 0 _Bool x$r_buff1_thd3; [L728] 0 _Bool x$read_delayed; [L729] 0 int *x$read_delayed_var; [L730] 0 int x$w_buff0; [L731] 0 _Bool x$w_buff0_used; [L732] 0 int x$w_buff1; [L733] 0 _Bool x$w_buff1_used; [L735] 0 int y = 0; [L737] 0 int z = 0; [L738] 0 _Bool weak$$choice0; [L739] 0 _Bool weak$$choice2; [L820] 0 pthread_t t1403; [L821] FCALL, FORK 0 pthread_create(&t1403, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1403, ((void *)0), P0, ((void *)0))=-2, t1403={5:0}, weak$$choice0=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=0, y=0, z=0] [L822] 0 pthread_t t1404; [L823] FCALL, FORK 0 pthread_create(&t1404, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1404, ((void *)0), P1, ((void *)0))=-1, t1403={5:0}, t1404={6:0}, weak$$choice0=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=0, y=0, z=0] [L824] 0 pthread_t t1405; [L763] 2 x$w_buff1 = x$w_buff0 [L764] 2 x$w_buff0 = 2 [L765] 2 x$w_buff1_used = x$w_buff0_used [L766] 2 x$w_buff0_used = (_Bool)1 [L767] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L767] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L768] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L769] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L770] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L771] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L772] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, 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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L825] FCALL, FORK 0 pthread_create(&t1405, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1405, ((void *)0), P2, ((void *)0))=0, t1403={5:0}, t1404={6:0}, t1405={3:0}, weak$$choice0=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=1, 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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L775] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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=1, 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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L792] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, 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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L795] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, 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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L743] 1 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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=1, 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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L746] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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=1, 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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L749] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L750] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L751] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L752] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L753] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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=1, 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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L756] EXPR 1 __unbuffered_cnt + 1 [L756] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L758] 1 return 0; [L778] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L779] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L780] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L781] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L782] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, 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=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L785] EXPR 2 __unbuffered_cnt + 1 [L785] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L787] 2 return 0; [L798] 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) [L799] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L800] 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 [L801] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L802] 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 [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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=1, 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=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L805] EXPR 3 __unbuffered_cnt + 1 [L805] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L807] 3 return 0; [L827] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1403={5:0}, t1404={6:0}, t1405={3:0}, weak$$choice0=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=1, 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=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L829] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L829] RET 0 assume_abort_if_not(main$tmp_guard0) [L831] 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) [L832] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L833] 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 [L834] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L835] 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}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1403={5:0}, t1404={6:0}, t1405={3:0}, weak$$choice0=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=1, 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=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L838] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L839] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L840] 0 x$flush_delayed = weak$$choice2 [L841] 0 x$mem_tmp = x [L842] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L843] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L844] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L845] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L846] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L847] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L848] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L849] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 0) [L850] 0 x = x$flush_delayed ? x$mem_tmp : x [L851] 0 x$flush_delayed = (_Bool)0 [L853] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] CALL 0 reach_error() [L17] COND FALSE 0 !(0) [L17] 0 __assert_fail ("0", "mix052_tso.oepc.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\read(__PRETTY_FUNCTION__)={49:50}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, 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=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] - UnprovableResult [Line: 756]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 756]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 17]: Unable to prove that assertion always holds Unable to prove that assertion always holds Reason: Not analyzed. - UnprovableResult [Line: 785]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 785]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 805]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 805]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 823]: 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: 825]: 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: 821]: 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, 150 locations, 18 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: 11.3s, OverallIterations: 16, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 5.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 538 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 538 mSDsluCounter, 53 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 30 mSDsCounter, 75 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1586 IncrementalHoareTripleChecker+Invalid, 1661 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 75 mSolverCounterUnsat, 23 mSDtfsCounter, 1586 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 80 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1134occurred in iteration=9, InterpolantAutomatonStates: 82, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 222 NumberOfCodeBlocks, 222 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 185 ConstructedInterpolants, 0 QuantifiedInterpolants, 1024 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 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 03:49:26,711 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...