/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 PROGRAM_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/rfi000_power.oepc_pso.oepc_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-27 10:11:23,578 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-27 10:11:23,663 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 10:11:23,667 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-27 10:11:23,667 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-27 10:11:23,696 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-27 10:11:23,696 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-27 10:11:23,697 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-27 10:11:23,698 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-27 10:11:23,701 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-27 10:11:23,701 INFO L153 SettingsManager]: * Use SBE=true [2023-08-27 10:11:23,702 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-27 10:11:23,702 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-27 10:11:23,703 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-27 10:11:23,703 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-27 10:11:23,704 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-27 10:11:23,704 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-27 10:11:23,704 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-27 10:11:23,704 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-27 10:11:23,704 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-27 10:11:23,705 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-27 10:11:23,706 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-27 10:11:23,706 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-27 10:11:23,706 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-27 10:11:23,707 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-27 10:11:23,707 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-27 10:11:23,707 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-27 10:11:23,707 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-27 10:11:23,708 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-27 10:11:23,708 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-27 10:11:23,709 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-27 10:11:23,709 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-27 10:11:23,709 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-27 10:11:23,709 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-27 10:11:23,709 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-27 10:11:23,710 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 -> PROGRAM_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 10:11:24,009 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-27 10:11:24,026 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-27 10:11:24,028 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-27 10:11:24,029 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-27 10:11:24,030 INFO L274 PluginConnector]: CDTParser initialized [2023-08-27 10:11:24,034 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi000_power.oepc_pso.oepc_rmo.oepc.i [2023-08-27 10:11:25,259 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-27 10:11:25,533 INFO L384 CDTParser]: Found 1 translation units. [2023-08-27 10:11:25,534 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi000_power.oepc_pso.oepc_rmo.oepc.i [2023-08-27 10:11:25,550 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7fee99afb/430db4cd78704a4bb7202b13eaee48ad/FLAG462ae26a7 [2023-08-27 10:11:25,562 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7fee99afb/430db4cd78704a4bb7202b13eaee48ad [2023-08-27 10:11:25,564 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-27 10:11:25,565 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-27 10:11:25,566 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-27 10:11:25,566 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-27 10:11:25,568 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-27 10:11:25,569 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 10:11:25" (1/1) ... [2023-08-27 10:11:25,570 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@10b5cd76 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:11:25, skipping insertion in model container [2023-08-27 10:11:25,570 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 10:11:25" (1/1) ... [2023-08-27 10:11:25,609 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-27 10:11:25,991 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-27 10:11:26,004 INFO L201 MainTranslator]: Completed pre-run [2023-08-27 10:11:26,036 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-27 10:11:26,037 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-27 10:11:26,102 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-27 10:11:26,134 WARN L669 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-27 10:11:26,134 WARN L669 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-27 10:11:26,140 INFO L206 MainTranslator]: Completed translation [2023-08-27 10:11:26,140 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:11:26 WrapperNode [2023-08-27 10:11:26,140 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-27 10:11:26,141 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-27 10:11:26,141 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-27 10:11:26,142 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-27 10:11:26,148 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:11:26" (1/1) ... [2023-08-27 10:11:26,172 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:11:26" (1/1) ... [2023-08-27 10:11:26,208 INFO L138 Inliner]: procedures = 175, calls = 46, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 138 [2023-08-27 10:11:26,209 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-27 10:11:26,210 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-27 10:11:26,210 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-27 10:11:26,210 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-27 10:11:26,218 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:11:26" (1/1) ... [2023-08-27 10:11:26,219 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:11:26" (1/1) ... [2023-08-27 10:11:26,223 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:11:26" (1/1) ... [2023-08-27 10:11:26,223 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:11:26" (1/1) ... [2023-08-27 10:11:26,230 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:11:26" (1/1) ... [2023-08-27 10:11:26,232 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:11:26" (1/1) ... [2023-08-27 10:11:26,235 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:11:26" (1/1) ... [2023-08-27 10:11:26,236 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:11:26" (1/1) ... [2023-08-27 10:11:26,239 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-27 10:11:26,240 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-27 10:11:26,240 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-27 10:11:26,240 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-27 10:11:26,241 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:11:26" (1/1) ... [2023-08-27 10:11:26,248 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-27 10:11:26,259 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 10:11:26,283 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 10:11:26,297 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 10:11:26,322 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-27 10:11:26,323 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-27 10:11:26,323 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-27 10:11:26,323 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-27 10:11:26,323 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-27 10:11:26,323 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-27 10:11:26,323 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-27 10:11:26,324 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-27 10:11:26,324 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-27 10:11:26,324 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-27 10:11:26,324 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-27 10:11:26,324 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-27 10:11:26,324 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-27 10:11:26,326 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 10:11:26,452 INFO L236 CfgBuilder]: Building ICFG [2023-08-27 10:11:26,454 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-27 10:11:26,758 INFO L277 CfgBuilder]: Performing block encoding [2023-08-27 10:11:26,954 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-27 10:11:26,955 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-27 10:11:26,957 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 10:11:26 BoogieIcfgContainer [2023-08-27 10:11:26,957 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-27 10:11:26,960 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-27 10:11:26,960 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-27 10:11:26,963 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-27 10:11:26,963 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.08 10:11:25" (1/3) ... [2023-08-27 10:11:26,964 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e2bbc9c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.08 10:11:26, skipping insertion in model container [2023-08-27 10:11:26,964 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:11:26" (2/3) ... [2023-08-27 10:11:26,964 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e2bbc9c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.08 10:11:26, skipping insertion in model container [2023-08-27 10:11:26,964 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 10:11:26" (3/3) ... [2023-08-27 10:11:26,966 INFO L112 eAbstractionObserver]: Analyzing ICFG rfi000_power.oepc_pso.oepc_rmo.oepc.i [2023-08-27 10:11:26,982 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-27 10:11:26,982 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2023-08-27 10:11:26,983 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-27 10:11:27,037 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-27 10:11:27,082 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 102 places, 98 transitions, 206 flow [2023-08-27 10:11:27,130 INFO L124 PetriNetUnfolderBase]: 3/96 cut-off events. [2023-08-27 10:11:27,131 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-27 10:11:27,135 INFO L83 FinitePrefix]: Finished finitePrefix Result has 103 conditions, 96 events. 3/96 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 75 event pairs, 0 based on Foata normal form. 0/87 useless extension candidates. Maximal degree in co-relation 61. Up to 2 conditions per place. [2023-08-27 10:11:27,136 INFO L82 GeneralOperation]: Start removeDead. Operand has 102 places, 98 transitions, 206 flow [2023-08-27 10:11:27,139 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 100 places, 96 transitions, 198 flow [2023-08-27 10:11:27,142 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-27 10:11:27,149 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 96 transitions, 198 flow [2023-08-27 10:11:27,151 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 96 transitions, 198 flow [2023-08-27 10:11:27,152 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 96 transitions, 198 flow [2023-08-27 10:11:27,171 INFO L124 PetriNetUnfolderBase]: 3/96 cut-off events. [2023-08-27 10:11:27,171 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-27 10:11:27,172 INFO L83 FinitePrefix]: Finished finitePrefix Result has 103 conditions, 96 events. 3/96 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 75 event pairs, 0 based on Foata normal form. 0/87 useless extension candidates. Maximal degree in co-relation 61. Up to 2 conditions per place. [2023-08-27 10:11:27,173 INFO L119 LiptonReduction]: Number of co-enabled transitions 1662 [2023-08-27 10:11:30,247 INFO L134 LiptonReduction]: Checked pairs total: 6449 [2023-08-27 10:11:30,247 INFO L136 LiptonReduction]: Total number of compositions: 91 [2023-08-27 10:11:30,258 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-27 10:11:30,263 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;@7dddbad3, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-27 10:11:30,264 INFO L358 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2023-08-27 10:11:30,266 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-27 10:11:30,266 INFO L124 PetriNetUnfolderBase]: 0/3 cut-off events. [2023-08-27 10:11:30,266 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-27 10:11:30,266 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:11:30,266 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-27 10:11:30,267 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2023-08-27 10:11:30,270 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:11:30,270 INFO L85 PathProgramCache]: Analyzing trace with hash 530333, now seen corresponding path program 1 times [2023-08-27 10:11:30,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:11:30,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628964662] [2023-08-27 10:11:30,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:11:30,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:11:30,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:11:30,568 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 10:11:30,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:11:30,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1628964662] [2023-08-27 10:11:30,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1628964662] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:11:30,570 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:11:30,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-27 10:11:30,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848299962] [2023-08-27 10:11:30,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:11:30,578 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-27 10:11:30,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:11:30,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-27 10:11:30,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-27 10:11:30,606 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 189 [2023-08-27 10:11:30,609 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 58 flow. Second operand has 3 states, 3 states have (on average 80.0) internal successors, (240), 3 states have internal predecessors, (240), 0 states have call successors, (0), 0 states 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 10:11:30,609 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:11:30,609 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 189 [2023-08-27 10:11:30,610 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:11:30,830 INFO L124 PetriNetUnfolderBase]: 380/746 cut-off events. [2023-08-27 10:11:30,830 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-08-27 10:11:30,835 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1398 conditions, 746 events. 380/746 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 4104 event pairs, 36 based on Foata normal form. 35/623 useless extension candidates. Maximal degree in co-relation 1388. Up to 549 conditions per place. [2023-08-27 10:11:30,841 INFO L140 encePairwiseOnDemand]: 185/189 looper letters, 32 selfloop transitions, 2 changer transitions 0/38 dead transitions. [2023-08-27 10:11:30,841 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 38 transitions, 153 flow [2023-08-27 10:11:30,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-27 10:11:30,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-27 10:11:30,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 274 transitions. [2023-08-27 10:11:30,859 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48324514991181655 [2023-08-27 10:11:30,859 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 274 transitions. [2023-08-27 10:11:30,860 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 274 transitions. [2023-08-27 10:11:30,863 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:11:30,865 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 274 transitions. [2023-08-27 10:11:30,869 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 91.33333333333333) internal successors, (274), 3 states have internal predecessors, (274), 0 states have call successors, (0), 0 states 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 10:11:30,872 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 189.0) internal successors, (756), 4 states have internal predecessors, (756), 0 states have call successors, (0), 0 states 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 10:11:30,873 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 189.0) internal successors, (756), 4 states have internal predecessors, (756), 0 states have call successors, (0), 0 states 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 10:11:30,874 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 58 flow. Second operand 3 states and 274 transitions. [2023-08-27 10:11:30,875 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 38 transitions, 153 flow [2023-08-27 10:11:30,876 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 38 transitions, 150 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-27 10:11:30,878 INFO L231 Difference]: Finished difference. Result has 31 places, 24 transitions, 56 flow [2023-08-27 10:11:30,879 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=189, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=56, PETRI_PLACES=31, PETRI_TRANSITIONS=24} [2023-08-27 10:11:30,882 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, -1 predicate places. [2023-08-27 10:11:30,882 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 24 transitions, 56 flow [2023-08-27 10:11:30,883 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 80.0) internal successors, (240), 3 states have internal predecessors, (240), 0 states have call successors, (0), 0 states 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 10:11:30,883 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:11:30,883 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-08-27 10:11:30,883 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-27 10:11:30,884 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2023-08-27 10:11:30,892 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:11:30,892 INFO L85 PathProgramCache]: Analyzing trace with hash -1380295729, now seen corresponding path program 1 times [2023-08-27 10:11:30,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:11:30,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925253344] [2023-08-27 10:11:30,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:11:30,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:11:30,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:11:30,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 10:11:30,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:11:30,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925253344] [2023-08-27 10:11:30,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1925253344] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:11:30,993 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:11:30,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-27 10:11:30,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869478399] [2023-08-27 10:11:30,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:11:30,994 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-27 10:11:30,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:11:30,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-27 10:11:30,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-27 10:11:30,995 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 189 [2023-08-27 10:11:30,996 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 24 transitions, 56 flow. Second operand has 3 states, 3 states have (on average 77.66666666666667) internal successors, (233), 3 states have internal predecessors, (233), 0 states have call successors, (0), 0 states 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 10:11:30,996 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:11:30,996 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 189 [2023-08-27 10:11:30,996 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:11:31,096 INFO L124 PetriNetUnfolderBase]: 123/257 cut-off events. [2023-08-27 10:11:31,098 INFO L125 PetriNetUnfolderBase]: For 18/18 co-relation queries the response was YES. [2023-08-27 10:11:31,099 INFO L83 FinitePrefix]: Finished finitePrefix Result has 543 conditions, 257 events. 123/257 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 985 event pairs, 59 based on Foata normal form. 0/199 useless extension candidates. Maximal degree in co-relation 533. Up to 183 conditions per place. [2023-08-27 10:11:31,100 INFO L140 encePairwiseOnDemand]: 181/189 looper letters, 30 selfloop transitions, 3 changer transitions 0/35 dead transitions. [2023-08-27 10:11:31,101 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 35 transitions, 148 flow [2023-08-27 10:11:31,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-27 10:11:31,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-27 10:11:31,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 266 transitions. [2023-08-27 10:11:31,104 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4691358024691358 [2023-08-27 10:11:31,104 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 266 transitions. [2023-08-27 10:11:31,104 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 266 transitions. [2023-08-27 10:11:31,104 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:11:31,104 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 266 transitions. [2023-08-27 10:11:31,105 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 88.66666666666667) internal successors, (266), 3 states have internal predecessors, (266), 0 states have call successors, (0), 0 states 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 10:11:31,107 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 189.0) internal successors, (756), 4 states have internal predecessors, (756), 0 states have call successors, (0), 0 states 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 10:11:31,108 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 189.0) internal successors, (756), 4 states have internal predecessors, (756), 0 states have call successors, (0), 0 states 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 10:11:31,108 INFO L175 Difference]: Start difference. First operand has 31 places, 24 transitions, 56 flow. Second operand 3 states and 266 transitions. [2023-08-27 10:11:31,108 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 35 transitions, 148 flow [2023-08-27 10:11:31,108 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 35 transitions, 142 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-27 10:11:31,109 INFO L231 Difference]: Finished difference. Result has 32 places, 26 transitions, 79 flow [2023-08-27 10:11:31,110 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=189, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=79, PETRI_PLACES=32, PETRI_TRANSITIONS=26} [2023-08-27 10:11:31,110 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 0 predicate places. [2023-08-27 10:11:31,111 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 79 flow [2023-08-27 10:11:31,112 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 77.66666666666667) internal successors, (233), 3 states have internal predecessors, (233), 0 states have call successors, (0), 0 states 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 10:11:31,112 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:11:31,114 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 10:11:31,115 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-27 10:11:31,116 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2023-08-27 10:11:31,118 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:11:31,122 INFO L85 PathProgramCache]: Analyzing trace with hash 177515737, now seen corresponding path program 1 times [2023-08-27 10:11:31,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:11:31,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680696218] [2023-08-27 10:11:31,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:11:31,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:11:31,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:11:31,866 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 10:11:31,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:11:31,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680696218] [2023-08-27 10:11:31,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1680696218] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:11:31,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:11:31,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-27 10:11:31,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484853421] [2023-08-27 10:11:31,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:11:31,867 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-27 10:11:31,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:11:31,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-27 10:11:31,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-27 10:11:31,869 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 189 [2023-08-27 10:11:31,869 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 79 flow. Second operand has 5 states, 5 states have (on average 67.4) internal successors, (337), 5 states have internal predecessors, (337), 0 states have call successors, (0), 0 states 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 10:11:31,870 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:11:31,870 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 189 [2023-08-27 10:11:31,870 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:11:32,174 INFO L124 PetriNetUnfolderBase]: 173/350 cut-off events. [2023-08-27 10:11:32,174 INFO L125 PetriNetUnfolderBase]: For 27/32 co-relation queries the response was YES. [2023-08-27 10:11:32,175 INFO L83 FinitePrefix]: Finished finitePrefix Result has 813 conditions, 350 events. 173/350 cut-off events. For 27/32 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1315 event pairs, 55 based on Foata normal form. 0/323 useless extension candidates. Maximal degree in co-relation 802. Up to 184 conditions per place. [2023-08-27 10:11:32,176 INFO L140 encePairwiseOnDemand]: 179/189 looper letters, 42 selfloop transitions, 14 changer transitions 2/60 dead transitions. [2023-08-27 10:11:32,176 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 60 transitions, 281 flow [2023-08-27 10:11:32,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-27 10:11:32,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-27 10:11:32,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 514 transitions. [2023-08-27 10:11:32,178 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3885109599395314 [2023-08-27 10:11:32,179 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 514 transitions. [2023-08-27 10:11:32,179 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 514 transitions. [2023-08-27 10:11:32,179 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:11:32,179 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 514 transitions. [2023-08-27 10:11:32,180 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 73.42857142857143) internal successors, (514), 7 states have internal predecessors, (514), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:11:32,182 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 189.0) internal successors, (1512), 8 states have internal predecessors, (1512), 0 states have call successors, (0), 0 states 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 10:11:32,183 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 189.0) internal successors, (1512), 8 states have internal predecessors, (1512), 0 states have call successors, (0), 0 states 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 10:11:32,183 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 79 flow. Second operand 7 states and 514 transitions. [2023-08-27 10:11:32,183 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 60 transitions, 281 flow [2023-08-27 10:11:32,184 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 60 transitions, 276 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-27 10:11:32,185 INFO L231 Difference]: Finished difference. Result has 42 places, 38 transitions, 177 flow [2023-08-27 10:11:32,185 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=189, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=177, PETRI_PLACES=42, PETRI_TRANSITIONS=38} [2023-08-27 10:11:32,186 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 10 predicate places. [2023-08-27 10:11:32,186 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 38 transitions, 177 flow [2023-08-27 10:11:32,187 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 67.4) internal successors, (337), 5 states have internal predecessors, (337), 0 states have call successors, (0), 0 states 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 10:11:32,187 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:11:32,187 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 10:11:32,187 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-27 10:11:32,187 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2023-08-27 10:11:32,187 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:11:32,188 INFO L85 PathProgramCache]: Analyzing trace with hash 702157328, now seen corresponding path program 1 times [2023-08-27 10:11:32,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:11:32,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289556221] [2023-08-27 10:11:32,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:11:32,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:11:32,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:11:32,258 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 10:11:32,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:11:32,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289556221] [2023-08-27 10:11:32,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1289556221] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:11:32,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:11:32,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-27 10:11:32,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697439789] [2023-08-27 10:11:32,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:11:32,259 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-27 10:11:32,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:11:32,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-27 10:11:32,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-27 10:11:32,260 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 189 [2023-08-27 10:11:32,261 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 38 transitions, 177 flow. Second operand has 4 states, 4 states have (on average 79.0) internal successors, (316), 4 states have internal predecessors, (316), 0 states have call successors, (0), 0 states 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 10:11:32,261 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:11:32,261 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 189 [2023-08-27 10:11:32,261 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:11:32,369 INFO L124 PetriNetUnfolderBase]: 140/287 cut-off events. [2023-08-27 10:11:32,369 INFO L125 PetriNetUnfolderBase]: For 231/235 co-relation queries the response was YES. [2023-08-27 10:11:32,370 INFO L83 FinitePrefix]: Finished finitePrefix Result has 886 conditions, 287 events. 140/287 cut-off events. For 231/235 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 1104 event pairs, 52 based on Foata normal form. 4/267 useless extension candidates. Maximal degree in co-relation 869. Up to 185 conditions per place. [2023-08-27 10:11:32,371 INFO L140 encePairwiseOnDemand]: 184/189 looper letters, 39 selfloop transitions, 3 changer transitions 0/46 dead transitions. [2023-08-27 10:11:32,371 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 46 transitions, 290 flow [2023-08-27 10:11:32,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-27 10:11:32,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-27 10:11:32,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 337 transitions. [2023-08-27 10:11:32,372 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44576719576719576 [2023-08-27 10:11:32,373 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 337 transitions. [2023-08-27 10:11:32,373 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 337 transitions. [2023-08-27 10:11:32,373 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:11:32,373 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 337 transitions. [2023-08-27 10:11:32,374 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 84.25) internal successors, (337), 4 states have internal predecessors, (337), 0 states have call successors, (0), 0 states 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 10:11:32,375 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 189.0) internal successors, (945), 5 states have internal predecessors, (945), 0 states have call successors, (0), 0 states 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 10:11:32,376 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 189.0) internal successors, (945), 5 states have internal predecessors, (945), 0 states have call successors, (0), 0 states 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 10:11:32,376 INFO L175 Difference]: Start difference. First operand has 42 places, 38 transitions, 177 flow. Second operand 4 states and 337 transitions. [2023-08-27 10:11:32,376 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 46 transitions, 290 flow [2023-08-27 10:11:32,378 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 46 transitions, 290 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-27 10:11:32,379 INFO L231 Difference]: Finished difference. Result has 43 places, 36 transitions, 175 flow [2023-08-27 10:11:32,379 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=189, PETRI_DIFFERENCE_MINUEND_FLOW=169, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=175, PETRI_PLACES=43, PETRI_TRANSITIONS=36} [2023-08-27 10:11:32,380 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 11 predicate places. [2023-08-27 10:11:32,381 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 36 transitions, 175 flow [2023-08-27 10:11:32,381 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 79.0) internal successors, (316), 4 states have internal predecessors, (316), 0 states have call successors, (0), 0 states 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 10:11:32,381 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:11:32,381 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 10:11:32,381 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-27 10:11:32,381 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2023-08-27 10:11:32,382 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:11:32,382 INFO L85 PathProgramCache]: Analyzing trace with hash 1653434123, now seen corresponding path program 1 times [2023-08-27 10:11:32,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:11:32,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132442607] [2023-08-27 10:11:32,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:11:32,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:11:32,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:11:32,470 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 10:11:32,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:11:32,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [132442607] [2023-08-27 10:11:32,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [132442607] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:11:32,471 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:11:32,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-27 10:11:32,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624453406] [2023-08-27 10:11:32,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:11:32,472 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-27 10:11:32,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:11:32,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-27 10:11:32,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-27 10:11:32,474 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 189 [2023-08-27 10:11:32,477 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 36 transitions, 175 flow. Second operand has 4 states, 4 states have (on average 79.0) internal successors, (316), 4 states have internal predecessors, (316), 0 states have call successors, (0), 0 states 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 10:11:32,477 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:11:32,477 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 189 [2023-08-27 10:11:32,477 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:11:32,555 INFO L124 PetriNetUnfolderBase]: 75/154 cut-off events. [2023-08-27 10:11:32,555 INFO L125 PetriNetUnfolderBase]: For 132/134 co-relation queries the response was YES. [2023-08-27 10:11:32,556 INFO L83 FinitePrefix]: Finished finitePrefix Result has 467 conditions, 154 events. 75/154 cut-off events. For 132/134 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 482 event pairs, 37 based on Foata normal form. 11/157 useless extension candidates. Maximal degree in co-relation 453. Up to 90 conditions per place. [2023-08-27 10:11:32,556 INFO L140 encePairwiseOnDemand]: 183/189 looper letters, 25 selfloop transitions, 5 changer transitions 4/37 dead transitions. [2023-08-27 10:11:32,556 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 37 transitions, 227 flow [2023-08-27 10:11:32,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-27 10:11:32,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-27 10:11:32,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 337 transitions. [2023-08-27 10:11:32,558 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44576719576719576 [2023-08-27 10:11:32,558 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 337 transitions. [2023-08-27 10:11:32,558 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 337 transitions. [2023-08-27 10:11:32,558 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:11:32,559 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 337 transitions. [2023-08-27 10:11:32,560 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 84.25) internal successors, (337), 4 states have internal predecessors, (337), 0 states have call successors, (0), 0 states 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 10:11:32,561 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 189.0) internal successors, (945), 5 states have internal predecessors, (945), 0 states have call successors, (0), 0 states 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 10:11:32,562 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 189.0) internal successors, (945), 5 states have internal predecessors, (945), 0 states have call successors, (0), 0 states 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 10:11:32,562 INFO L175 Difference]: Start difference. First operand has 43 places, 36 transitions, 175 flow. Second operand 4 states and 337 transitions. [2023-08-27 10:11:32,562 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 37 transitions, 227 flow [2023-08-27 10:11:32,565 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 37 transitions, 199 flow, removed 7 selfloop flow, removed 6 redundant places. [2023-08-27 10:11:32,567 INFO L231 Difference]: Finished difference. Result has 37 places, 24 transitions, 106 flow [2023-08-27 10:11:32,567 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=189, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=106, PETRI_PLACES=37, PETRI_TRANSITIONS=24} [2023-08-27 10:11:32,569 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 5 predicate places. [2023-08-27 10:11:32,569 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 24 transitions, 106 flow [2023-08-27 10:11:32,569 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 79.0) internal successors, (316), 4 states have internal predecessors, (316), 0 states have call successors, (0), 0 states 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 10:11:32,569 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:11:32,569 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 10:11:32,569 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-27 10:11:32,569 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2023-08-27 10:11:32,570 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:11:32,570 INFO L85 PathProgramCache]: Analyzing trace with hash 65942554, now seen corresponding path program 1 times [2023-08-27 10:11:32,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:11:32,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311467740] [2023-08-27 10:11:32,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:11:32,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:11:32,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:11:34,548 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 10:11:34,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:11:34,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311467740] [2023-08-27 10:11:34,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1311467740] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:11:34,548 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:11:34,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-08-27 10:11:34,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582906627] [2023-08-27 10:11:34,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:11:34,549 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-08-27 10:11:34,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:11:34,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-08-27 10:11:34,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2023-08-27 10:11:34,552 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 69 out of 189 [2023-08-27 10:11:34,553 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 24 transitions, 106 flow. Second operand has 11 states, 11 states have (on average 70.54545454545455) internal successors, (776), 11 states have internal predecessors, (776), 0 states have call successors, (0), 0 states 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 10:11:34,553 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:11:34,553 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 69 of 189 [2023-08-27 10:11:34,553 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:11:35,059 INFO L124 PetriNetUnfolderBase]: 42/142 cut-off events. [2023-08-27 10:11:35,059 INFO L125 PetriNetUnfolderBase]: For 144/145 co-relation queries the response was YES. [2023-08-27 10:11:35,060 INFO L83 FinitePrefix]: Finished finitePrefix Result has 487 conditions, 142 events. 42/142 cut-off events. For 144/145 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 517 event pairs, 5 based on Foata normal form. 3/145 useless extension candidates. Maximal degree in co-relation 471. Up to 44 conditions per place. [2023-08-27 10:11:35,060 INFO L140 encePairwiseOnDemand]: 179/189 looper letters, 41 selfloop transitions, 10 changer transitions 27/80 dead transitions. [2023-08-27 10:11:35,060 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 80 transitions, 541 flow [2023-08-27 10:11:35,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-08-27 10:11:35,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-08-27 10:11:35,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 892 transitions. [2023-08-27 10:11:35,063 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3932980599647266 [2023-08-27 10:11:35,063 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 892 transitions. [2023-08-27 10:11:35,063 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 892 transitions. [2023-08-27 10:11:35,064 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:11:35,064 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 892 transitions. [2023-08-27 10:11:35,066 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 74.33333333333333) internal successors, (892), 12 states have internal predecessors, (892), 0 states have call successors, (0), 0 states 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 10:11:35,068 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 189.0) internal successors, (2457), 13 states have internal predecessors, (2457), 0 states have call successors, (0), 0 states 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 10:11:35,069 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 189.0) internal successors, (2457), 13 states have internal predecessors, (2457), 0 states have call successors, (0), 0 states 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 10:11:35,069 INFO L175 Difference]: Start difference. First operand has 37 places, 24 transitions, 106 flow. Second operand 12 states and 892 transitions. [2023-08-27 10:11:35,069 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 80 transitions, 541 flow [2023-08-27 10:11:35,071 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 80 transitions, 495 flow, removed 10 selfloop flow, removed 2 redundant places. [2023-08-27 10:11:35,072 INFO L231 Difference]: Finished difference. Result has 51 places, 32 transitions, 195 flow [2023-08-27 10:11:35,072 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=189, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=195, PETRI_PLACES=51, PETRI_TRANSITIONS=32} [2023-08-27 10:11:35,073 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 19 predicate places. [2023-08-27 10:11:35,073 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 32 transitions, 195 flow [2023-08-27 10:11:35,073 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 70.54545454545455) internal successors, (776), 11 states have internal predecessors, (776), 0 states have call successors, (0), 0 states 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 10:11:35,073 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:11:35,073 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 10:11:35,073 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-27 10:11:35,074 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2023-08-27 10:11:35,074 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:11:35,074 INFO L85 PathProgramCache]: Analyzing trace with hash -235374414, now seen corresponding path program 2 times [2023-08-27 10:11:35,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:11:35,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417383335] [2023-08-27 10:11:35,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:11:35,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:11:35,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:11:35,647 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 10:11:35,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:11:35,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417383335] [2023-08-27 10:11:35,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1417383335] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:11:35,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:11:35,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-27 10:11:35,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544696387] [2023-08-27 10:11:35,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:11:35,649 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-27 10:11:35,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:11:35,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-27 10:11:35,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-27 10:11:35,650 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 189 [2023-08-27 10:11:35,650 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 32 transitions, 195 flow. Second operand has 5 states, 5 states have (on average 68.6) internal successors, (343), 5 states have internal predecessors, (343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:11:35,650 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:11:35,650 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 189 [2023-08-27 10:11:35,650 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:11:35,774 INFO L124 PetriNetUnfolderBase]: 37/122 cut-off events. [2023-08-27 10:11:35,774 INFO L125 PetriNetUnfolderBase]: For 164/164 co-relation queries the response was YES. [2023-08-27 10:11:35,774 INFO L83 FinitePrefix]: Finished finitePrefix Result has 534 conditions, 122 events. 37/122 cut-off events. For 164/164 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 412 event pairs, 12 based on Foata normal form. 2/124 useless extension candidates. Maximal degree in co-relation 515. Up to 66 conditions per place. [2023-08-27 10:11:35,775 INFO L140 encePairwiseOnDemand]: 183/189 looper letters, 20 selfloop transitions, 4 changer transitions 27/51 dead transitions. [2023-08-27 10:11:35,775 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 51 transitions, 393 flow [2023-08-27 10:11:35,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-27 10:11:35,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-27 10:11:35,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 361 transitions. [2023-08-27 10:11:35,777 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.382010582010582 [2023-08-27 10:11:35,777 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 361 transitions. [2023-08-27 10:11:35,777 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 361 transitions. [2023-08-27 10:11:35,777 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:11:35,777 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 361 transitions. [2023-08-27 10:11:35,778 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 72.2) internal successors, (361), 5 states have internal predecessors, (361), 0 states have call successors, (0), 0 states 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 10:11:35,780 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 189.0) internal successors, (1134), 6 states have internal predecessors, (1134), 0 states have call successors, (0), 0 states 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 10:11:35,780 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 189.0) internal successors, (1134), 6 states have internal predecessors, (1134), 0 states have call successors, (0), 0 states 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 10:11:35,780 INFO L175 Difference]: Start difference. First operand has 51 places, 32 transitions, 195 flow. Second operand 5 states and 361 transitions. [2023-08-27 10:11:35,780 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 51 transitions, 393 flow [2023-08-27 10:11:35,782 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 51 transitions, 355 flow, removed 14 selfloop flow, removed 8 redundant places. [2023-08-27 10:11:35,783 INFO L231 Difference]: Finished difference. Result has 43 places, 20 transitions, 106 flow [2023-08-27 10:11:35,783 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=189, PETRI_DIFFERENCE_MINUEND_FLOW=169, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=106, PETRI_PLACES=43, PETRI_TRANSITIONS=20} [2023-08-27 10:11:35,784 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 11 predicate places. [2023-08-27 10:11:35,784 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 20 transitions, 106 flow [2023-08-27 10:11:35,785 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 68.6) internal successors, (343), 5 states have internal predecessors, (343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:11:35,785 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:11:35,785 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 10:11:35,785 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-27 10:11:35,785 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2023-08-27 10:11:35,786 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:11:35,786 INFO L85 PathProgramCache]: Analyzing trace with hash -379589386, now seen corresponding path program 3 times [2023-08-27 10:11:35,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:11:35,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916173568] [2023-08-27 10:11:35,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:11:35,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:11:35,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-27 10:11:35,857 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-27 10:11:35,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-27 10:11:35,963 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-27 10:11:35,963 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-27 10:11:35,964 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONASSERT (12 of 13 remaining) [2023-08-27 10:11:35,966 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONASSERT (11 of 13 remaining) [2023-08-27 10:11:35,966 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 13 remaining) [2023-08-27 10:11:35,966 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 13 remaining) [2023-08-27 10:11:35,966 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 13 remaining) [2023-08-27 10:11:35,966 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 13 remaining) [2023-08-27 10:11:35,966 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 13 remaining) [2023-08-27 10:11:35,966 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 13 remaining) [2023-08-27 10:11:35,967 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONASSERT (4 of 13 remaining) [2023-08-27 10:11:35,967 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 13 remaining) [2023-08-27 10:11:35,967 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 13 remaining) [2023-08-27 10:11:35,967 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 13 remaining) [2023-08-27 10:11:35,967 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 13 remaining) [2023-08-27 10:11:35,967 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-27 10:11:35,967 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1] [2023-08-27 10:11:35,972 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-27 10:11:35,972 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-27 10:11:36,038 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.08 10:11:36 BasicIcfg [2023-08-27 10:11:36,038 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-27 10:11:36,039 INFO L158 Benchmark]: Toolchain (without parser) took 10473.81ms. Allocated memory was 373.3MB in the beginning and 587.2MB in the end (delta: 213.9MB). Free memory was 347.7MB in the beginning and 508.2MB in the end (delta: -160.5MB). Peak memory consumption was 55.4MB. Max. memory is 16.0GB. [2023-08-27 10:11:36,039 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 373.3MB. Free memory is still 349.7MB. There was no memory consumed. Max. memory is 16.0GB. [2023-08-27 10:11:36,039 INFO L158 Benchmark]: CACSL2BoogieTranslator took 574.95ms. Allocated memory is still 373.3MB. Free memory was 347.7MB in the beginning and 322.6MB in the end (delta: 25.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.0GB. [2023-08-27 10:11:36,040 INFO L158 Benchmark]: Boogie Procedure Inliner took 67.42ms. Allocated memory is still 373.3MB. Free memory was 322.6MB in the beginning and 319.9MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-27 10:11:36,040 INFO L158 Benchmark]: Boogie Preprocessor took 29.73ms. Allocated memory is still 373.3MB. Free memory was 319.9MB in the beginning and 317.9MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-27 10:11:36,040 INFO L158 Benchmark]: RCFGBuilder took 716.67ms. Allocated memory is still 373.3MB. Free memory was 317.9MB in the beginning and 317.3MB in the end (delta: 625.7kB). Peak memory consumption was 25.1MB. Max. memory is 16.0GB. [2023-08-27 10:11:36,045 INFO L158 Benchmark]: TraceAbstraction took 9078.26ms. Allocated memory was 373.3MB in the beginning and 587.2MB in the end (delta: 213.9MB). Free memory was 316.3MB in the beginning and 508.2MB in the end (delta: -192.0MB). Peak memory consumption was 21.9MB. Max. memory is 16.0GB. [2023-08-27 10:11:36,053 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.19ms. Allocated memory is still 373.3MB. Free memory is still 349.7MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 574.95ms. Allocated memory is still 373.3MB. Free memory was 347.7MB in the beginning and 322.6MB in the end (delta: 25.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 67.42ms. Allocated memory is still 373.3MB. Free memory was 322.6MB in the beginning and 319.9MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 29.73ms. Allocated memory is still 373.3MB. Free memory was 319.9MB in the beginning and 317.9MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 716.67ms. Allocated memory is still 373.3MB. Free memory was 317.9MB in the beginning and 317.3MB in the end (delta: 625.7kB). Peak memory consumption was 25.1MB. Max. memory is 16.0GB. * TraceAbstraction took 9078.26ms. Allocated memory was 373.3MB in the beginning and 587.2MB in the end (delta: 213.9MB). Free memory was 316.3MB in the beginning and 508.2MB in the end (delta: -192.0MB). Peak memory consumption was 21.9MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 267]: Unsoundness Warning unspecified type, defaulting to int C: short [267] - GenericResultAtLocation [Line: 267]: Unsoundness Warning unspecified type, defaulting to int C: short [267] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.1s, 100 PlacesBefore, 32 PlacesAfterwards, 96 TransitionsBefore, 26 TransitionsAfterwards, 1662 CoEnabledTransitionPairs, 7 FixpointIterations, 35 TrivialSequentialCompositions, 38 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 16 ConcurrentYvCompositions, 2 ChoiceCompositions, 91 TotalNumberOfCompositions, 6449 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2223, independent: 1989, independent conditional: 0, independent unconditional: 1989, dependent: 234, dependent conditional: 0, dependent unconditional: 234, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 915, independent: 887, independent conditional: 0, independent unconditional: 887, dependent: 28, dependent conditional: 0, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2223, independent: 1102, independent conditional: 0, independent unconditional: 1102, dependent: 206, dependent conditional: 0, dependent unconditional: 206, unknown: 915, unknown conditional: 0, unknown unconditional: 915] , Statistics on independence cache: Total cache size (in pairs): 94, Positive cache size: 79, Positive conditional cache size: 0, Positive unconditional cache size: 79, Negative cache size: 15, Negative conditional cache size: 0, Negative unconditional cache size: 15, 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: [L708] 0 int __unbuffered_cnt = 0; [L710] 0 int __unbuffered_p1_EAX = 0; [L712] 0 int __unbuffered_p1_EBX = 0; [L713] 0 _Bool main$tmp_guard0; [L714] 0 _Bool main$tmp_guard1; [L716] 0 int x = 0; [L718] 0 int y = 0; [L719] 0 _Bool y$flush_delayed; [L720] 0 int y$mem_tmp; [L721] 0 _Bool y$r_buff0_thd0; [L722] 0 _Bool y$r_buff0_thd1; [L723] 0 _Bool y$r_buff0_thd2; [L724] 0 _Bool y$r_buff1_thd0; [L725] 0 _Bool y$r_buff1_thd1; [L726] 0 _Bool y$r_buff1_thd2; [L727] 0 _Bool y$read_delayed; [L728] 0 int *y$read_delayed_var; [L729] 0 int y$w_buff0; [L730] 0 _Bool y$w_buff0_used; [L731] 0 int y$w_buff1; [L732] 0 _Bool y$w_buff1_used; [L733] 0 _Bool weak$$choice0; [L734] 0 _Bool weak$$choice2; [L826] 0 pthread_t t1585; [L827] FCALL, FORK 0 pthread_create(&t1585, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1585, ((void *)0), P0, ((void *)0))=-2, t1585={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L828] 0 pthread_t t1586; [L829] FCALL, FORK 0 pthread_create(&t1586, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1586, ((void *)0), P1, ((void *)0))=-1, t1585={5:0}, t1586={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L738] 1 y$w_buff1 = y$w_buff0 [L739] 1 y$w_buff0 = 2 [L740] 1 y$w_buff1_used = y$w_buff0_used [L741] 1 y$w_buff0_used = (_Bool)1 [L742] CALL 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L742] RET 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L743] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L744] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L745] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L746] 1 y$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L749] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L766] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L769] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1] [L772] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L773] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L774] 2 y$flush_delayed = weak$$choice2 [L775] 2 y$mem_tmp = y [L776] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L777] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L778] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L779] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L780] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L781] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L782] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L783] 2 __unbuffered_p1_EAX = y [L784] 2 y = y$flush_delayed ? y$mem_tmp : y [L785] 2 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1] [L788] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L789] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L790] 2 y$flush_delayed = weak$$choice2 [L791] 2 y$mem_tmp = y [L792] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L793] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L794] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L795] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L796] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L797] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L798] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L799] 2 __unbuffered_p1_EBX = y [L800] 2 y = y$flush_delayed ? y$mem_tmp : y [L801] 2 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1] [L804] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L805] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L806] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L807] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L808] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1] [L752] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L753] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L754] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L755] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L756] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L811] EXPR 2 __unbuffered_cnt + 1 [L811] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L813] 2 return 0; [L759] EXPR 1 __unbuffered_cnt + 1 [L759] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L761] 1 return 0; [L831] 0 main$tmp_guard0 = __unbuffered_cnt == 2 [L833] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L833] RET 0 assume_abort_if_not(main$tmp_guard0) [L835] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L836] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L837] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L838] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L839] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1585={5:0}, t1586={3:0}, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L842] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L843] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L844] 0 y$flush_delayed = weak$$choice2 [L845] 0 y$mem_tmp = y [L846] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L847] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L848] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L849] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L850] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L851] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L852] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L853] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 1) [L854] 0 y = y$flush_delayed ? y$mem_tmp : y [L855] 0 y$flush_delayed = (_Bool)0 [L857] 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", "rfi000_power.oepc_pso.oepc_rmo.oepc.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\read(__PRETTY_FUNCTION__)={49:50}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] - UnprovableResult [Line: 17]: Unable to prove that assertion always holds Unable to prove that assertion always holds Reason: Not analyzed. - UnprovableResult [Line: 759]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 759]: 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: 829]: 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: 827]: 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 5 procedures, 121 locations, 13 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: 8.9s, OverallIterations: 8, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 1.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 118 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 118 mSDsluCounter, 28 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 16 mSDsCounter, 49 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 647 IncrementalHoareTripleChecker+Invalid, 696 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 49 mSolverCounterUnsat, 12 mSDtfsCounter, 647 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 33 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=195occurred in iteration=6, InterpolantAutomatonStates: 38, 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.2s SatisfiabilityAnalysisTime, 3.5s InterpolantComputationTime, 103 NumberOfCodeBlocks, 103 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 78 ConstructedInterpolants, 0 QuantifiedInterpolants, 781 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 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 10:11:36,078 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...