/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 -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/safe003_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-26 21:24:08,056 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-26 21:24:08,142 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-26 21:24:08,146 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-26 21:24:08,147 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-26 21:24:08,174 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-26 21:24:08,175 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-26 21:24:08,179 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-26 21:24:08,180 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-26 21:24:08,183 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-26 21:24:08,183 INFO L153 SettingsManager]: * Use SBE=true [2023-08-26 21:24:08,184 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-26 21:24:08,184 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-26 21:24:08,185 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-26 21:24:08,185 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-26 21:24:08,185 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-26 21:24:08,186 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-26 21:24:08,186 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-26 21:24:08,186 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-26 21:24:08,186 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-26 21:24:08,186 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-26 21:24:08,187 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-26 21:24:08,187 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-26 21:24:08,188 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-26 21:24:08,188 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-26 21:24:08,188 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-26 21:24:08,189 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-26 21:24:08,189 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 21:24:08,190 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-26 21:24:08,190 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-26 21:24:08,191 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-26 21:24:08,191 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-26 21:24:08,191 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-26 21:24:08,191 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-26 21:24:08,191 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-26 21:24:08,192 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.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-26 21:24:08,511 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-26 21:24:08,533 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-26 21:24:08,535 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-26 21:24:08,536 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-26 21:24:08,536 INFO L274 PluginConnector]: CDTParser initialized [2023-08-26 21:24:08,537 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe003_power.opt.i [2023-08-26 21:24:09,597 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-26 21:24:09,879 INFO L384 CDTParser]: Found 1 translation units. [2023-08-26 21:24:09,879 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe003_power.opt.i [2023-08-26 21:24:09,895 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f8e7214b3/80863252a39e4aa5927267dfbf967863/FLAG4c18b1e28 [2023-08-26 21:24:09,910 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f8e7214b3/80863252a39e4aa5927267dfbf967863 [2023-08-26 21:24:09,912 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-26 21:24:09,913 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-26 21:24:09,914 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-26 21:24:09,914 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-26 21:24:09,916 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-26 21:24:09,917 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 09:24:09" (1/1) ... [2023-08-26 21:24:09,917 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3aa204c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:24:09, skipping insertion in model container [2023-08-26 21:24:09,917 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 09:24:09" (1/1) ... [2023-08-26 21:24:09,965 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-26 21:24:10,350 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 21:24:10,368 INFO L201 MainTranslator]: Completed pre-run [2023-08-26 21:24:10,401 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-26 21:24:10,403 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-26 21:24:10,451 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 21:24:10,491 WARN L669 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-26 21:24:10,491 WARN L669 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-26 21:24:10,497 INFO L206 MainTranslator]: Completed translation [2023-08-26 21:24:10,497 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:24:10 WrapperNode [2023-08-26 21:24:10,498 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-26 21:24:10,499 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-26 21:24:10,499 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-26 21:24:10,499 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-26 21:24:10,505 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:24:10" (1/1) ... [2023-08-26 21:24:10,538 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:24:10" (1/1) ... [2023-08-26 21:24:10,570 INFO L138 Inliner]: procedures = 176, calls = 74, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 189 [2023-08-26 21:24:10,570 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-26 21:24:10,571 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-26 21:24:10,571 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-26 21:24:10,571 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-26 21:24:10,578 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:24:10" (1/1) ... [2023-08-26 21:24:10,579 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:24:10" (1/1) ... [2023-08-26 21:24:10,594 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:24:10" (1/1) ... [2023-08-26 21:24:10,594 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:24:10" (1/1) ... [2023-08-26 21:24:10,606 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:24:10" (1/1) ... [2023-08-26 21:24:10,608 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:24:10" (1/1) ... [2023-08-26 21:24:10,610 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:24:10" (1/1) ... [2023-08-26 21:24:10,612 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:24:10" (1/1) ... [2023-08-26 21:24:10,627 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-26 21:24:10,628 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-26 21:24:10,628 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-26 21:24:10,628 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-26 21:24:10,629 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:24:10" (1/1) ... [2023-08-26 21:24:10,633 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 21:24:10,647 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 21:24:10,664 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-26 21:24:10,686 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-26 21:24:10,702 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-26 21:24:10,703 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-26 21:24:10,703 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-26 21:24:10,703 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-26 21:24:10,703 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-26 21:24:10,704 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-26 21:24:10,704 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-26 21:24:10,704 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-26 21:24:10,704 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-26 21:24:10,704 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-26 21:24:10,705 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-26 21:24:10,705 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-26 21:24:10,705 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-26 21:24:10,705 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-26 21:24:10,705 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-26 21:24:10,706 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-26 21:24:10,707 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-26 21:24:10,868 INFO L236 CfgBuilder]: Building ICFG [2023-08-26 21:24:10,869 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-26 21:24:11,270 INFO L277 CfgBuilder]: Performing block encoding [2023-08-26 21:24:11,536 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-26 21:24:11,536 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-26 21:24:11,538 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 09:24:11 BoogieIcfgContainer [2023-08-26 21:24:11,538 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-26 21:24:11,541 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-26 21:24:11,541 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-26 21:24:11,544 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-26 21:24:11,544 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.08 09:24:09" (1/3) ... [2023-08-26 21:24:11,544 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5029ea3c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 09:24:11, skipping insertion in model container [2023-08-26 21:24:11,545 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:24:10" (2/3) ... [2023-08-26 21:24:11,545 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5029ea3c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 09:24:11, skipping insertion in model container [2023-08-26 21:24:11,545 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 09:24:11" (3/3) ... [2023-08-26 21:24:11,546 INFO L112 eAbstractionObserver]: Analyzing ICFG safe003_power.opt.i [2023-08-26 21:24:11,560 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-26 21:24:11,560 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations. [2023-08-26 21:24:11,561 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-26 21:24:11,642 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-26 21:24:11,678 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 144 places, 137 transitions, 289 flow [2023-08-26 21:24:11,735 INFO L124 PetriNetUnfolderBase]: 3/134 cut-off events. [2023-08-26 21:24:11,735 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 21:24:11,741 INFO L83 FinitePrefix]: Finished finitePrefix Result has 144 conditions, 134 events. 3/134 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 85 event pairs, 0 based on Foata normal form. 0/123 useless extension candidates. Maximal degree in co-relation 79. Up to 2 conditions per place. [2023-08-26 21:24:11,741 INFO L82 GeneralOperation]: Start removeDead. Operand has 144 places, 137 transitions, 289 flow [2023-08-26 21:24:11,747 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 141 places, 134 transitions, 277 flow [2023-08-26 21:24:11,753 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-26 21:24:11,768 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 141 places, 134 transitions, 277 flow [2023-08-26 21:24:11,770 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 141 places, 134 transitions, 277 flow [2023-08-26 21:24:11,771 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 141 places, 134 transitions, 277 flow [2023-08-26 21:24:11,829 INFO L124 PetriNetUnfolderBase]: 3/134 cut-off events. [2023-08-26 21:24:11,829 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 21:24:11,830 INFO L83 FinitePrefix]: Finished finitePrefix Result has 144 conditions, 134 events. 3/134 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 85 event pairs, 0 based on Foata normal form. 0/123 useless extension candidates. Maximal degree in co-relation 79. Up to 2 conditions per place. [2023-08-26 21:24:11,832 INFO L119 LiptonReduction]: Number of co-enabled transitions 2776 [2023-08-26 21:24:19,187 INFO L134 LiptonReduction]: Checked pairs total: 10679 [2023-08-26 21:24:19,187 INFO L136 LiptonReduction]: Total number of compositions: 123 [2023-08-26 21:24:19,208 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-26 21:24:19,214 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;@318da408, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-26 21:24:19,215 INFO L358 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2023-08-26 21:24:19,223 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-26 21:24:19,223 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2023-08-26 21:24:19,224 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 21:24:19,224 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:24:19,224 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2023-08-26 21:24:19,225 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-26 21:24:19,228 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:24:19,228 INFO L85 PathProgramCache]: Analyzing trace with hash 27645186, now seen corresponding path program 1 times [2023-08-26 21:24:19,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:24:19,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488156511] [2023-08-26 21:24:19,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:24:19,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:24:19,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:24:19,632 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-26 21:24:19,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:24:19,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488156511] [2023-08-26 21:24:19,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1488156511] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:24:19,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:24:19,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 21:24:19,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231641572] [2023-08-26 21:24:19,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:24:19,641 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 21:24:19,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:24:19,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 21:24:19,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 21:24:19,665 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 260 [2023-08-26 21:24:19,669 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 29 transitions, 67 flow. Second operand has 3 states, 3 states have (on average 116.33333333333333) internal successors, (349), 3 states have internal predecessors, (349), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:24:19,669 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:24:19,669 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 260 [2023-08-26 21:24:19,670 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:24:20,211 INFO L124 PetriNetUnfolderBase]: 1784/2776 cut-off events. [2023-08-26 21:24:20,212 INFO L125 PetriNetUnfolderBase]: For 32/32 co-relation queries the response was YES. [2023-08-26 21:24:20,217 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5462 conditions, 2776 events. 1784/2776 cut-off events. For 32/32 co-relation queries the response was YES. Maximal size of possible extension queue 161. Compared 15467 event pairs, 504 based on Foata normal form. 0/2169 useless extension candidates. Maximal degree in co-relation 5451. Up to 1829 conditions per place. [2023-08-26 21:24:20,232 INFO L140 encePairwiseOnDemand]: 257/260 looper letters, 37 selfloop transitions, 2 changer transitions 0/44 dead transitions. [2023-08-26 21:24:20,232 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 44 transitions, 181 flow [2023-08-26 21:24:20,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 21:24:20,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 21:24:20,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 385 transitions. [2023-08-26 21:24:20,244 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4935897435897436 [2023-08-26 21:24:20,245 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 385 transitions. [2023-08-26 21:24:20,245 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 385 transitions. [2023-08-26 21:24:20,246 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:24:20,248 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 385 transitions. [2023-08-26 21:24:20,252 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 128.33333333333334) internal successors, (385), 3 states have internal predecessors, (385), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:24:20,256 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 260.0) internal successors, (1040), 4 states have internal predecessors, (1040), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:24:20,257 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 260.0) internal successors, (1040), 4 states have internal predecessors, (1040), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:24:20,258 INFO L175 Difference]: Start difference. First operand has 39 places, 29 transitions, 67 flow. Second operand 3 states and 385 transitions. [2023-08-26 21:24:20,259 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 44 transitions, 181 flow [2023-08-26 21:24:20,261 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 44 transitions, 176 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-26 21:24:20,263 INFO L231 Difference]: Finished difference. Result has 37 places, 28 transitions, 66 flow [2023-08-26 21:24:20,264 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=260, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=66, PETRI_PLACES=37, PETRI_TRANSITIONS=28} [2023-08-26 21:24:20,267 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, -2 predicate places. [2023-08-26 21:24:20,268 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 28 transitions, 66 flow [2023-08-26 21:24:20,268 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 116.33333333333333) internal successors, (349), 3 states have internal predecessors, (349), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:24:20,268 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:24:20,268 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-08-26 21:24:20,268 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-26 21:24:20,269 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-26 21:24:20,269 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:24:20,269 INFO L85 PathProgramCache]: Analyzing trace with hash 797244004, now seen corresponding path program 1 times [2023-08-26 21:24:20,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:24:20,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660271924] [2023-08-26 21:24:20,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:24:20,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:24:20,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:24:20,323 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-26 21:24:20,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:24:20,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660271924] [2023-08-26 21:24:20,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1660271924] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:24:20,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:24:20,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 21:24:20,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19667585] [2023-08-26 21:24:20,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:24:20,325 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 21:24:20,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:24:20,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 21:24:20,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 21:24:20,327 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 260 [2023-08-26 21:24:20,327 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 28 transitions, 66 flow. Second operand has 3 states, 3 states have (on average 113.0) internal successors, (339), 3 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:24:20,327 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:24:20,327 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 260 [2023-08-26 21:24:20,328 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:24:20,764 INFO L124 PetriNetUnfolderBase]: 1411/2192 cut-off events. [2023-08-26 21:24:20,764 INFO L125 PetriNetUnfolderBase]: For 109/109 co-relation queries the response was YES. [2023-08-26 21:24:20,767 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4526 conditions, 2192 events. 1411/2192 cut-off events. For 109/109 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 10777 event pairs, 475 based on Foata normal form. 0/1680 useless extension candidates. Maximal degree in co-relation 4516. Up to 1568 conditions per place. [2023-08-26 21:24:20,776 INFO L140 encePairwiseOnDemand]: 250/260 looper letters, 40 selfloop transitions, 4 changer transitions 0/46 dead transitions. [2023-08-26 21:24:20,776 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 46 transitions, 196 flow [2023-08-26 21:24:20,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 21:24:20,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 21:24:20,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 383 transitions. [2023-08-26 21:24:20,780 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.491025641025641 [2023-08-26 21:24:20,781 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 383 transitions. [2023-08-26 21:24:20,781 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 383 transitions. [2023-08-26 21:24:20,781 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:24:20,781 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 383 transitions. [2023-08-26 21:24:20,782 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 127.66666666666667) internal successors, (383), 3 states have internal predecessors, (383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:24:20,786 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 260.0) internal successors, (1040), 4 states have internal predecessors, (1040), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:24:20,787 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 260.0) internal successors, (1040), 4 states have internal predecessors, (1040), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:24:20,787 INFO L175 Difference]: Start difference. First operand has 37 places, 28 transitions, 66 flow. Second operand 3 states and 383 transitions. [2023-08-26 21:24:20,787 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 46 transitions, 196 flow [2023-08-26 21:24:20,788 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 46 transitions, 190 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 21:24:20,789 INFO L231 Difference]: Finished difference. Result has 38 places, 31 transitions, 98 flow [2023-08-26 21:24:20,790 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=260, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=98, PETRI_PLACES=38, PETRI_TRANSITIONS=31} [2023-08-26 21:24:20,791 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, -1 predicate places. [2023-08-26 21:24:20,791 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 31 transitions, 98 flow [2023-08-26 21:24:20,795 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 113.0) internal successors, (339), 3 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:24:20,795 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:24:20,795 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:24:20,798 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-26 21:24:20,799 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-26 21:24:20,799 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:24:20,799 INFO L85 PathProgramCache]: Analyzing trace with hash 1314861049, now seen corresponding path program 1 times [2023-08-26 21:24:20,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:24:20,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874814915] [2023-08-26 21:24:20,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:24:20,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:24:20,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:24:21,054 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-26 21:24:21,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:24:21,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874814915] [2023-08-26 21:24:21,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1874814915] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:24:21,055 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:24:21,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 21:24:21,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952212042] [2023-08-26 21:24:21,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:24:21,055 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 21:24:21,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:24:21,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 21:24:21,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 21:24:21,057 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 260 [2023-08-26 21:24:21,057 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 31 transitions, 98 flow. Second operand has 3 states, 3 states have (on average 117.0) internal successors, (351), 3 states have internal predecessors, (351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:24:21,058 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:24:21,058 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 260 [2023-08-26 21:24:21,058 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:24:21,415 INFO L124 PetriNetUnfolderBase]: 1157/1944 cut-off events. [2023-08-26 21:24:21,415 INFO L125 PetriNetUnfolderBase]: For 172/192 co-relation queries the response was YES. [2023-08-26 21:24:21,418 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4555 conditions, 1944 events. 1157/1944 cut-off events. For 172/192 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 10435 event pairs, 291 based on Foata normal form. 0/1655 useless extension candidates. Maximal degree in co-relation 4544. Up to 1383 conditions per place. [2023-08-26 21:24:21,426 INFO L140 encePairwiseOnDemand]: 257/260 looper letters, 38 selfloop transitions, 2 changer transitions 0/45 dead transitions. [2023-08-26 21:24:21,426 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 45 transitions, 220 flow [2023-08-26 21:24:21,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 21:24:21,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 21:24:21,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 378 transitions. [2023-08-26 21:24:21,428 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4846153846153846 [2023-08-26 21:24:21,428 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 378 transitions. [2023-08-26 21:24:21,428 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 378 transitions. [2023-08-26 21:24:21,428 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:24:21,428 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 378 transitions. [2023-08-26 21:24:21,429 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 126.0) internal successors, (378), 3 states have internal predecessors, (378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:24:21,431 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 260.0) internal successors, (1040), 4 states have internal predecessors, (1040), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:24:21,431 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 260.0) internal successors, (1040), 4 states have internal predecessors, (1040), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:24:21,431 INFO L175 Difference]: Start difference. First operand has 38 places, 31 transitions, 98 flow. Second operand 3 states and 378 transitions. [2023-08-26 21:24:21,431 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 45 transitions, 220 flow [2023-08-26 21:24:21,432 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 45 transitions, 214 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 21:24:21,433 INFO L231 Difference]: Finished difference. Result has 40 places, 31 transitions, 102 flow [2023-08-26 21:24:21,433 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=260, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=102, PETRI_PLACES=40, PETRI_TRANSITIONS=31} [2023-08-26 21:24:21,434 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 1 predicate places. [2023-08-26 21:24:21,434 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 31 transitions, 102 flow [2023-08-26 21:24:21,435 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 117.0) internal successors, (351), 3 states have internal predecessors, (351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:24:21,435 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:24:21,435 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:24:21,435 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-26 21:24:21,435 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-26 21:24:21,435 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:24:21,435 INFO L85 PathProgramCache]: Analyzing trace with hash 2105985573, now seen corresponding path program 1 times [2023-08-26 21:24:21,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:24:21,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919946533] [2023-08-26 21:24:21,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:24:21,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:24:21,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:24:21,570 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-26 21:24:21,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:24:21,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919946533] [2023-08-26 21:24:21,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1919946533] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:24:21,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:24:21,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 21:24:21,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585068076] [2023-08-26 21:24:21,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:24:21,572 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 21:24:21,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:24:21,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 21:24:21,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 21:24:21,573 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 260 [2023-08-26 21:24:21,573 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 31 transitions, 102 flow. Second operand has 3 states, 3 states have (on average 114.33333333333333) internal successors, (343), 3 states have internal predecessors, (343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:24:21,573 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:24:21,574 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 260 [2023-08-26 21:24:21,574 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:24:22,010 INFO L124 PetriNetUnfolderBase]: 1724/2670 cut-off events. [2023-08-26 21:24:22,010 INFO L125 PetriNetUnfolderBase]: For 427/439 co-relation queries the response was YES. [2023-08-26 21:24:22,014 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6396 conditions, 2670 events. 1724/2670 cut-off events. For 427/439 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 13391 event pairs, 498 based on Foata normal form. 8/2459 useless extension candidates. Maximal degree in co-relation 6383. Up to 2426 conditions per place. [2023-08-26 21:24:22,025 INFO L140 encePairwiseOnDemand]: 256/260 looper letters, 39 selfloop transitions, 3 changer transitions 0/45 dead transitions. [2023-08-26 21:24:22,025 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 45 transitions, 223 flow [2023-08-26 21:24:22,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 21:24:22,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 21:24:22,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 373 transitions. [2023-08-26 21:24:22,027 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4782051282051282 [2023-08-26 21:24:22,027 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 373 transitions. [2023-08-26 21:24:22,027 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 373 transitions. [2023-08-26 21:24:22,027 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:24:22,027 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 373 transitions. [2023-08-26 21:24:22,028 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 124.33333333333333) internal successors, (373), 3 states have internal predecessors, (373), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:24:22,030 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 260.0) internal successors, (1040), 4 states have internal predecessors, (1040), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:24:22,030 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 260.0) internal successors, (1040), 4 states have internal predecessors, (1040), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:24:22,030 INFO L175 Difference]: Start difference. First operand has 40 places, 31 transitions, 102 flow. Second operand 3 states and 373 transitions. [2023-08-26 21:24:22,030 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 45 transitions, 223 flow [2023-08-26 21:24:22,031 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 45 transitions, 217 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 21:24:22,032 INFO L231 Difference]: Finished difference. Result has 41 places, 33 transitions, 117 flow [2023-08-26 21:24:22,032 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=260, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=117, PETRI_PLACES=41, PETRI_TRANSITIONS=33} [2023-08-26 21:24:22,033 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 2 predicate places. [2023-08-26 21:24:22,033 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 33 transitions, 117 flow [2023-08-26 21:24:22,034 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 114.33333333333333) internal successors, (343), 3 states have internal predecessors, (343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:24:22,034 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:24:22,034 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:24:22,034 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-26 21:24:22,034 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-26 21:24:22,034 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:24:22,034 INFO L85 PathProgramCache]: Analyzing trace with hash 859225689, now seen corresponding path program 1 times [2023-08-26 21:24:22,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:24:22,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178834599] [2023-08-26 21:24:22,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:24:22,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:24:22,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:24:22,141 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-26 21:24:22,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:24:22,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178834599] [2023-08-26 21:24:22,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1178834599] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:24:22,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:24:22,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 21:24:22,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850915868] [2023-08-26 21:24:22,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:24:22,143 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 21:24:22,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:24:22,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 21:24:22,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 21:24:22,144 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 260 [2023-08-26 21:24:22,145 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 33 transitions, 117 flow. Second operand has 4 states, 4 states have (on average 112.75) internal successors, (451), 4 states have internal predecessors, (451), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:24:22,145 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:24:22,145 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 260 [2023-08-26 21:24:22,145 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:24:22,850 INFO L124 PetriNetUnfolderBase]: 2729/4276 cut-off events. [2023-08-26 21:24:22,850 INFO L125 PetriNetUnfolderBase]: For 1288/1318 co-relation queries the response was YES. [2023-08-26 21:24:22,856 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10534 conditions, 4276 events. 2729/4276 cut-off events. For 1288/1318 co-relation queries the response was YES. Maximal size of possible extension queue 211. Compared 23958 event pairs, 474 based on Foata normal form. 125/4020 useless extension candidates. Maximal degree in co-relation 10520. Up to 1979 conditions per place. [2023-08-26 21:24:22,872 INFO L140 encePairwiseOnDemand]: 255/260 looper letters, 58 selfloop transitions, 4 changer transitions 0/65 dead transitions. [2023-08-26 21:24:22,872 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 65 transitions, 334 flow [2023-08-26 21:24:22,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 21:24:22,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 21:24:22,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 497 transitions. [2023-08-26 21:24:22,874 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4778846153846154 [2023-08-26 21:24:22,874 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 497 transitions. [2023-08-26 21:24:22,874 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 497 transitions. [2023-08-26 21:24:22,874 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:24:22,874 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 497 transitions. [2023-08-26 21:24:22,876 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 124.25) internal successors, (497), 4 states have internal predecessors, (497), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:24:22,877 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 260.0) internal successors, (1300), 5 states have internal predecessors, (1300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:24:22,878 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 260.0) internal successors, (1300), 5 states have internal predecessors, (1300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:24:22,878 INFO L175 Difference]: Start difference. First operand has 41 places, 33 transitions, 117 flow. Second operand 4 states and 497 transitions. [2023-08-26 21:24:22,878 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 65 transitions, 334 flow [2023-08-26 21:24:22,879 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 65 transitions, 331 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 21:24:22,880 INFO L231 Difference]: Finished difference. Result has 44 places, 34 transitions, 132 flow [2023-08-26 21:24:22,880 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=260, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=132, PETRI_PLACES=44, PETRI_TRANSITIONS=34} [2023-08-26 21:24:22,881 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 5 predicate places. [2023-08-26 21:24:22,881 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 34 transitions, 132 flow [2023-08-26 21:24:22,881 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 112.75) internal successors, (451), 4 states have internal predecessors, (451), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:24:22,882 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:24:22,882 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:24:22,882 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-26 21:24:22,882 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-26 21:24:22,882 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:24:22,882 INFO L85 PathProgramCache]: Analyzing trace with hash 861040119, now seen corresponding path program 2 times [2023-08-26 21:24:22,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:24:22,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477352426] [2023-08-26 21:24:22,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:24:22,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:24:22,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:24:22,984 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 21:24:22,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:24:22,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477352426] [2023-08-26 21:24:22,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1477352426] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:24:22,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:24:22,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 21:24:22,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109571950] [2023-08-26 21:24:22,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:24:22,985 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 21:24:22,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:24:22,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 21:24:22,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 21:24:22,986 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 260 [2023-08-26 21:24:22,987 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 34 transitions, 132 flow. Second operand has 3 states, 3 states have (on average 117.66666666666667) internal successors, (353), 3 states have internal predecessors, (353), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:24:22,987 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:24:22,987 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 260 [2023-08-26 21:24:22,987 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:24:23,539 INFO L124 PetriNetUnfolderBase]: 2597/4080 cut-off events. [2023-08-26 21:24:23,539 INFO L125 PetriNetUnfolderBase]: For 1616/1666 co-relation queries the response was YES. [2023-08-26 21:24:23,547 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10173 conditions, 4080 events. 2597/4080 cut-off events. For 1616/1666 co-relation queries the response was YES. Maximal size of possible extension queue 225. Compared 23188 event pairs, 659 based on Foata normal form. 29/3708 useless extension candidates. Maximal degree in co-relation 10157. Up to 2852 conditions per place. [2023-08-26 21:24:23,562 INFO L140 encePairwiseOnDemand]: 257/260 looper letters, 42 selfloop transitions, 2 changer transitions 0/49 dead transitions. [2023-08-26 21:24:23,562 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 49 transitions, 269 flow [2023-08-26 21:24:23,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 21:24:23,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 21:24:23,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 379 transitions. [2023-08-26 21:24:23,564 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4858974358974359 [2023-08-26 21:24:23,564 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 379 transitions. [2023-08-26 21:24:23,564 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 379 transitions. [2023-08-26 21:24:23,565 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:24:23,565 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 379 transitions. [2023-08-26 21:24:23,566 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 126.33333333333333) internal successors, (379), 3 states have internal predecessors, (379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:24:23,567 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 260.0) internal successors, (1040), 4 states have internal predecessors, (1040), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:24:23,568 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 260.0) internal successors, (1040), 4 states have internal predecessors, (1040), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:24:23,568 INFO L175 Difference]: Start difference. First operand has 44 places, 34 transitions, 132 flow. Second operand 3 states and 379 transitions. [2023-08-26 21:24:23,568 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 49 transitions, 269 flow [2023-08-26 21:24:23,569 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 49 transitions, 263 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 21:24:23,570 INFO L231 Difference]: Finished difference. Result has 45 places, 34 transitions, 135 flow [2023-08-26 21:24:23,570 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=260, PETRI_DIFFERENCE_MINUEND_FLOW=127, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=135, PETRI_PLACES=45, PETRI_TRANSITIONS=34} [2023-08-26 21:24:23,571 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 6 predicate places. [2023-08-26 21:24:23,571 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 34 transitions, 135 flow [2023-08-26 21:24:23,571 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 117.66666666666667) internal successors, (353), 3 states have internal predecessors, (353), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:24:23,572 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:24:23,572 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:24:23,572 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-26 21:24:23,572 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-26 21:24:23,572 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:24:23,572 INFO L85 PathProgramCache]: Analyzing trace with hash -1095757513, now seen corresponding path program 1 times [2023-08-26 21:24:23,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:24:23,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236066307] [2023-08-26 21:24:23,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:24:23,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:24:23,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:24:23,656 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-26 21:24:23,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:24:23,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236066307] [2023-08-26 21:24:23,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [236066307] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:24:23,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:24:23,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 21:24:23,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214606839] [2023-08-26 21:24:23,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:24:23,658 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 21:24:23,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:24:23,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 21:24:23,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 21:24:23,659 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 260 [2023-08-26 21:24:23,659 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 34 transitions, 135 flow. Second operand has 4 states, 4 states have (on average 113.75) internal successors, (455), 4 states have internal predecessors, (455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:24:23,659 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:24:23,660 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 260 [2023-08-26 21:24:23,660 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:24:24,195 INFO L124 PetriNetUnfolderBase]: 1979/3035 cut-off events. [2023-08-26 21:24:24,196 INFO L125 PetriNetUnfolderBase]: For 1515/1519 co-relation queries the response was YES. [2023-08-26 21:24:24,200 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7871 conditions, 3035 events. 1979/3035 cut-off events. For 1515/1519 co-relation queries the response was YES. Maximal size of possible extension queue 185. Compared 16245 event pairs, 602 based on Foata normal form. 3/2740 useless extension candidates. Maximal degree in co-relation 7854. Up to 2023 conditions per place. [2023-08-26 21:24:24,208 INFO L140 encePairwiseOnDemand]: 253/260 looper letters, 40 selfloop transitions, 4 changer transitions 0/47 dead transitions. [2023-08-26 21:24:24,208 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 47 transitions, 264 flow [2023-08-26 21:24:24,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 21:24:24,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 21:24:24,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 488 transitions. [2023-08-26 21:24:24,210 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46923076923076923 [2023-08-26 21:24:24,210 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 488 transitions. [2023-08-26 21:24:24,210 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 488 transitions. [2023-08-26 21:24:24,211 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:24:24,211 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 488 transitions. [2023-08-26 21:24:24,212 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 122.0) internal successors, (488), 4 states have internal predecessors, (488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:24:24,213 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 260.0) internal successors, (1300), 5 states have internal predecessors, (1300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:24:24,214 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 260.0) internal successors, (1300), 5 states have internal predecessors, (1300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:24:24,214 INFO L175 Difference]: Start difference. First operand has 45 places, 34 transitions, 135 flow. Second operand 4 states and 488 transitions. [2023-08-26 21:24:24,214 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 47 transitions, 264 flow [2023-08-26 21:24:24,216 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 47 transitions, 252 flow, removed 2 selfloop flow, removed 3 redundant places. [2023-08-26 21:24:24,217 INFO L231 Difference]: Finished difference. Result has 42 places, 31 transitions, 122 flow [2023-08-26 21:24:24,217 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=260, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=122, PETRI_PLACES=42, PETRI_TRANSITIONS=31} [2023-08-26 21:24:24,217 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 3 predicate places. [2023-08-26 21:24:24,217 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 31 transitions, 122 flow [2023-08-26 21:24:24,218 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 113.75) internal successors, (455), 4 states have internal predecessors, (455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:24:24,218 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:24:24,218 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:24:24,218 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-26 21:24:24,218 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-26 21:24:24,218 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:24:24,219 INFO L85 PathProgramCache]: Analyzing trace with hash 1518322792, now seen corresponding path program 1 times [2023-08-26 21:24:24,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:24:24,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378738644] [2023-08-26 21:24:24,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:24:24,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:24:24,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:24:24,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-26 21:24:24,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:24:24,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378738644] [2023-08-26 21:24:24,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [378738644] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:24:24,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:24:24,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 21:24:24,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852515609] [2023-08-26 21:24:24,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:24:24,283 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 21:24:24,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:24:24,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 21:24:24,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-26 21:24:24,284 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 260 [2023-08-26 21:24:24,285 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 31 transitions, 122 flow. Second operand has 4 states, 4 states have (on average 113.75) internal successors, (455), 4 states have internal predecessors, (455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:24:24,285 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:24:24,285 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 260 [2023-08-26 21:24:24,285 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:24:24,742 INFO L124 PetriNetUnfolderBase]: 1593/2431 cut-off events. [2023-08-26 21:24:24,742 INFO L125 PetriNetUnfolderBase]: For 1497/1501 co-relation queries the response was YES. [2023-08-26 21:24:24,745 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6323 conditions, 2431 events. 1593/2431 cut-off events. For 1497/1501 co-relation queries the response was YES. Maximal size of possible extension queue 167. Compared 12616 event pairs, 536 based on Foata normal form. 3/2383 useless extension candidates. Maximal degree in co-relation 6307. Up to 1003 conditions per place. [2023-08-26 21:24:24,750 INFO L140 encePairwiseOnDemand]: 253/260 looper letters, 53 selfloop transitions, 7 changer transitions 0/63 dead transitions. [2023-08-26 21:24:24,751 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 63 transitions, 342 flow [2023-08-26 21:24:24,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 21:24:24,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 21:24:24,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 504 transitions. [2023-08-26 21:24:24,753 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4846153846153846 [2023-08-26 21:24:24,753 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 504 transitions. [2023-08-26 21:24:24,753 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 504 transitions. [2023-08-26 21:24:24,753 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:24:24,753 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 504 transitions. [2023-08-26 21:24:24,755 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 126.0) internal successors, (504), 4 states have internal predecessors, (504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:24:24,757 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 260.0) internal successors, (1300), 5 states have internal predecessors, (1300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:24:24,757 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 260.0) internal successors, (1300), 5 states have internal predecessors, (1300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:24:24,757 INFO L175 Difference]: Start difference. First operand has 42 places, 31 transitions, 122 flow. Second operand 4 states and 504 transitions. [2023-08-26 21:24:24,757 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 63 transitions, 342 flow [2023-08-26 21:24:24,759 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 63 transitions, 337 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 21:24:24,760 INFO L231 Difference]: Finished difference. Result has 44 places, 34 transitions, 161 flow [2023-08-26 21:24:24,761 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=260, PETRI_DIFFERENCE_MINUEND_FLOW=117, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=161, PETRI_PLACES=44, PETRI_TRANSITIONS=34} [2023-08-26 21:24:24,761 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 5 predicate places. [2023-08-26 21:24:24,761 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 34 transitions, 161 flow [2023-08-26 21:24:24,761 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 113.75) internal successors, (455), 4 states have internal predecessors, (455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:24:24,762 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:24:24,762 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:24:24,762 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-26 21:24:24,762 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-26 21:24:24,762 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:24:24,762 INFO L85 PathProgramCache]: Analyzing trace with hash -1804921013, now seen corresponding path program 1 times [2023-08-26 21:24:24,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:24:24,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136511586] [2023-08-26 21:24:24,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:24:24,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:24:24,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:24:24,871 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-26 21:24:24,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:24:24,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136511586] [2023-08-26 21:24:24,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2136511586] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:24:24,872 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:24:24,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 21:24:24,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562712230] [2023-08-26 21:24:24,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:24:24,872 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 21:24:24,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:24:24,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 21:24:24,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 21:24:24,874 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 260 [2023-08-26 21:24:24,874 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 34 transitions, 161 flow. Second operand has 4 states, 4 states have (on average 113.0) internal successors, (452), 4 states have internal predecessors, (452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:24:24,874 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:24:24,874 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 260 [2023-08-26 21:24:24,875 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:24:25,711 INFO L124 PetriNetUnfolderBase]: 4272/6473 cut-off events. [2023-08-26 21:24:25,711 INFO L125 PetriNetUnfolderBase]: For 6661/6661 co-relation queries the response was YES. [2023-08-26 21:24:25,720 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18975 conditions, 6473 events. 4272/6473 cut-off events. For 6661/6661 co-relation queries the response was YES. Maximal size of possible extension queue 327. Compared 36614 event pairs, 856 based on Foata normal form. 102/6476 useless extension candidates. Maximal degree in co-relation 18958. Up to 2152 conditions per place. [2023-08-26 21:24:25,737 INFO L140 encePairwiseOnDemand]: 256/260 looper letters, 90 selfloop transitions, 6 changer transitions 6/102 dead transitions. [2023-08-26 21:24:25,738 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 102 transitions, 689 flow [2023-08-26 21:24:25,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 21:24:25,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 21:24:25,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 628 transitions. [2023-08-26 21:24:25,740 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48307692307692307 [2023-08-26 21:24:25,740 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 628 transitions. [2023-08-26 21:24:25,740 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 628 transitions. [2023-08-26 21:24:25,741 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:24:25,741 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 628 transitions. [2023-08-26 21:24:25,742 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 125.6) internal successors, (628), 5 states have internal predecessors, (628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:24:25,744 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 260.0) internal successors, (1560), 6 states have internal predecessors, (1560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:24:25,744 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 260.0) internal successors, (1560), 6 states have internal predecessors, (1560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:24:25,744 INFO L175 Difference]: Start difference. First operand has 44 places, 34 transitions, 161 flow. Second operand 5 states and 628 transitions. [2023-08-26 21:24:25,744 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 102 transitions, 689 flow [2023-08-26 21:24:25,749 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 102 transitions, 639 flow, removed 12 selfloop flow, removed 2 redundant places. [2023-08-26 21:24:25,751 INFO L231 Difference]: Finished difference. Result has 50 places, 38 transitions, 200 flow [2023-08-26 21:24:25,751 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=260, PETRI_DIFFERENCE_MINUEND_FLOW=147, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=200, PETRI_PLACES=50, PETRI_TRANSITIONS=38} [2023-08-26 21:24:25,752 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 11 predicate places. [2023-08-26 21:24:25,752 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 38 transitions, 200 flow [2023-08-26 21:24:25,752 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 113.0) internal successors, (452), 4 states have internal predecessors, (452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:24:25,752 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:24:25,752 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:24:25,752 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-26 21:24:25,752 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-26 21:24:25,753 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:24:25,753 INFO L85 PathProgramCache]: Analyzing trace with hash -403792295, now seen corresponding path program 1 times [2023-08-26 21:24:25,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:24:25,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481781040] [2023-08-26 21:24:25,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:24:25,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:24:25,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:24:26,691 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-26 21:24:26,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:24:26,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481781040] [2023-08-26 21:24:26,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1481781040] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:24:26,692 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:24:26,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 21:24:26,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462422326] [2023-08-26 21:24:26,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:24:26,693 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 21:24:26,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:24:26,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 21:24:26,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-08-26 21:24:26,694 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 260 [2023-08-26 21:24:26,695 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 38 transitions, 200 flow. Second operand has 6 states, 6 states have (on average 94.0) internal successors, (564), 6 states have internal predecessors, (564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:24:26,695 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:24:26,695 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 260 [2023-08-26 21:24:26,695 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:24:27,644 INFO L124 PetriNetUnfolderBase]: 3404/5324 cut-off events. [2023-08-26 21:24:27,645 INFO L125 PetriNetUnfolderBase]: For 5182/5215 co-relation queries the response was YES. [2023-08-26 21:24:27,653 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15229 conditions, 5324 events. 3404/5324 cut-off events. For 5182/5215 co-relation queries the response was YES. Maximal size of possible extension queue 336. Compared 31540 event pairs, 1180 based on Foata normal form. 25/5207 useless extension candidates. Maximal degree in co-relation 15210. Up to 4925 conditions per place. [2023-08-26 21:24:27,669 INFO L140 encePairwiseOnDemand]: 250/260 looper letters, 59 selfloop transitions, 20 changer transitions 0/84 dead transitions. [2023-08-26 21:24:27,669 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 84 transitions, 518 flow [2023-08-26 21:24:27,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-26 21:24:27,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-26 21:24:27,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 710 transitions. [2023-08-26 21:24:27,672 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3901098901098901 [2023-08-26 21:24:27,672 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 710 transitions. [2023-08-26 21:24:27,672 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 710 transitions. [2023-08-26 21:24:27,673 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:24:27,673 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 710 transitions. [2023-08-26 21:24:27,675 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 101.42857142857143) internal successors, (710), 7 states have internal predecessors, (710), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:24:27,677 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 260.0) internal successors, (2080), 8 states have internal predecessors, (2080), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:24:27,677 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 260.0) internal successors, (2080), 8 states have internal predecessors, (2080), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:24:27,678 INFO L175 Difference]: Start difference. First operand has 50 places, 38 transitions, 200 flow. Second operand 7 states and 710 transitions. [2023-08-26 21:24:27,678 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 84 transitions, 518 flow [2023-08-26 21:24:27,684 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 84 transitions, 516 flow, removed 1 selfloop flow, removed 0 redundant places. [2023-08-26 21:24:27,685 INFO L231 Difference]: Finished difference. Result has 59 places, 57 transitions, 319 flow [2023-08-26 21:24:27,685 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=260, PETRI_DIFFERENCE_MINUEND_FLOW=198, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=319, PETRI_PLACES=59, PETRI_TRANSITIONS=57} [2023-08-26 21:24:27,686 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 20 predicate places. [2023-08-26 21:24:27,686 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 57 transitions, 319 flow [2023-08-26 21:24:27,686 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 94.0) internal successors, (564), 6 states have internal predecessors, (564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:24:27,686 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:24:27,686 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:24:27,686 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-26 21:24:27,687 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-26 21:24:27,687 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:24:27,687 INFO L85 PathProgramCache]: Analyzing trace with hash 1640997791, now seen corresponding path program 1 times [2023-08-26 21:24:27,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:24:27,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377353419] [2023-08-26 21:24:27,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:24:27,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:24:27,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:24:28,583 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-26 21:24:28,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:24:28,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377353419] [2023-08-26 21:24:28,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [377353419] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:24:28,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:24:28,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 21:24:28,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150925194] [2023-08-26 21:24:28,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:24:28,584 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-26 21:24:28,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:24:28,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-26 21:24:28,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-08-26 21:24:28,585 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 260 [2023-08-26 21:24:28,586 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 57 transitions, 319 flow. Second operand has 7 states, 7 states have (on average 92.85714285714286) internal successors, (650), 7 states have internal predecessors, (650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:24:28,586 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:24:28,586 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 260 [2023-08-26 21:24:28,586 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:24:29,318 INFO L124 PetriNetUnfolderBase]: 3435/5324 cut-off events. [2023-08-26 21:24:29,319 INFO L125 PetriNetUnfolderBase]: For 8987/9234 co-relation queries the response was YES. [2023-08-26 21:24:29,330 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18923 conditions, 5324 events. 3435/5324 cut-off events. For 8987/9234 co-relation queries the response was YES. Maximal size of possible extension queue 342. Compared 31044 event pairs, 1483 based on Foata normal form. 128/5273 useless extension candidates. Maximal degree in co-relation 18899. Up to 5063 conditions per place. [2023-08-26 21:24:29,349 INFO L140 encePairwiseOnDemand]: 251/260 looper letters, 69 selfloop transitions, 16 changer transitions 0/90 dead transitions. [2023-08-26 21:24:29,349 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 90 transitions, 642 flow [2023-08-26 21:24:29,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 21:24:29,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 21:24:29,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 508 transitions. [2023-08-26 21:24:29,351 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39076923076923076 [2023-08-26 21:24:29,351 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 508 transitions. [2023-08-26 21:24:29,351 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 508 transitions. [2023-08-26 21:24:29,351 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:24:29,352 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 508 transitions. [2023-08-26 21:24:29,353 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 101.6) internal successors, (508), 5 states have internal predecessors, (508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:24:29,355 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 260.0) internal successors, (1560), 6 states have internal predecessors, (1560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:24:29,355 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 260.0) internal successors, (1560), 6 states have internal predecessors, (1560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:24:29,355 INFO L175 Difference]: Start difference. First operand has 59 places, 57 transitions, 319 flow. Second operand 5 states and 508 transitions. [2023-08-26 21:24:29,355 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 90 transitions, 642 flow [2023-08-26 21:24:29,366 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 90 transitions, 636 flow, removed 3 selfloop flow, removed 0 redundant places. [2023-08-26 21:24:29,368 INFO L231 Difference]: Finished difference. Result has 66 places, 71 transitions, 460 flow [2023-08-26 21:24:29,368 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=260, PETRI_DIFFERENCE_MINUEND_FLOW=313, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=460, PETRI_PLACES=66, PETRI_TRANSITIONS=71} [2023-08-26 21:24:29,368 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 27 predicate places. [2023-08-26 21:24:29,368 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 71 transitions, 460 flow [2023-08-26 21:24:29,369 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 92.85714285714286) internal successors, (650), 7 states have internal predecessors, (650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:24:29,369 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:24:29,369 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:24:29,369 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-26 21:24:29,369 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-26 21:24:29,370 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:24:29,370 INFO L85 PathProgramCache]: Analyzing trace with hash 1641007401, now seen corresponding path program 1 times [2023-08-26 21:24:29,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:24:29,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792689096] [2023-08-26 21:24:29,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:24:29,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:24:29,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:24:30,557 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-26 21:24:30,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:24:30,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792689096] [2023-08-26 21:24:30,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [792689096] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:24:30,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:24:30,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 21:24:30,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427397857] [2023-08-26 21:24:30,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:24:30,559 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-26 21:24:30,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:24:30,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-26 21:24:30,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-08-26 21:24:30,561 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 260 [2023-08-26 21:24:30,561 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 71 transitions, 460 flow. Second operand has 7 states, 7 states have (on average 93.85714285714286) internal successors, (657), 7 states have internal predecessors, (657), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:24:30,561 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:24:30,561 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 260 [2023-08-26 21:24:30,561 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:24:31,512 INFO L124 PetriNetUnfolderBase]: 3982/6148 cut-off events. [2023-08-26 21:24:31,512 INFO L125 PetriNetUnfolderBase]: For 14338/14797 co-relation queries the response was YES. [2023-08-26 21:24:31,525 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24217 conditions, 6148 events. 3982/6148 cut-off events. For 14338/14797 co-relation queries the response was YES. Maximal size of possible extension queue 398. Compared 36748 event pairs, 1493 based on Foata normal form. 259/6235 useless extension candidates. Maximal degree in co-relation 24188. Up to 4122 conditions per place. [2023-08-26 21:24:31,551 INFO L140 encePairwiseOnDemand]: 251/260 looper letters, 91 selfloop transitions, 35 changer transitions 0/131 dead transitions. [2023-08-26 21:24:31,551 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 131 transitions, 1034 flow [2023-08-26 21:24:31,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-26 21:24:31,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-26 21:24:31,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 716 transitions. [2023-08-26 21:24:31,554 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3934065934065934 [2023-08-26 21:24:31,554 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 716 transitions. [2023-08-26 21:24:31,554 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 716 transitions. [2023-08-26 21:24:31,554 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:24:31,555 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 716 transitions. [2023-08-26 21:24:31,556 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 102.28571428571429) internal successors, (716), 7 states have internal predecessors, (716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:24:31,558 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 260.0) internal successors, (2080), 8 states have internal predecessors, (2080), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:24:31,559 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 260.0) internal successors, (2080), 8 states have internal predecessors, (2080), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:24:31,559 INFO L175 Difference]: Start difference. First operand has 66 places, 71 transitions, 460 flow. Second operand 7 states and 716 transitions. [2023-08-26 21:24:31,559 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 131 transitions, 1034 flow [2023-08-26 21:24:31,573 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 131 transitions, 1034 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-26 21:24:31,574 INFO L231 Difference]: Finished difference. Result has 74 places, 88 transitions, 688 flow [2023-08-26 21:24:31,575 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=260, PETRI_DIFFERENCE_MINUEND_FLOW=456, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=688, PETRI_PLACES=74, PETRI_TRANSITIONS=88} [2023-08-26 21:24:31,575 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 35 predicate places. [2023-08-26 21:24:31,575 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 88 transitions, 688 flow [2023-08-26 21:24:31,576 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 93.85714285714286) internal successors, (657), 7 states have internal predecessors, (657), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:24:31,576 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:24:31,576 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:24:31,576 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-26 21:24:31,576 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-26 21:24:31,576 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:24:31,576 INFO L85 PathProgramCache]: Analyzing trace with hash -1951554007, now seen corresponding path program 2 times [2023-08-26 21:24:31,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:24:31,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349466816] [2023-08-26 21:24:31,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:24:31,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:24:31,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:24:31,711 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-26 21:24:31,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:24:31,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349466816] [2023-08-26 21:24:31,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1349466816] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:24:31,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:24:31,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 21:24:31,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576842459] [2023-08-26 21:24:31,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:24:31,712 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 21:24:31,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:24:31,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 21:24:31,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 21:24:31,713 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 260 [2023-08-26 21:24:31,714 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 88 transitions, 688 flow. Second operand has 4 states, 4 states have (on average 113.75) internal successors, (455), 4 states have internal predecessors, (455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:24:31,714 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:24:31,714 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 260 [2023-08-26 21:24:31,714 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:24:32,973 INFO L124 PetriNetUnfolderBase]: 6200/9356 cut-off events. [2023-08-26 21:24:32,973 INFO L125 PetriNetUnfolderBase]: For 30102/30102 co-relation queries the response was YES. [2023-08-26 21:24:32,991 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43197 conditions, 9356 events. 6200/9356 cut-off events. For 30102/30102 co-relation queries the response was YES. Maximal size of possible extension queue 511. Compared 55901 event pairs, 1731 based on Foata normal form. 30/9263 useless extension candidates. Maximal degree in co-relation 43164. Up to 3830 conditions per place. [2023-08-26 21:24:33,026 INFO L140 encePairwiseOnDemand]: 256/260 looper letters, 269 selfloop transitions, 8 changer transitions 6/283 dead transitions. [2023-08-26 21:24:33,026 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 283 transitions, 2751 flow [2023-08-26 21:24:33,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 21:24:33,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 21:24:33,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 628 transitions. [2023-08-26 21:24:33,030 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48307692307692307 [2023-08-26 21:24:33,030 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 628 transitions. [2023-08-26 21:24:33,030 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 628 transitions. [2023-08-26 21:24:33,030 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:24:33,030 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 628 transitions. [2023-08-26 21:24:33,032 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 125.6) internal successors, (628), 5 states have internal predecessors, (628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:24:33,033 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 260.0) internal successors, (1560), 6 states have internal predecessors, (1560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:24:33,034 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 260.0) internal successors, (1560), 6 states have internal predecessors, (1560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:24:33,034 INFO L175 Difference]: Start difference. First operand has 74 places, 88 transitions, 688 flow. Second operand 5 states and 628 transitions. [2023-08-26 21:24:33,034 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 283 transitions, 2751 flow [2023-08-26 21:24:33,110 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 283 transitions, 2713 flow, removed 19 selfloop flow, removed 0 redundant places. [2023-08-26 21:24:33,113 INFO L231 Difference]: Finished difference. Result has 79 places, 91 transitions, 718 flow [2023-08-26 21:24:33,113 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=260, PETRI_DIFFERENCE_MINUEND_FLOW=678, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=718, PETRI_PLACES=79, PETRI_TRANSITIONS=91} [2023-08-26 21:24:33,115 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 40 predicate places. [2023-08-26 21:24:33,115 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 91 transitions, 718 flow [2023-08-26 21:24:33,115 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 113.75) internal successors, (455), 4 states have internal predecessors, (455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:24:33,115 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:24:33,115 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:24:33,116 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-26 21:24:33,116 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-26 21:24:33,116 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:24:33,116 INFO L85 PathProgramCache]: Analyzing trace with hash 1479343671, now seen corresponding path program 3 times [2023-08-26 21:24:33,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:24:33,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173076907] [2023-08-26 21:24:33,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:24:33,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:24:33,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:24:33,230 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-26 21:24:33,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:24:33,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173076907] [2023-08-26 21:24:33,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [173076907] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:24:33,232 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:24:33,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 21:24:33,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549918599] [2023-08-26 21:24:33,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:24:33,232 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 21:24:33,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:24:33,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 21:24:33,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 21:24:33,233 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 260 [2023-08-26 21:24:33,234 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 91 transitions, 718 flow. Second operand has 3 states, 3 states have (on average 116.0) internal successors, (348), 3 states have internal predecessors, (348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:24:33,234 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:24:33,234 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 260 [2023-08-26 21:24:33,234 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:24:34,497 INFO L124 PetriNetUnfolderBase]: 6168/9323 cut-off events. [2023-08-26 21:24:34,498 INFO L125 PetriNetUnfolderBase]: For 29730/29730 co-relation queries the response was YES. [2023-08-26 21:24:34,516 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42841 conditions, 9323 events. 6168/9323 cut-off events. For 29730/29730 co-relation queries the response was YES. Maximal size of possible extension queue 509. Compared 55505 event pairs, 2364 based on Foata normal form. 30/9230 useless extension candidates. Maximal degree in co-relation 42806. Up to 5151 conditions per place. [2023-08-26 21:24:34,545 INFO L140 encePairwiseOnDemand]: 257/260 looper letters, 138 selfloop transitions, 6 changer transitions 3/147 dead transitions. [2023-08-26 21:24:34,546 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 147 transitions, 1420 flow [2023-08-26 21:24:34,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 21:24:34,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 21:24:34,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 377 transitions. [2023-08-26 21:24:34,547 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48333333333333334 [2023-08-26 21:24:34,547 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 377 transitions. [2023-08-26 21:24:34,547 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 377 transitions. [2023-08-26 21:24:34,548 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:24:34,548 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 377 transitions. [2023-08-26 21:24:34,549 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 125.66666666666667) internal successors, (377), 3 states have internal predecessors, (377), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:24:34,550 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 260.0) internal successors, (1040), 4 states have internal predecessors, (1040), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:24:34,550 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 260.0) internal successors, (1040), 4 states have internal predecessors, (1040), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:24:34,550 INFO L175 Difference]: Start difference. First operand has 79 places, 91 transitions, 718 flow. Second operand 3 states and 377 transitions. [2023-08-26 21:24:34,550 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 147 transitions, 1420 flow [2023-08-26 21:24:34,577 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 147 transitions, 1412 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 21:24:34,579 INFO L231 Difference]: Finished difference. Result has 79 places, 90 transitions, 697 flow [2023-08-26 21:24:34,579 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=260, PETRI_DIFFERENCE_MINUEND_FLOW=685, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=697, PETRI_PLACES=79, PETRI_TRANSITIONS=90} [2023-08-26 21:24:34,579 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 40 predicate places. [2023-08-26 21:24:34,580 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 90 transitions, 697 flow [2023-08-26 21:24:34,580 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 116.0) internal successors, (348), 3 states have internal predecessors, (348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:24:34,580 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:24:34,580 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:24:34,580 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-26 21:24:34,580 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-26 21:24:34,581 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:24:34,581 INFO L85 PathProgramCache]: Analyzing trace with hash 1412605594, now seen corresponding path program 1 times [2023-08-26 21:24:34,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:24:34,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736889302] [2023-08-26 21:24:34,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:24:34,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:24:34,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:24:34,766 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-26 21:24:34,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:24:34,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736889302] [2023-08-26 21:24:34,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1736889302] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:24:34,767 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:24:34,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 21:24:34,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904432592] [2023-08-26 21:24:34,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:24:34,767 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 21:24:34,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:24:34,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 21:24:34,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 21:24:34,768 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 260 [2023-08-26 21:24:34,769 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 90 transitions, 697 flow. Second operand has 4 states, 4 states have (on average 112.5) internal successors, (450), 4 states have internal predecessors, (450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:24:34,769 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:24:34,769 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 260 [2023-08-26 21:24:34,769 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:24:35,684 INFO L124 PetriNetUnfolderBase]: 3510/5938 cut-off events. [2023-08-26 21:24:35,684 INFO L125 PetriNetUnfolderBase]: For 20176/20423 co-relation queries the response was YES. [2023-08-26 21:24:35,701 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26094 conditions, 5938 events. 3510/5938 cut-off events. For 20176/20423 co-relation queries the response was YES. Maximal size of possible extension queue 448. Compared 41059 event pairs, 526 based on Foata normal form. 660/6412 useless extension candidates. Maximal degree in co-relation 26060. Up to 3912 conditions per place. [2023-08-26 21:24:35,719 INFO L140 encePairwiseOnDemand]: 254/260 looper letters, 113 selfloop transitions, 8 changer transitions 3/131 dead transitions. [2023-08-26 21:24:35,719 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 131 transitions, 1243 flow [2023-08-26 21:24:35,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 21:24:35,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 21:24:35,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 608 transitions. [2023-08-26 21:24:35,721 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4676923076923077 [2023-08-26 21:24:35,722 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 608 transitions. [2023-08-26 21:24:35,722 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 608 transitions. [2023-08-26 21:24:35,722 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:24:35,722 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 608 transitions. [2023-08-26 21:24:35,723 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 121.6) internal successors, (608), 5 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-26 21:24:35,725 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 260.0) internal successors, (1560), 6 states have internal predecessors, (1560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:24:35,725 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 260.0) internal successors, (1560), 6 states have internal predecessors, (1560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:24:35,725 INFO L175 Difference]: Start difference. First operand has 79 places, 90 transitions, 697 flow. Second operand 5 states and 608 transitions. [2023-08-26 21:24:35,725 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 131 transitions, 1243 flow [2023-08-26 21:24:35,741 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 131 transitions, 1128 flow, removed 23 selfloop flow, removed 9 redundant places. [2023-08-26 21:24:35,743 INFO L231 Difference]: Finished difference. Result has 75 places, 65 transitions, 461 flow [2023-08-26 21:24:35,743 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=260, PETRI_DIFFERENCE_MINUEND_FLOW=404, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=461, PETRI_PLACES=75, PETRI_TRANSITIONS=65} [2023-08-26 21:24:35,743 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 36 predicate places. [2023-08-26 21:24:35,743 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 65 transitions, 461 flow [2023-08-26 21:24:35,743 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 112.5) internal successors, (450), 4 states have internal predecessors, (450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:24:35,744 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:24:35,744 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:24:35,744 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-26 21:24:35,744 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-26 21:24:35,744 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:24:35,744 INFO L85 PathProgramCache]: Analyzing trace with hash 740509411, now seen corresponding path program 1 times [2023-08-26 21:24:35,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:24:35,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895530066] [2023-08-26 21:24:35,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:24:35,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:24:35,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:24:35,968 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-26 21:24:35,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:24:35,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895530066] [2023-08-26 21:24:35,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1895530066] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:24:35,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:24:35,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 21:24:35,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944628563] [2023-08-26 21:24:35,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:24:35,971 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 21:24:35,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:24:35,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 21:24:35,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-26 21:24:35,972 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 260 [2023-08-26 21:24:35,973 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 65 transitions, 461 flow. Second operand has 5 states, 5 states have (on average 112.0) internal successors, (560), 5 states have internal predecessors, (560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:24:35,973 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:24:35,973 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 260 [2023-08-26 21:24:35,973 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:24:36,657 INFO L124 PetriNetUnfolderBase]: 2503/4563 cut-off events. [2023-08-26 21:24:36,657 INFO L125 PetriNetUnfolderBase]: For 16135/16252 co-relation queries the response was YES. [2023-08-26 21:24:36,667 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20625 conditions, 4563 events. 2503/4563 cut-off events. For 16135/16252 co-relation queries the response was YES. Maximal size of possible extension queue 345. Compared 32923 event pairs, 255 based on Foata normal form. 392/4753 useless extension candidates. Maximal degree in co-relation 20593. Up to 1484 conditions per place. [2023-08-26 21:24:36,676 INFO L140 encePairwiseOnDemand]: 254/260 looper letters, 124 selfloop transitions, 15 changer transitions 3/149 dead transitions. [2023-08-26 21:24:36,676 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 149 transitions, 1324 flow [2023-08-26 21:24:36,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-26 21:24:36,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-26 21:24:36,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 849 transitions. [2023-08-26 21:24:36,679 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4664835164835165 [2023-08-26 21:24:36,679 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 849 transitions. [2023-08-26 21:24:36,679 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 849 transitions. [2023-08-26 21:24:36,680 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:24:36,680 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 849 transitions. [2023-08-26 21:24:36,681 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 121.28571428571429) internal successors, (849), 7 states have internal predecessors, (849), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:24:36,684 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 260.0) internal successors, (2080), 8 states have internal predecessors, (2080), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:24:36,684 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 260.0) internal successors, (2080), 8 states have internal predecessors, (2080), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:24:36,684 INFO L175 Difference]: Start difference. First operand has 75 places, 65 transitions, 461 flow. Second operand 7 states and 849 transitions. [2023-08-26 21:24:36,684 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 149 transitions, 1324 flow [2023-08-26 21:24:36,763 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 149 transitions, 1311 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-08-26 21:24:36,765 INFO L231 Difference]: Finished difference. Result has 81 places, 66 transitions, 505 flow [2023-08-26 21:24:36,765 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=260, PETRI_DIFFERENCE_MINUEND_FLOW=436, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=505, PETRI_PLACES=81, PETRI_TRANSITIONS=66} [2023-08-26 21:24:36,766 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 42 predicate places. [2023-08-26 21:24:36,766 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 66 transitions, 505 flow [2023-08-26 21:24:36,766 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 112.0) internal successors, (560), 5 states have internal predecessors, (560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:24:36,766 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:24:36,766 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-26 21:24:36,766 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-08-26 21:24:36,766 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting P2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-26 21:24:36,767 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:24:36,767 INFO L85 PathProgramCache]: Analyzing trace with hash 631287758, now seen corresponding path program 1 times [2023-08-26 21:24:36,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:24:36,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682688675] [2023-08-26 21:24:36,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:24:36,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:24:36,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:24:36,856 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-26 21:24:36,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:24:36,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682688675] [2023-08-26 21:24:36,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1682688675] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:24:36,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:24:36,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 21:24:36,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520839983] [2023-08-26 21:24:36,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:24:36,858 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 21:24:36,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:24:36,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 21:24:36,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-26 21:24:36,859 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 260 [2023-08-26 21:24:36,860 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 66 transitions, 505 flow. Second operand has 5 states, 5 states have (on average 114.2) internal successors, (571), 5 states have internal predecessors, (571), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:24:36,860 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:24:36,860 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 260 [2023-08-26 21:24:36,860 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:24:37,475 INFO L124 PetriNetUnfolderBase]: 2410/4320 cut-off events. [2023-08-26 21:24:37,476 INFO L125 PetriNetUnfolderBase]: For 17033/17161 co-relation queries the response was YES. [2023-08-26 21:24:37,485 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21921 conditions, 4320 events. 2410/4320 cut-off events. For 17033/17161 co-relation queries the response was YES. Maximal size of possible extension queue 345. Compared 30363 event pairs, 414 based on Foata normal form. 8/4287 useless extension candidates. Maximal degree in co-relation 21886. Up to 1736 conditions per place. [2023-08-26 21:24:37,488 INFO L140 encePairwiseOnDemand]: 253/260 looper letters, 44 selfloop transitions, 10 changer transitions 41/97 dead transitions. [2023-08-26 21:24:37,488 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 97 transitions, 907 flow [2023-08-26 21:24:37,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 21:24:37,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 21:24:37,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 610 transitions. [2023-08-26 21:24:37,490 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46923076923076923 [2023-08-26 21:24:37,490 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 610 transitions. [2023-08-26 21:24:37,490 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 610 transitions. [2023-08-26 21:24:37,490 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:24:37,490 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 610 transitions. [2023-08-26 21:24:37,492 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 122.0) internal successors, (610), 5 states have internal predecessors, (610), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:24:37,493 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 260.0) internal successors, (1560), 6 states have internal predecessors, (1560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:24:37,494 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 260.0) internal successors, (1560), 6 states have internal predecessors, (1560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:24:37,494 INFO L175 Difference]: Start difference. First operand has 81 places, 66 transitions, 505 flow. Second operand 5 states and 610 transitions. [2023-08-26 21:24:37,494 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 97 transitions, 907 flow [2023-08-26 21:24:37,566 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 97 transitions, 880 flow, removed 1 selfloop flow, removed 4 redundant places. [2023-08-26 21:24:37,567 INFO L231 Difference]: Finished difference. Result has 78 places, 36 transitions, 285 flow [2023-08-26 21:24:37,567 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=260, PETRI_DIFFERENCE_MINUEND_FLOW=460, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=285, PETRI_PLACES=78, PETRI_TRANSITIONS=36} [2023-08-26 21:24:37,568 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 39 predicate places. [2023-08-26 21:24:37,568 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 36 transitions, 285 flow [2023-08-26 21:24:37,568 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 114.2) internal successors, (571), 5 states have internal predecessors, (571), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:24:37,568 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:24:37,569 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:24:37,569 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-08-26 21:24:37,569 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-26 21:24:37,569 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:24:37,569 INFO L85 PathProgramCache]: Analyzing trace with hash -1012669769, now seen corresponding path program 1 times [2023-08-26 21:24:37,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:24:37,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715811596] [2023-08-26 21:24:37,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:24:37,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:24:37,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:24:37,802 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-26 21:24:37,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:24:37,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715811596] [2023-08-26 21:24:37,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1715811596] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:24:37,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:24:37,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 21:24:37,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251160012] [2023-08-26 21:24:37,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:24:37,803 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 21:24:37,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:24:37,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 21:24:37,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-26 21:24:37,805 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 260 [2023-08-26 21:24:37,805 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 36 transitions, 285 flow. Second operand has 6 states, 6 states have (on average 111.83333333333333) internal successors, (671), 6 states have internal predecessors, (671), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:24:37,805 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:24:37,806 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 260 [2023-08-26 21:24:37,806 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:24:37,935 INFO L124 PetriNetUnfolderBase]: 139/281 cut-off events. [2023-08-26 21:24:37,935 INFO L125 PetriNetUnfolderBase]: For 1165/1165 co-relation queries the response was YES. [2023-08-26 21:24:37,936 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1471 conditions, 281 events. 139/281 cut-off events. For 1165/1165 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1057 event pairs, 25 based on Foata normal form. 12/291 useless extension candidates. Maximal degree in co-relation 1437. Up to 115 conditions per place. [2023-08-26 21:24:37,937 INFO L140 encePairwiseOnDemand]: 254/260 looper letters, 41 selfloop transitions, 10 changer transitions 12/65 dead transitions. [2023-08-26 21:24:37,937 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 65 transitions, 614 flow [2023-08-26 21:24:37,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-26 21:24:37,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-26 21:24:37,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 814 transitions. [2023-08-26 21:24:37,939 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4472527472527473 [2023-08-26 21:24:37,939 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 814 transitions. [2023-08-26 21:24:37,939 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 814 transitions. [2023-08-26 21:24:37,940 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:24:37,940 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 814 transitions. [2023-08-26 21:24:37,941 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 116.28571428571429) internal successors, (814), 7 states have internal predecessors, (814), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:24:37,943 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 260.0) internal successors, (2080), 8 states have internal predecessors, (2080), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:24:37,944 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 260.0) internal successors, (2080), 8 states have internal predecessors, (2080), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:24:37,944 INFO L175 Difference]: Start difference. First operand has 78 places, 36 transitions, 285 flow. Second operand 7 states and 814 transitions. [2023-08-26 21:24:37,944 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 65 transitions, 614 flow [2023-08-26 21:24:37,946 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 65 transitions, 487 flow, removed 25 selfloop flow, removed 22 redundant places. [2023-08-26 21:24:37,947 INFO L231 Difference]: Finished difference. Result has 55 places, 36 transitions, 223 flow [2023-08-26 21:24:37,947 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=260, PETRI_DIFFERENCE_MINUEND_FLOW=191, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=223, PETRI_PLACES=55, PETRI_TRANSITIONS=36} [2023-08-26 21:24:37,948 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 16 predicate places. [2023-08-26 21:24:37,948 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 36 transitions, 223 flow [2023-08-26 21:24:37,948 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 111.83333333333333) internal successors, (671), 6 states have internal predecessors, (671), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:24:37,948 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:24:37,948 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:24:37,948 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-08-26 21:24:37,948 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-26 21:24:37,949 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:24:37,949 INFO L85 PathProgramCache]: Analyzing trace with hash -1412557187, now seen corresponding path program 1 times [2023-08-26 21:24:37,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:24:37,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049148203] [2023-08-26 21:24:37,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:24:37,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:24:38,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-26 21:24:38,028 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-26 21:24:38,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-26 21:24:38,169 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-26 21:24:38,169 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-26 21:24:38,170 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONASSERT (17 of 18 remaining) [2023-08-26 21:24:38,171 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONASSERT (16 of 18 remaining) [2023-08-26 21:24:38,172 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 18 remaining) [2023-08-26 21:24:38,173 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 18 remaining) [2023-08-26 21:24:38,173 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 18 remaining) [2023-08-26 21:24:38,175 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 18 remaining) [2023-08-26 21:24:38,175 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 18 remaining) [2023-08-26 21:24:38,175 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 18 remaining) [2023-08-26 21:24:38,175 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (9 of 18 remaining) [2023-08-26 21:24:38,175 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 18 remaining) [2023-08-26 21:24:38,176 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (7 of 18 remaining) [2023-08-26 21:24:38,176 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONASSERT (6 of 18 remaining) [2023-08-26 21:24:38,176 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 18 remaining) [2023-08-26 21:24:38,176 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 18 remaining) [2023-08-26 21:24:38,176 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 18 remaining) [2023-08-26 21:24:38,176 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 18 remaining) [2023-08-26 21:24:38,176 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 18 remaining) [2023-08-26 21:24:38,176 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 18 remaining) [2023-08-26 21:24:38,176 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-08-26 21:24:38,177 INFO L445 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:24:38,181 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-26 21:24:38,182 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-26 21:24:38,282 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.08 09:24:38 BasicIcfg [2023-08-26 21:24:38,282 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-26 21:24:38,283 INFO L158 Benchmark]: Toolchain (without parser) took 28369.51ms. Allocated memory was 360.7MB in the beginning and 1.5GB in the end (delta: 1.1GB). Free memory was 335.1MB in the beginning and 1.1GB in the end (delta: -763.8MB). Peak memory consumption was 375.6MB. Max. memory is 16.0GB. [2023-08-26 21:24:38,283 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 360.7MB. Free memory is still 336.8MB. There was no memory consumed. Max. memory is 16.0GB. [2023-08-26 21:24:38,283 INFO L158 Benchmark]: CACSL2BoogieTranslator took 583.80ms. Allocated memory is still 360.7MB. Free memory was 335.1MB in the beginning and 310.7MB in the end (delta: 24.4MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. [2023-08-26 21:24:38,284 INFO L158 Benchmark]: Boogie Procedure Inliner took 71.57ms. Allocated memory is still 360.7MB. Free memory was 310.7MB in the beginning and 307.9MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. [2023-08-26 21:24:38,284 INFO L158 Benchmark]: Boogie Preprocessor took 56.69ms. Allocated memory is still 360.7MB. Free memory was 307.9MB in the beginning and 305.4MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-26 21:24:38,284 INFO L158 Benchmark]: RCFGBuilder took 910.37ms. Allocated memory is still 360.7MB. Free memory was 305.4MB in the beginning and 276.2MB in the end (delta: 29.3MB). Peak memory consumption was 31.4MB. Max. memory is 16.0GB. [2023-08-26 21:24:38,284 INFO L158 Benchmark]: TraceAbstraction took 26741.35ms. Allocated memory was 360.7MB in the beginning and 1.5GB in the end (delta: 1.1GB). Free memory was 275.1MB in the beginning and 1.1GB in the end (delta: -823.9MB). Peak memory consumption was 314.9MB. Max. memory is 16.0GB. [2023-08-26 21:24:38,285 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 360.7MB. Free memory is still 336.8MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 583.80ms. Allocated memory is still 360.7MB. Free memory was 335.1MB in the beginning and 310.7MB in the end (delta: 24.4MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 71.57ms. Allocated memory is still 360.7MB. Free memory was 310.7MB in the beginning and 307.9MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. * Boogie Preprocessor took 56.69ms. Allocated memory is still 360.7MB. Free memory was 307.9MB in the beginning and 305.4MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 910.37ms. Allocated memory is still 360.7MB. Free memory was 305.4MB in the beginning and 276.2MB in the end (delta: 29.3MB). Peak memory consumption was 31.4MB. Max. memory is 16.0GB. * TraceAbstraction took 26741.35ms. Allocated memory was 360.7MB in the beginning and 1.5GB in the end (delta: 1.1GB). Free memory was 275.1MB in the beginning and 1.1GB in the end (delta: -823.9MB). Peak memory consumption was 314.9MB. 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: 7.4s, 141 PlacesBefore, 39 PlacesAfterwards, 134 TransitionsBefore, 29 TransitionsAfterwards, 2776 CoEnabledTransitionPairs, 7 FixpointIterations, 57 TrivialSequentialCompositions, 46 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 17 ConcurrentYvCompositions, 3 ChoiceCompositions, 123 TotalNumberOfCompositions, 10679 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 4140, independent: 3825, independent conditional: 0, independent unconditional: 3825, dependent: 315, dependent conditional: 0, dependent unconditional: 315, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1579, independent: 1511, independent conditional: 0, independent unconditional: 1511, dependent: 68, dependent conditional: 0, dependent unconditional: 68, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 4140, independent: 2314, independent conditional: 0, independent unconditional: 2314, dependent: 247, dependent conditional: 0, dependent unconditional: 247, unknown: 1579, unknown conditional: 0, unknown unconditional: 1579] , Statistics on independence cache: Total cache size (in pairs): 153, Positive cache size: 129, Positive conditional cache size: 0, Positive unconditional cache size: 129, Negative cache size: 24, Negative conditional cache size: 0, Negative unconditional cache size: 24, 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; [L712] 0 _Bool __unbuffered_p1_EAX$flush_delayed; [L713] 0 int __unbuffered_p1_EAX$mem_tmp; [L714] 0 _Bool __unbuffered_p1_EAX$r_buff0_thd0; [L715] 0 _Bool __unbuffered_p1_EAX$r_buff0_thd1; [L716] 0 _Bool __unbuffered_p1_EAX$r_buff0_thd2; [L717] 0 _Bool __unbuffered_p1_EAX$r_buff0_thd3; [L718] 0 _Bool __unbuffered_p1_EAX$r_buff1_thd0; [L719] 0 _Bool __unbuffered_p1_EAX$r_buff1_thd1; [L720] 0 _Bool __unbuffered_p1_EAX$r_buff1_thd2; [L721] 0 _Bool __unbuffered_p1_EAX$r_buff1_thd3; [L722] 0 _Bool __unbuffered_p1_EAX$read_delayed; [L723] 0 int *__unbuffered_p1_EAX$read_delayed_var; [L724] 0 int __unbuffered_p1_EAX$w_buff0; [L725] 0 _Bool __unbuffered_p1_EAX$w_buff0_used; [L726] 0 int __unbuffered_p1_EAX$w_buff1; [L727] 0 _Bool __unbuffered_p1_EAX$w_buff1_used; [L729] 0 int __unbuffered_p2_EAX = 0; [L731] 0 int __unbuffered_p2_EBX = 0; [L732] 0 _Bool main$tmp_guard0; [L733] 0 _Bool main$tmp_guard1; [L735] 0 int x = 0; [L736] 0 _Bool x$flush_delayed; [L737] 0 int x$mem_tmp; [L738] 0 _Bool x$r_buff0_thd0; [L739] 0 _Bool x$r_buff0_thd1; [L740] 0 _Bool x$r_buff0_thd2; [L741] 0 _Bool x$r_buff0_thd3; [L742] 0 _Bool x$r_buff1_thd0; [L743] 0 _Bool x$r_buff1_thd1; [L744] 0 _Bool x$r_buff1_thd2; [L745] 0 _Bool x$r_buff1_thd3; [L746] 0 _Bool x$read_delayed; [L747] 0 int *x$read_delayed_var; [L748] 0 int x$w_buff0; [L749] 0 _Bool x$w_buff0_used; [L750] 0 int x$w_buff1; [L751] 0 _Bool x$w_buff1_used; [L753] 0 int y = 0; [L754] 0 _Bool weak$$choice0; [L755] 0 _Bool weak$$choice1; [L756] 0 _Bool weak$$choice2; [L853] 0 pthread_t t1852; [L854] FCALL, FORK 0 pthread_create(&t1852, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=0, __unbuffered_p1_EAX$read_delayed_var={0:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1852, ((void *)0), P0, ((void *)0))=-3, t1852={7:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L855] 0 pthread_t t1853; [L856] FCALL, FORK 0 pthread_create(&t1853, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=0, __unbuffered_p1_EAX$read_delayed_var={0:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1853, ((void *)0), P1, ((void *)0))=-2, t1852={7:0}, t1853={5:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L789] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L790] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L791] 2 x$flush_delayed = weak$$choice2 [L792] EXPR 2 \read(x) [L792] 2 x$mem_tmp = x [L793] 2 weak$$choice1 = __VERIFIER_nondet_bool() [L794] EXPR 2 !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L794] EXPR 2 \read(x) [L794] EXPR 2 !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L794] 2 x = !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L795] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)))) [L796] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)))) [L797] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? weak$$choice0 || !weak$$choice1 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? weak$$choice0 : weak$$choice0)))) [L798] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? weak$$choice0 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)))) [L799] 2 x$r_buff0_thd2 = weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)))) [L800] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x$r_buff1_thd2 : (_Bool)0) : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)))) [L801] 2 __unbuffered_p1_EAX$read_delayed = (_Bool)1 [L802] 2 __unbuffered_p1_EAX$read_delayed_var = &x [L803] EXPR 2 \read(x) [L803] 2 __unbuffered_p1_EAX = x [L804] EXPR 2 x$flush_delayed ? x$mem_tmp : x [L804] EXPR 2 \read(x) [L804] EXPR 2 x$flush_delayed ? x$mem_tmp : x [L804] 2 x = x$flush_delayed ? x$mem_tmp : x [L805] 2 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L808] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L811] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L811] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L811] EXPR 2 \read(x) [L811] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L811] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L811] 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) [L812] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L813] 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 [L814] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L815] 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 [__unbuffered_cnt=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L857] 0 pthread_t t1854; [L858] FCALL, FORK 0 pthread_create(&t1854, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1854, ((void *)0), P2, ((void *)0))=-1, t1852={7:0}, t1853={5:0}, t1854={8:0}, weak$$choice0=6, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L825] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L828] 3 __unbuffered_p2_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L760] 1 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L763] 1 x$w_buff1 = x$w_buff0 [L764] 1 x$w_buff0 = 1 [L765] 1 x$w_buff1_used = x$w_buff0_used [L766] 1 x$w_buff0_used = (_Bool)1 [L767] CALL 1 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L767] RET 1 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L768] 1 x$r_buff1_thd0 = x$r_buff0_thd0 [L769] 1 x$r_buff1_thd1 = x$r_buff0_thd1 [L770] 1 x$r_buff1_thd2 = x$r_buff0_thd2 [L771] 1 x$r_buff1_thd3 = x$r_buff0_thd3 [L772] 1 x$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L775] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L775] 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) [L776] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L777] 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 [L778] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L779] 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$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L818] EXPR 2 __unbuffered_cnt + 1 [L818] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L820] 2 return 0; [L831] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L831] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L831] EXPR 3 \read(x) [L831] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L831] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L831] 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) [L832] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L833] 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 [L834] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L835] 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=1, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L782] EXPR 1 __unbuffered_cnt + 1 [L782] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L784] 1 return 0; [L838] EXPR 3 __unbuffered_cnt + 1 [L838] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L840] 3 return 0; [L860] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L862] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L862] RET 0 assume_abort_if_not(main$tmp_guard0) [L864] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L864] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L864] EXPR 0 \read(x) [L864] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L864] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L864] 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) [L865] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L866] 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 [L867] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L868] 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$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1852={7:0}, t1853={5:0}, t1854={8:0}, weak$$choice0=6, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L871] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L872] EXPR 0 __unbuffered_p1_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p1_EAX$read_delayed_var : __unbuffered_p1_EAX) : __unbuffered_p1_EAX [L872] EXPR 0 weak$$choice1 ? *__unbuffered_p1_EAX$read_delayed_var : __unbuffered_p1_EAX [L872] EXPR 0 \read(*__unbuffered_p1_EAX$read_delayed_var) [L872] EXPR 0 weak$$choice1 ? *__unbuffered_p1_EAX$read_delayed_var : __unbuffered_p1_EAX [L872] EXPR 0 __unbuffered_p1_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p1_EAX$read_delayed_var : __unbuffered_p1_EAX) : __unbuffered_p1_EAX [L872] 0 __unbuffered_p1_EAX = __unbuffered_p1_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p1_EAX$read_delayed_var : __unbuffered_p1_EAX) : __unbuffered_p1_EAX [L873] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 1) [L875] 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", "safe003_power.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\read(__PRETTY_FUNCTION__)={49:52}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice1=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] - UnprovableResult [Line: 17]: Unable to prove that assertion always holds Unable to prove that assertion always holds Reason: Not analyzed. - UnprovableResult [Line: 782]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 782]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 818]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 818]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 838]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 838]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 856]: 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: 858]: 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: 854]: 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, 169 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: 26.5s, OverallIterations: 19, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 13.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 7.5s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 417 SdHoareTripleChecker+Valid, 1.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 417 mSDsluCounter, 23 SdHoareTripleChecker+Invalid, 1.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 7 mSDsCounter, 78 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1559 IncrementalHoareTripleChecker+Invalid, 1637 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 78 mSolverCounterUnsat, 16 mSDtfsCounter, 1559 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 63 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=718occurred in iteration=13, InterpolantAutomatonStates: 83, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 4.7s InterpolantComputationTime, 252 NumberOfCodeBlocks, 252 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 213 ConstructedInterpolants, 0 QuantifiedInterpolants, 1472 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-08-26 21:24:38,309 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...