/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/mix055_tso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-27 03:49:42,179 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-27 03:49:42,269 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf [2023-08-27 03:49:42,274 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-27 03:49:42,275 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-27 03:49:42,312 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-27 03:49:42,313 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-27 03:49:42,318 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-27 03:49:42,318 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-27 03:49:42,319 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-27 03:49:42,319 INFO L153 SettingsManager]: * Use SBE=true [2023-08-27 03:49:42,319 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-27 03:49:42,320 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-27 03:49:42,320 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-27 03:49:42,320 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-27 03:49:42,321 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-27 03:49:42,321 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-27 03:49:42,321 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-27 03:49:42,322 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-27 03:49:42,322 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-27 03:49:42,322 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-27 03:49:42,326 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-27 03:49:42,326 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-27 03:49:42,327 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-27 03:49:42,328 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-27 03:49:42,328 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-27 03:49:42,328 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-27 03:49:42,329 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-27 03:49:42,329 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-27 03:49:42,329 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-27 03:49:42,329 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-27 03:49:42,330 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-27 03:49:42,330 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-27 03:49:42,330 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-27 03:49:42,330 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-27 03:49:42,331 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Order of the error locations to be checked -> INSUFFICIENT_FIRST Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check absence of signed integer overflows -> true [2023-08-27 03:49:42,646 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-27 03:49:42,670 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-27 03:49:42,672 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-27 03:49:42,673 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-27 03:49:42,673 INFO L274 PluginConnector]: CDTParser initialized [2023-08-27 03:49:42,674 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix055_tso.oepc.i [2023-08-27 03:49:43,896 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-27 03:49:44,163 INFO L384 CDTParser]: Found 1 translation units. [2023-08-27 03:49:44,164 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix055_tso.oepc.i [2023-08-27 03:49:44,180 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/84bf8d408/d61dce893a1f446f8c41ec6b31e2f5dd/FLAG6520d3422 [2023-08-27 03:49:44,197 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/84bf8d408/d61dce893a1f446f8c41ec6b31e2f5dd [2023-08-27 03:49:44,199 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-27 03:49:44,200 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-27 03:49:44,204 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-27 03:49:44,204 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-27 03:49:44,207 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-27 03:49:44,208 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 03:49:44" (1/1) ... [2023-08-27 03:49:44,209 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@d405e93 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:49:44, skipping insertion in model container [2023-08-27 03:49:44,209 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 03:49:44" (1/1) ... [2023-08-27 03:49:44,268 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-27 03:49:44,623 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-27 03:49:44,635 INFO L201 MainTranslator]: Completed pre-run [2023-08-27 03:49:44,651 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-27 03:49:44,653 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-27 03:49:44,684 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-27 03:49:44,712 WARN L669 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-27 03:49:44,712 WARN L669 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-27 03:49:44,718 INFO L206 MainTranslator]: Completed translation [2023-08-27 03:49:44,718 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:49:44 WrapperNode [2023-08-27 03:49:44,719 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-27 03:49:44,720 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-27 03:49:44,720 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-27 03:49:44,720 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-27 03:49:44,725 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:49:44" (1/1) ... [2023-08-27 03:49:44,737 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:49:44" (1/1) ... [2023-08-27 03:49:44,761 INFO L138 Inliner]: procedures = 177, calls = 68, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 168 [2023-08-27 03:49:44,762 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-27 03:49:44,762 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-27 03:49:44,762 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-27 03:49:44,762 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-27 03:49:44,771 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:49:44" (1/1) ... [2023-08-27 03:49:44,771 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:49:44" (1/1) ... [2023-08-27 03:49:44,774 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:49:44" (1/1) ... [2023-08-27 03:49:44,774 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:49:44" (1/1) ... [2023-08-27 03:49:44,787 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:49:44" (1/1) ... [2023-08-27 03:49:44,788 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:49:44" (1/1) ... [2023-08-27 03:49:44,793 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:49:44" (1/1) ... [2023-08-27 03:49:44,795 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:49:44" (1/1) ... [2023-08-27 03:49:44,798 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-27 03:49:44,799 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-27 03:49:44,799 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-27 03:49:44,799 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-27 03:49:44,800 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:49:44" (1/1) ... [2023-08-27 03:49:44,804 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-27 03:49:44,828 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 03:49:44,850 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-27 03:49:44,880 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-27 03:49:44,895 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-27 03:49:44,895 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-27 03:49:44,896 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-27 03:49:44,896 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-27 03:49:44,896 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-27 03:49:44,896 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-27 03:49:44,896 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-27 03:49:44,896 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-27 03:49:44,896 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-27 03:49:44,896 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-27 03:49:44,897 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-27 03:49:44,897 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-08-27 03:49:44,897 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-08-27 03:49:44,897 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-27 03:49:44,897 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-27 03:49:44,899 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-27 03:49:44,899 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-27 03:49:44,900 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-27 03:49:45,045 INFO L236 CfgBuilder]: Building ICFG [2023-08-27 03:49:45,047 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-27 03:49:45,446 INFO L277 CfgBuilder]: Performing block encoding [2023-08-27 03:49:45,546 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-27 03:49:45,547 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-27 03:49:45,549 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 03:49:45 BoogieIcfgContainer [2023-08-27 03:49:45,549 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-27 03:49:45,551 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-27 03:49:45,551 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-27 03:49:45,553 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-27 03:49:45,554 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.08 03:49:44" (1/3) ... [2023-08-27 03:49:45,554 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51684932 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.08 03:49:45, skipping insertion in model container [2023-08-27 03:49:45,554 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:49:44" (2/3) ... [2023-08-27 03:49:45,555 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51684932 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.08 03:49:45, skipping insertion in model container [2023-08-27 03:49:45,555 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 03:49:45" (3/3) ... [2023-08-27 03:49:45,556 INFO L112 eAbstractionObserver]: Analyzing ICFG mix055_tso.oepc.i [2023-08-27 03:49:45,567 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-27 03:49:45,568 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 10 error locations. [2023-08-27 03:49:45,568 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-27 03:49:45,627 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-27 03:49:45,690 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 150 places, 140 transitions, 300 flow [2023-08-27 03:49:45,738 INFO L124 PetriNetUnfolderBase]: 3/136 cut-off events. [2023-08-27 03:49:45,738 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-27 03:49:45,742 INFO L83 FinitePrefix]: Finished finitePrefix Result has 149 conditions, 136 events. 3/136 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 107 event pairs, 0 based on Foata normal form. 0/123 useless extension candidates. Maximal degree in co-relation 99. Up to 2 conditions per place. [2023-08-27 03:49:45,742 INFO L82 GeneralOperation]: Start removeDead. Operand has 150 places, 140 transitions, 300 flow [2023-08-27 03:49:45,746 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 146 places, 136 transitions, 284 flow [2023-08-27 03:49:45,751 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-27 03:49:45,758 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 146 places, 136 transitions, 284 flow [2023-08-27 03:49:45,760 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 146 places, 136 transitions, 284 flow [2023-08-27 03:49:45,761 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 146 places, 136 transitions, 284 flow [2023-08-27 03:49:45,788 INFO L124 PetriNetUnfolderBase]: 3/136 cut-off events. [2023-08-27 03:49:45,788 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-27 03:49:45,789 INFO L83 FinitePrefix]: Finished finitePrefix Result has 149 conditions, 136 events. 3/136 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 107 event pairs, 0 based on Foata normal form. 0/123 useless extension candidates. Maximal degree in co-relation 99. Up to 2 conditions per place. [2023-08-27 03:49:45,792 INFO L119 LiptonReduction]: Number of co-enabled transitions 4400 [2023-08-27 03:49:49,577 INFO L134 LiptonReduction]: Checked pairs total: 15543 [2023-08-27 03:49:49,577 INFO L136 LiptonReduction]: Total number of compositions: 115 [2023-08-27 03:49:49,591 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-27 03:49:49,598 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;@994abde, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-27 03:49:49,598 INFO L358 AbstractCegarLoop]: Starting to check reachability of 23 error locations. [2023-08-27 03:49:49,602 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-27 03:49:49,603 INFO L124 PetriNetUnfolderBase]: 0/6 cut-off events. [2023-08-27 03:49:49,603 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-27 03:49:49,603 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:49:49,603 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-27 03:49:49,604 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-27 03:49:49,608 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:49:49,608 INFO L85 PathProgramCache]: Analyzing trace with hash 591026526, now seen corresponding path program 1 times [2023-08-27 03:49:49,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:49:49,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505835466] [2023-08-27 03:49:49,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:49:49,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:49:49,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:49:49,992 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 03:49:49,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:49:49,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505835466] [2023-08-27 03:49:49,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [505835466] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:49:49,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:49:49,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-27 03:49:49,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341536821] [2023-08-27 03:49:49,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:49:50,002 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-27 03:49:50,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:49:50,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-27 03:49:50,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-27 03:49:50,035 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 255 [2023-08-27 03:49:50,038 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 40 transitions, 92 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:49:50,039 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:49:50,039 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 255 [2023-08-27 03:49:50,040 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:49:52,185 INFO L124 PetriNetUnfolderBase]: 14064/20154 cut-off events. [2023-08-27 03:49:52,185 INFO L125 PetriNetUnfolderBase]: For 136/136 co-relation queries the response was YES. [2023-08-27 03:49:52,223 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39222 conditions, 20154 events. 14064/20154 cut-off events. For 136/136 co-relation queries the response was YES. Maximal size of possible extension queue 931. Compared 124305 event pairs, 5627 based on Foata normal form. 625/15811 useless extension candidates. Maximal degree in co-relation 39210. Up to 15733 conditions per place. [2023-08-27 03:49:52,344 INFO L140 encePairwiseOnDemand]: 251/255 looper letters, 50 selfloop transitions, 2 changer transitions 0/60 dead transitions. [2023-08-27 03:49:52,344 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 60 transitions, 242 flow [2023-08-27 03:49:52,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-27 03:49:52,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-27 03:49:52,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 400 transitions. [2023-08-27 03:49:52,363 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5228758169934641 [2023-08-27 03:49:52,364 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 400 transitions. [2023-08-27 03:49:52,364 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 400 transitions. [2023-08-27 03:49:52,366 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:49:52,368 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 400 transitions. [2023-08-27 03:49:52,371 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 133.33333333333334) internal successors, (400), 3 states have internal predecessors, (400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:49:52,375 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 255.0) internal successors, (1020), 4 states have internal predecessors, (1020), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:49:52,376 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 255.0) internal successors, (1020), 4 states have internal predecessors, (1020), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:49:52,377 INFO L175 Difference]: Start difference. First operand has 52 places, 40 transitions, 92 flow. Second operand 3 states and 400 transitions. [2023-08-27 03:49:52,378 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 60 transitions, 242 flow [2023-08-27 03:49:52,383 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 60 transitions, 236 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-27 03:49:52,384 INFO L231 Difference]: Finished difference. Result has 49 places, 38 transitions, 88 flow [2023-08-27 03:49:52,386 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=255, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=88, PETRI_PLACES=49, PETRI_TRANSITIONS=38} [2023-08-27 03:49:52,389 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, -3 predicate places. [2023-08-27 03:49:52,389 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 38 transitions, 88 flow [2023-08-27 03:49:52,390 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:49:52,390 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:49:52,390 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-08-27 03:49:52,390 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-27 03:49:52,391 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-27 03:49:52,397 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:49:52,398 INFO L85 PathProgramCache]: Analyzing trace with hash 1140273114, now seen corresponding path program 1 times [2023-08-27 03:49:52,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:49:52,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26373784] [2023-08-27 03:49:52,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:49:52,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:49:52,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:49:52,449 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 03:49:52,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:49:52,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26373784] [2023-08-27 03:49:52,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [26373784] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:49:52,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:49:52,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-27 03:49:52,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084643427] [2023-08-27 03:49:52,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:49:52,451 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-27 03:49:52,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:49:52,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-27 03:49:52,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-27 03:49:52,453 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 255 [2023-08-27 03:49:52,453 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 38 transitions, 88 flow. Second operand has 3 states, 3 states have (on average 111.66666666666667) internal successors, (335), 3 states have internal predecessors, (335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:49:52,453 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:49:52,453 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 255 [2023-08-27 03:49:52,454 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:49:54,150 INFO L124 PetriNetUnfolderBase]: 14064/18845 cut-off events. [2023-08-27 03:49:54,151 INFO L125 PetriNetUnfolderBase]: For 932/932 co-relation queries the response was YES. [2023-08-27 03:49:54,181 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38846 conditions, 18845 events. 14064/18845 cut-off events. For 932/932 co-relation queries the response was YES. Maximal size of possible extension queue 806. Compared 100975 event pairs, 14064 based on Foata normal form. 0/13694 useless extension candidates. Maximal degree in co-relation 38836. Up to 18750 conditions per place. [2023-08-27 03:49:54,262 INFO L140 encePairwiseOnDemand]: 250/255 looper letters, 29 selfloop transitions, 1 changer transitions 0/34 dead transitions. [2023-08-27 03:49:54,262 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 34 transitions, 140 flow [2023-08-27 03:49:54,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-27 03:49:54,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-27 03:49:54,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 364 transitions. [2023-08-27 03:49:54,264 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47581699346405226 [2023-08-27 03:49:54,264 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 364 transitions. [2023-08-27 03:49:54,264 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 364 transitions. [2023-08-27 03:49:54,264 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:49:54,264 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 364 transitions. [2023-08-27 03:49:54,265 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 121.33333333333333) internal successors, (364), 3 states have internal predecessors, (364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:49:54,267 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 255.0) internal successors, (1020), 4 states have internal predecessors, (1020), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:49:54,268 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 255.0) internal successors, (1020), 4 states have internal predecessors, (1020), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:49:54,268 INFO L175 Difference]: Start difference. First operand has 49 places, 38 transitions, 88 flow. Second operand 3 states and 364 transitions. [2023-08-27 03:49:54,268 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 34 transitions, 140 flow [2023-08-27 03:49:54,269 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 34 transitions, 136 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-27 03:49:54,270 INFO L231 Difference]: Finished difference. Result has 45 places, 34 transitions, 78 flow [2023-08-27 03:49:54,270 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=255, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=78, PETRI_PLACES=45, PETRI_TRANSITIONS=34} [2023-08-27 03:49:54,271 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, -7 predicate places. [2023-08-27 03:49:54,271 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 34 transitions, 78 flow [2023-08-27 03:49:54,271 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 111.66666666666667) internal successors, (335), 3 states have internal predecessors, (335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:49:54,272 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:49:54,272 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-08-27 03:49:54,272 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-27 03:49:54,272 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-27 03:49:54,272 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:49:54,273 INFO L85 PathProgramCache]: Analyzing trace with hash 1140273115, now seen corresponding path program 1 times [2023-08-27 03:49:54,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:49:54,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005296186] [2023-08-27 03:49:54,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:49:54,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:49:54,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:49:54,315 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 03:49:54,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:49:54,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005296186] [2023-08-27 03:49:54,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2005296186] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:49:54,316 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:49:54,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-27 03:49:54,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685980200] [2023-08-27 03:49:54,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:49:54,317 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-27 03:49:54,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:49:54,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-27 03:49:54,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-27 03:49:54,318 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 255 [2023-08-27 03:49:54,319 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 34 transitions, 78 flow. Second operand has 3 states, 3 states have (on average 111.66666666666667) internal successors, (335), 3 states have internal predecessors, (335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:49:54,319 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:49:54,319 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 255 [2023-08-27 03:49:54,319 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:49:55,132 INFO L124 PetriNetUnfolderBase]: 7467/10477 cut-off events. [2023-08-27 03:49:55,132 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-27 03:49:55,147 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21136 conditions, 10477 events. 7467/10477 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 494. Compared 57361 event pairs, 2605 based on Foata normal form. 0/7925 useless extension candidates. Maximal degree in co-relation 21130. Up to 9705 conditions per place. [2023-08-27 03:49:55,188 INFO L140 encePairwiseOnDemand]: 245/255 looper letters, 44 selfloop transitions, 5 changer transitions 0/53 dead transitions. [2023-08-27 03:49:55,188 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 53 transitions, 220 flow [2023-08-27 03:49:55,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-27 03:49:55,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-27 03:49:55,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 384 transitions. [2023-08-27 03:49:55,190 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5019607843137255 [2023-08-27 03:49:55,190 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 384 transitions. [2023-08-27 03:49:55,190 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 384 transitions. [2023-08-27 03:49:55,191 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:49:55,191 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 384 transitions. [2023-08-27 03:49:55,192 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 128.0) internal successors, (384), 3 states have internal predecessors, (384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:49:55,193 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 255.0) internal successors, (1020), 4 states have internal predecessors, (1020), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:49:55,194 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 255.0) internal successors, (1020), 4 states have internal predecessors, (1020), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:49:55,194 INFO L175 Difference]: Start difference. First operand has 45 places, 34 transitions, 78 flow. Second operand 3 states and 384 transitions. [2023-08-27 03:49:55,194 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 53 transitions, 220 flow [2023-08-27 03:49:55,194 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 53 transitions, 219 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-27 03:49:55,195 INFO L231 Difference]: Finished difference. Result has 47 places, 38 transitions, 118 flow [2023-08-27 03:49:55,195 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=255, PETRI_DIFFERENCE_MINUEND_FLOW=77, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=118, PETRI_PLACES=47, PETRI_TRANSITIONS=38} [2023-08-27 03:49:55,196 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, -5 predicate places. [2023-08-27 03:49:55,196 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 38 transitions, 118 flow [2023-08-27 03:49:55,197 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 111.66666666666667) internal successors, (335), 3 states have internal predecessors, (335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:49:55,197 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:49:55,197 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:49:55,197 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-27 03:49:55,197 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting P1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-27 03:49:55,197 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:49:55,198 INFO L85 PathProgramCache]: Analyzing trace with hash -1077541099, now seen corresponding path program 1 times [2023-08-27 03:49:55,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:49:55,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048083896] [2023-08-27 03:49:55,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:49:55,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:49:55,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:49:55,286 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 03:49:55,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:49:55,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048083896] [2023-08-27 03:49:55,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2048083896] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:49:55,287 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:49:55,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-27 03:49:55,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929511585] [2023-08-27 03:49:55,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:49:55,288 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-27 03:49:55,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:49:55,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-27 03:49:55,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-27 03:49:55,289 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 255 [2023-08-27 03:49:55,290 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 38 transitions, 118 flow. Second operand has 4 states, 4 states have (on average 112.5) internal successors, (450), 4 states have internal predecessors, (450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:49:55,290 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:49:55,290 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 255 [2023-08-27 03:49:55,290 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:49:55,777 INFO L124 PetriNetUnfolderBase]: 2799/4187 cut-off events. [2023-08-27 03:49:55,777 INFO L125 PetriNetUnfolderBase]: For 433/433 co-relation queries the response was YES. [2023-08-27 03:49:55,785 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10189 conditions, 4187 events. 2799/4187 cut-off events. For 433/433 co-relation queries the response was YES. Maximal size of possible extension queue 165. Compared 21741 event pairs, 860 based on Foata normal form. 108/3764 useless extension candidates. Maximal degree in co-relation 10181. Up to 2443 conditions per place. [2023-08-27 03:49:55,800 INFO L140 encePairwiseOnDemand]: 245/255 looper letters, 57 selfloop transitions, 9 changer transitions 0/70 dead transitions. [2023-08-27 03:49:55,800 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 70 transitions, 332 flow [2023-08-27 03:49:55,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-27 03:49:55,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-27 03:49:55,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 511 transitions. [2023-08-27 03:49:55,803 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5009803921568627 [2023-08-27 03:49:55,803 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 511 transitions. [2023-08-27 03:49:55,803 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 511 transitions. [2023-08-27 03:49:55,803 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:49:55,803 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 511 transitions. [2023-08-27 03:49:55,805 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 127.75) internal successors, (511), 4 states have internal predecessors, (511), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:49:55,807 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 255.0) internal successors, (1275), 5 states have internal predecessors, (1275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:49:55,807 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 255.0) internal successors, (1275), 5 states have internal predecessors, (1275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:49:55,808 INFO L175 Difference]: Start difference. First operand has 47 places, 38 transitions, 118 flow. Second operand 4 states and 511 transitions. [2023-08-27 03:49:55,808 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 70 transitions, 332 flow [2023-08-27 03:49:55,813 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 70 transitions, 327 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-27 03:49:55,814 INFO L231 Difference]: Finished difference. Result has 50 places, 42 transitions, 173 flow [2023-08-27 03:49:55,814 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=255, PETRI_DIFFERENCE_MINUEND_FLOW=113, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=173, PETRI_PLACES=50, PETRI_TRANSITIONS=42} [2023-08-27 03:49:55,815 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, -2 predicate places. [2023-08-27 03:49:55,815 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 42 transitions, 173 flow [2023-08-27 03:49:55,815 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 112.5) internal successors, (450), 4 states have internal predecessors, (450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:49:55,816 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:49:55,816 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:49:55,816 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-27 03:49:55,816 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting P2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-27 03:49:55,816 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:49:55,817 INFO L85 PathProgramCache]: Analyzing trace with hash 1738441391, now seen corresponding path program 1 times [2023-08-27 03:49:55,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:49:55,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431797339] [2023-08-27 03:49:55,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:49:55,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:49:55,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:49:55,908 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 03:49:55,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:49:55,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [431797339] [2023-08-27 03:49:55,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [431797339] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:49:55,909 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:49:55,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-27 03:49:55,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62451118] [2023-08-27 03:49:55,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:49:55,910 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-27 03:49:55,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:49:55,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-27 03:49:55,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-27 03:49:55,911 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 255 [2023-08-27 03:49:55,912 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 42 transitions, 173 flow. Second operand has 5 states, 5 states have (on average 113.0) internal successors, (565), 5 states have internal predecessors, (565), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:49:55,912 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:49:55,912 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 255 [2023-08-27 03:49:55,913 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:49:56,260 INFO L124 PetriNetUnfolderBase]: 1707/2525 cut-off events. [2023-08-27 03:49:56,260 INFO L125 PetriNetUnfolderBase]: For 1620/1620 co-relation queries the response was YES. [2023-08-27 03:49:56,265 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6822 conditions, 2525 events. 1707/2525 cut-off events. For 1620/1620 co-relation queries the response was YES. Maximal size of possible extension queue 131. Compared 11983 event pairs, 513 based on Foata normal form. 54/2486 useless extension candidates. Maximal degree in co-relation 6812. Up to 972 conditions per place. [2023-08-27 03:49:56,274 INFO L140 encePairwiseOnDemand]: 245/255 looper letters, 68 selfloop transitions, 13 changer transitions 0/85 dead transitions. [2023-08-27 03:49:56,274 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 85 transitions, 449 flow [2023-08-27 03:49:56,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-27 03:49:56,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-27 03:49:56,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 636 transitions. [2023-08-27 03:49:56,277 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4988235294117647 [2023-08-27 03:49:56,277 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 636 transitions. [2023-08-27 03:49:56,277 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 636 transitions. [2023-08-27 03:49:56,277 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:49:56,277 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 636 transitions. [2023-08-27 03:49:56,279 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 127.2) internal successors, (636), 5 states have internal predecessors, (636), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:49:56,281 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 255.0) internal successors, (1530), 6 states have internal predecessors, (1530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:49:56,282 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 255.0) internal successors, (1530), 6 states have internal predecessors, (1530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:49:56,282 INFO L175 Difference]: Start difference. First operand has 50 places, 42 transitions, 173 flow. Second operand 5 states and 636 transitions. [2023-08-27 03:49:56,282 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 85 transitions, 449 flow [2023-08-27 03:49:56,286 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 85 transitions, 431 flow, removed 4 selfloop flow, removed 2 redundant places. [2023-08-27 03:49:56,287 INFO L231 Difference]: Finished difference. Result has 53 places, 46 transitions, 231 flow [2023-08-27 03:49:56,287 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=255, PETRI_DIFFERENCE_MINUEND_FLOW=155, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=231, PETRI_PLACES=53, PETRI_TRANSITIONS=46} [2023-08-27 03:49:56,288 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 1 predicate places. [2023-08-27 03:49:56,288 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 46 transitions, 231 flow [2023-08-27 03:49:56,289 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 113.0) internal successors, (565), 5 states have internal predecessors, (565), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:49:56,289 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:49:56,289 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:49:56,289 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-27 03:49:56,289 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting P3Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-27 03:49:56,289 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:49:56,290 INFO L85 PathProgramCache]: Analyzing trace with hash -1488718443, now seen corresponding path program 1 times [2023-08-27 03:49:56,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:49:56,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958313074] [2023-08-27 03:49:56,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:49:56,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:49:56,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:49:56,419 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 03:49:56,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:49:56,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958313074] [2023-08-27 03:49:56,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1958313074] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:49:56,420 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:49:56,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-27 03:49:56,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524139763] [2023-08-27 03:49:56,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:49:56,421 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-27 03:49:56,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:49:56,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-27 03:49:56,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-08-27 03:49:56,424 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 255 [2023-08-27 03:49:56,425 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 46 transitions, 231 flow. Second operand has 6 states, 6 states have (on average 113.33333333333333) internal successors, (680), 6 states have internal predecessors, (680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:49:56,425 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:49:56,425 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 255 [2023-08-27 03:49:56,425 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:49:56,804 INFO L124 PetriNetUnfolderBase]: 1623/2353 cut-off events. [2023-08-27 03:49:56,804 INFO L125 PetriNetUnfolderBase]: For 1906/1906 co-relation queries the response was YES. [2023-08-27 03:49:56,811 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6544 conditions, 2353 events. 1623/2353 cut-off events. For 1906/1906 co-relation queries the response was YES. Maximal size of possible extension queue 131. Compared 11093 event pairs, 488 based on Foata normal form. 12/2316 useless extension candidates. Maximal degree in co-relation 6533. Up to 972 conditions per place. [2023-08-27 03:49:56,817 INFO L140 encePairwiseOnDemand]: 245/255 looper letters, 55 selfloop transitions, 17 changer transitions 6/82 dead transitions. [2023-08-27 03:49:56,817 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 82 transitions, 447 flow [2023-08-27 03:49:56,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-27 03:49:56,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-27 03:49:56,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 743 transitions. [2023-08-27 03:49:56,820 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48562091503267973 [2023-08-27 03:49:56,820 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 743 transitions. [2023-08-27 03:49:56,820 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 743 transitions. [2023-08-27 03:49:56,821 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:49:56,821 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 743 transitions. [2023-08-27 03:49:56,822 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 123.83333333333333) internal successors, (743), 6 states have internal predecessors, (743), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:49:56,825 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 255.0) internal successors, (1785), 7 states have internal predecessors, (1785), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:49:56,825 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 255.0) internal successors, (1785), 7 states have internal predecessors, (1785), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:49:56,825 INFO L175 Difference]: Start difference. First operand has 53 places, 46 transitions, 231 flow. Second operand 6 states and 743 transitions. [2023-08-27 03:49:56,826 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 82 transitions, 447 flow [2023-08-27 03:49:56,851 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 82 transitions, 413 flow, removed 8 selfloop flow, removed 3 redundant places. [2023-08-27 03:49:56,853 INFO L231 Difference]: Finished difference. Result has 52 places, 40 transitions, 205 flow [2023-08-27 03:49:56,853 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=255, PETRI_DIFFERENCE_MINUEND_FLOW=165, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=205, PETRI_PLACES=52, PETRI_TRANSITIONS=40} [2023-08-27 03:49:56,854 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 0 predicate places. [2023-08-27 03:49:56,854 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 40 transitions, 205 flow [2023-08-27 03:49:56,854 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 113.33333333333333) internal successors, (680), 6 states have internal predecessors, (680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:49:56,854 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:49:56,855 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:49:56,855 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-27 03:49:56,855 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-27 03:49:56,855 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:49:56,855 INFO L85 PathProgramCache]: Analyzing trace with hash -664216609, now seen corresponding path program 1 times [2023-08-27 03:49:56,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:49:56,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73570370] [2023-08-27 03:49:56,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:49:56,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:49:56,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:49:57,608 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 03:49:57,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:49:57,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73570370] [2023-08-27 03:49:57,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [73570370] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:49:57,610 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:49:57,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-27 03:49:57,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990120075] [2023-08-27 03:49:57,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:49:57,611 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-27 03:49:57,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:49:57,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-27 03:49:57,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-08-27 03:49:57,612 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 255 [2023-08-27 03:49:57,613 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 40 transitions, 205 flow. Second operand has 8 states, 8 states have (on average 111.125) internal successors, (889), 8 states have internal predecessors, (889), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:49:57,613 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:49:57,614 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 255 [2023-08-27 03:49:57,614 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:49:58,217 INFO L124 PetriNetUnfolderBase]: 1965/3143 cut-off events. [2023-08-27 03:49:58,218 INFO L125 PetriNetUnfolderBase]: For 3788/3788 co-relation queries the response was YES. [2023-08-27 03:49:58,225 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9310 conditions, 3143 events. 1965/3143 cut-off events. For 3788/3788 co-relation queries the response was YES. Maximal size of possible extension queue 186. Compared 17963 event pairs, 333 based on Foata normal form. 2/3141 useless extension candidates. Maximal degree in co-relation 9298. Up to 1135 conditions per place. [2023-08-27 03:49:58,230 INFO L140 encePairwiseOnDemand]: 246/255 looper letters, 83 selfloop transitions, 6 changer transitions 82/174 dead transitions. [2023-08-27 03:49:58,230 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 174 transitions, 1318 flow [2023-08-27 03:49:58,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-08-27 03:49:58,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-08-27 03:49:58,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1187 transitions. [2023-08-27 03:49:58,234 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4654901960784314 [2023-08-27 03:49:58,234 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1187 transitions. [2023-08-27 03:49:58,234 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1187 transitions. [2023-08-27 03:49:58,235 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:49:58,235 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1187 transitions. [2023-08-27 03:49:58,237 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 118.7) internal successors, (1187), 10 states have internal predecessors, (1187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:49:58,240 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 255.0) internal successors, (2805), 11 states have internal predecessors, (2805), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:49:58,241 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 255.0) internal successors, (2805), 11 states have internal predecessors, (2805), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:49:58,241 INFO L175 Difference]: Start difference. First operand has 52 places, 40 transitions, 205 flow. Second operand 10 states and 1187 transitions. [2023-08-27 03:49:58,241 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 174 transitions, 1318 flow [2023-08-27 03:49:58,275 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 174 transitions, 1079 flow, removed 48 selfloop flow, removed 4 redundant places. [2023-08-27 03:49:58,277 INFO L231 Difference]: Finished difference. Result has 63 places, 45 transitions, 222 flow [2023-08-27 03:49:58,277 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=255, PETRI_DIFFERENCE_MINUEND_FLOW=155, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=222, PETRI_PLACES=63, PETRI_TRANSITIONS=45} [2023-08-27 03:49:58,277 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 11 predicate places. [2023-08-27 03:49:58,278 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 45 transitions, 222 flow [2023-08-27 03:49:58,278 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 111.125) internal successors, (889), 8 states have internal predecessors, (889), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:49:58,278 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:49:58,278 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:49:58,278 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-27 03:49:58,279 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-27 03:49:58,279 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:49:58,279 INFO L85 PathProgramCache]: Analyzing trace with hash -665616797, now seen corresponding path program 2 times [2023-08-27 03:49:58,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:49:58,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156743674] [2023-08-27 03:49:58,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:49:58,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:49:58,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:49:58,632 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 03:49:58,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:49:58,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156743674] [2023-08-27 03:49:58,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1156743674] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:49:58,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:49:58,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-27 03:49:58,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166886891] [2023-08-27 03:49:58,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:49:58,633 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-27 03:49:58,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:49:58,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-27 03:49:58,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-27 03:49:58,635 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 255 [2023-08-27 03:49:58,635 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 45 transitions, 222 flow. Second operand has 5 states, 5 states have (on average 115.0) internal successors, (575), 5 states have internal predecessors, (575), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:49:58,635 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:49:58,635 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 255 [2023-08-27 03:49:58,636 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:49:59,096 INFO L124 PetriNetUnfolderBase]: 2590/4142 cut-off events. [2023-08-27 03:49:59,097 INFO L125 PetriNetUnfolderBase]: For 6042/6050 co-relation queries the response was YES. [2023-08-27 03:49:59,109 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14150 conditions, 4142 events. 2590/4142 cut-off events. For 6042/6050 co-relation queries the response was YES. Maximal size of possible extension queue 241. Compared 24606 event pairs, 453 based on Foata normal form. 3/4119 useless extension candidates. Maximal degree in co-relation 14131. Up to 1904 conditions per place. [2023-08-27 03:49:59,115 INFO L140 encePairwiseOnDemand]: 251/255 looper letters, 60 selfloop transitions, 1 changer transitions 34/98 dead transitions. [2023-08-27 03:49:59,115 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 98 transitions, 696 flow [2023-08-27 03:49:59,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-27 03:49:59,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-27 03:49:59,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 603 transitions. [2023-08-27 03:49:59,117 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47294117647058825 [2023-08-27 03:49:59,117 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 603 transitions. [2023-08-27 03:49:59,117 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 603 transitions. [2023-08-27 03:49:59,118 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:49:59,118 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 603 transitions. [2023-08-27 03:49:59,119 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 120.6) internal successors, (603), 5 states have internal predecessors, (603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:49:59,121 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 255.0) internal successors, (1530), 6 states have internal predecessors, (1530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:49:59,121 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 255.0) internal successors, (1530), 6 states have internal predecessors, (1530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:49:59,121 INFO L175 Difference]: Start difference. First operand has 63 places, 45 transitions, 222 flow. Second operand 5 states and 603 transitions. [2023-08-27 03:49:59,122 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 98 transitions, 696 flow [2023-08-27 03:49:59,170 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 98 transitions, 655 flow, removed 19 selfloop flow, removed 6 redundant places. [2023-08-27 03:49:59,172 INFO L231 Difference]: Finished difference. Result has 59 places, 45 transitions, 212 flow [2023-08-27 03:49:59,172 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=255, PETRI_DIFFERENCE_MINUEND_FLOW=203, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=212, PETRI_PLACES=59, PETRI_TRANSITIONS=45} [2023-08-27 03:49:59,172 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 7 predicate places. [2023-08-27 03:49:59,173 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 45 transitions, 212 flow [2023-08-27 03:49:59,173 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 115.0) internal successors, (575), 5 states have internal predecessors, (575), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:49:59,173 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:49:59,173 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:49:59,173 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-27 03:49:59,173 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-27 03:49:59,174 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:49:59,174 INFO L85 PathProgramCache]: Analyzing trace with hash 1257560927, now seen corresponding path program 3 times [2023-08-27 03:49:59,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:49:59,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096355890] [2023-08-27 03:49:59,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:49:59,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:49:59,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:50:00,659 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 03:50:00,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:50:00,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096355890] [2023-08-27 03:50:00,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1096355890] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:50:00,659 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:50:00,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-08-27 03:50:00,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090231546] [2023-08-27 03:50:00,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:50:00,660 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-08-27 03:50:00,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:50:00,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-08-27 03:50:00,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2023-08-27 03:50:00,664 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 255 [2023-08-27 03:50:00,665 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 45 transitions, 212 flow. Second operand has 10 states, 10 states have (on average 104.6) internal successors, (1046), 10 states have internal predecessors, (1046), 0 states have call successors, (0), 0 states 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:50:00,665 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:50:00,665 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 255 [2023-08-27 03:50:00,666 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:50:01,752 INFO L124 PetriNetUnfolderBase]: 5103/8118 cut-off events. [2023-08-27 03:50:01,752 INFO L125 PetriNetUnfolderBase]: For 9053/9061 co-relation queries the response was YES. [2023-08-27 03:50:01,771 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26540 conditions, 8118 events. 5103/8118 cut-off events. For 9053/9061 co-relation queries the response was YES. Maximal size of possible extension queue 387. Compared 51135 event pairs, 687 based on Foata normal form. 2/8046 useless extension candidates. Maximal degree in co-relation 26524. Up to 2661 conditions per place. [2023-08-27 03:50:01,777 INFO L140 encePairwiseOnDemand]: 246/255 looper letters, 64 selfloop transitions, 6 changer transitions 133/205 dead transitions. [2023-08-27 03:50:01,778 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 205 transitions, 1413 flow [2023-08-27 03:50:01,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-08-27 03:50:01,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-08-27 03:50:01,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1130 transitions. [2023-08-27 03:50:01,781 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44313725490196076 [2023-08-27 03:50:01,781 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1130 transitions. [2023-08-27 03:50:01,781 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1130 transitions. [2023-08-27 03:50:01,782 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:50:01,782 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1130 transitions. [2023-08-27 03:50:01,784 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 113.0) internal successors, (1130), 10 states have internal predecessors, (1130), 0 states have call successors, (0), 0 states 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:50:01,787 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 255.0) internal successors, (2805), 11 states have internal predecessors, (2805), 0 states have call successors, (0), 0 states 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:50:01,788 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 255.0) internal successors, (2805), 11 states have internal predecessors, (2805), 0 states have call successors, (0), 0 states 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:50:01,788 INFO L175 Difference]: Start difference. First operand has 59 places, 45 transitions, 212 flow. Second operand 10 states and 1130 transitions. [2023-08-27 03:50:01,788 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 205 transitions, 1413 flow [2023-08-27 03:50:01,954 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 205 transitions, 1401 flow, removed 3 selfloop flow, removed 3 redundant places. [2023-08-27 03:50:01,956 INFO L231 Difference]: Finished difference. Result has 70 places, 42 transitions, 228 flow [2023-08-27 03:50:01,956 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=255, PETRI_DIFFERENCE_MINUEND_FLOW=207, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=228, PETRI_PLACES=70, PETRI_TRANSITIONS=42} [2023-08-27 03:50:01,957 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 18 predicate places. [2023-08-27 03:50:01,957 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 42 transitions, 228 flow [2023-08-27 03:50:01,958 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 104.6) internal successors, (1046), 10 states have internal predecessors, (1046), 0 states have call successors, (0), 0 states 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:50:01,958 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:50:01,958 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:50:01,959 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-27 03:50:01,959 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-27 03:50:01,959 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:50:01,959 INFO L85 PathProgramCache]: Analyzing trace with hash -1049773413, now seen corresponding path program 4 times [2023-08-27 03:50:01,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:50:01,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773783634] [2023-08-27 03:50:01,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:50:01,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:50:02,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:50:03,349 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:50:03,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:50:03,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [773783634] [2023-08-27 03:50:03,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [773783634] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:50:03,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:50:03,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-08-27 03:50:03,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511265631] [2023-08-27 03:50:03,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:50:03,351 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-08-27 03:50:03,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:50:03,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-08-27 03:50:03,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2023-08-27 03:50:03,352 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 255 [2023-08-27 03:50:03,353 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 42 transitions, 228 flow. Second operand has 11 states, 11 states have (on average 96.54545454545455) internal successors, (1062), 11 states have internal predecessors, (1062), 0 states have call successors, (0), 0 states 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:50:03,353 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:50:03,353 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 255 [2023-08-27 03:50:03,353 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:50:04,071 INFO L124 PetriNetUnfolderBase]: 1304/2199 cut-off events. [2023-08-27 03:50:04,071 INFO L125 PetriNetUnfolderBase]: For 3658/3658 co-relation queries the response was YES. [2023-08-27 03:50:04,079 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8134 conditions, 2199 events. 1304/2199 cut-off events. For 3658/3658 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 11502 event pairs, 109 based on Foata normal form. 1/2200 useless extension candidates. Maximal degree in co-relation 8113. Up to 1074 conditions per place. [2023-08-27 03:50:04,082 INFO L140 encePairwiseOnDemand]: 244/255 looper letters, 89 selfloop transitions, 18 changer transitions 22/129 dead transitions. [2023-08-27 03:50:04,082 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 129 transitions, 933 flow [2023-08-27 03:50:04,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-08-27 03:50:04,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-08-27 03:50:04,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1031 transitions. [2023-08-27 03:50:04,086 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40431372549019606 [2023-08-27 03:50:04,086 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1031 transitions. [2023-08-27 03:50:04,086 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1031 transitions. [2023-08-27 03:50:04,086 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:50:04,086 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1031 transitions. [2023-08-27 03:50:04,088 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 103.1) internal successors, (1031), 10 states have internal predecessors, (1031), 0 states have call successors, (0), 0 states 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:50:04,091 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 255.0) internal successors, (2805), 11 states have internal predecessors, (2805), 0 states have call successors, (0), 0 states 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:50:04,092 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 255.0) internal successors, (2805), 11 states have internal predecessors, (2805), 0 states have call successors, (0), 0 states 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:50:04,092 INFO L175 Difference]: Start difference. First operand has 70 places, 42 transitions, 228 flow. Second operand 10 states and 1031 transitions. [2023-08-27 03:50:04,092 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 129 transitions, 933 flow [2023-08-27 03:50:04,118 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 129 transitions, 885 flow, removed 19 selfloop flow, removed 8 redundant places. [2023-08-27 03:50:04,120 INFO L231 Difference]: Finished difference. Result has 69 places, 54 transitions, 332 flow [2023-08-27 03:50:04,120 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=255, PETRI_DIFFERENCE_MINUEND_FLOW=205, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=332, PETRI_PLACES=69, PETRI_TRANSITIONS=54} [2023-08-27 03:50:04,121 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 17 predicate places. [2023-08-27 03:50:04,121 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 54 transitions, 332 flow [2023-08-27 03:50:04,121 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 96.54545454545455) internal successors, (1062), 11 states have internal predecessors, (1062), 0 states have call successors, (0), 0 states 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:50:04,122 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:50:04,122 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:50:04,122 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-27 03:50:04,122 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-27 03:50:04,122 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:50:04,122 INFO L85 PathProgramCache]: Analyzing trace with hash -2040067885, now seen corresponding path program 5 times [2023-08-27 03:50:04,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:50:04,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204318767] [2023-08-27 03:50:04,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:50:04,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:50:04,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:50:05,364 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:50:05,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:50:05,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204318767] [2023-08-27 03:50:05,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [204318767] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:50:05,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:50:05,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-08-27 03:50:05,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912804887] [2023-08-27 03:50:05,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:50:05,365 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-08-27 03:50:05,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:50:05,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-08-27 03:50:05,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2023-08-27 03:50:05,367 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 255 [2023-08-27 03:50:05,368 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 54 transitions, 332 flow. Second operand has 11 states, 11 states have (on average 106.27272727272727) internal successors, (1169), 11 states have internal predecessors, (1169), 0 states have call successors, (0), 0 states 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:50:05,368 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:50:05,368 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 255 [2023-08-27 03:50:05,368 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:50:05,782 INFO L124 PetriNetUnfolderBase]: 1091/1840 cut-off events. [2023-08-27 03:50:05,783 INFO L125 PetriNetUnfolderBase]: For 4204/4214 co-relation queries the response was YES. [2023-08-27 03:50:05,789 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7497 conditions, 1840 events. 1091/1840 cut-off events. For 4204/4214 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 9319 event pairs, 194 based on Foata normal form. 10/1820 useless extension candidates. Maximal degree in co-relation 7478. Up to 816 conditions per place. [2023-08-27 03:50:05,792 INFO L140 encePairwiseOnDemand]: 249/255 looper letters, 53 selfloop transitions, 4 changer transitions 40/100 dead transitions. [2023-08-27 03:50:05,792 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 100 transitions, 763 flow [2023-08-27 03:50:05,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-27 03:50:05,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-27 03:50:05,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 785 transitions. [2023-08-27 03:50:05,794 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43977591036414565 [2023-08-27 03:50:05,794 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 785 transitions. [2023-08-27 03:50:05,795 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 785 transitions. [2023-08-27 03:50:05,795 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:50:05,795 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 785 transitions. [2023-08-27 03:50:05,797 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 112.14285714285714) internal successors, (785), 7 states have internal predecessors, (785), 0 states have call successors, (0), 0 states 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:50:05,799 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 255.0) internal successors, (2040), 8 states have internal predecessors, (2040), 0 states have call successors, (0), 0 states 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:50:05,799 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 255.0) internal successors, (2040), 8 states have internal predecessors, (2040), 0 states have call successors, (0), 0 states 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:50:05,799 INFO L175 Difference]: Start difference. First operand has 69 places, 54 transitions, 332 flow. Second operand 7 states and 785 transitions. [2023-08-27 03:50:05,799 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 100 transitions, 763 flow [2023-08-27 03:50:05,819 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 100 transitions, 756 flow, removed 2 selfloop flow, removed 3 redundant places. [2023-08-27 03:50:05,820 INFO L231 Difference]: Finished difference. Result has 72 places, 45 transitions, 269 flow [2023-08-27 03:50:05,821 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=255, PETRI_DIFFERENCE_MINUEND_FLOW=325, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=269, PETRI_PLACES=72, PETRI_TRANSITIONS=45} [2023-08-27 03:50:05,821 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 20 predicate places. [2023-08-27 03:50:05,821 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 45 transitions, 269 flow [2023-08-27 03:50:05,822 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 106.27272727272727) internal successors, (1169), 11 states have internal predecessors, (1169), 0 states have call successors, (0), 0 states 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:50:05,822 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:50:05,822 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:50:05,822 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-27 03:50:05,822 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-27 03:50:05,822 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:50:05,822 INFO L85 PathProgramCache]: Analyzing trace with hash 1564664451, now seen corresponding path program 6 times [2023-08-27 03:50:05,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:50:05,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246398904] [2023-08-27 03:50:05,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:50:05,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:50:05,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-27 03:50:05,870 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-27 03:50:05,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-27 03:50:05,949 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-27 03:50:05,950 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-27 03:50:05,950 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONASSERT (22 of 23 remaining) [2023-08-27 03:50:05,952 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 23 remaining) [2023-08-27 03:50:05,952 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 23 remaining) [2023-08-27 03:50:05,952 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONASSERT (19 of 23 remaining) [2023-08-27 03:50:05,954 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 23 remaining) [2023-08-27 03:50:05,955 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 23 remaining) [2023-08-27 03:50:05,955 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 23 remaining) [2023-08-27 03:50:05,955 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 23 remaining) [2023-08-27 03:50:05,955 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 23 remaining) [2023-08-27 03:50:05,955 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 23 remaining) [2023-08-27 03:50:05,955 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (12 of 23 remaining) [2023-08-27 03:50:05,955 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (11 of 23 remaining) [2023-08-27 03:50:05,955 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (10 of 23 remaining) [2023-08-27 03:50:05,956 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (9 of 23 remaining) [2023-08-27 03:50:05,956 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 23 remaining) [2023-08-27 03:50:05,956 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 23 remaining) [2023-08-27 03:50:05,956 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONASSERT (6 of 23 remaining) [2023-08-27 03:50:05,956 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 23 remaining) [2023-08-27 03:50:05,956 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 23 remaining) [2023-08-27 03:50:05,956 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 23 remaining) [2023-08-27 03:50:05,956 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 23 remaining) [2023-08-27 03:50:05,956 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 23 remaining) [2023-08-27 03:50:05,956 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 23 remaining) [2023-08-27 03:50:05,956 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-27 03:50:05,957 INFO L445 BasicCegarLoop]: Path program histogram: [6, 1, 1, 1, 1, 1, 1] [2023-08-27 03:50:05,962 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-27 03:50:05,962 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-27 03:50:06,044 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.08 03:50:06 BasicIcfg [2023-08-27 03:50:06,044 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-27 03:50:06,045 INFO L158 Benchmark]: Toolchain (without parser) took 21844.81ms. Allocated memory was 341.8MB in the beginning and 2.1GB in the end (delta: 1.7GB). Free memory was 316.3MB in the beginning and 1.5GB in the end (delta: -1.2GB). Peak memory consumption was 529.8MB. Max. memory is 16.0GB. [2023-08-27 03:50:06,045 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 341.8MB. Free memory was 319.2MB in the beginning and 319.1MB in the end (delta: 157.3kB). There was no memory consumed. Max. memory is 16.0GB. [2023-08-27 03:50:06,045 INFO L158 Benchmark]: CACSL2BoogieTranslator took 514.66ms. Allocated memory is still 341.8MB. Free memory was 315.5MB in the beginning and 292.1MB in the end (delta: 23.5MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. [2023-08-27 03:50:06,045 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.26ms. Allocated memory is still 341.8MB. Free memory was 292.1MB in the beginning and 289.2MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. [2023-08-27 03:50:06,046 INFO L158 Benchmark]: Boogie Preprocessor took 35.92ms. Allocated memory is still 341.8MB. Free memory was 289.2MB in the beginning and 287.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-27 03:50:06,046 INFO L158 Benchmark]: RCFGBuilder took 750.12ms. Allocated memory is still 341.8MB. Free memory was 287.1MB in the beginning and 243.1MB in the end (delta: 44.0MB). Peak memory consumption was 44.0MB. Max. memory is 16.0GB. [2023-08-27 03:50:06,046 INFO L158 Benchmark]: TraceAbstraction took 20493.46ms. Allocated memory was 341.8MB in the beginning and 2.1GB in the end (delta: 1.7GB). Free memory was 242.3MB in the beginning and 1.5GB in the end (delta: -1.3GB). Peak memory consumption was 456.4MB. Max. memory is 16.0GB. [2023-08-27 03:50:06,047 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 341.8MB. Free memory was 319.2MB in the beginning and 319.1MB in the end (delta: 157.3kB). There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 514.66ms. Allocated memory is still 341.8MB. Free memory was 315.5MB in the beginning and 292.1MB in the end (delta: 23.5MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 42.26ms. Allocated memory is still 341.8MB. Free memory was 292.1MB in the beginning and 289.2MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. * Boogie Preprocessor took 35.92ms. Allocated memory is still 341.8MB. Free memory was 289.2MB in the beginning and 287.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 750.12ms. Allocated memory is still 341.8MB. Free memory was 287.1MB in the beginning and 243.1MB in the end (delta: 44.0MB). Peak memory consumption was 44.0MB. Max. memory is 16.0GB. * TraceAbstraction took 20493.46ms. Allocated memory was 341.8MB in the beginning and 2.1GB in the end (delta: 1.7GB). Free memory was 242.3MB in the beginning and 1.5GB in the end (delta: -1.3GB). Peak memory consumption was 456.4MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 267]: Unsoundness Warning unspecified type, defaulting to int C: short [267] - GenericResultAtLocation [Line: 267]: Unsoundness Warning unspecified type, defaulting to int C: short [267] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.8s, 146 PlacesBefore, 52 PlacesAfterwards, 136 TransitionsBefore, 40 TransitionsAfterwards, 4400 CoEnabledTransitionPairs, 6 FixpointIterations, 41 TrivialSequentialCompositions, 58 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 14 ConcurrentYvCompositions, 2 ChoiceCompositions, 115 TotalNumberOfCompositions, 15543 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 4970, independent: 4651, independent conditional: 0, independent unconditional: 4651, dependent: 319, dependent conditional: 0, dependent unconditional: 319, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 2280, independent: 2221, independent conditional: 0, independent unconditional: 2221, dependent: 59, dependent conditional: 0, dependent unconditional: 59, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 4970, independent: 2430, independent conditional: 0, independent unconditional: 2430, dependent: 260, dependent conditional: 0, dependent unconditional: 260, unknown: 2280, unknown conditional: 0, unknown unconditional: 2280] , Statistics on independence cache: Total cache size (in pairs): 245, Positive cache size: 217, Positive conditional cache size: 0, Positive unconditional cache size: 217, Negative cache size: 28, Negative conditional cache size: 0, Negative unconditional cache size: 28, 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_p1_EAX = 0; [L714] 0 int __unbuffered_p3_EAX = 0; [L716] 0 int a = 0; [L717] 0 _Bool main$tmp_guard0; [L718] 0 _Bool main$tmp_guard1; [L720] 0 int x = 0; [L721] 0 _Bool x$flush_delayed; [L722] 0 int x$mem_tmp; [L723] 0 _Bool x$r_buff0_thd0; [L724] 0 _Bool x$r_buff0_thd1; [L725] 0 _Bool x$r_buff0_thd2; [L726] 0 _Bool x$r_buff0_thd3; [L727] 0 _Bool x$r_buff0_thd4; [L728] 0 _Bool x$r_buff1_thd0; [L729] 0 _Bool x$r_buff1_thd1; [L730] 0 _Bool x$r_buff1_thd2; [L731] 0 _Bool x$r_buff1_thd3; [L732] 0 _Bool x$r_buff1_thd4; [L733] 0 _Bool x$read_delayed; [L734] 0 int *x$read_delayed_var; [L735] 0 int x$w_buff0; [L736] 0 _Bool x$w_buff0_used; [L737] 0 int x$w_buff1; [L738] 0 _Bool x$w_buff1_used; [L740] 0 int y = 0; [L742] 0 int z = 0; [L743] 0 _Bool weak$$choice0; [L744] 0 _Bool weak$$choice2; [L846] 0 pthread_t t1481; [L847] FCALL, FORK 0 pthread_create(&t1481, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1481, ((void *)0), P0, ((void *)0))=-4, t1481={5:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L848] 0 pthread_t t1482; [L849] FCALL, FORK 0 pthread_create(&t1482, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1482, ((void *)0), P1, ((void *)0))=-3, t1481={5:0}, t1482={6:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L850] 0 pthread_t t1483; [L851] FCALL, FORK 0 pthread_create(&t1483, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1483, ((void *)0), P2, ((void *)0))=-2, t1481={5:0}, t1482={6:0}, t1483={7:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L852] 0 pthread_t t1484; [L853] FCALL, FORK 0 pthread_create(&t1484, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1484, ((void *)0), P3, ((void *)0))=-1, t1481={5:0}, t1482={6:0}, t1483={7:0}, t1484={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L768] 2 x$w_buff1 = x$w_buff0 [L769] 2 x$w_buff0 = 2 [L770] 2 x$w_buff1_used = x$w_buff0_used [L771] 2 x$w_buff0_used = (_Bool)1 [L772] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L772] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L773] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L774] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L775] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L776] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L777] 2 x$r_buff1_thd4 = x$r_buff0_thd4 [L778] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L781] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L798] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L801] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L818] 4 z = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=2] [L821] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=2] [L748] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=2] [L751] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=2] [L804] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L805] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L806] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L807] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L808] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=2] [L824] 4 x = x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L825] 4 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$w_buff0_used [L826] 4 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$w_buff1_used [L827] 4 x$r_buff0_thd4 = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$r_buff0_thd4 [L828] 4 x$r_buff1_thd4 = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$r_buff1_thd4 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=2] [L754] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L755] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L756] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L757] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L758] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=2] [L784] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L785] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L786] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L787] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L788] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=2] [L791] EXPR 2 __unbuffered_cnt + 1 [L791] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L793] 2 return 0; [L811] EXPR 3 __unbuffered_cnt + 1 [L811] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L813] 3 return 0; [L761] EXPR 1 __unbuffered_cnt + 1 [L761] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L763] 1 return 0; [L831] EXPR 4 __unbuffered_cnt + 1 [L831] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L833] 4 return 0; [L855] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L857] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L857] RET 0 assume_abort_if_not(main$tmp_guard0) [L859] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L860] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L861] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L862] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L863] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1481={5:0}, t1482={6:0}, t1483={7:0}, t1484={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=2] [L866] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L867] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L868] 0 x$flush_delayed = weak$$choice2 [L869] 0 x$mem_tmp = x [L870] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L871] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L872] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L873] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L874] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L875] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L876] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L877] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p3_EAX == 0) [L878] 0 x = x$flush_delayed ? x$mem_tmp : x [L879] 0 x$flush_delayed = (_Bool)0 [L881] 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", "mix055_tso.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_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=2] - UnprovableResult [Line: 761]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 761]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 17]: Unable to prove that assertion always holds Unable to prove that assertion always holds Reason: Not analyzed. - UnprovableResult [Line: 791]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 791]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 811]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 811]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 831]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 831]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 849]: 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: 847]: 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: 851]: 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: 853]: 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, 183 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: 20.3s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 10.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.9s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 456 SdHoareTripleChecker+Valid, 1.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 456 mSDsluCounter, 69 SdHoareTripleChecker+Invalid, 1.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 52 mSDsCounter, 138 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2120 IncrementalHoareTripleChecker+Invalid, 2258 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 138 mSolverCounterUnsat, 17 mSDtfsCounter, 2120 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 70 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=332occurred in iteration=10, 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.4s SatisfiabilityAnalysisTime, 5.5s InterpolantComputationTime, 239 NumberOfCodeBlocks, 239 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 200 ConstructedInterpolants, 0 QuantifiedInterpolants, 2756 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 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:50:06,082 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...