/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf --traceabstraction.order.of.the.error.locations.to.be.checked INSUFFICIENT_FIRST -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --cacsl2boogietranslator.check.absence.of.signed.integer.overflows true -i ../../../trunk/examples/svcomp/pthread-wmm/mix039.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-27 03:46:19,420 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-27 03:46:19,492 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf [2023-08-27 03:46:19,496 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-27 03:46:19,496 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-27 03:46:19,521 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-27 03:46:19,522 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-27 03:46:19,522 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-27 03:46:19,523 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-27 03:46:19,523 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-27 03:46:19,523 INFO L153 SettingsManager]: * Use SBE=true [2023-08-27 03:46:19,524 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-27 03:46:19,524 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-27 03:46:19,524 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-27 03:46:19,525 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-27 03:46:19,525 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-27 03:46:19,525 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-27 03:46:19,526 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-27 03:46:19,526 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-27 03:46:19,526 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-27 03:46:19,527 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-27 03:46:19,527 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-27 03:46:19,528 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-27 03:46:19,528 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-27 03:46:19,528 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-27 03:46:19,529 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-27 03:46:19,529 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-27 03:46:19,529 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-27 03:46:19,530 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-27 03:46:19,530 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-27 03:46:19,530 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-27 03:46:19,530 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-27 03:46:19,531 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-27 03:46:19,531 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-27 03:46:19,531 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-27 03:46:19,531 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Order of the error locations to be checked -> INSUFFICIENT_FIRST Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check absence of signed integer overflows -> true [2023-08-27 03:46:19,846 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-27 03:46:19,865 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-27 03:46:19,867 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-27 03:46:19,868 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-27 03:46:19,870 INFO L274 PluginConnector]: CDTParser initialized [2023-08-27 03:46:19,872 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix039.oepc.i [2023-08-27 03:46:21,055 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-27 03:46:21,323 INFO L384 CDTParser]: Found 1 translation units. [2023-08-27 03:46:21,324 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix039.oepc.i [2023-08-27 03:46:21,338 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/816e9795f/d7d7a7bee1a24b51a5b0dd25c89c4908/FLAGdbcbdf456 [2023-08-27 03:46:21,354 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/816e9795f/d7d7a7bee1a24b51a5b0dd25c89c4908 [2023-08-27 03:46:21,356 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-27 03:46:21,357 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-27 03:46:21,358 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-27 03:46:21,359 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-27 03:46:21,361 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-27 03:46:21,362 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 03:46:21" (1/1) ... [2023-08-27 03:46:21,362 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@550edeb9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:46:21, skipping insertion in model container [2023-08-27 03:46:21,363 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 03:46:21" (1/1) ... [2023-08-27 03:46:21,410 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-27 03:46:21,781 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-27 03:46:21,796 INFO L201 MainTranslator]: Completed pre-run [2023-08-27 03:46:21,822 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-27 03:46:21,824 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-27 03:46:21,877 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-27 03:46:21,948 WARN L669 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-27 03:46:21,948 WARN L669 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-27 03:46:21,954 INFO L206 MainTranslator]: Completed translation [2023-08-27 03:46:21,956 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:46:21 WrapperNode [2023-08-27 03:46:21,967 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-27 03:46:21,969 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-27 03:46:21,969 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-27 03:46:21,969 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-27 03:46:21,975 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:46:21" (1/1) ... [2023-08-27 03:46:22,006 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:46:21" (1/1) ... [2023-08-27 03:46:22,029 INFO L138 Inliner]: procedures = 177, calls = 72, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 154 [2023-08-27 03:46:22,034 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-27 03:46:22,035 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-27 03:46:22,035 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-27 03:46:22,035 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-27 03:46:22,044 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:46:21" (1/1) ... [2023-08-27 03:46:22,045 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:46:21" (1/1) ... [2023-08-27 03:46:22,058 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:46:21" (1/1) ... [2023-08-27 03:46:22,058 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:46:21" (1/1) ... [2023-08-27 03:46:22,077 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:46:21" (1/1) ... [2023-08-27 03:46:22,079 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:46:21" (1/1) ... [2023-08-27 03:46:22,081 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:46:21" (1/1) ... [2023-08-27 03:46:22,082 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:46:21" (1/1) ... [2023-08-27 03:46:22,085 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-27 03:46:22,086 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-27 03:46:22,086 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-27 03:46:22,086 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-27 03:46:22,087 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:46:21" (1/1) ... [2023-08-27 03:46:22,091 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-27 03:46:22,115 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 03:46:22,127 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-27 03:46:22,153 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-27 03:46:22,172 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-27 03:46:22,172 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-27 03:46:22,172 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-27 03:46:22,173 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-27 03:46:22,173 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-27 03:46:22,173 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-27 03:46:22,173 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-27 03:46:22,173 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-27 03:46:22,173 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-27 03:46:22,173 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-27 03:46:22,174 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-27 03:46:22,174 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-08-27 03:46:22,174 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-08-27 03:46:22,174 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-27 03:46:22,174 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-27 03:46:22,175 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-27 03:46:22,175 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-27 03:46:22,177 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-27 03:46:22,345 INFO L236 CfgBuilder]: Building ICFG [2023-08-27 03:46:22,347 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-27 03:46:22,721 INFO L277 CfgBuilder]: Performing block encoding [2023-08-27 03:46:22,847 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-27 03:46:22,848 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-27 03:46:22,850 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 03:46:22 BoogieIcfgContainer [2023-08-27 03:46:22,850 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-27 03:46:22,853 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-27 03:46:22,853 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-27 03:46:22,856 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-27 03:46:22,856 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.08 03:46:21" (1/3) ... [2023-08-27 03:46:22,857 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71b0b87a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.08 03:46:22, skipping insertion in model container [2023-08-27 03:46:22,857 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:46:21" (2/3) ... [2023-08-27 03:46:22,857 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71b0b87a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.08 03:46:22, skipping insertion in model container [2023-08-27 03:46:22,858 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 03:46:22" (3/3) ... [2023-08-27 03:46:22,859 INFO L112 eAbstractionObserver]: Analyzing ICFG mix039.oepc.i [2023-08-27 03:46:22,875 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-27 03:46:22,876 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 10 error locations. [2023-08-27 03:46:22,877 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-27 03:46:22,951 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-27 03:46:22,988 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 155 places, 145 transitions, 310 flow [2023-08-27 03:46:23,092 INFO L124 PetriNetUnfolderBase]: 3/141 cut-off events. [2023-08-27 03:46:23,092 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-27 03:46:23,099 INFO L83 FinitePrefix]: Finished finitePrefix Result has 154 conditions, 141 events. 3/141 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 111 event pairs, 0 based on Foata normal form. 0/128 useless extension candidates. Maximal degree in co-relation 101. Up to 2 conditions per place. [2023-08-27 03:46:23,099 INFO L82 GeneralOperation]: Start removeDead. Operand has 155 places, 145 transitions, 310 flow [2023-08-27 03:46:23,106 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 151 places, 141 transitions, 294 flow [2023-08-27 03:46:23,110 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-27 03:46:23,124 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 151 places, 141 transitions, 294 flow [2023-08-27 03:46:23,130 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 151 places, 141 transitions, 294 flow [2023-08-27 03:46:23,131 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 151 places, 141 transitions, 294 flow [2023-08-27 03:46:23,171 INFO L124 PetriNetUnfolderBase]: 3/141 cut-off events. [2023-08-27 03:46:23,171 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-27 03:46:23,173 INFO L83 FinitePrefix]: Finished finitePrefix Result has 154 conditions, 141 events. 3/141 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 111 event pairs, 0 based on Foata normal form. 0/128 useless extension candidates. Maximal degree in co-relation 101. Up to 2 conditions per place. [2023-08-27 03:46:23,175 INFO L119 LiptonReduction]: Number of co-enabled transitions 4666 [2023-08-27 03:46:27,286 INFO L134 LiptonReduction]: Checked pairs total: 17674 [2023-08-27 03:46:27,287 INFO L136 LiptonReduction]: Total number of compositions: 123 [2023-08-27 03:46:27,298 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-27 03:46:27,304 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;@46e12ef0, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-27 03:46:27,304 INFO L358 AbstractCegarLoop]: Starting to check reachability of 23 error locations. [2023-08-27 03:46:27,307 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-27 03:46:27,308 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-08-27 03:46:27,308 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-27 03:46:27,308 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:46:27,309 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-27 03:46:27,309 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-27 03:46:27,313 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:46:27,314 INFO L85 PathProgramCache]: Analyzing trace with hash 632718, now seen corresponding path program 1 times [2023-08-27 03:46:27,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:46:27,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574476464] [2023-08-27 03:46:27,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:46:27,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:46:27,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:46:27,684 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 03:46:27,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:46:27,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574476464] [2023-08-27 03:46:27,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [574476464] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:46:27,686 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:46:27,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-27 03:46:27,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696574770] [2023-08-27 03:46:27,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:46:27,695 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-27 03:46:27,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:46:27,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-27 03:46:27,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-27 03:46:27,719 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 268 [2023-08-27 03:46:27,721 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 39 transitions, 90 flow. Second operand has 3 states, 3 states have (on average 121.0) internal successors, (363), 3 states have internal predecessors, (363), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:46:27,721 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:46:27,721 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 268 [2023-08-27 03:46:27,722 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:46:29,916 INFO L124 PetriNetUnfolderBase]: 12064/17903 cut-off events. [2023-08-27 03:46:29,917 INFO L125 PetriNetUnfolderBase]: For 148/148 co-relation queries the response was YES. [2023-08-27 03:46:29,959 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34346 conditions, 17903 events. 12064/17903 cut-off events. For 148/148 co-relation queries the response was YES. Maximal size of possible extension queue 827. Compared 122022 event pairs, 1764 based on Foata normal form. 0/14083 useless extension candidates. Maximal degree in co-relation 34334. Up to 13549 conditions per place. [2023-08-27 03:46:30,081 INFO L140 encePairwiseOnDemand]: 264/268 looper letters, 50 selfloop transitions, 2 changer transitions 0/60 dead transitions. [2023-08-27 03:46:30,081 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 60 transitions, 245 flow [2023-08-27 03:46:30,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-27 03:46:30,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-27 03:46:30,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 415 transitions. [2023-08-27 03:46:30,091 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5161691542288557 [2023-08-27 03:46:30,092 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 415 transitions. [2023-08-27 03:46:30,093 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 415 transitions. [2023-08-27 03:46:30,094 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:46:30,096 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 415 transitions. [2023-08-27 03:46:30,099 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 138.33333333333334) internal successors, (415), 3 states have internal predecessors, (415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:46:30,103 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 268.0) internal successors, (1072), 4 states have internal predecessors, (1072), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:46:30,104 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 268.0) internal successors, (1072), 4 states have internal predecessors, (1072), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:46:30,105 INFO L175 Difference]: Start difference. First operand has 51 places, 39 transitions, 90 flow. Second operand 3 states and 415 transitions. [2023-08-27 03:46:30,106 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 60 transitions, 245 flow [2023-08-27 03:46:30,109 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 60 transitions, 238 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-27 03:46:30,111 INFO L231 Difference]: Finished difference. Result has 48 places, 37 transitions, 86 flow [2023-08-27 03:46:30,112 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=268, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=86, PETRI_PLACES=48, PETRI_TRANSITIONS=37} [2023-08-27 03:46:30,115 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, -3 predicate places. [2023-08-27 03:46:30,115 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 37 transitions, 86 flow [2023-08-27 03:46:30,116 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 121.0) internal successors, (363), 3 states have internal predecessors, (363), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:46:30,116 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:46:30,116 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-08-27 03:46:30,116 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-27 03:46:30,117 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-27 03:46:30,117 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:46:30,117 INFO L85 PathProgramCache]: Analyzing trace with hash 1669907442, now seen corresponding path program 1 times [2023-08-27 03:46:30,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:46:30,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472607942] [2023-08-27 03:46:30,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:46:30,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:46:30,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:46:30,177 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 03:46:30,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:46:30,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472607942] [2023-08-27 03:46:30,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [472607942] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:46:30,178 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:46:30,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-27 03:46:30,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66684804] [2023-08-27 03:46:30,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:46:30,179 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-27 03:46:30,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:46:30,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-27 03:46:30,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-27 03:46:30,181 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 268 [2023-08-27 03:46:30,181 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 37 transitions, 86 flow. Second operand has 3 states, 3 states have (on average 116.66666666666667) internal successors, (350), 3 states have internal predecessors, (350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:46:30,182 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:46:30,182 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 268 [2023-08-27 03:46:30,182 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:46:31,813 INFO L124 PetriNetUnfolderBase]: 12064/16219 cut-off events. [2023-08-27 03:46:31,813 INFO L125 PetriNetUnfolderBase]: For 811/811 co-relation queries the response was YES. [2023-08-27 03:46:31,856 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33472 conditions, 16219 events. 12064/16219 cut-off events. For 811/811 co-relation queries the response was YES. Maximal size of possible extension queue 668. Compared 85246 event pairs, 12064 based on Foata normal form. 0/12266 useless extension candidates. Maximal degree in co-relation 33462. Up to 16125 conditions per place. [2023-08-27 03:46:31,929 INFO L140 encePairwiseOnDemand]: 263/268 looper letters, 28 selfloop transitions, 1 changer transitions 0/33 dead transitions. [2023-08-27 03:46:31,930 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 33 transitions, 136 flow [2023-08-27 03:46:31,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-27 03:46:31,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-27 03:46:31,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 378 transitions. [2023-08-27 03:46:31,932 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4701492537313433 [2023-08-27 03:46:31,932 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 378 transitions. [2023-08-27 03:46:31,932 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 378 transitions. [2023-08-27 03:46:31,933 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:46:31,933 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 378 transitions. [2023-08-27 03:46:31,934 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 126.0) internal successors, (378), 3 states have internal predecessors, (378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:46:31,936 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 268.0) internal successors, (1072), 4 states have internal predecessors, (1072), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:46:31,937 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 268.0) internal successors, (1072), 4 states have internal predecessors, (1072), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:46:31,937 INFO L175 Difference]: Start difference. First operand has 48 places, 37 transitions, 86 flow. Second operand 3 states and 378 transitions. [2023-08-27 03:46:31,937 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 33 transitions, 136 flow [2023-08-27 03:46:31,938 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 33 transitions, 132 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-27 03:46:31,938 INFO L231 Difference]: Finished difference. Result has 44 places, 33 transitions, 76 flow [2023-08-27 03:46:31,939 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=268, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=76, PETRI_PLACES=44, PETRI_TRANSITIONS=33} [2023-08-27 03:46:31,939 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, -7 predicate places. [2023-08-27 03:46:31,940 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 33 transitions, 76 flow [2023-08-27 03:46:31,940 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 116.66666666666667) internal successors, (350), 3 states have internal predecessors, (350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:46:31,940 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:46:31,940 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-08-27 03:46:31,940 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-27 03:46:31,941 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-27 03:46:31,941 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:46:31,941 INFO L85 PathProgramCache]: Analyzing trace with hash 1669907443, now seen corresponding path program 1 times [2023-08-27 03:46:31,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:46:31,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82568738] [2023-08-27 03:46:31,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:46:31,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:46:31,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:46:32,096 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 03:46:32,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:46:32,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82568738] [2023-08-27 03:46:32,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [82568738] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:46:32,097 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:46:32,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-27 03:46:32,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982625155] [2023-08-27 03:46:32,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:46:32,098 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-27 03:46:32,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:46:32,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-27 03:46:32,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-27 03:46:32,099 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 268 [2023-08-27 03:46:32,100 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 33 transitions, 76 flow. Second operand has 3 states, 3 states have (on average 116.66666666666667) internal successors, (350), 3 states have internal predecessors, (350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:46:32,100 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:46:32,100 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 268 [2023-08-27 03:46:32,100 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:46:33,146 INFO L124 PetriNetUnfolderBase]: 7784/10735 cut-off events. [2023-08-27 03:46:33,146 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-27 03:46:33,160 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21656 conditions, 10735 events. 7784/10735 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 440. Compared 57641 event pairs, 2133 based on Foata normal form. 0/8735 useless extension candidates. Maximal degree in co-relation 21650. Up to 8563 conditions per place. [2023-08-27 03:46:33,205 INFO L140 encePairwiseOnDemand]: 259/268 looper letters, 47 selfloop transitions, 5 changer transitions 0/56 dead transitions. [2023-08-27 03:46:33,206 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 56 transitions, 232 flow [2023-08-27 03:46:33,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-27 03:46:33,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-27 03:46:33,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 401 transitions. [2023-08-27 03:46:33,208 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4987562189054726 [2023-08-27 03:46:33,208 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 401 transitions. [2023-08-27 03:46:33,208 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 401 transitions. [2023-08-27 03:46:33,208 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:46:33,208 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 401 transitions. [2023-08-27 03:46:33,210 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 133.66666666666666) internal successors, (401), 3 states have internal predecessors, (401), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:46:33,211 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 268.0) internal successors, (1072), 4 states have internal predecessors, (1072), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:46:33,212 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 268.0) internal successors, (1072), 4 states have internal predecessors, (1072), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:46:33,212 INFO L175 Difference]: Start difference. First operand has 44 places, 33 transitions, 76 flow. Second operand 3 states and 401 transitions. [2023-08-27 03:46:33,212 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 56 transitions, 232 flow [2023-08-27 03:46:33,213 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 56 transitions, 231 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-27 03:46:33,214 INFO L231 Difference]: Finished difference. Result has 46 places, 37 transitions, 114 flow [2023-08-27 03:46:33,214 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=268, PETRI_DIFFERENCE_MINUEND_FLOW=75, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=114, PETRI_PLACES=46, PETRI_TRANSITIONS=37} [2023-08-27 03:46:33,215 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, -5 predicate places. [2023-08-27 03:46:33,215 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 37 transitions, 114 flow [2023-08-27 03:46:33,215 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 116.66666666666667) internal successors, (350), 3 states have internal predecessors, (350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:46:33,215 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:46:33,216 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:46:33,216 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-27 03:46:33,220 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-27 03:46:33,221 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:46:33,221 INFO L85 PathProgramCache]: Analyzing trace with hash 437072231, now seen corresponding path program 1 times [2023-08-27 03:46:33,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:46:33,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318872057] [2023-08-27 03:46:33,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:46:33,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:46:33,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:46:33,545 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 03:46:33,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:46:33,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318872057] [2023-08-27 03:46:33,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [318872057] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:46:33,546 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:46:33,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-27 03:46:33,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265654913] [2023-08-27 03:46:33,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:46:33,547 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-27 03:46:33,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:46:33,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-27 03:46:33,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-27 03:46:33,549 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 268 [2023-08-27 03:46:33,549 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 37 transitions, 114 flow. Second operand has 3 states, 3 states have (on average 113.66666666666667) internal successors, (341), 3 states have internal predecessors, (341), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:46:33,549 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:46:33,550 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 268 [2023-08-27 03:46:33,550 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:46:36,158 INFO L124 PetriNetUnfolderBase]: 26759/36622 cut-off events. [2023-08-27 03:46:36,159 INFO L125 PetriNetUnfolderBase]: For 3585/3585 co-relation queries the response was YES. [2023-08-27 03:46:36,231 INFO L83 FinitePrefix]: Finished finitePrefix Result has 86982 conditions, 36622 events. 26759/36622 cut-off events. For 3585/3585 co-relation queries the response was YES. Maximal size of possible extension queue 1072. Compared 207461 event pairs, 9736 based on Foata normal form. 0/31738 useless extension candidates. Maximal degree in co-relation 86974. Up to 22911 conditions per place. [2023-08-27 03:46:36,367 INFO L140 encePairwiseOnDemand]: 259/268 looper letters, 63 selfloop transitions, 8 changer transitions 0/71 dead transitions. [2023-08-27 03:46:36,368 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 71 transitions, 358 flow [2023-08-27 03:46:36,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-27 03:46:36,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-27 03:46:36,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 394 transitions. [2023-08-27 03:46:36,370 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4900497512437811 [2023-08-27 03:46:36,370 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 394 transitions. [2023-08-27 03:46:36,370 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 394 transitions. [2023-08-27 03:46:36,370 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:46:36,370 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 394 transitions. [2023-08-27 03:46:36,371 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 131.33333333333334) internal successors, (394), 3 states have internal predecessors, (394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:46:36,373 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 268.0) internal successors, (1072), 4 states have internal predecessors, (1072), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:46:36,373 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 268.0) internal successors, (1072), 4 states have internal predecessors, (1072), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:46:36,373 INFO L175 Difference]: Start difference. First operand has 46 places, 37 transitions, 114 flow. Second operand 3 states and 394 transitions. [2023-08-27 03:46:36,373 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 71 transitions, 358 flow [2023-08-27 03:46:36,377 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 71 transitions, 349 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-27 03:46:36,379 INFO L231 Difference]: Finished difference. Result has 49 places, 44 transitions, 171 flow [2023-08-27 03:46:36,379 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=268, PETRI_DIFFERENCE_MINUEND_FLOW=109, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=171, PETRI_PLACES=49, PETRI_TRANSITIONS=44} [2023-08-27 03:46:36,380 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, -2 predicate places. [2023-08-27 03:46:36,381 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 44 transitions, 171 flow [2023-08-27 03:46:36,381 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 113.66666666666667) internal successors, (341), 3 states have internal predecessors, (341), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:46:36,381 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:46:36,381 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:46:36,382 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-27 03:46:36,382 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-27 03:46:36,382 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:46:36,382 INFO L85 PathProgramCache]: Analyzing trace with hash 521588776, now seen corresponding path program 1 times [2023-08-27 03:46:36,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:46:36,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723288036] [2023-08-27 03:46:36,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:46:36,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:46:36,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:46:36,457 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 03:46:36,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:46:36,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723288036] [2023-08-27 03:46:36,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [723288036] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:46:36,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:46:36,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-27 03:46:36,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416685531] [2023-08-27 03:46:36,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:46:36,459 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-27 03:46:36,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:46:36,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-27 03:46:36,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-27 03:46:36,463 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 268 [2023-08-27 03:46:36,463 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 44 transitions, 171 flow. Second operand has 4 states, 4 states have (on average 117.5) internal successors, (470), 4 states have internal predecessors, (470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:46:36,468 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:46:36,468 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 268 [2023-08-27 03:46:36,468 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:46:37,974 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([477] L831-->L847: Formula: (let ((.cse4 (= (mod v_~b$r_buff1_thd4~0_60 256) 0)) (.cse6 (= (mod v_~b$r_buff0_thd4~0_62 256) 0))) (let ((.cse8 (not .cse6)) (.cse7 (and .cse6 .cse4)) (.cse12 (= (mod v_~b$w_buff0_used~0_150 256) 0)) (.cse9 (and .cse6 (= (mod v_~b$w_buff1_used~0_133 256) 0)))) (let ((.cse10 (or .cse7 .cse12 .cse9)) (.cse11 (and (not .cse12) .cse8))) (let ((.cse2 (= (mod v_~b$w_buff1_used~0_132 256) 0)) (.cse5 (ite .cse10 v_~b~0_93 (ite .cse11 v_~b$w_buff0~0_61 v_~b$w_buff1~0_64))) (.cse3 (= (mod v_~b$w_buff0_used~0_149 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_32 256) 0)))) (and (= v_~b$w_buff0~0_61 v_~b$w_buff0~0_60) (= (ite .cse0 v_~b$r_buff1_thd4~0_60 (ite (let ((.cse1 (= (mod v_~b$r_buff0_thd4~0_61 256) 0))) (or (and .cse1 .cse2) .cse3 (and .cse1 .cse4))) v_~b$r_buff1_thd4~0_60 0)) v_~b$r_buff1_thd4~0_59) (= v_~b~0_92 (ite .cse0 v_~b$mem_tmp~0_18 .cse5)) (= v_~b$flush_delayed~0_25 0) (= (ite .cse0 v_~b$r_buff0_thd4~0_62 (ite (or (and .cse6 .cse2) .cse7 .cse3) v_~b$r_buff0_thd4~0_62 (ite (and .cse8 (not .cse3)) 0 v_~b$r_buff0_thd4~0_62))) v_~b$r_buff0_thd4~0_61) (= .cse5 v_~__unbuffered_p3_EBX~0_10) (= v_~b$mem_tmp~0_18 v_~b~0_93) (= v_~b$w_buff1_used~0_132 (ite .cse0 v_~b$w_buff1_used~0_133 (ite (or .cse7 .cse3 .cse9) v_~b$w_buff1_used~0_133 0))) (= v_~b$w_buff1~0_64 v_~b$w_buff1~0_63) (= (ite .cse0 v_~b$w_buff0_used~0_150 (ite .cse10 v_~b$w_buff0_used~0_150 (ite .cse11 0 v_~b$w_buff0_used~0_150))) v_~b$w_buff0_used~0_149)))))) InVars {~b$w_buff0_used~0=v_~b$w_buff0_used~0_150, ~b~0=v_~b~0_93, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_133, ~b$r_buff1_thd4~0=v_~b$r_buff1_thd4~0_60, ~b$w_buff1~0=v_~b$w_buff1~0_64, ~b$w_buff0~0=v_~b$w_buff0~0_61, ~b$r_buff0_thd4~0=v_~b$r_buff0_thd4~0_62} OutVars{~b$mem_tmp~0=v_~b$mem_tmp~0_18, ~b$flush_delayed~0=v_~b$flush_delayed~0_25, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_10, ~b$w_buff0_used~0=v_~b$w_buff0_used~0_149, ~weak$$choice0~0=v_~weak$$choice0~0_7, ~b~0=v_~b~0_92, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_132, ~b$r_buff1_thd4~0=v_~b$r_buff1_thd4~0_59, ~b$w_buff1~0=v_~b$w_buff1~0_63, ~b$w_buff0~0=v_~b$w_buff0~0_60, ~weak$$choice2~0=v_~weak$$choice2~0_32, ~b$r_buff0_thd4~0=v_~b$r_buff0_thd4~0_61, P3Thread1of1ForFork0_#t~nondet3=|v_P3Thread1of1ForFork0_#t~nondet3_1|, P3Thread1of1ForFork0_#t~nondet4=|v_P3Thread1of1ForFork0_#t~nondet4_1|} AuxVars[] AssignedVars[~b$mem_tmp~0, ~b$flush_delayed~0, ~__unbuffered_p3_EBX~0, ~b$w_buff0_used~0, ~weak$$choice0~0, ~b~0, ~b$w_buff1_used~0, ~b$r_buff1_thd4~0, ~b$w_buff1~0, ~b$w_buff0~0, ~weak$$choice2~0, ~b$r_buff0_thd4~0, P3Thread1of1ForFork0_#t~nondet3, P3Thread1of1ForFork0_#t~nondet4][57], [113#L768true, 164#(<= 0 ~__unbuffered_cnt~0), 102#L847true, Black: 168#(<= ~__unbuffered_cnt~0 0), Black: 173#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))), 171#true, 4#ULTIMATE.startEXITtrue, 101#P1EXITtrue, P1Thread1of1ForFork1InUse, P3Thread1of1ForFork0InUse, 180#(<= ~__unbuffered_cnt~0 1), P0Thread1of1ForFork3InUse, P2Thread1of1ForFork2InUse, 127#L815true]) [2023-08-27 03:46:37,975 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is cut-off event [2023-08-27 03:46:37,975 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-27 03:46:37,975 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-27 03:46:37,975 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-27 03:46:38,063 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([477] L831-->L847: Formula: (let ((.cse4 (= (mod v_~b$r_buff1_thd4~0_60 256) 0)) (.cse6 (= (mod v_~b$r_buff0_thd4~0_62 256) 0))) (let ((.cse8 (not .cse6)) (.cse7 (and .cse6 .cse4)) (.cse12 (= (mod v_~b$w_buff0_used~0_150 256) 0)) (.cse9 (and .cse6 (= (mod v_~b$w_buff1_used~0_133 256) 0)))) (let ((.cse10 (or .cse7 .cse12 .cse9)) (.cse11 (and (not .cse12) .cse8))) (let ((.cse2 (= (mod v_~b$w_buff1_used~0_132 256) 0)) (.cse5 (ite .cse10 v_~b~0_93 (ite .cse11 v_~b$w_buff0~0_61 v_~b$w_buff1~0_64))) (.cse3 (= (mod v_~b$w_buff0_used~0_149 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_32 256) 0)))) (and (= v_~b$w_buff0~0_61 v_~b$w_buff0~0_60) (= (ite .cse0 v_~b$r_buff1_thd4~0_60 (ite (let ((.cse1 (= (mod v_~b$r_buff0_thd4~0_61 256) 0))) (or (and .cse1 .cse2) .cse3 (and .cse1 .cse4))) v_~b$r_buff1_thd4~0_60 0)) v_~b$r_buff1_thd4~0_59) (= v_~b~0_92 (ite .cse0 v_~b$mem_tmp~0_18 .cse5)) (= v_~b$flush_delayed~0_25 0) (= (ite .cse0 v_~b$r_buff0_thd4~0_62 (ite (or (and .cse6 .cse2) .cse7 .cse3) v_~b$r_buff0_thd4~0_62 (ite (and .cse8 (not .cse3)) 0 v_~b$r_buff0_thd4~0_62))) v_~b$r_buff0_thd4~0_61) (= .cse5 v_~__unbuffered_p3_EBX~0_10) (= v_~b$mem_tmp~0_18 v_~b~0_93) (= v_~b$w_buff1_used~0_132 (ite .cse0 v_~b$w_buff1_used~0_133 (ite (or .cse7 .cse3 .cse9) v_~b$w_buff1_used~0_133 0))) (= v_~b$w_buff1~0_64 v_~b$w_buff1~0_63) (= (ite .cse0 v_~b$w_buff0_used~0_150 (ite .cse10 v_~b$w_buff0_used~0_150 (ite .cse11 0 v_~b$w_buff0_used~0_150))) v_~b$w_buff0_used~0_149)))))) InVars {~b$w_buff0_used~0=v_~b$w_buff0_used~0_150, ~b~0=v_~b~0_93, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_133, ~b$r_buff1_thd4~0=v_~b$r_buff1_thd4~0_60, ~b$w_buff1~0=v_~b$w_buff1~0_64, ~b$w_buff0~0=v_~b$w_buff0~0_61, ~b$r_buff0_thd4~0=v_~b$r_buff0_thd4~0_62} OutVars{~b$mem_tmp~0=v_~b$mem_tmp~0_18, ~b$flush_delayed~0=v_~b$flush_delayed~0_25, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_10, ~b$w_buff0_used~0=v_~b$w_buff0_used~0_149, ~weak$$choice0~0=v_~weak$$choice0~0_7, ~b~0=v_~b~0_92, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_132, ~b$r_buff1_thd4~0=v_~b$r_buff1_thd4~0_59, ~b$w_buff1~0=v_~b$w_buff1~0_63, ~b$w_buff0~0=v_~b$w_buff0~0_60, ~weak$$choice2~0=v_~weak$$choice2~0_32, ~b$r_buff0_thd4~0=v_~b$r_buff0_thd4~0_61, P3Thread1of1ForFork0_#t~nondet3=|v_P3Thread1of1ForFork0_#t~nondet3_1|, P3Thread1of1ForFork0_#t~nondet4=|v_P3Thread1of1ForFork0_#t~nondet4_1|} AuxVars[] AssignedVars[~b$mem_tmp~0, ~b$flush_delayed~0, ~__unbuffered_p3_EBX~0, ~b$w_buff0_used~0, ~weak$$choice0~0, ~b~0, ~b$w_buff1_used~0, ~b$r_buff1_thd4~0, ~b$w_buff1~0, ~b$w_buff0~0, ~weak$$choice2~0, ~b$r_buff0_thd4~0, P3Thread1of1ForFork0_#t~nondet3, P3Thread1of1ForFork0_#t~nondet4][75], [113#L768true, 164#(<= 0 ~__unbuffered_cnt~0), 102#L847true, Black: 168#(<= ~__unbuffered_cnt~0 0), Black: 173#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))), 171#true, 177#true, 4#ULTIMATE.startEXITtrue, 101#P1EXITtrue, P1Thread1of1ForFork1InUse, P3Thread1of1ForFork0InUse, P0Thread1of1ForFork3InUse, 46#P2EXITtrue, P2Thread1of1ForFork2InUse]) [2023-08-27 03:46:38,064 INFO L294 olderBase$Statistics]: this new event has 24 ancestors and is cut-off event [2023-08-27 03:46:38,064 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-08-27 03:46:38,064 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-08-27 03:46:38,064 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-08-27 03:46:38,337 INFO L124 PetriNetUnfolderBase]: 15109/21482 cut-off events. [2023-08-27 03:46:38,338 INFO L125 PetriNetUnfolderBase]: For 8498/8890 co-relation queries the response was YES. [2023-08-27 03:46:38,372 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56032 conditions, 21482 events. 15109/21482 cut-off events. For 8498/8890 co-relation queries the response was YES. Maximal size of possible extension queue 992. Compared 133110 event pairs, 4160 based on Foata normal form. 17/20027 useless extension candidates. Maximal degree in co-relation 56021. Up to 8248 conditions per place. [2023-08-27 03:46:38,451 INFO L140 encePairwiseOnDemand]: 259/268 looper letters, 73 selfloop transitions, 9 changer transitions 0/90 dead transitions. [2023-08-27 03:46:38,451 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 90 transitions, 485 flow [2023-08-27 03:46:38,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-27 03:46:38,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-27 03:46:38,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 537 transitions. [2023-08-27 03:46:38,453 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5009328358208955 [2023-08-27 03:46:38,453 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 537 transitions. [2023-08-27 03:46:38,453 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 537 transitions. [2023-08-27 03:46:38,454 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:46:38,455 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 537 transitions. [2023-08-27 03:46:38,456 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 134.25) internal successors, (537), 4 states have internal predecessors, (537), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:46:38,459 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 268.0) internal successors, (1340), 5 states have internal predecessors, (1340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:46:38,459 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 268.0) internal successors, (1340), 5 states have internal predecessors, (1340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:46:38,459 INFO L175 Difference]: Start difference. First operand has 49 places, 44 transitions, 171 flow. Second operand 4 states and 537 transitions. [2023-08-27 03:46:38,459 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 90 transitions, 485 flow [2023-08-27 03:46:38,490 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 90 transitions, 457 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-27 03:46:38,492 INFO L231 Difference]: Finished difference. Result has 51 places, 48 transitions, 213 flow [2023-08-27 03:46:38,492 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=268, PETRI_DIFFERENCE_MINUEND_FLOW=155, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=213, PETRI_PLACES=51, PETRI_TRANSITIONS=48} [2023-08-27 03:46:38,494 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 0 predicate places. [2023-08-27 03:46:38,494 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 48 transitions, 213 flow [2023-08-27 03:46:38,495 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 117.5) internal successors, (470), 4 states have internal predecessors, (470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:46:38,495 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:46:38,495 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:46:38,495 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-27 03:46:38,495 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-27 03:46:38,495 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:46:38,495 INFO L85 PathProgramCache]: Analyzing trace with hash 713146973, now seen corresponding path program 1 times [2023-08-27 03:46:38,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:46:38,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799488137] [2023-08-27 03:46:38,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:46:38,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:46:38,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:46:38,668 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 03:46:38,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:46:38,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799488137] [2023-08-27 03:46:38,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [799488137] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:46:38,669 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:46:38,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-27 03:46:38,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172295667] [2023-08-27 03:46:38,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:46:38,669 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-27 03:46:38,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:46:38,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-27 03:46:38,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-27 03:46:38,675 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 268 [2023-08-27 03:46:38,675 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 48 transitions, 213 flow. Second operand has 4 states, 4 states have (on average 113.0) internal successors, (452), 4 states have internal predecessors, (452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:46:38,676 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:46:38,676 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 268 [2023-08-27 03:46:38,676 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:46:40,698 INFO L124 PetriNetUnfolderBase]: 18772/25669 cut-off events. [2023-08-27 03:46:40,698 INFO L125 PetriNetUnfolderBase]: For 21630/21630 co-relation queries the response was YES. [2023-08-27 03:46:40,773 INFO L83 FinitePrefix]: Finished finitePrefix Result has 73977 conditions, 25669 events. 18772/25669 cut-off events. For 21630/21630 co-relation queries the response was YES. Maximal size of possible extension queue 763. Compared 135981 event pairs, 4731 based on Foata normal form. 0/24468 useless extension candidates. Maximal degree in co-relation 73965. Up to 11907 conditions per place. [2023-08-27 03:46:40,882 INFO L140 encePairwiseOnDemand]: 259/268 looper letters, 92 selfloop transitions, 9 changer transitions 0/101 dead transitions. [2023-08-27 03:46:40,883 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 101 transitions, 667 flow [2023-08-27 03:46:40,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-27 03:46:40,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-27 03:46:40,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 514 transitions. [2023-08-27 03:46:40,885 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47947761194029853 [2023-08-27 03:46:40,885 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 514 transitions. [2023-08-27 03:46:40,885 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 514 transitions. [2023-08-27 03:46:40,886 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:46:40,886 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 514 transitions. [2023-08-27 03:46:40,887 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 128.5) internal successors, (514), 4 states have internal predecessors, (514), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:46:40,889 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 268.0) internal successors, (1340), 5 states have internal predecessors, (1340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:46:40,889 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 268.0) internal successors, (1340), 5 states have internal predecessors, (1340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:46:40,890 INFO L175 Difference]: Start difference. First operand has 51 places, 48 transitions, 213 flow. Second operand 4 states and 514 transitions. [2023-08-27 03:46:40,890 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 101 transitions, 667 flow [2023-08-27 03:46:40,902 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 101 transitions, 621 flow, removed 11 selfloop flow, removed 2 redundant places. [2023-08-27 03:46:40,904 INFO L231 Difference]: Finished difference. Result has 55 places, 53 transitions, 263 flow [2023-08-27 03:46:40,904 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=268, PETRI_DIFFERENCE_MINUEND_FLOW=195, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=263, PETRI_PLACES=55, PETRI_TRANSITIONS=53} [2023-08-27 03:46:40,906 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 4 predicate places. [2023-08-27 03:46:40,907 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 53 transitions, 263 flow [2023-08-27 03:46:40,907 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 113.0) internal successors, (452), 4 states have internal predecessors, (452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:46:40,907 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:46:40,907 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:46:40,907 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-27 03:46:40,908 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-27 03:46:40,908 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:46:40,908 INFO L85 PathProgramCache]: Analyzing trace with hash -885552175, now seen corresponding path program 1 times [2023-08-27 03:46:40,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:46:40,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141497648] [2023-08-27 03:46:40,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:46:40,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:46:40,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:46:41,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-27 03:46:41,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:46:41,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2141497648] [2023-08-27 03:46:41,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2141497648] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:46:41,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:46:41,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-27 03:46:41,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043774452] [2023-08-27 03:46:41,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:46:41,077 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-27 03:46:41,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:46:41,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-27 03:46:41,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-27 03:46:41,078 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 268 [2023-08-27 03:46:41,079 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 53 transitions, 263 flow. Second operand has 4 states, 4 states have (on average 113.25) internal successors, (453), 4 states have internal predecessors, (453), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:46:41,079 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:46:41,079 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 268 [2023-08-27 03:46:41,079 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:46:43,306 INFO L124 PetriNetUnfolderBase]: 18494/25288 cut-off events. [2023-08-27 03:46:43,306 INFO L125 PetriNetUnfolderBase]: For 25054/25054 co-relation queries the response was YES. [2023-08-27 03:46:43,384 INFO L83 FinitePrefix]: Finished finitePrefix Result has 77155 conditions, 25288 events. 18494/25288 cut-off events. For 25054/25054 co-relation queries the response was YES. Maximal size of possible extension queue 751. Compared 135412 event pairs, 2518 based on Foata normal form. 40/24685 useless extension candidates. Maximal degree in co-relation 77140. Up to 15339 conditions per place. [2023-08-27 03:46:43,498 INFO L140 encePairwiseOnDemand]: 259/268 looper letters, 94 selfloop transitions, 19 changer transitions 0/113 dead transitions. [2023-08-27 03:46:43,498 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 113 transitions, 753 flow [2023-08-27 03:46:43,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-27 03:46:43,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-27 03:46:43,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 521 transitions. [2023-08-27 03:46:43,501 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48600746268656714 [2023-08-27 03:46:43,501 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 521 transitions. [2023-08-27 03:46:43,501 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 521 transitions. [2023-08-27 03:46:43,501 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:46:43,501 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 521 transitions. [2023-08-27 03:46:43,503 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 130.25) internal successors, (521), 4 states have internal predecessors, (521), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:46:43,504 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 268.0) internal successors, (1340), 5 states have internal predecessors, (1340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:46:43,505 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 268.0) internal successors, (1340), 5 states have internal predecessors, (1340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:46:43,505 INFO L175 Difference]: Start difference. First operand has 55 places, 53 transitions, 263 flow. Second operand 4 states and 521 transitions. [2023-08-27 03:46:43,505 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 113 transitions, 753 flow [2023-08-27 03:46:43,610 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 113 transitions, 748 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-27 03:46:43,612 INFO L231 Difference]: Finished difference. Result has 60 places, 65 transitions, 433 flow [2023-08-27 03:46:43,612 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=268, PETRI_DIFFERENCE_MINUEND_FLOW=260, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=433, PETRI_PLACES=60, PETRI_TRANSITIONS=65} [2023-08-27 03:46:43,613 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 9 predicate places. [2023-08-27 03:46:43,613 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 65 transitions, 433 flow [2023-08-27 03:46:43,613 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 113.25) internal successors, (453), 4 states have internal predecessors, (453), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:46:43,614 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:46:43,614 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:46:43,614 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-27 03:46:43,614 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-27 03:46:43,614 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:46:43,614 INFO L85 PathProgramCache]: Analyzing trace with hash -1682255479, now seen corresponding path program 1 times [2023-08-27 03:46:43,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:46:43,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521066992] [2023-08-27 03:46:43,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:46:43,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:46:43,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:46:43,762 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 03:46:43,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:46:43,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521066992] [2023-08-27 03:46:43,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1521066992] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:46:43,763 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:46:43,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-27 03:46:43,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584903945] [2023-08-27 03:46:43,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:46:43,764 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-27 03:46:43,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:46:43,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-27 03:46:43,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-27 03:46:43,765 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 268 [2023-08-27 03:46:43,765 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 65 transitions, 433 flow. Second operand has 4 states, 4 states have (on average 116.25) internal successors, (465), 4 states have internal predecessors, (465), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:46:43,765 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:46:43,766 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 268 [2023-08-27 03:46:43,766 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:46:45,220 INFO L124 PetriNetUnfolderBase]: 11036/16529 cut-off events. [2023-08-27 03:46:45,220 INFO L125 PetriNetUnfolderBase]: For 22919/23844 co-relation queries the response was YES. [2023-08-27 03:46:45,271 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51648 conditions, 16529 events. 11036/16529 cut-off events. For 22919/23844 co-relation queries the response was YES. Maximal size of possible extension queue 729. Compared 107295 event pairs, 1584 based on Foata normal form. 1443/16825 useless extension candidates. Maximal degree in co-relation 51629. Up to 8621 conditions per place. [2023-08-27 03:46:45,339 INFO L140 encePairwiseOnDemand]: 261/268 looper letters, 88 selfloop transitions, 6 changer transitions 0/111 dead transitions. [2023-08-27 03:46:45,339 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 111 transitions, 847 flow [2023-08-27 03:46:45,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-27 03:46:45,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-27 03:46:45,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 520 transitions. [2023-08-27 03:46:45,341 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48507462686567165 [2023-08-27 03:46:45,341 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 520 transitions. [2023-08-27 03:46:45,341 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 520 transitions. [2023-08-27 03:46:45,342 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:46:45,342 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 520 transitions. [2023-08-27 03:46:45,343 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 130.0) internal successors, (520), 4 states have internal predecessors, (520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:46:45,344 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 268.0) internal successors, (1340), 5 states have internal predecessors, (1340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:46:45,345 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 268.0) internal successors, (1340), 5 states have internal predecessors, (1340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:46:45,345 INFO L175 Difference]: Start difference. First operand has 60 places, 65 transitions, 433 flow. Second operand 4 states and 520 transitions. [2023-08-27 03:46:45,345 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 111 transitions, 847 flow [2023-08-27 03:46:45,393 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 111 transitions, 847 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-27 03:46:45,395 INFO L231 Difference]: Finished difference. Result has 65 places, 66 transitions, 463 flow [2023-08-27 03:46:45,395 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=268, PETRI_DIFFERENCE_MINUEND_FLOW=433, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=463, PETRI_PLACES=65, PETRI_TRANSITIONS=66} [2023-08-27 03:46:45,395 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 14 predicate places. [2023-08-27 03:46:45,395 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 66 transitions, 463 flow [2023-08-27 03:46:45,396 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 116.25) internal successors, (465), 4 states have internal predecessors, (465), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:46:45,396 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:46:45,396 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:46:45,396 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-27 03:46:45,396 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-27 03:46:45,397 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:46:45,397 INFO L85 PathProgramCache]: Analyzing trace with hash 694203895, now seen corresponding path program 1 times [2023-08-27 03:46:45,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:46:45,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279961265] [2023-08-27 03:46:45,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:46:45,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:46:45,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:46:45,591 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 03:46:45,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:46:45,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279961265] [2023-08-27 03:46:45,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [279961265] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:46:45,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:46:45,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-27 03:46:45,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456676725] [2023-08-27 03:46:45,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:46:45,592 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-27 03:46:45,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:46:45,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-27 03:46:45,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-27 03:46:45,594 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 268 [2023-08-27 03:46:45,594 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 66 transitions, 463 flow. Second operand has 5 states, 5 states have (on average 116.2) internal successors, (581), 5 states have internal predecessors, (581), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:46:45,594 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:46:45,594 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 268 [2023-08-27 03:46:45,594 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:46:46,614 INFO L124 PetriNetUnfolderBase]: 7951/12441 cut-off events. [2023-08-27 03:46:46,614 INFO L125 PetriNetUnfolderBase]: For 23383/23889 co-relation queries the response was YES. [2023-08-27 03:46:46,651 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42661 conditions, 12441 events. 7951/12441 cut-off events. For 23383/23889 co-relation queries the response was YES. Maximal size of possible extension queue 520. Compared 82528 event pairs, 1508 based on Foata normal form. 953/12220 useless extension candidates. Maximal degree in co-relation 42638. Up to 3846 conditions per place. [2023-08-27 03:46:46,697 INFO L140 encePairwiseOnDemand]: 261/268 looper letters, 95 selfloop transitions, 10 changer transitions 0/121 dead transitions. [2023-08-27 03:46:46,697 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 121 transitions, 926 flow [2023-08-27 03:46:46,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-27 03:46:46,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-27 03:46:46,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 651 transitions. [2023-08-27 03:46:46,700 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48582089552238805 [2023-08-27 03:46:46,700 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 651 transitions. [2023-08-27 03:46:46,700 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 651 transitions. [2023-08-27 03:46:46,700 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:46:46,700 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 651 transitions. [2023-08-27 03:46:46,702 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 130.2) internal successors, (651), 5 states have internal predecessors, (651), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:46:46,704 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 268.0) internal successors, (1608), 6 states have internal predecessors, (1608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:46:46,704 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 268.0) internal successors, (1608), 6 states have internal predecessors, (1608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:46:46,704 INFO L175 Difference]: Start difference. First operand has 65 places, 66 transitions, 463 flow. Second operand 5 states and 651 transitions. [2023-08-27 03:46:46,704 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 121 transitions, 926 flow [2023-08-27 03:46:46,735 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 121 transitions, 918 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-27 03:46:46,736 INFO L231 Difference]: Finished difference. Result has 69 places, 64 transitions, 471 flow [2023-08-27 03:46:46,737 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=268, PETRI_DIFFERENCE_MINUEND_FLOW=428, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=471, PETRI_PLACES=69, PETRI_TRANSITIONS=64} [2023-08-27 03:46:46,737 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 18 predicate places. [2023-08-27 03:46:46,737 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 64 transitions, 471 flow [2023-08-27 03:46:46,738 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 116.2) internal successors, (581), 5 states have internal predecessors, (581), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:46:46,738 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:46:46,738 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:46:46,738 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-27 03:46:46,738 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting P2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-27 03:46:46,738 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:46:46,738 INFO L85 PathProgramCache]: Analyzing trace with hash -1410173707, now seen corresponding path program 1 times [2023-08-27 03:46:46,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:46:46,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827001728] [2023-08-27 03:46:46,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:46:46,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:46:46,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:46:46,806 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 03:46:46,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:46:46,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827001728] [2023-08-27 03:46:46,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [827001728] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:46:46,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:46:46,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-27 03:46:46,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253868301] [2023-08-27 03:46:46,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:46:46,807 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-27 03:46:46,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:46:46,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-27 03:46:46,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-27 03:46:46,808 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 268 [2023-08-27 03:46:46,809 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 64 transitions, 471 flow. Second operand has 5 states, 5 states have (on average 118.0) internal successors, (590), 5 states have internal predecessors, (590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:46:46,809 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:46:46,809 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 268 [2023-08-27 03:46:46,809 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:46:47,766 INFO L124 PetriNetUnfolderBase]: 6971/10742 cut-off events. [2023-08-27 03:46:47,766 INFO L125 PetriNetUnfolderBase]: For 27558/28014 co-relation queries the response was YES. [2023-08-27 03:46:47,796 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39972 conditions, 10742 events. 6971/10742 cut-off events. For 27558/28014 co-relation queries the response was YES. Maximal size of possible extension queue 514. Compared 68567 event pairs, 1428 based on Foata normal form. 184/10539 useless extension candidates. Maximal degree in co-relation 39947. Up to 3846 conditions per place. [2023-08-27 03:46:47,827 INFO L140 encePairwiseOnDemand]: 259/268 looper letters, 94 selfloop transitions, 13 changer transitions 0/123 dead transitions. [2023-08-27 03:46:47,827 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 123 transitions, 976 flow [2023-08-27 03:46:47,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-27 03:46:47,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-27 03:46:47,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 665 transitions. [2023-08-27 03:46:47,829 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4962686567164179 [2023-08-27 03:46:47,829 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 665 transitions. [2023-08-27 03:46:47,829 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 665 transitions. [2023-08-27 03:46:47,830 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:46:47,830 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 665 transitions. [2023-08-27 03:46:47,831 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 133.0) internal successors, (665), 5 states have internal predecessors, (665), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:46:47,833 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 268.0) internal successors, (1608), 6 states have internal predecessors, (1608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:46:47,833 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 268.0) internal successors, (1608), 6 states have internal predecessors, (1608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:46:47,834 INFO L175 Difference]: Start difference. First operand has 69 places, 64 transitions, 471 flow. Second operand 5 states and 665 transitions. [2023-08-27 03:46:47,834 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 123 transitions, 976 flow [2023-08-27 03:46:47,867 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 123 transitions, 960 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-27 03:46:47,869 INFO L231 Difference]: Finished difference. Result has 71 places, 68 transitions, 530 flow [2023-08-27 03:46:47,869 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=268, PETRI_DIFFERENCE_MINUEND_FLOW=456, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=530, PETRI_PLACES=71, PETRI_TRANSITIONS=68} [2023-08-27 03:46:47,870 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 20 predicate places. [2023-08-27 03:46:47,870 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 68 transitions, 530 flow [2023-08-27 03:46:47,870 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 118.0) internal successors, (590), 5 states have internal predecessors, (590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:46:47,870 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:46:47,870 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] [2023-08-27 03:46:47,870 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-27 03:46:47,870 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-27 03:46:47,871 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:46:47,871 INFO L85 PathProgramCache]: Analyzing trace with hash 498632197, now seen corresponding path program 1 times [2023-08-27 03:46:47,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:46:47,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710237014] [2023-08-27 03:46:47,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:46:47,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:46:47,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:46:48,077 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 03:46:48,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:46:48,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710237014] [2023-08-27 03:46:48,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [710237014] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:46:48,077 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:46:48,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-27 03:46:48,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725722597] [2023-08-27 03:46:48,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:46:48,078 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-27 03:46:48,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:46:48,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-27 03:46:48,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-27 03:46:48,079 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 268 [2023-08-27 03:46:48,080 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 68 transitions, 530 flow. Second operand has 3 states, 3 states have (on average 123.33333333333333) internal successors, (370), 3 states have internal predecessors, (370), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:46:48,080 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:46:48,080 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 268 [2023-08-27 03:46:48,080 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:46:49,413 INFO L124 PetriNetUnfolderBase]: 9961/15438 cut-off events. [2023-08-27 03:46:49,414 INFO L125 PetriNetUnfolderBase]: For 49966/50108 co-relation queries the response was YES. [2023-08-27 03:46:49,473 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61750 conditions, 15438 events. 9961/15438 cut-off events. For 49966/50108 co-relation queries the response was YES. Maximal size of possible extension queue 667. Compared 102533 event pairs, 3482 based on Foata normal form. 105/15093 useless extension candidates. Maximal degree in co-relation 61724. Up to 8311 conditions per place. [2023-08-27 03:46:49,534 INFO L140 encePairwiseOnDemand]: 265/268 looper letters, 87 selfloop transitions, 9 changer transitions 0/106 dead transitions. [2023-08-27 03:46:49,534 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 106 transitions, 998 flow [2023-08-27 03:46:49,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-27 03:46:49,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-27 03:46:49,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 405 transitions. [2023-08-27 03:46:49,536 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.503731343283582 [2023-08-27 03:46:49,536 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 405 transitions. [2023-08-27 03:46:49,536 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 405 transitions. [2023-08-27 03:46:49,536 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:46:49,536 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 405 transitions. [2023-08-27 03:46:49,537 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 135.0) internal successors, (405), 3 states have internal predecessors, (405), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:46:49,539 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 268.0) internal successors, (1072), 4 states have internal predecessors, (1072), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:46:49,539 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 268.0) internal successors, (1072), 4 states have internal predecessors, (1072), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:46:49,539 INFO L175 Difference]: Start difference. First operand has 71 places, 68 transitions, 530 flow. Second operand 3 states and 405 transitions. [2023-08-27 03:46:49,539 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 106 transitions, 998 flow [2023-08-27 03:46:49,825 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 106 transitions, 932 flow, removed 16 selfloop flow, removed 3 redundant places. [2023-08-27 03:46:49,826 INFO L231 Difference]: Finished difference. Result has 71 places, 68 transitions, 525 flow [2023-08-27 03:46:49,827 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=268, PETRI_DIFFERENCE_MINUEND_FLOW=496, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=525, PETRI_PLACES=71, PETRI_TRANSITIONS=68} [2023-08-27 03:46:49,827 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 20 predicate places. [2023-08-27 03:46:49,827 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 68 transitions, 525 flow [2023-08-27 03:46:49,827 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 123.33333333333333) internal successors, (370), 3 states have internal predecessors, (370), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:46:49,827 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:46:49,828 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] [2023-08-27 03:46:49,828 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-27 03:46:49,828 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-27 03:46:49,828 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:46:49,828 INFO L85 PathProgramCache]: Analyzing trace with hash -375152584, now seen corresponding path program 1 times [2023-08-27 03:46:49,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:46:49,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207061711] [2023-08-27 03:46:49,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:46:49,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:46:49,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:46:50,034 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 03:46:50,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:46:50,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207061711] [2023-08-27 03:46:50,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1207061711] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:46:50,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:46:50,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-27 03:46:50,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213879895] [2023-08-27 03:46:50,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:46:50,036 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-27 03:46:50,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:46:50,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-27 03:46:50,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-27 03:46:50,037 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 268 [2023-08-27 03:46:50,038 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 68 transitions, 525 flow. Second operand has 5 states, 5 states have (on average 112.0) internal successors, (560), 5 states have internal predecessors, (560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:46:50,038 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:46:50,038 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 268 [2023-08-27 03:46:50,038 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:46:52,298 INFO L124 PetriNetUnfolderBase]: 18628/27501 cut-off events. [2023-08-27 03:46:52,298 INFO L125 PetriNetUnfolderBase]: For 84070/84070 co-relation queries the response was YES. [2023-08-27 03:46:52,435 INFO L83 FinitePrefix]: Finished finitePrefix Result has 107187 conditions, 27501 events. 18628/27501 cut-off events. For 84070/84070 co-relation queries the response was YES. Maximal size of possible extension queue 1008. Compared 178014 event pairs, 1152 based on Foata normal form. 80/27410 useless extension candidates. Maximal degree in co-relation 107161. Up to 10081 conditions per place. [2023-08-27 03:46:52,532 INFO L140 encePairwiseOnDemand]: 258/268 looper letters, 168 selfloop transitions, 31 changer transitions 0/199 dead transitions. [2023-08-27 03:46:52,532 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 199 transitions, 1800 flow [2023-08-27 03:46:52,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-27 03:46:52,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-27 03:46:52,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 763 transitions. [2023-08-27 03:46:52,535 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47450248756218905 [2023-08-27 03:46:52,535 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 763 transitions. [2023-08-27 03:46:52,535 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 763 transitions. [2023-08-27 03:46:52,535 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:46:52,535 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 763 transitions. [2023-08-27 03:46:52,537 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 127.16666666666667) internal successors, (763), 6 states have internal predecessors, (763), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:46:52,539 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 268.0) internal successors, (1876), 7 states have internal predecessors, (1876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:46:52,540 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 268.0) internal successors, (1876), 7 states have internal predecessors, (1876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:46:52,540 INFO L175 Difference]: Start difference. First operand has 71 places, 68 transitions, 525 flow. Second operand 6 states and 763 transitions. [2023-08-27 03:46:52,540 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 199 transitions, 1800 flow [2023-08-27 03:46:53,025 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 199 transitions, 1778 flow, removed 2 selfloop flow, removed 1 redundant places. [2023-08-27 03:46:53,027 INFO L231 Difference]: Finished difference. Result has 78 places, 86 transitions, 821 flow [2023-08-27 03:46:53,027 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=268, PETRI_DIFFERENCE_MINUEND_FLOW=514, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=821, PETRI_PLACES=78, PETRI_TRANSITIONS=86} [2023-08-27 03:46:53,028 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 27 predicate places. [2023-08-27 03:46:53,028 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 86 transitions, 821 flow [2023-08-27 03:46:53,028 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 112.0) internal successors, (560), 5 states have internal predecessors, (560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:46:53,028 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:46:53,028 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] [2023-08-27 03:46:53,028 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-27 03:46:53,028 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-27 03:46:53,029 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:46:53,029 INFO L85 PathProgramCache]: Analyzing trace with hash -1712280098, now seen corresponding path program 2 times [2023-08-27 03:46:53,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:46:53,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951167430] [2023-08-27 03:46:53,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:46:53,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:46:53,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:46:53,226 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 03:46:53,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:46:53,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951167430] [2023-08-27 03:46:53,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1951167430] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:46:53,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:46:53,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-27 03:46:53,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634804965] [2023-08-27 03:46:53,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:46:53,228 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-27 03:46:53,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:46:53,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-27 03:46:53,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-27 03:46:53,229 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 268 [2023-08-27 03:46:53,230 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 86 transitions, 821 flow. Second operand has 6 states, 6 states have (on average 116.0) internal successors, (696), 6 states have internal predecessors, (696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:46:53,230 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:46:53,230 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 268 [2023-08-27 03:46:53,230 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:46:55,300 INFO L124 PetriNetUnfolderBase]: 11745/18439 cut-off events. [2023-08-27 03:46:55,300 INFO L125 PetriNetUnfolderBase]: For 51458/52071 co-relation queries the response was YES. [2023-08-27 03:46:55,405 INFO L83 FinitePrefix]: Finished finitePrefix Result has 69744 conditions, 18439 events. 11745/18439 cut-off events. For 51458/52071 co-relation queries the response was YES. Maximal size of possible extension queue 1041. Compared 132931 event pairs, 2348 based on Foata normal form. 640/18516 useless extension candidates. Maximal degree in co-relation 69714. Up to 7096 conditions per place. [2023-08-27 03:46:55,467 INFO L140 encePairwiseOnDemand]: 261/268 looper letters, 122 selfloop transitions, 14 changer transitions 0/163 dead transitions. [2023-08-27 03:46:55,468 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 163 transitions, 1565 flow [2023-08-27 03:46:55,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-27 03:46:55,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-27 03:46:55,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 780 transitions. [2023-08-27 03:46:55,470 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48507462686567165 [2023-08-27 03:46:55,470 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 780 transitions. [2023-08-27 03:46:55,470 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 780 transitions. [2023-08-27 03:46:55,470 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:46:55,471 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 780 transitions. [2023-08-27 03:46:55,472 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 130.0) internal successors, (780), 6 states have internal predecessors, (780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:46:55,474 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 268.0) internal successors, (1876), 7 states have internal predecessors, (1876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:46:55,475 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 268.0) internal successors, (1876), 7 states have internal predecessors, (1876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:46:55,475 INFO L175 Difference]: Start difference. First operand has 78 places, 86 transitions, 821 flow. Second operand 6 states and 780 transitions. [2023-08-27 03:46:55,475 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 163 transitions, 1565 flow [2023-08-27 03:46:56,384 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 163 transitions, 1502 flow, removed 8 selfloop flow, removed 1 redundant places. [2023-08-27 03:46:56,386 INFO L231 Difference]: Finished difference. Result has 84 places, 85 transitions, 803 flow [2023-08-27 03:46:56,386 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=268, PETRI_DIFFERENCE_MINUEND_FLOW=750, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=803, PETRI_PLACES=84, PETRI_TRANSITIONS=85} [2023-08-27 03:46:56,387 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 33 predicate places. [2023-08-27 03:46:56,387 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 85 transitions, 803 flow [2023-08-27 03:46:56,387 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 116.0) internal successors, (696), 6 states have internal predecessors, (696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:46:56,387 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:46:56,387 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] [2023-08-27 03:46:56,387 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-27 03:46:56,388 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-27 03:46:56,388 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:46:56,388 INFO L85 PathProgramCache]: Analyzing trace with hash 1109259632, now seen corresponding path program 1 times [2023-08-27 03:46:56,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:46:56,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752784739] [2023-08-27 03:46:56,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:46:56,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:46:56,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:46:57,260 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 03:46:57,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:46:57,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752784739] [2023-08-27 03:46:57,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1752784739] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:46:57,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:46:57,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-27 03:46:57,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145593369] [2023-08-27 03:46:57,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:46:57,261 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-27 03:46:57,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:46:57,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-27 03:46:57,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-08-27 03:46:57,262 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 268 [2023-08-27 03:46:57,263 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 85 transitions, 803 flow. Second operand has 7 states, 7 states have (on average 114.0) internal successors, (798), 7 states have internal predecessors, (798), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:46:57,263 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:46:57,263 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 268 [2023-08-27 03:46:57,263 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:47:00,990 INFO L124 PetriNetUnfolderBase]: 20390/32309 cut-off events. [2023-08-27 03:47:00,990 INFO L125 PetriNetUnfolderBase]: For 140662/141940 co-relation queries the response was YES. [2023-08-27 03:47:01,159 INFO L83 FinitePrefix]: Finished finitePrefix Result has 139414 conditions, 32309 events. 20390/32309 cut-off events. For 140662/141940 co-relation queries the response was YES. Maximal size of possible extension queue 1787. Compared 257762 event pairs, 2862 based on Foata normal form. 339/31606 useless extension candidates. Maximal degree in co-relation 139381. Up to 9165 conditions per place. [2023-08-27 03:47:01,259 INFO L140 encePairwiseOnDemand]: 261/268 looper letters, 208 selfloop transitions, 8 changer transitions 3/246 dead transitions. [2023-08-27 03:47:01,259 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 246 transitions, 2591 flow [2023-08-27 03:47:01,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-27 03:47:01,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-27 03:47:01,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 774 transitions. [2023-08-27 03:47:01,261 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48134328358208955 [2023-08-27 03:47:01,261 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 774 transitions. [2023-08-27 03:47:01,261 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 774 transitions. [2023-08-27 03:47:01,261 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:47:01,261 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 774 transitions. [2023-08-27 03:47:01,262 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 129.0) internal successors, (774), 6 states have internal predecessors, (774), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:47:01,264 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 268.0) internal successors, (1876), 7 states have internal predecessors, (1876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:47:01,265 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 268.0) internal successors, (1876), 7 states have internal predecessors, (1876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:47:01,265 INFO L175 Difference]: Start difference. First operand has 84 places, 85 transitions, 803 flow. Second operand 6 states and 774 transitions. [2023-08-27 03:47:01,265 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 246 transitions, 2591 flow [2023-08-27 03:47:03,949 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 246 transitions, 2494 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-27 03:47:03,952 INFO L231 Difference]: Finished difference. Result has 88 places, 91 transitions, 871 flow [2023-08-27 03:47:03,952 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=268, PETRI_DIFFERENCE_MINUEND_FLOW=780, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=871, PETRI_PLACES=88, PETRI_TRANSITIONS=91} [2023-08-27 03:47:03,952 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 37 predicate places. [2023-08-27 03:47:03,953 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 91 transitions, 871 flow [2023-08-27 03:47:03,953 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 114.0) internal successors, (798), 7 states have internal predecessors, (798), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:47:03,953 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:47:03,953 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] [2023-08-27 03:47:03,953 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-27 03:47:03,954 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-27 03:47:03,954 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:47:03,954 INFO L85 PathProgramCache]: Analyzing trace with hash 1157032356, now seen corresponding path program 2 times [2023-08-27 03:47:03,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:47:03,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441203702] [2023-08-27 03:47:03,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:47:03,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:47:04,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:47:04,194 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 03:47:04,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:47:04,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441203702] [2023-08-27 03:47:04,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1441203702] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:47:04,196 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:47:04,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-27 03:47:04,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879924021] [2023-08-27 03:47:04,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:47:04,197 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-27 03:47:04,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:47:04,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-27 03:47:04,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-08-27 03:47:04,198 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 268 [2023-08-27 03:47:04,199 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 91 transitions, 871 flow. Second operand has 7 states, 7 states have (on average 116.0) internal successors, (812), 7 states have internal predecessors, (812), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:47:04,199 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:47:04,199 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 268 [2023-08-27 03:47:04,199 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:47:07,744 INFO L124 PetriNetUnfolderBase]: 18296/29141 cut-off events. [2023-08-27 03:47:07,744 INFO L125 PetriNetUnfolderBase]: For 107131/107957 co-relation queries the response was YES. [2023-08-27 03:47:07,886 INFO L83 FinitePrefix]: Finished finitePrefix Result has 126249 conditions, 29141 events. 18296/29141 cut-off events. For 107131/107957 co-relation queries the response was YES. Maximal size of possible extension queue 1725. Compared 232771 event pairs, 2758 based on Foata normal form. 375/29019 useless extension candidates. Maximal degree in co-relation 126213. Up to 10903 conditions per place. [2023-08-27 03:47:07,909 INFO L140 encePairwiseOnDemand]: 257/268 looper letters, 70 selfloop transitions, 18 changer transitions 52/154 dead transitions. [2023-08-27 03:47:07,910 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 154 transitions, 1575 flow [2023-08-27 03:47:07,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-27 03:47:07,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-27 03:47:07,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 877 transitions. [2023-08-27 03:47:07,912 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46748400852878463 [2023-08-27 03:47:07,912 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 877 transitions. [2023-08-27 03:47:07,912 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 877 transitions. [2023-08-27 03:47:07,913 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:47:07,913 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 877 transitions. [2023-08-27 03:47:07,914 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 125.28571428571429) internal successors, (877), 7 states have internal predecessors, (877), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:47:07,916 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 268.0) internal successors, (2144), 8 states have internal predecessors, (2144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:47:07,917 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 268.0) internal successors, (2144), 8 states have internal predecessors, (2144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:47:07,917 INFO L175 Difference]: Start difference. First operand has 88 places, 91 transitions, 871 flow. Second operand 7 states and 877 transitions. [2023-08-27 03:47:07,917 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 154 transitions, 1575 flow [2023-08-27 03:47:11,734 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 154 transitions, 1549 flow, removed 1 selfloop flow, removed 4 redundant places. [2023-08-27 03:47:11,735 INFO L231 Difference]: Finished difference. Result has 88 places, 60 transitions, 529 flow [2023-08-27 03:47:11,736 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=268, PETRI_DIFFERENCE_MINUEND_FLOW=760, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=529, PETRI_PLACES=88, PETRI_TRANSITIONS=60} [2023-08-27 03:47:11,736 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 37 predicate places. [2023-08-27 03:47:11,736 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 60 transitions, 529 flow [2023-08-27 03:47:11,737 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 116.0) internal successors, (812), 7 states have internal predecessors, (812), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:47:11,737 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:47:11,737 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, 1, 1, 1] [2023-08-27 03:47:11,737 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-27 03:47:11,737 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-27 03:47:11,737 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:47:11,737 INFO L85 PathProgramCache]: Analyzing trace with hash 810732146, now seen corresponding path program 1 times [2023-08-27 03:47:11,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:47:11,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734974967] [2023-08-27 03:47:11,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:47:11,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:47:11,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-27 03:47:11,812 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-27 03:47:11,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-27 03:47:11,931 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-27 03:47:11,933 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-27 03:47:11,935 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONASSERT (22 of 23 remaining) [2023-08-27 03:47:11,937 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONASSERT (21 of 23 remaining) [2023-08-27 03:47:11,937 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 23 remaining) [2023-08-27 03:47:11,937 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 23 remaining) [2023-08-27 03:47:11,937 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 23 remaining) [2023-08-27 03:47:11,937 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 23 remaining) [2023-08-27 03:47:11,937 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 23 remaining) [2023-08-27 03:47:11,937 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 23 remaining) [2023-08-27 03:47:11,937 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 23 remaining) [2023-08-27 03:47:11,938 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 23 remaining) [2023-08-27 03:47:11,938 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (12 of 23 remaining) [2023-08-27 03:47:11,938 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (11 of 23 remaining) [2023-08-27 03:47:11,938 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (10 of 23 remaining) [2023-08-27 03:47:11,938 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (9 of 23 remaining) [2023-08-27 03:47:11,938 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONASSERT (8 of 23 remaining) [2023-08-27 03:47:11,939 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 23 remaining) [2023-08-27 03:47:11,939 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 23 remaining) [2023-08-27 03:47:11,939 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 23 remaining) [2023-08-27 03:47:11,939 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 23 remaining) [2023-08-27 03:47:11,939 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 23 remaining) [2023-08-27 03:47:11,939 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 23 remaining) [2023-08-27 03:47:11,939 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 23 remaining) [2023-08-27 03:47:11,939 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 23 remaining) [2023-08-27 03:47:11,939 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-08-27 03:47:11,940 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:47:11,945 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-27 03:47:11,946 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-27 03:47:12,046 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.08 03:47:12 BasicIcfg [2023-08-27 03:47:12,046 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-27 03:47:12,046 INFO L158 Benchmark]: Toolchain (without parser) took 50688.99ms. Allocated memory was 337.6MB in the beginning and 7.0GB in the end (delta: 6.6GB). Free memory was 294.7MB in the beginning and 5.6GB in the end (delta: -5.3GB). Peak memory consumption was 1.3GB. Max. memory is 16.0GB. [2023-08-27 03:47:12,046 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 337.6MB. Free memory is still 314.6MB. There was no memory consumed. Max. memory is 16.0GB. [2023-08-27 03:47:12,047 INFO L158 Benchmark]: CACSL2BoogieTranslator took 609.27ms. Allocated memory is still 337.6MB. Free memory was 294.7MB in the beginning and 313.4MB in the end (delta: -18.6MB). Peak memory consumption was 31.7MB. Max. memory is 16.0GB. [2023-08-27 03:47:12,047 INFO L158 Benchmark]: Boogie Procedure Inliner took 65.74ms. Allocated memory is still 337.6MB. Free memory was 313.4MB in the beginning and 311.1MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-27 03:47:12,047 INFO L158 Benchmark]: Boogie Preprocessor took 50.44ms. Allocated memory is still 337.6MB. Free memory was 311.1MB in the beginning and 309.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-27 03:47:12,047 INFO L158 Benchmark]: RCFGBuilder took 764.11ms. Allocated memory is still 337.6MB. Free memory was 309.0MB in the beginning and 266.3MB in the end (delta: 42.7MB). Peak memory consumption was 44.0MB. Max. memory is 16.0GB. [2023-08-27 03:47:12,047 INFO L158 Benchmark]: TraceAbstraction took 49192.73ms. Allocated memory was 337.6MB in the beginning and 7.0GB in the end (delta: 6.6GB). Free memory was 265.6MB in the beginning and 5.6GB in the end (delta: -5.3GB). Peak memory consumption was 1.3GB. Max. memory is 16.0GB. [2023-08-27 03:47:12,049 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.15ms. Allocated memory is still 337.6MB. Free memory is still 314.6MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 609.27ms. Allocated memory is still 337.6MB. Free memory was 294.7MB in the beginning and 313.4MB in the end (delta: -18.6MB). Peak memory consumption was 31.7MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 65.74ms. Allocated memory is still 337.6MB. Free memory was 313.4MB in the beginning and 311.1MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 50.44ms. Allocated memory is still 337.6MB. Free memory was 311.1MB in the beginning and 309.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 764.11ms. Allocated memory is still 337.6MB. Free memory was 309.0MB in the beginning and 266.3MB in the end (delta: 42.7MB). Peak memory consumption was 44.0MB. Max. memory is 16.0GB. * TraceAbstraction took 49192.73ms. Allocated memory was 337.6MB in the beginning and 7.0GB in the end (delta: 6.6GB). Free memory was 265.6MB in the beginning and 5.6GB in the end (delta: -5.3GB). Peak memory consumption was 1.3GB. 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.2s, 151 PlacesBefore, 51 PlacesAfterwards, 141 TransitionsBefore, 39 TransitionsAfterwards, 4666 CoEnabledTransitionPairs, 7 FixpointIterations, 44 TrivialSequentialCompositions, 60 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 17 ConcurrentYvCompositions, 2 ChoiceCompositions, 123 TotalNumberOfCompositions, 17674 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 6454, independent: 6075, independent conditional: 0, independent unconditional: 6075, dependent: 379, dependent conditional: 0, dependent unconditional: 379, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 2596, independent: 2522, independent conditional: 0, independent unconditional: 2522, dependent: 74, dependent conditional: 0, dependent unconditional: 74, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 6454, independent: 3553, independent conditional: 0, independent unconditional: 3553, dependent: 305, dependent conditional: 0, dependent unconditional: 305, unknown: 2596, unknown conditional: 0, unknown unconditional: 2596] , Statistics on independence cache: Total cache size (in pairs): 258, Positive cache size: 232, Positive conditional cache size: 0, Positive unconditional cache size: 232, Negative cache size: 26, Negative conditional cache size: 0, Negative unconditional cache size: 26, 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_p2_EAX = 0; [L716] 0 int __unbuffered_p3_EAX = 0; [L718] 0 int __unbuffered_p3_EBX = 0; [L720] 0 int a = 0; [L722] 0 int b = 0; [L723] 0 _Bool b$flush_delayed; [L724] 0 int b$mem_tmp; [L725] 0 _Bool b$r_buff0_thd0; [L726] 0 _Bool b$r_buff0_thd1; [L727] 0 _Bool b$r_buff0_thd2; [L728] 0 _Bool b$r_buff0_thd3; [L729] 0 _Bool b$r_buff0_thd4; [L730] 0 _Bool b$r_buff1_thd0; [L731] 0 _Bool b$r_buff1_thd1; [L732] 0 _Bool b$r_buff1_thd2; [L733] 0 _Bool b$r_buff1_thd3; [L734] 0 _Bool b$r_buff1_thd4; [L735] 0 _Bool b$read_delayed; [L736] 0 int *b$read_delayed_var; [L737] 0 int b$w_buff0; [L738] 0 _Bool b$w_buff0_used; [L739] 0 int b$w_buff1; [L740] 0 _Bool b$w_buff1_used; [L741] 0 _Bool main$tmp_guard0; [L742] 0 _Bool main$tmp_guard1; [L744] 0 int x = 0; [L746] 0 int y = 0; [L748] 0 int z = 0; [L749] 0 _Bool weak$$choice0; [L750] 0 _Bool weak$$choice2; [L871] 0 pthread_t t1025; [L872] FCALL, FORK 0 pthread_create(&t1025, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1025, ((void *)0), P0, ((void *)0))=-3, t1025={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L754] 1 b$w_buff1 = b$w_buff0 [L755] 1 b$w_buff0 = 1 [L756] 1 b$w_buff1_used = b$w_buff0_used [L757] 1 b$w_buff0_used = (_Bool)1 [L758] CALL 1 __VERIFIER_assert(!(b$w_buff1_used && b$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L758] RET 1 __VERIFIER_assert(!(b$w_buff1_used && b$w_buff0_used)) [L759] 1 b$r_buff1_thd0 = b$r_buff0_thd0 [L760] 1 b$r_buff1_thd1 = b$r_buff0_thd1 [L761] 1 b$r_buff1_thd2 = b$r_buff0_thd2 [L762] 1 b$r_buff1_thd3 = b$r_buff0_thd3 [L763] 1 b$r_buff1_thd4 = b$r_buff0_thd4 [L764] 1 b$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L767] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L873] 0 pthread_t t1026; [L874] FCALL, FORK 0 pthread_create(&t1026, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1026, ((void *)0), P1, ((void *)0))=-2, t1025={5:0}, t1026={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L784] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L787] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L875] 0 pthread_t t1027; [L876] FCALL, FORK 0 pthread_create(&t1027, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_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$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1027, ((void *)0), P2, ((void *)0))=-1, t1025={5:0}, t1026={6:0}, t1027={7:0}, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L877] 0 pthread_t t1028; [L804] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_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}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=0] [L807] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_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}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=0] [L810] 3 b = b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd3 ? b$w_buff1 : b) [L811] 3 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$w_buff0_used [L812] 3 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$w_buff1_used [L813] 3 b$r_buff0_thd3 = b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$r_buff0_thd3 [L814] 3 b$r_buff1_thd3 = b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_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}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=0] [L878] FCALL, FORK 0 pthread_create(&t1028, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_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$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1028, ((void *)0), P3, ((void *)0))=0, t1025={5:0}, t1026={6:0}, t1027={7:0}, t1028={3:0}, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=0] [L824] 4 z = 1 [L827] 4 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __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$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=1] [L830] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_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$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=1] [L833] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L834] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L835] 4 b$flush_delayed = weak$$choice2 [L836] 4 b$mem_tmp = b [L837] 4 b = !b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : b$w_buff1) [L838] 4 b$w_buff0 = weak$$choice2 ? b$w_buff0 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff0 : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : b$w_buff0)) [L839] 4 b$w_buff1 = weak$$choice2 ? b$w_buff1 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff1 : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff1 : b$w_buff1)) [L840] 4 b$w_buff0_used = weak$$choice2 ? b$w_buff0_used : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff0_used : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$w_buff0_used)) [L841] 4 b$w_buff1_used = weak$$choice2 ? b$w_buff1_used : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff1_used : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L842] 4 b$r_buff0_thd4 = weak$$choice2 ? b$r_buff0_thd4 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$r_buff0_thd4 : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$r_buff0_thd4)) [L843] 4 b$r_buff1_thd4 = weak$$choice2 ? b$r_buff1_thd4 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$r_buff1_thd4 : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L844] 4 __unbuffered_p3_EBX = b [L845] 4 b = b$flush_delayed ? b$mem_tmp : b [L846] 4 b$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_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$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y=2, z=1] [L770] 1 b = b$w_buff0_used && b$r_buff0_thd1 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd1 ? b$w_buff1 : b) [L771] 1 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$w_buff0_used [L772] 1 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$w_buff1_used [L773] 1 b$r_buff0_thd1 = b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$r_buff0_thd1 [L774] 1 b$r_buff1_thd1 = b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p0_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$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y=2, z=1] [L790] 2 b = b$w_buff0_used && b$r_buff0_thd2 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd2 ? b$w_buff1 : b) [L791] 2 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$w_buff0_used [L792] 2 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$w_buff1_used [L793] 2 b$r_buff0_thd2 = b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$r_buff0_thd2 [L794] 2 b$r_buff1_thd2 = b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_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$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y=2, z=1] [L849] 4 b = b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd4 ? b$w_buff1 : b) [L850] 4 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$w_buff0_used [L851] 4 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd4 || b$w_buff1_used && b$r_buff1_thd4 ? (_Bool)0 : b$w_buff1_used [L852] 4 b$r_buff0_thd4 = b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$r_buff0_thd4 [L853] 4 b$r_buff1_thd4 = b$w_buff0_used && b$r_buff0_thd4 || b$w_buff1_used && b$r_buff1_thd4 ? (_Bool)0 : b$r_buff1_thd4 VAL [__unbuffered_cnt=0, __unbuffered_p0_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$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y=2, z=1] [L777] EXPR 1 __unbuffered_cnt + 1 [L777] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L779] 1 return 0; [L797] EXPR 2 __unbuffered_cnt + 1 [L797] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L799] 2 return 0; [L817] EXPR 3 __unbuffered_cnt + 1 [L817] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L819] 3 return 0; [L856] EXPR 4 __unbuffered_cnt + 1 [L856] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L858] 4 return 0; [L880] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_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$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t1025={5:0}, t1026={6:0}, t1027={7:0}, t1028={3:0}, weak$$choice2=0, x=1, y=2, z=1] [L882] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L882] RET 0 assume_abort_if_not(main$tmp_guard0) [L884] 0 b = b$w_buff0_used && b$r_buff0_thd0 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd0 ? b$w_buff1 : b) [L885] 0 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$w_buff0_used [L886] 0 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd0 || b$w_buff1_used && b$r_buff1_thd0 ? (_Bool)0 : b$w_buff1_used [L887] 0 b$r_buff0_thd0 = b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$r_buff0_thd0 [L888] 0 b$r_buff1_thd0 = b$w_buff0_used && b$r_buff0_thd0 || b$w_buff1_used && b$r_buff1_thd0 ? (_Bool)0 : b$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_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$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t1025={5:0}, t1026={6:0}, t1027={7:0}, t1028={3:0}, weak$$choice2=0, x=1, y=2, z=1] [L891] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L893] 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", "mix039.oepc.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\read(__PRETTY_FUNCTION__)={49:50}, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_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$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=1, y=2, z=1] - UnprovableResult [Line: 17]: Unable to prove that assertion always holds Unable to prove that assertion always holds Reason: Not analyzed. - UnprovableResult [Line: 777]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 777]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 797]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 797]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 817]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 817]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 856]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 856]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 874]: 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: 878]: 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: 872]: 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: 876]: 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, 190 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: 49.0s, OverallIterations: 16, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 40.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 783 SdHoareTripleChecker+Valid, 1.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 783 mSDsluCounter, 38 SdHoareTripleChecker+Invalid, 1.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 13 mSDsCounter, 93 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1528 IncrementalHoareTripleChecker+Invalid, 1621 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 93 mSolverCounterUnsat, 25 mSDtfsCounter, 1528 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 56 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=871occurred in iteration=14, InterpolantAutomatonStates: 66, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.9s InterpolantComputationTime, 249 NumberOfCodeBlocks, 249 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 206 ConstructedInterpolants, 0 QuantifiedInterpolants, 1278 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-08-27 03:47:12,070 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...