/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/mix036_pso.opt_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-26 21:17:15,664 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-26 21:17:15,741 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:17:15,746 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-26 21:17:15,747 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-26 21:17:15,777 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-26 21:17:15,778 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-26 21:17:15,778 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-26 21:17:15,779 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-26 21:17:15,782 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-26 21:17:15,782 INFO L153 SettingsManager]: * Use SBE=true [2023-08-26 21:17:15,783 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-26 21:17:15,783 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-26 21:17:15,784 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-26 21:17:15,784 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-26 21:17:15,785 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-26 21:17:15,785 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-26 21:17:15,785 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-26 21:17:15,785 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-26 21:17:15,785 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-26 21:17:15,786 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-26 21:17:15,786 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-26 21:17:15,787 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-26 21:17:15,787 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-26 21:17:15,787 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-26 21:17:15,788 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-26 21:17:15,788 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-26 21:17:15,788 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 21:17:15,789 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-26 21:17:15,789 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-26 21:17:15,790 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-26 21:17:15,790 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-26 21:17:15,790 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-26 21:17:15,790 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-26 21:17:15,790 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-26 21:17:15,791 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:17:16,098 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-26 21:17:16,122 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-26 21:17:16,124 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-26 21:17:16,125 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-26 21:17:16,126 INFO L274 PluginConnector]: CDTParser initialized [2023-08-26 21:17:16,127 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix036_pso.opt_tso.opt.i [2023-08-26 21:17:17,316 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-26 21:17:17,622 INFO L384 CDTParser]: Found 1 translation units. [2023-08-26 21:17:17,623 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix036_pso.opt_tso.opt.i [2023-08-26 21:17:17,647 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/16bcc115d/436ffcf47df4415bb37769bd569be09e/FLAG7c735d37f [2023-08-26 21:17:17,661 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/16bcc115d/436ffcf47df4415bb37769bd569be09e [2023-08-26 21:17:17,665 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-26 21:17:17,667 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-26 21:17:17,670 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-26 21:17:17,670 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-26 21:17:17,672 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-26 21:17:17,674 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 09:17:17" (1/1) ... [2023-08-26 21:17:17,675 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2bfcabe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:17:17, skipping insertion in model container [2023-08-26 21:17:17,675 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 09:17:17" (1/1) ... [2023-08-26 21:17:17,726 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-26 21:17:18,066 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 21:17:18,081 INFO L201 MainTranslator]: Completed pre-run [2023-08-26 21:17:18,097 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-26 21:17:18,099 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-26 21:17:18,133 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 21:17:18,167 WARN L669 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-26 21:17:18,167 WARN L669 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-26 21:17:18,173 INFO L206 MainTranslator]: Completed translation [2023-08-26 21:17:18,173 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:17:18 WrapperNode [2023-08-26 21:17:18,173 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-26 21:17:18,174 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-26 21:17:18,174 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-26 21:17:18,175 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-26 21:17:18,181 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:17:18" (1/1) ... [2023-08-26 21:17:18,203 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:17:18" (1/1) ... [2023-08-26 21:17:18,232 INFO L138 Inliner]: procedures = 177, calls = 72, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 161 [2023-08-26 21:17:18,232 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-26 21:17:18,238 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-26 21:17:18,238 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-26 21:17:18,238 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-26 21:17:18,244 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:17:18" (1/1) ... [2023-08-26 21:17:18,245 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:17:18" (1/1) ... [2023-08-26 21:17:18,248 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:17:18" (1/1) ... [2023-08-26 21:17:18,248 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:17:18" (1/1) ... [2023-08-26 21:17:18,258 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:17:18" (1/1) ... [2023-08-26 21:17:18,281 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:17:18" (1/1) ... [2023-08-26 21:17:18,283 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:17:18" (1/1) ... [2023-08-26 21:17:18,284 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:17:18" (1/1) ... [2023-08-26 21:17:18,287 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-26 21:17:18,288 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-26 21:17:18,288 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-26 21:17:18,288 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-26 21:17:18,289 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:17:18" (1/1) ... [2023-08-26 21:17:18,296 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 21:17:18,306 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 21:17:18,317 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:17:18,337 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:17:18,351 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-26 21:17:18,352 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-26 21:17:18,352 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-26 21:17:18,352 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-26 21:17:18,353 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-26 21:17:18,353 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-26 21:17:18,353 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-26 21:17:18,353 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-26 21:17:18,353 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-26 21:17:18,353 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-26 21:17:18,353 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-26 21:17:18,353 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-08-26 21:17:18,353 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-08-26 21:17:18,354 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-26 21:17:18,354 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-26 21:17:18,355 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-26 21:17:18,355 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-26 21:17:18,356 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:17:18,500 INFO L236 CfgBuilder]: Building ICFG [2023-08-26 21:17:18,502 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-26 21:17:18,893 INFO L277 CfgBuilder]: Performing block encoding [2023-08-26 21:17:19,056 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-26 21:17:19,056 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-26 21:17:19,058 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 09:17:19 BoogieIcfgContainer [2023-08-26 21:17:19,058 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-26 21:17:19,061 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-26 21:17:19,061 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-26 21:17:19,064 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-26 21:17:19,064 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.08 09:17:17" (1/3) ... [2023-08-26 21:17:19,065 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4fb3af0a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 09:17:19, skipping insertion in model container [2023-08-26 21:17:19,065 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:17:18" (2/3) ... [2023-08-26 21:17:19,066 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4fb3af0a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 09:17:19, skipping insertion in model container [2023-08-26 21:17:19,066 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 09:17:19" (3/3) ... [2023-08-26 21:17:19,067 INFO L112 eAbstractionObserver]: Analyzing ICFG mix036_pso.opt_tso.opt.i [2023-08-26 21:17:19,083 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-26 21:17:19,084 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 10 error locations. [2023-08-26 21:17:19,084 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-26 21:17:19,151 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-26 21:17:19,192 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 153 places, 143 transitions, 306 flow [2023-08-26 21:17:19,264 INFO L124 PetriNetUnfolderBase]: 3/139 cut-off events. [2023-08-26 21:17:19,264 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 21:17:19,271 INFO L83 FinitePrefix]: Finished finitePrefix Result has 152 conditions, 139 events. 3/139 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 106 event pairs, 0 based on Foata normal form. 0/126 useless extension candidates. Maximal degree in co-relation 98. Up to 2 conditions per place. [2023-08-26 21:17:19,271 INFO L82 GeneralOperation]: Start removeDead. Operand has 153 places, 143 transitions, 306 flow [2023-08-26 21:17:19,278 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 149 places, 139 transitions, 290 flow [2023-08-26 21:17:19,282 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-26 21:17:19,296 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 149 places, 139 transitions, 290 flow [2023-08-26 21:17:19,300 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 149 places, 139 transitions, 290 flow [2023-08-26 21:17:19,300 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 149 places, 139 transitions, 290 flow [2023-08-26 21:17:19,348 INFO L124 PetriNetUnfolderBase]: 3/139 cut-off events. [2023-08-26 21:17:19,349 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 21:17:19,350 INFO L83 FinitePrefix]: Finished finitePrefix Result has 152 conditions, 139 events. 3/139 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 107 event pairs, 0 based on Foata normal form. 0/126 useless extension candidates. Maximal degree in co-relation 98. Up to 2 conditions per place. [2023-08-26 21:17:19,353 INFO L119 LiptonReduction]: Number of co-enabled transitions 4152 [2023-08-26 21:17:23,368 INFO L134 LiptonReduction]: Checked pairs total: 14328 [2023-08-26 21:17:23,368 INFO L136 LiptonReduction]: Total number of compositions: 123 [2023-08-26 21:17:23,380 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-26 21:17:23,386 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;@55926fc7, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-26 21:17:23,386 INFO L358 AbstractCegarLoop]: Starting to check reachability of 23 error locations. [2023-08-26 21:17:23,389 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-26 21:17:23,389 INFO L124 PetriNetUnfolderBase]: 0/6 cut-off events. [2023-08-26 21:17:23,389 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 21:17:23,389 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:17:23,390 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-26 21:17:23,390 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-26 21:17:23,394 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:17:23,395 INFO L85 PathProgramCache]: Analyzing trace with hash 582199734, now seen corresponding path program 1 times [2023-08-26 21:17:23,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:17:23,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41386577] [2023-08-26 21:17:23,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:17:23,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:17:23,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:17:23,628 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:17:23,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:17:23,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41386577] [2023-08-26 21:17:23,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [41386577] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:17:23,629 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:17:23,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 21:17:23,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917072312] [2023-08-26 21:17:23,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:17:23,640 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 21:17:23,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:17:23,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 21:17:23,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 21:17:23,670 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 266 [2023-08-26 21:17:23,675 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 36 transitions, 84 flow. Second operand has 3 states, 3 states have (on average 117.33333333333333) internal successors, (352), 3 states have internal predecessors, (352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:17:23,676 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:17:23,676 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 266 [2023-08-26 21:17:23,677 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:17:25,095 INFO L124 PetriNetUnfolderBase]: 9509/13235 cut-off events. [2023-08-26 21:17:25,095 INFO L125 PetriNetUnfolderBase]: For 86/86 co-relation queries the response was YES. [2023-08-26 21:17:25,119 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26645 conditions, 13235 events. 9509/13235 cut-off events. For 86/86 co-relation queries the response was YES. Maximal size of possible extension queue 761. Compared 76514 event pairs, 2559 based on Foata normal form. 0/8406 useless extension candidates. Maximal degree in co-relation 26633. Up to 12139 conditions per place. [2023-08-26 21:17:25,197 INFO L140 encePairwiseOnDemand]: 252/266 looper letters, 49 selfloop transitions, 5 changer transitions 0/57 dead transitions. [2023-08-26 21:17:25,198 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 57 transitions, 243 flow [2023-08-26 21:17:25,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 21:17:25,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 21:17:25,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 412 transitions. [2023-08-26 21:17:25,216 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5162907268170426 [2023-08-26 21:17:25,216 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 412 transitions. [2023-08-26 21:17:25,217 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 412 transitions. [2023-08-26 21:17:25,220 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:17:25,222 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 412 transitions. [2023-08-26 21:17:25,227 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 137.33333333333334) internal successors, (412), 3 states have internal predecessors, (412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:17:25,232 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 266.0) internal successors, (1064), 4 states have internal predecessors, (1064), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:17:25,233 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 266.0) internal successors, (1064), 4 states have internal predecessors, (1064), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:17:25,235 INFO L175 Difference]: Start difference. First operand has 48 places, 36 transitions, 84 flow. Second operand 3 states and 412 transitions. [2023-08-26 21:17:25,236 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 57 transitions, 243 flow [2023-08-26 21:17:25,240 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 57 transitions, 236 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-26 21:17:25,242 INFO L231 Difference]: Finished difference. Result has 47 places, 39 transitions, 125 flow [2023-08-26 21:17:25,244 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=125, PETRI_PLACES=47, PETRI_TRANSITIONS=39} [2023-08-26 21:17:25,247 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, -1 predicate places. [2023-08-26 21:17:25,247 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 39 transitions, 125 flow [2023-08-26 21:17:25,247 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 117.33333333333333) internal successors, (352), 3 states have internal predecessors, (352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:17:25,248 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:17:25,248 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:17:25,248 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-26 21:17:25,248 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P3Err0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-26 21:17:25,256 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:17:25,256 INFO L85 PathProgramCache]: Analyzing trace with hash -289368066, now seen corresponding path program 1 times [2023-08-26 21:17:25,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:17:25,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526991161] [2023-08-26 21:17:25,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:17:25,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:17:25,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:17:25,525 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:17:25,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:17:25,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526991161] [2023-08-26 21:17:25,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [526991161] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:17:25,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:17:25,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 21:17:25,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805425005] [2023-08-26 21:17:25,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:17:25,527 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 21:17:25,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:17:25,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 21:17:25,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 21:17:25,529 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 266 [2023-08-26 21:17:25,529 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 39 transitions, 125 flow. Second operand has 3 states, 3 states have (on average 124.0) internal successors, (372), 3 states have internal predecessors, (372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:17:25,530 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:17:25,530 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 266 [2023-08-26 21:17:25,530 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:17:26,427 INFO L124 PetriNetUnfolderBase]: 6528/9778 cut-off events. [2023-08-26 21:17:26,427 INFO L125 PetriNetUnfolderBase]: For 1218/1690 co-relation queries the response was YES. [2023-08-26 21:17:26,455 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23733 conditions, 9778 events. 6528/9778 cut-off events. For 1218/1690 co-relation queries the response was YES. Maximal size of possible extension queue 763. Compared 65651 event pairs, 1504 based on Foata normal form. 0/7251 useless extension candidates. Maximal degree in co-relation 23722. Up to 6998 conditions per place. [2023-08-26 21:17:26,508 INFO L140 encePairwiseOnDemand]: 263/266 looper letters, 46 selfloop transitions, 2 changer transitions 0/55 dead transitions. [2023-08-26 21:17:26,508 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 55 transitions, 274 flow [2023-08-26 21:17:26,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 21:17:26,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 21:17:26,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 405 transitions. [2023-08-26 21:17:26,510 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5075187969924813 [2023-08-26 21:17:26,510 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 405 transitions. [2023-08-26 21:17:26,510 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 405 transitions. [2023-08-26 21:17:26,510 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:17:26,510 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 405 transitions. [2023-08-26 21:17:26,511 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 135.0) internal successors, (405), 3 states have internal predecessors, (405), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:17:26,513 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 266.0) internal successors, (1064), 4 states have internal predecessors, (1064), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:17:26,514 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 266.0) internal successors, (1064), 4 states have internal predecessors, (1064), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:17:26,514 INFO L175 Difference]: Start difference. First operand has 47 places, 39 transitions, 125 flow. Second operand 3 states and 405 transitions. [2023-08-26 21:17:26,514 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 55 transitions, 274 flow [2023-08-26 21:17:26,515 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 55 transitions, 266 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 21:17:26,516 INFO L231 Difference]: Finished difference. Result has 47 places, 38 transitions, 122 flow [2023-08-26 21:17:26,516 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=122, PETRI_PLACES=47, PETRI_TRANSITIONS=38} [2023-08-26 21:17:26,517 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, -1 predicate places. [2023-08-26 21:17:26,517 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 38 transitions, 122 flow [2023-08-26 21:17:26,518 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 124.0) internal successors, (372), 3 states have internal predecessors, (372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:17:26,518 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:17:26,518 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:17:26,518 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-26 21:17:26,518 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-26 21:17:26,519 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:17:26,519 INFO L85 PathProgramCache]: Analyzing trace with hash -2873728, now seen corresponding path program 1 times [2023-08-26 21:17:26,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:17:26,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979430390] [2023-08-26 21:17:26,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:17:26,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:17:26,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:17:26,572 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:17:26,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:17:26,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979430390] [2023-08-26 21:17:26,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1979430390] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:17:26,573 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:17:26,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 21:17:26,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001757195] [2023-08-26 21:17:26,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:17:26,574 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 21:17:26,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:17:26,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 21:17:26,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 21:17:26,575 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 266 [2023-08-26 21:17:26,576 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 38 transitions, 122 flow. Second operand has 4 states, 4 states have (on average 118.0) internal successors, (472), 4 states have internal predecessors, (472), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:17:26,576 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:17:26,576 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 266 [2023-08-26 21:17:26,576 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:17:27,169 INFO L124 PetriNetUnfolderBase]: 4789/6711 cut-off events. [2023-08-26 21:17:27,170 INFO L125 PetriNetUnfolderBase]: For 646/646 co-relation queries the response was YES. [2023-08-26 21:17:27,182 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16481 conditions, 6711 events. 4789/6711 cut-off events. For 646/646 co-relation queries the response was YES. Maximal size of possible extension queue 366. Compared 34728 event pairs, 1132 based on Foata normal form. 0/5211 useless extension candidates. Maximal degree in co-relation 16469. Up to 5810 conditions per place. [2023-08-26 21:17:27,211 INFO L140 encePairwiseOnDemand]: 257/266 looper letters, 43 selfloop transitions, 5 changer transitions 0/51 dead transitions. [2023-08-26 21:17:27,211 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 51 transitions, 244 flow [2023-08-26 21:17:27,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 21:17:27,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 21:17:27,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 516 transitions. [2023-08-26 21:17:27,213 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4849624060150376 [2023-08-26 21:17:27,213 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 516 transitions. [2023-08-26 21:17:27,214 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 516 transitions. [2023-08-26 21:17:27,214 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:17:27,214 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 516 transitions. [2023-08-26 21:17:27,215 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 129.0) internal successors, (516), 4 states have internal predecessors, (516), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:17:27,217 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 266.0) internal successors, (1330), 5 states have internal predecessors, (1330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:17:27,218 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 266.0) internal successors, (1330), 5 states have internal predecessors, (1330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:17:27,218 INFO L175 Difference]: Start difference. First operand has 47 places, 38 transitions, 122 flow. Second operand 4 states and 516 transitions. [2023-08-26 21:17:27,218 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 51 transitions, 244 flow [2023-08-26 21:17:27,220 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 51 transitions, 238 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 21:17:27,221 INFO L231 Difference]: Finished difference. Result has 44 places, 34 transitions, 112 flow [2023-08-26 21:17:27,221 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=112, PETRI_PLACES=44, PETRI_TRANSITIONS=34} [2023-08-26 21:17:27,222 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, -4 predicate places. [2023-08-26 21:17:27,222 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 34 transitions, 112 flow [2023-08-26 21:17:27,223 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 118.0) internal successors, (472), 4 states have internal predecessors, (472), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:17:27,223 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:17:27,223 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:17:27,223 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-26 21:17:27,223 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-26 21:17:27,224 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:17:27,224 INFO L85 PathProgramCache]: Analyzing trace with hash 876787233, now seen corresponding path program 1 times [2023-08-26 21:17:27,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:17:27,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458890666] [2023-08-26 21:17:27,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:17:27,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:17:27,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:17:27,265 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:17:27,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:17:27,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458890666] [2023-08-26 21:17:27,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [458890666] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:17:27,266 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:17:27,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 21:17:27,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696382072] [2023-08-26 21:17:27,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:17:27,267 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 21:17:27,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:17:27,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 21:17:27,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-26 21:17:27,268 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 266 [2023-08-26 21:17:27,269 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 34 transitions, 112 flow. Second operand has 4 states, 4 states have (on average 118.0) internal successors, (472), 4 states have internal predecessors, (472), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:17:27,269 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:17:27,269 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 266 [2023-08-26 21:17:27,269 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:17:27,770 INFO L124 PetriNetUnfolderBase]: 2967/4214 cut-off events. [2023-08-26 21:17:27,770 INFO L125 PetriNetUnfolderBase]: For 1202/1202 co-relation queries the response was YES. [2023-08-26 21:17:27,779 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10327 conditions, 4214 events. 2967/4214 cut-off events. For 1202/1202 co-relation queries the response was YES. Maximal size of possible extension queue 208. Compared 20098 event pairs, 638 based on Foata normal form. 0/3725 useless extension candidates. Maximal degree in co-relation 10315. Up to 1818 conditions per place. [2023-08-26 21:17:27,797 INFO L140 encePairwiseOnDemand]: 257/266 looper letters, 58 selfloop transitions, 9 changer transitions 0/70 dead transitions. [2023-08-26 21:17:27,798 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 70 transitions, 336 flow [2023-08-26 21:17:27,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 21:17:27,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 21:17:27,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 535 transitions. [2023-08-26 21:17:27,800 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5028195488721805 [2023-08-26 21:17:27,800 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 535 transitions. [2023-08-26 21:17:27,800 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 535 transitions. [2023-08-26 21:17:27,801 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:17:27,801 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 535 transitions. [2023-08-26 21:17:27,802 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 133.75) internal successors, (535), 4 states have internal predecessors, (535), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:17:27,804 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 266.0) internal successors, (1330), 5 states have internal predecessors, (1330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:17:27,805 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 266.0) internal successors, (1330), 5 states have internal predecessors, (1330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:17:27,805 INFO L175 Difference]: Start difference. First operand has 44 places, 34 transitions, 112 flow. Second operand 4 states and 535 transitions. [2023-08-26 21:17:27,805 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 70 transitions, 336 flow [2023-08-26 21:17:27,807 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 70 transitions, 330 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 21:17:27,808 INFO L231 Difference]: Finished difference. Result has 46 places, 38 transitions, 164 flow [2023-08-26 21:17:27,808 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=164, PETRI_PLACES=46, PETRI_TRANSITIONS=38} [2023-08-26 21:17:27,809 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, -2 predicate places. [2023-08-26 21:17:27,809 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 38 transitions, 164 flow [2023-08-26 21:17:27,809 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 118.0) internal successors, (472), 4 states have internal predecessors, (472), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:17:27,810 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:17:27,810 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:17:27,810 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-26 21:17:27,810 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-26 21:17:27,810 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:17:27,811 INFO L85 PathProgramCache]: Analyzing trace with hash 1090238430, now seen corresponding path program 1 times [2023-08-26 21:17:27,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:17:27,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643365550] [2023-08-26 21:17:27,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:17:27,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:17:27,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:17:28,036 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:17:28,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:17:28,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [643365550] [2023-08-26 21:17:28,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [643365550] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:17:28,037 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:17:28,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 21:17:28,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517295904] [2023-08-26 21:17:28,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:17:28,037 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 21:17:28,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:17:28,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 21:17:28,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 21:17:28,039 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 266 [2023-08-26 21:17:28,039 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 38 transitions, 164 flow. Second operand has 3 states, 3 states have (on average 122.66666666666667) internal successors, (368), 3 states have internal predecessors, (368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:17:28,039 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:17:28,039 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 266 [2023-08-26 21:17:28,040 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:17:28,447 INFO L124 PetriNetUnfolderBase]: 2733/4036 cut-off events. [2023-08-26 21:17:28,447 INFO L125 PetriNetUnfolderBase]: For 3271/3271 co-relation queries the response was YES. [2023-08-26 21:17:28,453 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11502 conditions, 4036 events. 2733/4036 cut-off events. For 3271/3271 co-relation queries the response was YES. Maximal size of possible extension queue 200. Compared 21041 event pairs, 916 based on Foata normal form. 0/3642 useless extension candidates. Maximal degree in co-relation 11489. Up to 2572 conditions per place. [2023-08-26 21:17:28,471 INFO L140 encePairwiseOnDemand]: 263/266 looper letters, 52 selfloop transitions, 2 changer transitions 0/57 dead transitions. [2023-08-26 21:17:28,471 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 57 transitions, 367 flow [2023-08-26 21:17:28,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 21:17:28,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 21:17:28,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 398 transitions. [2023-08-26 21:17:28,473 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49874686716791977 [2023-08-26 21:17:28,473 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 398 transitions. [2023-08-26 21:17:28,473 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 398 transitions. [2023-08-26 21:17:28,473 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:17:28,474 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 398 transitions. [2023-08-26 21:17:28,475 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 132.66666666666666) internal successors, (398), 3 states have internal predecessors, (398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:17:28,476 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 266.0) internal successors, (1064), 4 states have internal predecessors, (1064), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:17:28,477 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 266.0) internal successors, (1064), 4 states have internal predecessors, (1064), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:17:28,477 INFO L175 Difference]: Start difference. First operand has 46 places, 38 transitions, 164 flow. Second operand 3 states and 398 transitions. [2023-08-26 21:17:28,477 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 57 transitions, 367 flow [2023-08-26 21:17:28,479 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 57 transitions, 337 flow, removed 7 selfloop flow, removed 2 redundant places. [2023-08-26 21:17:28,480 INFO L231 Difference]: Finished difference. Result has 47 places, 38 transitions, 154 flow [2023-08-26 21:17:28,480 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=146, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=154, PETRI_PLACES=47, PETRI_TRANSITIONS=38} [2023-08-26 21:17:28,481 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, -1 predicate places. [2023-08-26 21:17:28,481 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 38 transitions, 154 flow [2023-08-26 21:17:28,482 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 122.66666666666667) internal successors, (368), 3 states have internal predecessors, (368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:17:28,482 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:17:28,482 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:17:28,482 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-26 21:17:28,482 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-26 21:17:28,482 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:17:28,482 INFO L85 PathProgramCache]: Analyzing trace with hash -307662112, now seen corresponding path program 1 times [2023-08-26 21:17:28,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:17:28,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626469096] [2023-08-26 21:17:28,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:17:28,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:17:28,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:17:28,659 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:17:28,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:17:28,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626469096] [2023-08-26 21:17:28,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [626469096] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:17:28,659 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:17:28,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 21:17:28,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415116252] [2023-08-26 21:17:28,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:17:28,660 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 21:17:28,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:17:28,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 21:17:28,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 21:17:28,662 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 266 [2023-08-26 21:17:28,663 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 38 transitions, 154 flow. Second operand has 4 states, 4 states have (on average 115.25) internal successors, (461), 4 states have internal predecessors, (461), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:17:28,663 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:17:28,663 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 266 [2023-08-26 21:17:28,663 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:17:29,080 INFO L124 PetriNetUnfolderBase]: 2487/3699 cut-off events. [2023-08-26 21:17:29,080 INFO L125 PetriNetUnfolderBase]: For 1475/1475 co-relation queries the response was YES. [2023-08-26 21:17:29,089 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10222 conditions, 3699 events. 2487/3699 cut-off events. For 1475/1475 co-relation queries the response was YES. Maximal size of possible extension queue 197. Compared 19150 event pairs, 559 based on Foata normal form. 223/3625 useless extension candidates. Maximal degree in co-relation 10208. Up to 2830 conditions per place. [2023-08-26 21:17:29,103 INFO L140 encePairwiseOnDemand]: 259/266 looper letters, 69 selfloop transitions, 10 changer transitions 0/82 dead transitions. [2023-08-26 21:17:29,104 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 82 transitions, 475 flow [2023-08-26 21:17:29,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 21:17:29,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 21:17:29,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 633 transitions. [2023-08-26 21:17:29,106 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47593984962406016 [2023-08-26 21:17:29,106 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 633 transitions. [2023-08-26 21:17:29,106 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 633 transitions. [2023-08-26 21:17:29,106 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:17:29,107 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 633 transitions. [2023-08-26 21:17:29,108 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 126.6) internal successors, (633), 5 states have internal predecessors, (633), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:17:29,110 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 266.0) internal successors, (1596), 6 states have internal predecessors, (1596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:17:29,111 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 266.0) internal successors, (1596), 6 states have internal predecessors, (1596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:17:29,111 INFO L175 Difference]: Start difference. First operand has 47 places, 38 transitions, 154 flow. Second operand 5 states and 633 transitions. [2023-08-26 21:17:29,111 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 82 transitions, 475 flow [2023-08-26 21:17:29,115 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 82 transitions, 465 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 21:17:29,116 INFO L231 Difference]: Finished difference. Result has 52 places, 43 transitions, 221 flow [2023-08-26 21:17:29,116 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=150, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=221, PETRI_PLACES=52, PETRI_TRANSITIONS=43} [2023-08-26 21:17:29,118 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, 4 predicate places. [2023-08-26 21:17:29,121 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 43 transitions, 221 flow [2023-08-26 21:17:29,121 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 115.25) internal successors, (461), 4 states have internal predecessors, (461), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:17:29,122 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:17:29,122 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:17:29,122 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-26 21:17:29,122 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting P2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-26 21:17:29,122 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:17:29,125 INFO L85 PathProgramCache]: Analyzing trace with hash 452830852, now seen corresponding path program 1 times [2023-08-26 21:17:29,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:17:29,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33000814] [2023-08-26 21:17:29,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:17:29,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:17:29,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:17:29,220 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:17:29,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:17:29,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33000814] [2023-08-26 21:17:29,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [33000814] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:17:29,220 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:17:29,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 21:17:29,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890426687] [2023-08-26 21:17:29,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:17:29,221 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 21:17:29,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:17:29,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 21:17:29,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-26 21:17:29,222 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 266 [2023-08-26 21:17:29,223 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 43 transitions, 221 flow. Second operand has 5 states, 5 states have (on average 118.6) internal successors, (593), 5 states have internal predecessors, (593), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:17:29,223 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:17:29,223 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 266 [2023-08-26 21:17:29,223 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:17:29,588 INFO L124 PetriNetUnfolderBase]: 2103/3093 cut-off events. [2023-08-26 21:17:29,588 INFO L125 PetriNetUnfolderBase]: For 2234/2234 co-relation queries the response was YES. [2023-08-26 21:17:29,596 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8996 conditions, 3093 events. 2103/3093 cut-off events. For 2234/2234 co-relation queries the response was YES. Maximal size of possible extension queue 177. Compared 15179 event pairs, 235 based on Foata normal form. 0/3066 useless extension candidates. Maximal degree in co-relation 8979. Up to 1320 conditions per place. [2023-08-26 21:17:29,607 INFO L140 encePairwiseOnDemand]: 257/266 looper letters, 68 selfloop transitions, 17 changer transitions 0/88 dead transitions. [2023-08-26 21:17:29,607 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 88 transitions, 528 flow [2023-08-26 21:17:29,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 21:17:29,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 21:17:29,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 665 transitions. [2023-08-26 21:17:29,610 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5 [2023-08-26 21:17:29,610 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 665 transitions. [2023-08-26 21:17:29,610 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 665 transitions. [2023-08-26 21:17:29,611 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:17:29,611 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 665 transitions. [2023-08-26 21:17:29,612 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 133.0) internal successors, (665), 5 states have internal predecessors, (665), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:17:29,614 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 266.0) internal successors, (1596), 6 states have internal predecessors, (1596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:17:29,614 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 266.0) internal successors, (1596), 6 states have internal predecessors, (1596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:17:29,615 INFO L175 Difference]: Start difference. First operand has 52 places, 43 transitions, 221 flow. Second operand 5 states and 665 transitions. [2023-08-26 21:17:29,615 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 88 transitions, 528 flow [2023-08-26 21:17:29,625 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 88 transitions, 514 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 21:17:29,627 INFO L231 Difference]: Finished difference. Result has 55 places, 47 transitions, 289 flow [2023-08-26 21:17:29,627 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=207, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=289, PETRI_PLACES=55, PETRI_TRANSITIONS=47} [2023-08-26 21:17:29,632 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, 7 predicate places. [2023-08-26 21:17:29,632 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 47 transitions, 289 flow [2023-08-26 21:17:29,633 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 118.6) internal successors, (593), 5 states have internal predecessors, (593), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:17:29,633 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:17:29,633 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:17:29,633 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-26 21:17:29,633 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-26 21:17:29,633 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:17:29,633 INFO L85 PathProgramCache]: Analyzing trace with hash 1311386264, now seen corresponding path program 1 times [2023-08-26 21:17:29,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:17:29,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978048291] [2023-08-26 21:17:29,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:17:29,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:17:29,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:17:29,811 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:17:29,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:17:29,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978048291] [2023-08-26 21:17:29,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1978048291] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:17:29,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:17:29,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 21:17:29,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435096329] [2023-08-26 21:17:29,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:17:29,812 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 21:17:29,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:17:29,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 21:17:29,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-26 21:17:29,814 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 266 [2023-08-26 21:17:29,814 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 47 transitions, 289 flow. Second operand has 5 states, 5 states have (on average 115.0) internal successors, (575), 5 states have internal predecessors, (575), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:17:29,814 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:17:29,814 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 266 [2023-08-26 21:17:29,814 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:17:30,142 INFO L124 PetriNetUnfolderBase]: 1558/2400 cut-off events. [2023-08-26 21:17:30,142 INFO L125 PetriNetUnfolderBase]: For 3275/3275 co-relation queries the response was YES. [2023-08-26 21:17:30,147 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8139 conditions, 2400 events. 1558/2400 cut-off events. For 3275/3275 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 11897 event pairs, 181 based on Foata normal form. 136/2505 useless extension candidates. Maximal degree in co-relation 8121. Up to 862 conditions per place. [2023-08-26 21:17:30,153 INFO L140 encePairwiseOnDemand]: 259/266 looper letters, 83 selfloop transitions, 19 changer transitions 4/109 dead transitions. [2023-08-26 21:17:30,153 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 109 transitions, 738 flow [2023-08-26 21:17:30,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-26 21:17:30,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-26 21:17:30,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 884 transitions. [2023-08-26 21:17:30,156 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4747583243823845 [2023-08-26 21:17:30,156 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 884 transitions. [2023-08-26 21:17:30,156 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 884 transitions. [2023-08-26 21:17:30,156 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:17:30,157 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 884 transitions. [2023-08-26 21:17:30,158 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 126.28571428571429) internal successors, (884), 7 states have internal predecessors, (884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:17:30,161 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 266.0) internal successors, (2128), 8 states have internal predecessors, (2128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:17:30,161 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 266.0) internal successors, (2128), 8 states have internal predecessors, (2128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:17:30,162 INFO L175 Difference]: Start difference. First operand has 55 places, 47 transitions, 289 flow. Second operand 7 states and 884 transitions. [2023-08-26 21:17:30,162 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 109 transitions, 738 flow [2023-08-26 21:17:30,182 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 109 transitions, 672 flow, removed 16 selfloop flow, removed 3 redundant places. [2023-08-26 21:17:30,184 INFO L231 Difference]: Finished difference. Result has 61 places, 52 transitions, 341 flow [2023-08-26 21:17:30,184 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=247, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=341, PETRI_PLACES=61, PETRI_TRANSITIONS=52} [2023-08-26 21:17:30,184 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, 13 predicate places. [2023-08-26 21:17:30,185 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 52 transitions, 341 flow [2023-08-26 21:17:30,185 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 115.0) internal successors, (575), 5 states have internal predecessors, (575), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:17:30,185 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:17:30,185 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:17:30,185 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-26 21:17:30,186 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-26 21:17:30,186 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:17:30,186 INFO L85 PathProgramCache]: Analyzing trace with hash 1802727874, now seen corresponding path program 1 times [2023-08-26 21:17:30,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:17:30,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999783581] [2023-08-26 21:17:30,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:17:30,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:17:30,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:17:30,324 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:17:30,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:17:30,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999783581] [2023-08-26 21:17:30,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [999783581] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:17:30,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:17:30,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 21:17:30,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534742485] [2023-08-26 21:17:30,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:17:30,325 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 21:17:30,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:17:30,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 21:17:30,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 21:17:30,327 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 266 [2023-08-26 21:17:30,327 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 52 transitions, 341 flow. Second operand has 4 states, 4 states have (on average 114.75) internal successors, (459), 4 states have internal predecessors, (459), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:17:30,327 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:17:30,327 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 266 [2023-08-26 21:17:30,327 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:17:30,912 INFO L124 PetriNetUnfolderBase]: 4409/6624 cut-off events. [2023-08-26 21:17:30,912 INFO L125 PetriNetUnfolderBase]: For 13055/13055 co-relation queries the response was YES. [2023-08-26 21:17:30,926 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22661 conditions, 6624 events. 4409/6624 cut-off events. For 13055/13055 co-relation queries the response was YES. Maximal size of possible extension queue 245. Compared 35724 event pairs, 437 based on Foata normal form. 43/6611 useless extension candidates. Maximal degree in co-relation 22640. Up to 4008 conditions per place. [2023-08-26 21:17:30,943 INFO L140 encePairwiseOnDemand]: 257/266 looper letters, 136 selfloop transitions, 14 changer transitions 0/150 dead transitions. [2023-08-26 21:17:30,943 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 150 transitions, 1223 flow [2023-08-26 21:17:30,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 21:17:30,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 21:17:30,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 643 transitions. [2023-08-26 21:17:30,945 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48345864661654137 [2023-08-26 21:17:30,945 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 643 transitions. [2023-08-26 21:17:30,945 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 643 transitions. [2023-08-26 21:17:30,946 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:17:30,946 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 643 transitions. [2023-08-26 21:17:30,947 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 128.6) internal successors, (643), 5 states have internal predecessors, (643), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:17:30,948 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 266.0) internal successors, (1596), 6 states have internal predecessors, (1596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:17:30,949 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 266.0) internal successors, (1596), 6 states have internal predecessors, (1596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:17:30,949 INFO L175 Difference]: Start difference. First operand has 61 places, 52 transitions, 341 flow. Second operand 5 states and 643 transitions. [2023-08-26 21:17:30,949 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 150 transitions, 1223 flow [2023-08-26 21:17:31,058 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 150 transitions, 1130 flow, removed 3 selfloop flow, removed 4 redundant places. [2023-08-26 21:17:31,059 INFO L231 Difference]: Finished difference. Result has 64 places, 64 transitions, 404 flow [2023-08-26 21:17:31,060 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=307, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=404, PETRI_PLACES=64, PETRI_TRANSITIONS=64} [2023-08-26 21:17:31,060 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, 16 predicate places. [2023-08-26 21:17:31,060 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 64 transitions, 404 flow [2023-08-26 21:17:31,061 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 114.75) internal successors, (459), 4 states have internal predecessors, (459), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:17:31,061 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:17:31,061 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:17:31,061 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-26 21:17:31,061 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-26 21:17:31,062 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:17:31,062 INFO L85 PathProgramCache]: Analyzing trace with hash -1959629486, now seen corresponding path program 2 times [2023-08-26 21:17:31,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:17:31,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683318362] [2023-08-26 21:17:31,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:17:31,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:17:31,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:17:31,208 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:17:31,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:17:31,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [683318362] [2023-08-26 21:17:31,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [683318362] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:17:31,209 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:17:31,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 21:17:31,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294272566] [2023-08-26 21:17:31,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:17:31,209 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 21:17:31,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:17:31,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 21:17:31,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-26 21:17:31,210 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 266 [2023-08-26 21:17:31,211 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 64 transitions, 404 flow. Second operand has 6 states, 6 states have (on average 114.83333333333333) internal successors, (689), 6 states have internal predecessors, (689), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:17:31,211 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:17:31,211 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 266 [2023-08-26 21:17:31,211 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:17:31,794 INFO L124 PetriNetUnfolderBase]: 2722/4305 cut-off events. [2023-08-26 21:17:31,794 INFO L125 PetriNetUnfolderBase]: For 9030/9286 co-relation queries the response was YES. [2023-08-26 21:17:31,810 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16773 conditions, 4305 events. 2722/4305 cut-off events. For 9030/9286 co-relation queries the response was YES. Maximal size of possible extension queue 287. Compared 25194 event pairs, 217 based on Foata normal form. 269/4392 useless extension candidates. Maximal degree in co-relation 16749. Up to 920 conditions per place. [2023-08-26 21:17:31,825 INFO L140 encePairwiseOnDemand]: 259/266 looper letters, 116 selfloop transitions, 28 changer transitions 4/155 dead transitions. [2023-08-26 21:17:31,825 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 155 transitions, 1113 flow [2023-08-26 21:17:31,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-26 21:17:31,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-26 21:17:31,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1133 transitions. [2023-08-26 21:17:31,829 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47326649958228906 [2023-08-26 21:17:31,829 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1133 transitions. [2023-08-26 21:17:31,830 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1133 transitions. [2023-08-26 21:17:31,830 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:17:31,830 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1133 transitions. [2023-08-26 21:17:31,833 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 125.88888888888889) internal successors, (1133), 9 states have internal predecessors, (1133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:17:31,837 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 266.0) internal successors, (2660), 10 states have internal predecessors, (2660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:17:31,839 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 266.0) internal successors, (2660), 10 states have internal predecessors, (2660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:17:31,840 INFO L175 Difference]: Start difference. First operand has 64 places, 64 transitions, 404 flow. Second operand 9 states and 1133 transitions. [2023-08-26 21:17:31,840 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 155 transitions, 1113 flow [2023-08-26 21:17:31,960 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 155 transitions, 1113 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-26 21:17:31,962 INFO L231 Difference]: Finished difference. Result has 75 places, 68 transitions, 505 flow [2023-08-26 21:17:31,962 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=505, PETRI_PLACES=75, PETRI_TRANSITIONS=68} [2023-08-26 21:17:31,963 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, 27 predicate places. [2023-08-26 21:17:31,963 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 68 transitions, 505 flow [2023-08-26 21:17:31,964 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 114.83333333333333) internal successors, (689), 6 states have internal predecessors, (689), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:17:31,964 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:17:31,964 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:17:31,964 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-26 21:17:31,965 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting P3Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-26 21:17:31,965 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:17:31,965 INFO L85 PathProgramCache]: Analyzing trace with hash -2025757459, now seen corresponding path program 1 times [2023-08-26 21:17:31,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:17:31,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640687506] [2023-08-26 21:17:31,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:17:31,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:17:31,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:17:32,075 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:17:32,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:17:32,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640687506] [2023-08-26 21:17:32,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1640687506] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:17:32,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:17:32,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 21:17:32,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088556405] [2023-08-26 21:17:32,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:17:32,077 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 21:17:32,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:17:32,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 21:17:32,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-08-26 21:17:32,078 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 266 [2023-08-26 21:17:32,079 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 68 transitions, 505 flow. Second operand has 6 states, 6 states have (on average 119.16666666666667) internal successors, (715), 6 states have internal predecessors, (715), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:17:32,079 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:17:32,079 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 266 [2023-08-26 21:17:32,080 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:17:32,527 INFO L124 PetriNetUnfolderBase]: 2675/4221 cut-off events. [2023-08-26 21:17:32,527 INFO L125 PetriNetUnfolderBase]: For 12431/12650 co-relation queries the response was YES. [2023-08-26 21:17:32,538 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18481 conditions, 4221 events. 2675/4221 cut-off events. For 12431/12650 co-relation queries the response was YES. Maximal size of possible extension queue 275. Compared 24573 event pairs, 392 based on Foata normal form. 106/4212 useless extension candidates. Maximal degree in co-relation 18452. Up to 1528 conditions per place. [2023-08-26 21:17:32,544 INFO L140 encePairwiseOnDemand]: 257/266 looper letters, 67 selfloop transitions, 27 changer transitions 8/109 dead transitions. [2023-08-26 21:17:32,544 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 109 transitions, 874 flow [2023-08-26 21:17:32,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-26 21:17:32,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-26 21:17:32,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 775 transitions. [2023-08-26 21:17:32,546 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4855889724310777 [2023-08-26 21:17:32,546 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 775 transitions. [2023-08-26 21:17:32,546 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 775 transitions. [2023-08-26 21:17:32,547 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:17:32,547 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 775 transitions. [2023-08-26 21:17:32,548 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 129.16666666666666) internal successors, (775), 6 states have internal predecessors, (775), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:17:32,550 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 266.0) internal successors, (1862), 7 states have internal predecessors, (1862), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:17:32,551 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 266.0) internal successors, (1862), 7 states have internal predecessors, (1862), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:17:32,551 INFO L175 Difference]: Start difference. First operand has 75 places, 68 transitions, 505 flow. Second operand 6 states and 775 transitions. [2023-08-26 21:17:32,551 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 109 transitions, 874 flow [2023-08-26 21:17:32,693 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 109 transitions, 820 flow, removed 2 selfloop flow, removed 6 redundant places. [2023-08-26 21:17:32,695 INFO L231 Difference]: Finished difference. Result has 70 places, 59 transitions, 436 flow [2023-08-26 21:17:32,695 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=419, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=436, PETRI_PLACES=70, PETRI_TRANSITIONS=59} [2023-08-26 21:17:32,696 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, 22 predicate places. [2023-08-26 21:17:32,696 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 59 transitions, 436 flow [2023-08-26 21:17:32,696 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 119.16666666666667) internal successors, (715), 6 states have internal predecessors, (715), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:17:32,696 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:17:32,696 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:17:32,696 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-26 21:17:32,696 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-26 21:17:32,697 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:17:32,697 INFO L85 PathProgramCache]: Analyzing trace with hash 240559361, now seen corresponding path program 1 times [2023-08-26 21:17:32,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:17:32,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676489956] [2023-08-26 21:17:32,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:17:32,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:17:32,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:17:32,912 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:17:32,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:17:32,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676489956] [2023-08-26 21:17:32,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [676489956] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:17:32,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:17:32,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 21:17:32,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174495057] [2023-08-26 21:17:32,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:17:32,913 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 21:17:32,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:17:32,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 21:17:32,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 21:17:32,914 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 266 [2023-08-26 21:17:32,915 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 59 transitions, 436 flow. Second operand has 4 states, 4 states have (on average 115.5) internal successors, (462), 4 states have internal predecessors, (462), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:17:32,915 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:17:32,915 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 266 [2023-08-26 21:17:32,915 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:17:33,448 INFO L124 PetriNetUnfolderBase]: 4329/6568 cut-off events. [2023-08-26 21:17:33,449 INFO L125 PetriNetUnfolderBase]: For 20642/20642 co-relation queries the response was YES. [2023-08-26 21:17:33,465 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28197 conditions, 6568 events. 4329/6568 cut-off events. For 20642/20642 co-relation queries the response was YES. Maximal size of possible extension queue 280. Compared 36535 event pairs, 326 based on Foata normal form. 10/6578 useless extension candidates. Maximal degree in co-relation 28168. Up to 4208 conditions per place. [2023-08-26 21:17:33,477 INFO L140 encePairwiseOnDemand]: 258/266 looper letters, 95 selfloop transitions, 20 changer transitions 40/155 dead transitions. [2023-08-26 21:17:33,477 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 155 transitions, 1447 flow [2023-08-26 21:17:33,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 21:17:33,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 21:17:33,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 623 transitions. [2023-08-26 21:17:33,479 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46842105263157896 [2023-08-26 21:17:33,479 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 623 transitions. [2023-08-26 21:17:33,479 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 623 transitions. [2023-08-26 21:17:33,480 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:17:33,480 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 623 transitions. [2023-08-26 21:17:33,481 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 124.6) internal successors, (623), 5 states have internal predecessors, (623), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:17:33,483 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 266.0) internal successors, (1596), 6 states have internal predecessors, (1596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:17:33,483 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 266.0) internal successors, (1596), 6 states have internal predecessors, (1596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:17:33,483 INFO L175 Difference]: Start difference. First operand has 70 places, 59 transitions, 436 flow. Second operand 5 states and 623 transitions. [2023-08-26 21:17:33,484 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 155 transitions, 1447 flow [2023-08-26 21:17:33,666 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 155 transitions, 1192 flow, removed 24 selfloop flow, removed 7 redundant places. [2023-08-26 21:17:33,668 INFO L231 Difference]: Finished difference. Result has 69 places, 61 transitions, 422 flow [2023-08-26 21:17:33,668 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=333, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=422, PETRI_PLACES=69, PETRI_TRANSITIONS=61} [2023-08-26 21:17:33,669 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, 21 predicate places. [2023-08-26 21:17:33,669 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 61 transitions, 422 flow [2023-08-26 21:17:33,669 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 115.5) internal successors, (462), 4 states have internal predecessors, (462), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:17:33,669 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:17:33,669 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:17:33,670 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-26 21:17:33,670 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-26 21:17:33,670 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:17:33,670 INFO L85 PathProgramCache]: Analyzing trace with hash -1915771863, now seen corresponding path program 2 times [2023-08-26 21:17:33,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:17:33,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309003731] [2023-08-26 21:17:33,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:17:33,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:17:33,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:17:33,865 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:17:33,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:17:33,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309003731] [2023-08-26 21:17:33,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [309003731] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:17:33,866 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:17:33,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-26 21:17:33,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768287285] [2023-08-26 21:17:33,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:17:33,867 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-26 21:17:33,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:17:33,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-26 21:17:33,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-08-26 21:17:33,868 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 266 [2023-08-26 21:17:33,869 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 61 transitions, 422 flow. Second operand has 7 states, 7 states have (on average 114.85714285714286) internal successors, (804), 7 states have internal predecessors, (804), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:17:33,869 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:17:33,869 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 266 [2023-08-26 21:17:33,869 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:17:34,176 INFO L124 PetriNetUnfolderBase]: 1338/2142 cut-off events. [2023-08-26 21:17:34,176 INFO L125 PetriNetUnfolderBase]: For 5205/5487 co-relation queries the response was YES. [2023-08-26 21:17:34,181 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8425 conditions, 2142 events. 1338/2142 cut-off events. For 5205/5487 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 11316 event pairs, 176 based on Foata normal form. 137/2224 useless extension candidates. Maximal degree in co-relation 8396. Up to 797 conditions per place. [2023-08-26 21:17:34,185 INFO L140 encePairwiseOnDemand]: 259/266 looper letters, 74 selfloop transitions, 18 changer transitions 15/122 dead transitions. [2023-08-26 21:17:34,185 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 122 transitions, 984 flow [2023-08-26 21:17:34,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-26 21:17:34,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-26 21:17:34,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 977 transitions. [2023-08-26 21:17:34,188 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4591165413533835 [2023-08-26 21:17:34,188 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 977 transitions. [2023-08-26 21:17:34,188 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 977 transitions. [2023-08-26 21:17:34,189 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:17:34,189 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 977 transitions. [2023-08-26 21:17:34,191 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 122.125) internal successors, (977), 8 states have internal predecessors, (977), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:17:34,193 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 266.0) internal successors, (2394), 9 states have internal predecessors, (2394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:17:34,194 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 266.0) internal successors, (2394), 9 states have internal predecessors, (2394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:17:34,194 INFO L175 Difference]: Start difference. First operand has 69 places, 61 transitions, 422 flow. Second operand 8 states and 977 transitions. [2023-08-26 21:17:34,194 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 122 transitions, 984 flow [2023-08-26 21:17:34,218 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 122 transitions, 948 flow, removed 8 selfloop flow, removed 7 redundant places. [2023-08-26 21:17:34,219 INFO L231 Difference]: Finished difference. Result has 66 places, 62 transitions, 458 flow [2023-08-26 21:17:34,219 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=398, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=458, PETRI_PLACES=66, PETRI_TRANSITIONS=62} [2023-08-26 21:17:34,220 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, 18 predicate places. [2023-08-26 21:17:34,220 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 62 transitions, 458 flow [2023-08-26 21:17:34,220 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 114.85714285714286) internal successors, (804), 7 states have internal predecessors, (804), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:17:34,220 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:17:34,221 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:17:34,221 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-26 21:17:34,221 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-26 21:17:34,221 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:17:34,221 INFO L85 PathProgramCache]: Analyzing trace with hash -1725692229, now seen corresponding path program 1 times [2023-08-26 21:17:34,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:17:34,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303655423] [2023-08-26 21:17:34,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:17:34,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:17:34,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:17:34,376 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:17:34,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:17:34,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303655423] [2023-08-26 21:17:34,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [303655423] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:17:34,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:17:34,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 21:17:34,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936959269] [2023-08-26 21:17:34,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:17:34,377 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 21:17:34,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:17:34,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 21:17:34,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 21:17:34,378 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 266 [2023-08-26 21:17:34,379 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 62 transitions, 458 flow. Second operand has 4 states, 4 states have (on average 122.75) internal successors, (491), 4 states have internal predecessors, (491), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:17:34,379 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:17:34,379 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 266 [2023-08-26 21:17:34,379 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:17:34,711 INFO L124 PetriNetUnfolderBase]: 1808/2966 cut-off events. [2023-08-26 21:17:34,711 INFO L125 PetriNetUnfolderBase]: For 9264/9420 co-relation queries the response was YES. [2023-08-26 21:17:34,718 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12970 conditions, 2966 events. 1808/2966 cut-off events. For 9264/9420 co-relation queries the response was YES. Maximal size of possible extension queue 164. Compared 16670 event pairs, 293 based on Foata normal form. 16/2970 useless extension candidates. Maximal degree in co-relation 12943. Up to 1694 conditions per place. [2023-08-26 21:17:34,721 INFO L140 encePairwiseOnDemand]: 263/266 looper letters, 61 selfloop transitions, 1 changer transitions 49/121 dead transitions. [2023-08-26 21:17:34,721 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 121 transitions, 1106 flow [2023-08-26 21:17:34,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 21:17:34,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 21:17:34,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 519 transitions. [2023-08-26 21:17:34,723 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48778195488721804 [2023-08-26 21:17:34,723 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 519 transitions. [2023-08-26 21:17:34,723 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 519 transitions. [2023-08-26 21:17:34,723 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:17:34,724 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 519 transitions. [2023-08-26 21:17:34,725 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 129.75) internal successors, (519), 4 states have internal predecessors, (519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:17:34,726 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 266.0) internal successors, (1330), 5 states have internal predecessors, (1330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:17:34,726 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 266.0) internal successors, (1330), 5 states have internal predecessors, (1330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:17:34,726 INFO L175 Difference]: Start difference. First operand has 66 places, 62 transitions, 458 flow. Second operand 4 states and 519 transitions. [2023-08-26 21:17:34,726 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 121 transitions, 1106 flow [2023-08-26 21:17:34,756 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 121 transitions, 1000 flow, removed 11 selfloop flow, removed 6 redundant places. [2023-08-26 21:17:34,757 INFO L231 Difference]: Finished difference. Result has 64 places, 55 transitions, 365 flow [2023-08-26 21:17:34,757 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=416, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=365, PETRI_PLACES=64, PETRI_TRANSITIONS=55} [2023-08-26 21:17:34,758 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, 16 predicate places. [2023-08-26 21:17:34,758 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 55 transitions, 365 flow [2023-08-26 21:17:34,758 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 122.75) internal successors, (491), 4 states have internal predecessors, (491), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:17:34,758 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:17:34,758 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:17:34,758 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-26 21:17:34,758 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-26 21:17:34,759 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:17:34,759 INFO L85 PathProgramCache]: Analyzing trace with hash -1494105921, now seen corresponding path program 2 times [2023-08-26 21:17:34,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:17:34,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057015829] [2023-08-26 21:17:34,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:17:34,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:17:34,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:17:35,616 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:17:35,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:17:35,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057015829] [2023-08-26 21:17:35,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1057015829] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:17:35,617 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:17:35,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-26 21:17:35,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4551542] [2023-08-26 21:17:35,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:17:35,617 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-26 21:17:35,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:17:35,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-26 21:17:35,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-08-26 21:17:35,619 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 266 [2023-08-26 21:17:35,620 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 55 transitions, 365 flow. Second operand has 8 states, 8 states have (on average 114.875) internal successors, (919), 8 states have internal predecessors, (919), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:17:35,621 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:17:35,621 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 266 [2023-08-26 21:17:35,621 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:17:36,250 INFO L124 PetriNetUnfolderBase]: 2318/3860 cut-off events. [2023-08-26 21:17:36,250 INFO L125 PetriNetUnfolderBase]: For 9539/9637 co-relation queries the response was YES. [2023-08-26 21:17:36,259 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15763 conditions, 3860 events. 2318/3860 cut-off events. For 9539/9637 co-relation queries the response was YES. Maximal size of possible extension queue 229. Compared 23000 event pairs, 401 based on Foata normal form. 26/3854 useless extension candidates. Maximal degree in co-relation 15740. Up to 1310 conditions per place. [2023-08-26 21:17:36,262 INFO L140 encePairwiseOnDemand]: 258/266 looper letters, 45 selfloop transitions, 2 changer transitions 170/224 dead transitions. [2023-08-26 21:17:36,262 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 224 transitions, 1866 flow [2023-08-26 21:17:36,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-08-26 21:17:36,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-08-26 21:17:36,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1332 transitions. [2023-08-26 21:17:36,268 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45522898154477104 [2023-08-26 21:17:36,268 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1332 transitions. [2023-08-26 21:17:36,268 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1332 transitions. [2023-08-26 21:17:36,269 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:17:36,269 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1332 transitions. [2023-08-26 21:17:36,271 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 121.0909090909091) internal successors, (1332), 11 states have internal predecessors, (1332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:17:36,274 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 266.0) internal successors, (3192), 12 states have internal predecessors, (3192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:17:36,275 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 266.0) internal successors, (3192), 12 states have internal predecessors, (3192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:17:36,275 INFO L175 Difference]: Start difference. First operand has 64 places, 55 transitions, 365 flow. Second operand 11 states and 1332 transitions. [2023-08-26 21:17:36,275 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 224 transitions, 1866 flow [2023-08-26 21:17:36,342 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 224 transitions, 1851 flow, removed 5 selfloop flow, removed 3 redundant places. [2023-08-26 21:17:36,343 INFO L231 Difference]: Finished difference. Result has 77 places, 53 transitions, 387 flow [2023-08-26 21:17:36,344 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=360, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=387, PETRI_PLACES=77, PETRI_TRANSITIONS=53} [2023-08-26 21:17:36,344 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, 29 predicate places. [2023-08-26 21:17:36,344 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 53 transitions, 387 flow [2023-08-26 21:17:36,344 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 114.875) internal successors, (919), 8 states have internal predecessors, (919), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:17:36,344 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:17:36,345 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:17:36,345 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-26 21:17:36,345 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-26 21:17:36,345 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:17:36,345 INFO L85 PathProgramCache]: Analyzing trace with hash -157054045, now seen corresponding path program 3 times [2023-08-26 21:17:36,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:17:36,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382248165] [2023-08-26 21:17:36,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:17:36,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:17:36,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:17:36,501 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:17:36,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:17:36,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382248165] [2023-08-26 21:17:36,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [382248165] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:17:36,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:17:36,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 21:17:36,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258165530] [2023-08-26 21:17:36,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:17:36,502 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 21:17:36,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:17:36,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 21:17:36,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-26 21:17:36,503 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 266 [2023-08-26 21:17:36,504 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 53 transitions, 387 flow. Second operand has 5 states, 5 states have (on average 115.0) internal successors, (575), 5 states have internal predecessors, (575), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:17:36,504 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:17:36,504 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 266 [2023-08-26 21:17:36,504 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:17:36,759 INFO L124 PetriNetUnfolderBase]: 1005/1665 cut-off events. [2023-08-26 21:17:36,759 INFO L125 PetriNetUnfolderBase]: For 6704/6704 co-relation queries the response was YES. [2023-08-26 21:17:36,765 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7831 conditions, 1665 events. 1005/1665 cut-off events. For 6704/6704 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 8247 event pairs, 218 based on Foata normal form. 1/1666 useless extension candidates. Maximal degree in co-relation 7802. Up to 823 conditions per place. [2023-08-26 21:17:36,767 INFO L140 encePairwiseOnDemand]: 260/266 looper letters, 43 selfloop transitions, 4 changer transitions 48/95 dead transitions. [2023-08-26 21:17:36,767 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 95 transitions, 856 flow [2023-08-26 21:17:36,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-26 21:17:36,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-26 21:17:36,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 714 transitions. [2023-08-26 21:17:36,769 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4473684210526316 [2023-08-26 21:17:36,769 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 714 transitions. [2023-08-26 21:17:36,769 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 714 transitions. [2023-08-26 21:17:36,770 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:17:36,770 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 714 transitions. [2023-08-26 21:17:36,772 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 119.0) internal successors, (714), 6 states have internal predecessors, (714), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:17:36,774 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 266.0) internal successors, (1862), 7 states have internal predecessors, (1862), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:17:36,775 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 266.0) internal successors, (1862), 7 states have internal predecessors, (1862), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:17:36,775 INFO L175 Difference]: Start difference. First operand has 77 places, 53 transitions, 387 flow. Second operand 6 states and 714 transitions. [2023-08-26 21:17:36,775 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 95 transitions, 856 flow [2023-08-26 21:17:36,792 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 95 transitions, 832 flow, removed 10 selfloop flow, removed 7 redundant places. [2023-08-26 21:17:36,793 INFO L231 Difference]: Finished difference. Result has 68 places, 41 transitions, 259 flow [2023-08-26 21:17:36,793 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=367, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=259, PETRI_PLACES=68, PETRI_TRANSITIONS=41} [2023-08-26 21:17:36,795 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, 20 predicate places. [2023-08-26 21:17:36,795 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 41 transitions, 259 flow [2023-08-26 21:17:36,796 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 115.0) internal successors, (575), 5 states have internal predecessors, (575), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:17:36,796 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:17:36,796 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:17:36,796 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-08-26 21:17:36,796 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-26 21:17:36,796 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:17:36,796 INFO L85 PathProgramCache]: Analyzing trace with hash -237218379, now seen corresponding path program 4 times [2023-08-26 21:17:36,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:17:36,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019092505] [2023-08-26 21:17:36,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:17:36,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:17:36,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:17:36,967 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:17:36,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:17:36,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019092505] [2023-08-26 21:17:36,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2019092505] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:17:36,969 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:17:36,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 21:17:36,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316261166] [2023-08-26 21:17:36,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:17:36,969 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 21:17:36,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:17:36,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 21:17:36,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-26 21:17:36,970 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 266 [2023-08-26 21:17:36,971 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 41 transitions, 259 flow. Second operand has 5 states, 5 states have (on average 115.0) internal successors, (575), 5 states have internal predecessors, (575), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:17:36,971 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:17:36,971 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 266 [2023-08-26 21:17:36,971 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:17:37,187 INFO L124 PetriNetUnfolderBase]: 617/1065 cut-off events. [2023-08-26 21:17:37,188 INFO L125 PetriNetUnfolderBase]: For 3451/3451 co-relation queries the response was YES. [2023-08-26 21:17:37,191 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4694 conditions, 1065 events. 617/1065 cut-off events. For 3451/3451 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 5016 event pairs, 177 based on Foata normal form. 1/1066 useless extension candidates. Maximal degree in co-relation 4669. Up to 509 conditions per place. [2023-08-26 21:17:37,192 INFO L140 encePairwiseOnDemand]: 261/266 looper letters, 44 selfloop transitions, 3 changer transitions 34/81 dead transitions. [2023-08-26 21:17:37,192 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 81 transitions, 656 flow [2023-08-26 21:17:37,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-26 21:17:37,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-26 21:17:37,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 712 transitions. [2023-08-26 21:17:37,194 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44611528822055135 [2023-08-26 21:17:37,195 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 712 transitions. [2023-08-26 21:17:37,195 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 712 transitions. [2023-08-26 21:17:37,195 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:17:37,195 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 712 transitions. [2023-08-26 21:17:37,209 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 118.66666666666667) internal successors, (712), 6 states have internal predecessors, (712), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:17:37,211 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 266.0) internal successors, (1862), 7 states have internal predecessors, (1862), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:17:37,211 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 266.0) internal successors, (1862), 7 states have internal predecessors, (1862), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:17:37,212 INFO L175 Difference]: Start difference. First operand has 68 places, 41 transitions, 259 flow. Second operand 6 states and 712 transitions. [2023-08-26 21:17:37,212 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 81 transitions, 656 flow [2023-08-26 21:17:37,221 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 81 transitions, 619 flow, removed 10 selfloop flow, removed 7 redundant places. [2023-08-26 21:17:37,222 INFO L231 Difference]: Finished difference. Result has 64 places, 37 transitions, 207 flow [2023-08-26 21:17:37,222 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=230, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=207, PETRI_PLACES=64, PETRI_TRANSITIONS=37} [2023-08-26 21:17:37,222 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, 16 predicate places. [2023-08-26 21:17:37,222 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 37 transitions, 207 flow [2023-08-26 21:17:37,222 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 115.0) internal successors, (575), 5 states have internal predecessors, (575), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:17:37,223 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:17:37,223 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:17:37,223 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-08-26 21:17:37,223 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-26 21:17:37,223 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:17:37,223 INFO L85 PathProgramCache]: Analyzing trace with hash 81499377, now seen corresponding path program 5 times [2023-08-26 21:17:37,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:17:37,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607922453] [2023-08-26 21:17:37,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:17:37,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:17:37,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:17:37,560 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:17:37,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:17:37,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607922453] [2023-08-26 21:17:37,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [607922453] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:17:37,561 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:17:37,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 21:17:37,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133797302] [2023-08-26 21:17:37,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:17:37,562 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 21:17:37,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:17:37,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 21:17:37,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-26 21:17:37,563 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 266 [2023-08-26 21:17:37,563 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 37 transitions, 207 flow. Second operand has 5 states, 5 states have (on average 113.0) internal successors, (565), 5 states have internal predecessors, (565), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:17:37,564 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:17:37,564 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 266 [2023-08-26 21:17:37,564 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:17:37,760 INFO L124 PetriNetUnfolderBase]: 461/819 cut-off events. [2023-08-26 21:17:37,760 INFO L125 PetriNetUnfolderBase]: For 2101/2101 co-relation queries the response was YES. [2023-08-26 21:17:37,763 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3440 conditions, 819 events. 461/819 cut-off events. For 2101/2101 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 3764 event pairs, 70 based on Foata normal form. 1/820 useless extension candidates. Maximal degree in co-relation 3419. Up to 308 conditions per place. [2023-08-26 21:17:37,764 INFO L140 encePairwiseOnDemand]: 258/266 looper letters, 37 selfloop transitions, 4 changer transitions 46/87 dead transitions. [2023-08-26 21:17:37,764 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 87 transitions, 686 flow [2023-08-26 21:17:37,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-26 21:17:37,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-26 21:17:37,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 810 transitions. [2023-08-26 21:17:37,767 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43501611170784105 [2023-08-26 21:17:37,767 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 810 transitions. [2023-08-26 21:17:37,767 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 810 transitions. [2023-08-26 21:17:37,768 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:17:37,768 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 810 transitions. [2023-08-26 21:17:37,769 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 115.71428571428571) internal successors, (810), 7 states have internal predecessors, (810), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:17:37,771 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 266.0) internal successors, (2128), 8 states have internal predecessors, (2128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:17:37,771 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 266.0) internal successors, (2128), 8 states have internal predecessors, (2128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:17:37,771 INFO L175 Difference]: Start difference. First operand has 64 places, 37 transitions, 207 flow. Second operand 7 states and 810 transitions. [2023-08-26 21:17:37,772 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 87 transitions, 686 flow [2023-08-26 21:17:37,778 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 87 transitions, 674 flow, removed 2 selfloop flow, removed 4 redundant places. [2023-08-26 21:17:37,779 INFO L231 Difference]: Finished difference. Result has 66 places, 37 transitions, 216 flow [2023-08-26 21:17:37,779 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=196, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=216, PETRI_PLACES=66, PETRI_TRANSITIONS=37} [2023-08-26 21:17:37,779 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, 18 predicate places. [2023-08-26 21:17:37,779 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 37 transitions, 216 flow [2023-08-26 21:17:37,780 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 113.0) internal successors, (565), 5 states have internal predecessors, (565), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:17:37,780 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:17:37,780 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:17:37,780 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-08-26 21:17:37,780 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-26 21:17:37,780 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:17:37,780 INFO L85 PathProgramCache]: Analyzing trace with hash -1154920055, now seen corresponding path program 6 times [2023-08-26 21:17:37,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:17:37,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128389661] [2023-08-26 21:17:37,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:17:37,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:17:37,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-26 21:17:37,838 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-26 21:17:37,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-26 21:17:37,935 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-26 21:17:37,935 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-26 21:17:37,936 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONASSERT (22 of 23 remaining) [2023-08-26 21:17:37,937 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 23 remaining) [2023-08-26 21:17:37,939 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 23 remaining) [2023-08-26 21:17:37,939 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 23 remaining) [2023-08-26 21:17:37,939 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 23 remaining) [2023-08-26 21:17:37,940 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 23 remaining) [2023-08-26 21:17:37,940 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 23 remaining) [2023-08-26 21:17:37,940 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONASSERT (15 of 23 remaining) [2023-08-26 21:17:37,940 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 23 remaining) [2023-08-26 21:17:37,940 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 23 remaining) [2023-08-26 21:17:37,941 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (12 of 23 remaining) [2023-08-26 21:17:37,941 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (11 of 23 remaining) [2023-08-26 21:17:37,941 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (10 of 23 remaining) [2023-08-26 21:17:37,941 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (9 of 23 remaining) [2023-08-26 21:17:37,941 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 23 remaining) [2023-08-26 21:17:37,941 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 23 remaining) [2023-08-26 21:17:37,941 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 23 remaining) [2023-08-26 21:17:37,942 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 23 remaining) [2023-08-26 21:17:37,942 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 23 remaining) [2023-08-26 21:17:37,942 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 23 remaining) [2023-08-26 21:17:37,942 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONASSERT (2 of 23 remaining) [2023-08-26 21:17:37,942 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 23 remaining) [2023-08-26 21:17:37,942 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 23 remaining) [2023-08-26 21:17:37,942 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-08-26 21:17:37,943 INFO L445 BasicCegarLoop]: Path program histogram: [6, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:17:37,948 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-26 21:17:37,948 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-26 21:17:38,038 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.08 09:17:38 BasicIcfg [2023-08-26 21:17:38,038 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-26 21:17:38,038 INFO L158 Benchmark]: Toolchain (without parser) took 20371.28ms. Allocated memory was 362.8MB in the beginning and 1.3GB in the end (delta: 895.5MB). Free memory was 336.3MB in the beginning and 872.7MB in the end (delta: -536.4MB). Peak memory consumption was 359.4MB. Max. memory is 16.0GB. [2023-08-26 21:17:38,039 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 362.8MB. Free memory is still 338.8MB. There was no memory consumed. Max. memory is 16.0GB. [2023-08-26 21:17:38,039 INFO L158 Benchmark]: CACSL2BoogieTranslator took 503.99ms. Allocated memory is still 362.8MB. Free memory was 336.0MB in the beginning and 313.1MB in the end (delta: 22.9MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. [2023-08-26 21:17:38,039 INFO L158 Benchmark]: Boogie Procedure Inliner took 57.90ms. Allocated memory is still 362.8MB. Free memory was 313.1MB in the beginning and 310.5MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-26 21:17:38,039 INFO L158 Benchmark]: Boogie Preprocessor took 49.95ms. Allocated memory is still 362.8MB. Free memory was 310.5MB in the beginning and 308.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-26 21:17:38,039 INFO L158 Benchmark]: RCFGBuilder took 770.34ms. Allocated memory was 362.8MB in the beginning and 505.4MB in the end (delta: 142.6MB). Free memory was 308.4MB in the beginning and 467.9MB in the end (delta: -159.5MB). Peak memory consumption was 29.4MB. Max. memory is 16.0GB. [2023-08-26 21:17:38,040 INFO L158 Benchmark]: TraceAbstraction took 18977.13ms. Allocated memory was 505.4MB in the beginning and 1.3GB in the end (delta: 752.9MB). Free memory was 467.9MB in the beginning and 872.7MB in the end (delta: -404.8MB). Peak memory consumption was 348.9MB. Max. memory is 16.0GB. [2023-08-26 21:17:38,041 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 362.8MB. Free memory is still 338.8MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 503.99ms. Allocated memory is still 362.8MB. Free memory was 336.0MB in the beginning and 313.1MB in the end (delta: 22.9MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 57.90ms. Allocated memory is still 362.8MB. Free memory was 313.1MB in the beginning and 310.5MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 49.95ms. Allocated memory is still 362.8MB. Free memory was 310.5MB in the beginning and 308.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 770.34ms. Allocated memory was 362.8MB in the beginning and 505.4MB in the end (delta: 142.6MB). Free memory was 308.4MB in the beginning and 467.9MB in the end (delta: -159.5MB). Peak memory consumption was 29.4MB. Max. memory is 16.0GB. * TraceAbstraction took 18977.13ms. Allocated memory was 505.4MB in the beginning and 1.3GB in the end (delta: 752.9MB). Free memory was 467.9MB in the beginning and 872.7MB in the end (delta: -404.8MB). Peak memory consumption was 348.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: 4.1s, 149 PlacesBefore, 48 PlacesAfterwards, 139 TransitionsBefore, 36 TransitionsAfterwards, 4152 CoEnabledTransitionPairs, 7 FixpointIterations, 45 TrivialSequentialCompositions, 60 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 16 ConcurrentYvCompositions, 2 ChoiceCompositions, 123 TotalNumberOfCompositions, 14328 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 5675, independent: 5340, independent conditional: 0, independent unconditional: 5340, dependent: 335, dependent conditional: 0, dependent unconditional: 335, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 2337, independent: 2274, independent conditional: 0, independent unconditional: 2274, dependent: 63, dependent conditional: 0, dependent unconditional: 63, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 5675, independent: 3066, independent conditional: 0, independent unconditional: 3066, dependent: 272, dependent conditional: 0, dependent unconditional: 272, unknown: 2337, unknown conditional: 0, unknown unconditional: 2337] , Statistics on independence cache: Total cache size (in pairs): 216, Positive cache size: 191, Positive conditional cache size: 0, Positive unconditional cache size: 191, Negative cache size: 25, Negative conditional cache size: 0, Negative unconditional cache size: 25, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 17]: assertion can be violated assertion can be violated We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p1_EAX = 0; [L716] 0 int __unbuffered_p2_EAX = 0; [L718] 0 int __unbuffered_p3_EAX = 0; [L720] 0 int __unbuffered_p3_EBX = 0; [L722] 0 int a = 0; [L724] 0 int b = 0; [L725] 0 _Bool main$tmp_guard0; [L726] 0 _Bool main$tmp_guard1; [L728] 0 int x = 0; [L730] 0 int y = 0; [L732] 0 int z = 0; [L733] 0 _Bool z$flush_delayed; [L734] 0 int z$mem_tmp; [L735] 0 _Bool z$r_buff0_thd0; [L736] 0 _Bool z$r_buff0_thd1; [L737] 0 _Bool z$r_buff0_thd2; [L738] 0 _Bool z$r_buff0_thd3; [L739] 0 _Bool z$r_buff0_thd4; [L740] 0 _Bool z$r_buff1_thd0; [L741] 0 _Bool z$r_buff1_thd1; [L742] 0 _Bool z$r_buff1_thd2; [L743] 0 _Bool z$r_buff1_thd3; [L744] 0 _Bool z$r_buff1_thd4; [L745] 0 _Bool z$read_delayed; [L746] 0 int *z$read_delayed_var; [L747] 0 int z$w_buff0; [L748] 0 _Bool z$w_buff0_used; [L749] 0 int z$w_buff1; [L750] 0 _Bool z$w_buff1_used; [L751] 0 _Bool weak$$choice0; [L752] 0 _Bool weak$$choice2; [L858] 0 pthread_t t949; [L859] FCALL, FORK 0 pthread_create(&t949, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t949, ((void *)0), P0, ((void *)0))=-2, t949={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L860] 0 pthread_t t950; [L861] FCALL, FORK 0 pthread_create(&t950, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t950, ((void *)0), P1, ((void *)0))=-1, t949={5:0}, t950={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L862] 0 pthread_t t951; [L863] FCALL, FORK 0 pthread_create(&t951, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t951, ((void *)0), P2, ((void *)0))=0, t949={5:0}, t950={6:0}, t951={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L864] 0 pthread_t t952; [L865] FCALL, FORK 0 pthread_create(&t952, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t952, ((void *)0), P3, ((void *)0))=1, t949={5:0}, t950={6:0}, t951={7:0}, t952={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L814] 4 z$w_buff1 = z$w_buff0 [L815] 4 z$w_buff0 = 1 [L816] 4 z$w_buff1_used = z$w_buff0_used [L817] 4 z$w_buff0_used = (_Bool)1 [L818] CALL 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 4 !(!expression) [L818] RET 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L819] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L820] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L821] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L822] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L823] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L824] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L827] 4 a = 1 [L830] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L833] 4 __unbuffered_p3_EBX = b VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L756] 1 b = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L759] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L771] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L774] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L786] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L764] EXPR 1 __unbuffered_cnt + 1 [L764] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L766] 1 return 0; [L789] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L790] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L791] 3 z$flush_delayed = weak$$choice2 [L792] 3 z$mem_tmp = z [L793] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L794] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L795] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L796] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L797] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L798] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L799] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L800] 3 __unbuffered_p2_EAX = z [L801] 3 z = z$flush_delayed ? z$mem_tmp : z [L802] 3 z$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L836] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L837] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L838] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L839] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L840] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L807] EXPR 3 __unbuffered_cnt + 1 [L807] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L809] 3 return 0; [L779] EXPR 2 __unbuffered_cnt + 1 [L779] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L781] 2 return 0; [L843] EXPR 4 __unbuffered_cnt + 1 [L843] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L845] 4 return 0; [L867] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L869] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L869] RET 0 assume_abort_if_not(main$tmp_guard0) [L871] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L872] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L873] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L874] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L875] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t949={5:0}, t950={6:0}, t951={7:0}, t952={3:0}, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L878] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L880] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] CALL 0 reach_error() [L17] COND FALSE 0 !(0) [L17] 0 __assert_fail ("0", "mix036_pso.opt_tso.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\read(__PRETTY_FUNCTION__)={50:49}, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] - UnprovableResult [Line: 764]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 764]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 779]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 779]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 807]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 807]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 17]: Unable to prove that assertion always holds Unable to prove that assertion always holds Reason: Not analyzed. - UnprovableResult [Line: 843]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 843]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 865]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 861]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 863]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 859]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 185 locations, 23 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 18.8s, OverallIterations: 19, TraceHistogramMax: 1, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 10.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 665 SdHoareTripleChecker+Valid, 1.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 665 mSDsluCounter, 57 SdHoareTripleChecker+Invalid, 1.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 23 mSDsCounter, 84 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2150 IncrementalHoareTripleChecker+Invalid, 2234 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 84 mSolverCounterUnsat, 34 mSDtfsCounter, 2150 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 81 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=505occurred in iteration=10, InterpolantAutomatonStates: 101, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.2s InterpolantComputationTime, 343 NumberOfCodeBlocks, 343 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 300 ConstructedInterpolants, 0 QuantifiedInterpolants, 1645 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-08-26 21:17:38,067 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...