/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --cacsl2boogietranslator.check.absence.of.signed.integer.overflows true -i ../../../trunk/examples/svcomp/pthread-wmm/mix022_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-26 21:14:05,304 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-26 21:14:05,360 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf [2023-08-26 21:14:05,364 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-26 21:14:05,365 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-26 21:14:05,394 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-26 21:14:05,395 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-26 21:14:05,396 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-26 21:14:05,396 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-26 21:14:05,400 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-26 21:14:05,400 INFO L153 SettingsManager]: * Use SBE=true [2023-08-26 21:14:05,400 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-26 21:14:05,401 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-26 21:14:05,401 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-26 21:14:05,402 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-26 21:14:05,402 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-26 21:14:05,402 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-26 21:14:05,402 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-26 21:14:05,402 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-26 21:14:05,403 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-26 21:14:05,403 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-26 21:14:05,404 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-26 21:14:05,405 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-26 21:14:05,405 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-26 21:14:05,405 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-26 21:14:05,406 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-26 21:14:05,406 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-26 21:14:05,406 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 21:14:05,406 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-26 21:14:05,406 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-26 21:14:05,407 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-26 21:14:05,407 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-26 21:14:05,408 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-26 21:14:05,408 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-26 21:14:05,408 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-26 21:14:05,408 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check absence of signed integer overflows -> true [2023-08-26 21:14:05,748 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-26 21:14:05,774 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-26 21:14:05,776 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-26 21:14:05,777 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-26 21:14:05,778 INFO L274 PluginConnector]: CDTParser initialized [2023-08-26 21:14:05,779 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix022_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2023-08-26 21:14:06,947 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-26 21:14:07,207 INFO L384 CDTParser]: Found 1 translation units. [2023-08-26 21:14:07,208 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix022_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2023-08-26 21:14:07,223 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fd06be125/8815901dbb8445f38129df6a5185f0cc/FLAG5961ea28c [2023-08-26 21:14:07,235 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fd06be125/8815901dbb8445f38129df6a5185f0cc [2023-08-26 21:14:07,237 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-26 21:14:07,238 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-26 21:14:07,239 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-26 21:14:07,239 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-26 21:14:07,242 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-26 21:14:07,242 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 09:14:07" (1/1) ... [2023-08-26 21:14:07,243 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@47a4264e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:14:07, skipping insertion in model container [2023-08-26 21:14:07,243 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 09:14:07" (1/1) ... [2023-08-26 21:14:07,291 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-26 21:14:07,665 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 21:14:07,677 INFO L201 MainTranslator]: Completed pre-run [2023-08-26 21:14:07,706 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-26 21:14:07,708 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-26 21:14:07,744 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 21:14:07,778 WARN L669 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-26 21:14:07,778 WARN L669 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-26 21:14:07,785 INFO L206 MainTranslator]: Completed translation [2023-08-26 21:14:07,785 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:14:07 WrapperNode [2023-08-26 21:14:07,786 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-26 21:14:07,787 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-26 21:14:07,787 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-26 21:14:07,787 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-26 21:14:07,793 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:14:07" (1/1) ... [2023-08-26 21:14:07,821 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:14:07" (1/1) ... [2023-08-26 21:14:07,856 INFO L138 Inliner]: procedures = 175, calls = 44, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 121 [2023-08-26 21:14:07,857 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-26 21:14:07,857 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-26 21:14:07,858 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-26 21:14:07,858 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-26 21:14:07,865 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:14:07" (1/1) ... [2023-08-26 21:14:07,865 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:14:07" (1/1) ... [2023-08-26 21:14:07,882 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:14:07" (1/1) ... [2023-08-26 21:14:07,882 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:14:07" (1/1) ... [2023-08-26 21:14:07,888 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:14:07" (1/1) ... [2023-08-26 21:14:07,889 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:14:07" (1/1) ... [2023-08-26 21:14:07,891 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:14:07" (1/1) ... [2023-08-26 21:14:07,892 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:14:07" (1/1) ... [2023-08-26 21:14:07,895 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-26 21:14:07,896 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-26 21:14:07,896 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-26 21:14:07,896 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-26 21:14:07,896 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:14:07" (1/1) ... [2023-08-26 21:14:07,917 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 21:14:07,932 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 21:14:07,950 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-26 21:14:07,973 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-26 21:14:07,987 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-26 21:14:07,988 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-26 21:14:07,988 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-26 21:14:07,989 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-26 21:14:07,989 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-26 21:14:07,989 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-26 21:14:07,989 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-26 21:14:07,989 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-26 21:14:07,989 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-26 21:14:07,989 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-26 21:14:07,989 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-26 21:14:07,990 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-26 21:14:07,990 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-26 21:14:07,991 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-26 21:14:08,117 INFO L236 CfgBuilder]: Building ICFG [2023-08-26 21:14:08,119 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-26 21:14:08,431 INFO L277 CfgBuilder]: Performing block encoding [2023-08-26 21:14:08,511 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-26 21:14:08,511 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-26 21:14:08,513 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 09:14:08 BoogieIcfgContainer [2023-08-26 21:14:08,513 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-26 21:14:08,515 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-26 21:14:08,515 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-26 21:14:08,518 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-26 21:14:08,518 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.08 09:14:07" (1/3) ... [2023-08-26 21:14:08,519 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2297ca00 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 09:14:08, skipping insertion in model container [2023-08-26 21:14:08,519 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:14:07" (2/3) ... [2023-08-26 21:14:08,519 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2297ca00 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 09:14:08, skipping insertion in model container [2023-08-26 21:14:08,519 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 09:14:08" (3/3) ... [2023-08-26 21:14:08,520 INFO L112 eAbstractionObserver]: Analyzing ICFG mix022_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2023-08-26 21:14:08,536 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-26 21:14:08,536 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2023-08-26 21:14:08,536 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-26 21:14:08,577 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-26 21:14:08,606 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 101 places, 97 transitions, 204 flow [2023-08-26 21:14:08,644 INFO L124 PetriNetUnfolderBase]: 3/95 cut-off events. [2023-08-26 21:14:08,644 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 21:14:08,649 INFO L83 FinitePrefix]: Finished finitePrefix Result has 102 conditions, 95 events. 3/95 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 65 event pairs, 0 based on Foata normal form. 0/86 useless extension candidates. Maximal degree in co-relation 60. Up to 2 conditions per place. [2023-08-26 21:14:08,649 INFO L82 GeneralOperation]: Start removeDead. Operand has 101 places, 97 transitions, 204 flow [2023-08-26 21:14:08,652 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 99 places, 95 transitions, 196 flow [2023-08-26 21:14:08,656 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-26 21:14:08,664 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 99 places, 95 transitions, 196 flow [2023-08-26 21:14:08,667 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 99 places, 95 transitions, 196 flow [2023-08-26 21:14:08,667 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 99 places, 95 transitions, 196 flow [2023-08-26 21:14:08,689 INFO L124 PetriNetUnfolderBase]: 3/95 cut-off events. [2023-08-26 21:14:08,689 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 21:14:08,690 INFO L83 FinitePrefix]: Finished finitePrefix Result has 102 conditions, 95 events. 3/95 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 65 event pairs, 0 based on Foata normal form. 0/86 useless extension candidates. Maximal degree in co-relation 60. Up to 2 conditions per place. [2023-08-26 21:14:08,691 INFO L119 LiptonReduction]: Number of co-enabled transitions 1580 [2023-08-26 21:14:11,828 INFO L134 LiptonReduction]: Checked pairs total: 5676 [2023-08-26 21:14:11,828 INFO L136 LiptonReduction]: Total number of compositions: 93 [2023-08-26 21:14:11,840 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-26 21:14:11,845 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;@316322a9, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-26 21:14:11,845 INFO L358 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2023-08-26 21:14:11,848 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-26 21:14:11,848 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-08-26 21:14:11,848 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 21:14:11,848 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:14:11,849 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-26 21:14:11,849 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2023-08-26 21:14:11,853 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:14:11,853 INFO L85 PathProgramCache]: Analyzing trace with hash 462716, now seen corresponding path program 1 times [2023-08-26 21:14:11,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:14:11,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154027053] [2023-08-26 21:14:11,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:14:11,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:14:11,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:14:12,195 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 21:14:12,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:14:12,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154027053] [2023-08-26 21:14:12,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [154027053] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:14:12,197 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:14:12,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 21:14:12,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094150339] [2023-08-26 21:14:12,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:14:12,206 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 21:14:12,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:14:12,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 21:14:12,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 21:14:12,230 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 190 [2023-08-26 21:14:12,232 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 23 transitions, 52 flow. Second operand has 3 states, 3 states have (on average 81.0) internal successors, (243), 3 states have internal predecessors, (243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:14:12,233 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:14:12,233 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 190 [2023-08-26 21:14:12,233 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:14:12,391 INFO L124 PetriNetUnfolderBase]: 224/455 cut-off events. [2023-08-26 21:14:12,391 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-08-26 21:14:12,394 INFO L83 FinitePrefix]: Finished finitePrefix Result has 856 conditions, 455 events. 224/455 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 2333 event pairs, 20 based on Foata normal form. 0/367 useless extension candidates. Maximal degree in co-relation 846. Up to 333 conditions per place. [2023-08-26 21:14:12,398 INFO L140 encePairwiseOnDemand]: 186/190 looper letters, 26 selfloop transitions, 2 changer transitions 0/32 dead transitions. [2023-08-26 21:14:12,399 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 32 transitions, 129 flow [2023-08-26 21:14:12,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 21:14:12,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 21:14:12,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 271 transitions. [2023-08-26 21:14:12,412 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47543859649122805 [2023-08-26 21:14:12,413 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 271 transitions. [2023-08-26 21:14:12,413 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 271 transitions. [2023-08-26 21:14:12,416 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:14:12,419 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 271 transitions. [2023-08-26 21:14:12,421 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 90.33333333333333) internal successors, (271), 3 states have internal predecessors, (271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:14:12,426 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 190.0) internal successors, (760), 4 states have internal predecessors, (760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:14:12,427 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 190.0) internal successors, (760), 4 states have internal predecessors, (760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:14:12,429 INFO L175 Difference]: Start difference. First operand has 29 places, 23 transitions, 52 flow. Second operand 3 states and 271 transitions. [2023-08-26 21:14:12,429 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 32 transitions, 129 flow [2023-08-26 21:14:12,431 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 32 transitions, 126 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 21:14:12,445 INFO L231 Difference]: Finished difference. Result has 28 places, 21 transitions, 50 flow [2023-08-26 21:14:12,447 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=190, PETRI_DIFFERENCE_MINUEND_FLOW=46, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=50, PETRI_PLACES=28, PETRI_TRANSITIONS=21} [2023-08-26 21:14:12,450 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, -1 predicate places. [2023-08-26 21:14:12,451 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 21 transitions, 50 flow [2023-08-26 21:14:12,451 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 81.0) internal successors, (243), 3 states have internal predecessors, (243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:14:12,451 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:14:12,451 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-08-26 21:14:12,452 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-26 21:14:12,452 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-26 21:14:12,452 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:14:12,452 INFO L85 PathProgramCache]: Analyzing trace with hash 900224010, now seen corresponding path program 1 times [2023-08-26 21:14:12,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:14:12,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672748680] [2023-08-26 21:14:12,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:14:12,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:14:12,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:14:12,521 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 21:14:12,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:14:12,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672748680] [2023-08-26 21:14:12,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [672748680] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:14:12,522 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:14:12,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 21:14:12,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708910023] [2023-08-26 21:14:12,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:14:12,523 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 21:14:12,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:14:12,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 21:14:12,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 21:14:12,526 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 190 [2023-08-26 21:14:12,526 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 21 transitions, 50 flow. Second operand has 3 states, 3 states have (on average 78.66666666666667) internal successors, (236), 3 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:14:12,526 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:14:12,526 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 190 [2023-08-26 21:14:12,526 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:14:12,616 INFO L124 PetriNetUnfolderBase]: 158/292 cut-off events. [2023-08-26 21:14:12,616 INFO L125 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES. [2023-08-26 21:14:12,617 INFO L83 FinitePrefix]: Finished finitePrefix Result has 620 conditions, 292 events. 158/292 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1131 event pairs, 78 based on Foata normal form. 0/244 useless extension candidates. Maximal degree in co-relation 610. Up to 145 conditions per place. [2023-08-26 21:14:12,619 INFO L140 encePairwiseOnDemand]: 183/190 looper letters, 29 selfloop transitions, 3 changer transitions 0/34 dead transitions. [2023-08-26 21:14:12,619 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 34 transitions, 144 flow [2023-08-26 21:14:12,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 21:14:12,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 21:14:12,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 267 transitions. [2023-08-26 21:14:12,621 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46842105263157896 [2023-08-26 21:14:12,621 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 267 transitions. [2023-08-26 21:14:12,621 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 267 transitions. [2023-08-26 21:14:12,621 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:14:12,621 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 267 transitions. [2023-08-26 21:14:12,622 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 89.0) internal successors, (267), 3 states have internal predecessors, (267), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:14:12,624 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 190.0) internal successors, (760), 4 states have internal predecessors, (760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:14:12,624 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 190.0) internal successors, (760), 4 states have internal predecessors, (760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:14:12,624 INFO L175 Difference]: Start difference. First operand has 28 places, 21 transitions, 50 flow. Second operand 3 states and 267 transitions. [2023-08-26 21:14:12,624 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 34 transitions, 144 flow [2023-08-26 21:14:12,625 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 34 transitions, 138 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 21:14:12,626 INFO L231 Difference]: Finished difference. Result has 29 places, 23 transitions, 71 flow [2023-08-26 21:14:12,626 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=190, PETRI_DIFFERENCE_MINUEND_FLOW=46, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=71, PETRI_PLACES=29, PETRI_TRANSITIONS=23} [2023-08-26 21:14:12,627 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 0 predicate places. [2023-08-26 21:14:12,627 INFO L495 AbstractCegarLoop]: Abstraction has has 29 places, 23 transitions, 71 flow [2023-08-26 21:14:12,627 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 78.66666666666667) internal successors, (236), 3 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:14:12,627 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:14:12,627 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:14:12,627 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-26 21:14:12,628 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-26 21:14:12,628 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:14:12,628 INFO L85 PathProgramCache]: Analyzing trace with hash -2124826592, now seen corresponding path program 1 times [2023-08-26 21:14:12,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:14:12,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098103834] [2023-08-26 21:14:12,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:14:12,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:14:12,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:14:12,787 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 21:14:12,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:14:12,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1098103834] [2023-08-26 21:14:12,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1098103834] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:14:12,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:14:12,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 21:14:12,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512176198] [2023-08-26 21:14:12,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:14:12,788 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 21:14:12,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:14:12,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 21:14:12,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 21:14:12,790 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 190 [2023-08-26 21:14:12,790 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 23 transitions, 71 flow. Second operand has 3 states, 3 states have (on average 78.33333333333333) internal successors, (235), 3 states have internal predecessors, (235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:14:12,790 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:14:12,790 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 190 [2023-08-26 21:14:12,790 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:14:12,865 INFO L124 PetriNetUnfolderBase]: 228/407 cut-off events. [2023-08-26 21:14:12,865 INFO L125 PetriNetUnfolderBase]: For 21/21 co-relation queries the response was YES. [2023-08-26 21:14:12,866 INFO L83 FinitePrefix]: Finished finitePrefix Result has 945 conditions, 407 events. 228/407 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1546 event pairs, 77 based on Foata normal form. 0/367 useless extension candidates. Maximal degree in co-relation 934. Up to 380 conditions per place. [2023-08-26 21:14:12,868 INFO L140 encePairwiseOnDemand]: 186/190 looper letters, 26 selfloop transitions, 3 changer transitions 0/31 dead transitions. [2023-08-26 21:14:12,868 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 31 transitions, 147 flow [2023-08-26 21:14:12,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 21:14:12,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 21:14:12,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 256 transitions. [2023-08-26 21:14:12,869 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44912280701754387 [2023-08-26 21:14:12,869 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 256 transitions. [2023-08-26 21:14:12,870 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 256 transitions. [2023-08-26 21:14:12,870 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:14:12,870 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 256 transitions. [2023-08-26 21:14:12,871 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 85.33333333333333) internal successors, (256), 3 states have internal predecessors, (256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:14:12,872 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 190.0) internal successors, (760), 4 states have internal predecessors, (760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:14:12,872 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 190.0) internal successors, (760), 4 states have internal predecessors, (760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:14:12,872 INFO L175 Difference]: Start difference. First operand has 29 places, 23 transitions, 71 flow. Second operand 3 states and 256 transitions. [2023-08-26 21:14:12,873 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 31 transitions, 147 flow [2023-08-26 21:14:12,874 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 31 transitions, 144 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 21:14:12,874 INFO L231 Difference]: Finished difference. Result has 31 places, 25 transitions, 87 flow [2023-08-26 21:14:12,874 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=190, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=87, PETRI_PLACES=31, PETRI_TRANSITIONS=25} [2023-08-26 21:14:12,875 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 2 predicate places. [2023-08-26 21:14:12,875 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 25 transitions, 87 flow [2023-08-26 21:14:12,875 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 78.33333333333333) internal successors, (235), 3 states have internal predecessors, (235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:14:12,875 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:14:12,876 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:14:12,876 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-26 21:14:12,876 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2023-08-26 21:14:12,876 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:14:12,877 INFO L85 PathProgramCache]: Analyzing trace with hash -1445116660, now seen corresponding path program 1 times [2023-08-26 21:14:12,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:14:12,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632795798] [2023-08-26 21:14:12,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:14:12,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:14:12,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:14:12,981 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 21:14:12,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:14:12,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [632795798] [2023-08-26 21:14:12,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [632795798] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:14:12,982 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:14:12,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 21:14:12,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403813744] [2023-08-26 21:14:12,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:14:12,983 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 21:14:12,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:14:12,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 21:14:12,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 21:14:12,984 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 190 [2023-08-26 21:14:12,984 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 25 transitions, 87 flow. Second operand has 3 states, 3 states have (on average 80.66666666666667) internal successors, (242), 3 states have internal predecessors, (242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:14:12,984 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:14:12,985 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 190 [2023-08-26 21:14:12,985 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:14:13,056 INFO L124 PetriNetUnfolderBase]: 189/355 cut-off events. [2023-08-26 21:14:13,056 INFO L125 PetriNetUnfolderBase]: For 69/70 co-relation queries the response was YES. [2023-08-26 21:14:13,057 INFO L83 FinitePrefix]: Finished finitePrefix Result has 844 conditions, 355 events. 189/355 cut-off events. For 69/70 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1380 event pairs, 59 based on Foata normal form. 8/352 useless extension candidates. Maximal degree in co-relation 831. Up to 254 conditions per place. [2023-08-26 21:14:13,058 INFO L140 encePairwiseOnDemand]: 187/190 looper letters, 25 selfloop transitions, 2 changer transitions 0/31 dead transitions. [2023-08-26 21:14:13,058 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 31 transitions, 155 flow [2023-08-26 21:14:13,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 21:14:13,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 21:14:13,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 259 transitions. [2023-08-26 21:14:13,060 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4543859649122807 [2023-08-26 21:14:13,060 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 259 transitions. [2023-08-26 21:14:13,060 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 259 transitions. [2023-08-26 21:14:13,060 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:14:13,060 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 259 transitions. [2023-08-26 21:14:13,061 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 86.33333333333333) internal successors, (259), 3 states have internal predecessors, (259), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:14:13,062 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 190.0) internal successors, (760), 4 states have internal predecessors, (760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:14:13,063 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 190.0) internal successors, (760), 4 states have internal predecessors, (760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:14:13,063 INFO L175 Difference]: Start difference. First operand has 31 places, 25 transitions, 87 flow. Second operand 3 states and 259 transitions. [2023-08-26 21:14:13,063 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 31 transitions, 155 flow [2023-08-26 21:14:13,064 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 31 transitions, 152 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 21:14:13,064 INFO L231 Difference]: Finished difference. Result has 33 places, 25 transitions, 92 flow [2023-08-26 21:14:13,065 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=190, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=92, PETRI_PLACES=33, PETRI_TRANSITIONS=25} [2023-08-26 21:14:13,065 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 4 predicate places. [2023-08-26 21:14:13,065 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 25 transitions, 92 flow [2023-08-26 21:14:13,066 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 80.66666666666667) internal successors, (242), 3 states have internal predecessors, (242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:14:13,066 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:14:13,066 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:14:13,066 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-26 21:14:13,066 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2023-08-26 21:14:13,066 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:14:13,067 INFO L85 PathProgramCache]: Analyzing trace with hash -1900955095, now seen corresponding path program 1 times [2023-08-26 21:14:13,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:14:13,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805387937] [2023-08-26 21:14:13,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:14:13,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:14:13,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:14:13,191 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 21:14:13,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:14:13,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1805387937] [2023-08-26 21:14:13,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1805387937] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:14:13,192 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:14:13,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 21:14:13,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080677491] [2023-08-26 21:14:13,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:14:13,193 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 21:14:13,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:14:13,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 21:14:13,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 21:14:13,194 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 190 [2023-08-26 21:14:13,194 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 25 transitions, 92 flow. Second operand has 4 states, 4 states have (on average 75.0) internal successors, (300), 4 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:14:13,195 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:14:13,195 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 190 [2023-08-26 21:14:13,195 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:14:13,301 INFO L124 PetriNetUnfolderBase]: 89/211 cut-off events. [2023-08-26 21:14:13,301 INFO L125 PetriNetUnfolderBase]: For 48/49 co-relation queries the response was YES. [2023-08-26 21:14:13,302 INFO L83 FinitePrefix]: Finished finitePrefix Result has 536 conditions, 211 events. 89/211 cut-off events. For 48/49 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 826 event pairs, 30 based on Foata normal form. 28/214 useless extension candidates. Maximal degree in co-relation 521. Up to 118 conditions per place. [2023-08-26 21:14:13,303 INFO L140 encePairwiseOnDemand]: 185/190 looper letters, 41 selfloop transitions, 6 changer transitions 2/52 dead transitions. [2023-08-26 21:14:13,303 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 52 transitions, 270 flow [2023-08-26 21:14:13,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 21:14:13,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 21:14:13,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 414 transitions. [2023-08-26 21:14:13,305 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4357894736842105 [2023-08-26 21:14:13,305 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 414 transitions. [2023-08-26 21:14:13,305 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 414 transitions. [2023-08-26 21:14:13,305 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:14:13,305 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 414 transitions. [2023-08-26 21:14:13,306 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 82.8) internal successors, (414), 5 states have internal predecessors, (414), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:14:13,308 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 190.0) internal successors, (1140), 6 states have internal predecessors, (1140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:14:13,309 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 190.0) internal successors, (1140), 6 states have internal predecessors, (1140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:14:13,309 INFO L175 Difference]: Start difference. First operand has 33 places, 25 transitions, 92 flow. Second operand 5 states and 414 transitions. [2023-08-26 21:14:13,309 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 52 transitions, 270 flow [2023-08-26 21:14:13,310 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 52 transitions, 266 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 21:14:13,311 INFO L231 Difference]: Finished difference. Result has 38 places, 28 transitions, 125 flow [2023-08-26 21:14:13,311 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=190, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=125, PETRI_PLACES=38, PETRI_TRANSITIONS=28} [2023-08-26 21:14:13,312 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 9 predicate places. [2023-08-26 21:14:13,312 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 28 transitions, 125 flow [2023-08-26 21:14:13,312 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 75.0) internal successors, (300), 4 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:14:13,312 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:14:13,312 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:14:13,313 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-26 21:14:13,313 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-26 21:14:13,313 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:14:13,313 INFO L85 PathProgramCache]: Analyzing trace with hash -680861712, now seen corresponding path program 1 times [2023-08-26 21:14:13,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:14:13,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142455859] [2023-08-26 21:14:13,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:14:13,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:14:13,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:14:13,521 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 21:14:13,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:14:13,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142455859] [2023-08-26 21:14:13,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [142455859] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:14:13,522 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:14:13,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 21:14:13,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309043574] [2023-08-26 21:14:13,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:14:13,523 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 21:14:13,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:14:13,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 21:14:13,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-26 21:14:13,524 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 190 [2023-08-26 21:14:13,525 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 28 transitions, 125 flow. Second operand has 5 states, 5 states have (on average 75.2) internal successors, (376), 5 states have internal predecessors, (376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:14:13,525 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:14:13,525 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 190 [2023-08-26 21:14:13,525 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:14:13,635 INFO L124 PetriNetUnfolderBase]: 53/135 cut-off events. [2023-08-26 21:14:13,635 INFO L125 PetriNetUnfolderBase]: For 115/116 co-relation queries the response was YES. [2023-08-26 21:14:13,636 INFO L83 FinitePrefix]: Finished finitePrefix Result has 414 conditions, 135 events. 53/135 cut-off events. For 115/116 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 461 event pairs, 10 based on Foata normal form. 11/139 useless extension candidates. Maximal degree in co-relation 396. Up to 37 conditions per place. [2023-08-26 21:14:13,637 INFO L140 encePairwiseOnDemand]: 183/190 looper letters, 34 selfloop transitions, 9 changer transitions 3/49 dead transitions. [2023-08-26 21:14:13,637 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 49 transitions, 275 flow [2023-08-26 21:14:13,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-26 21:14:13,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-26 21:14:13,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 561 transitions. [2023-08-26 21:14:13,639 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4218045112781955 [2023-08-26 21:14:13,639 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 561 transitions. [2023-08-26 21:14:13,639 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 561 transitions. [2023-08-26 21:14:13,640 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:14:13,640 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 561 transitions. [2023-08-26 21:14:13,641 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 80.14285714285714) internal successors, (561), 7 states have internal predecessors, (561), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:14:13,643 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 190.0) internal successors, (1520), 8 states have internal predecessors, (1520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:14:13,644 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 190.0) internal successors, (1520), 8 states have internal predecessors, (1520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:14:13,644 INFO L175 Difference]: Start difference. First operand has 38 places, 28 transitions, 125 flow. Second operand 7 states and 561 transitions. [2023-08-26 21:14:13,644 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 49 transitions, 275 flow [2023-08-26 21:14:13,645 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 49 transitions, 261 flow, removed 2 selfloop flow, removed 3 redundant places. [2023-08-26 21:14:13,646 INFO L231 Difference]: Finished difference. Result has 42 places, 26 transitions, 137 flow [2023-08-26 21:14:13,646 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=190, PETRI_DIFFERENCE_MINUEND_FLOW=103, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=137, PETRI_PLACES=42, PETRI_TRANSITIONS=26} [2023-08-26 21:14:13,647 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 13 predicate places. [2023-08-26 21:14:13,647 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 26 transitions, 137 flow [2023-08-26 21:14:13,647 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 75.2) internal successors, (376), 5 states have internal predecessors, (376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:14:13,647 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:14:13,648 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:14:13,648 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-26 21:14:13,648 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2023-08-26 21:14:13,648 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:14:13,648 INFO L85 PathProgramCache]: Analyzing trace with hash 1027244749, now seen corresponding path program 1 times [2023-08-26 21:14:13,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:14:13,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393512748] [2023-08-26 21:14:13,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:14:13,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:14:13,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:14:13,712 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 21:14:13,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:14:13,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393512748] [2023-08-26 21:14:13,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [393512748] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:14:13,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:14:13,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 21:14:13,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448576601] [2023-08-26 21:14:13,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:14:13,714 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 21:14:13,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:14:13,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 21:14:13,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 21:14:13,715 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 190 [2023-08-26 21:14:13,716 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 26 transitions, 137 flow. Second operand has 4 states, 4 states have (on average 79.75) internal successors, (319), 4 states have internal predecessors, (319), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:14:13,716 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:14:13,716 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 190 [2023-08-26 21:14:13,716 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:14:13,778 INFO L124 PetriNetUnfolderBase]: 49/124 cut-off events. [2023-08-26 21:14:13,778 INFO L125 PetriNetUnfolderBase]: For 205/206 co-relation queries the response was YES. [2023-08-26 21:14:13,778 INFO L83 FinitePrefix]: Finished finitePrefix Result has 420 conditions, 124 events. 49/124 cut-off events. For 205/206 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 421 event pairs, 30 based on Foata normal form. 6/127 useless extension candidates. Maximal degree in co-relation 401. Up to 67 conditions per place. [2023-08-26 21:14:13,779 INFO L140 encePairwiseOnDemand]: 185/190 looper letters, 23 selfloop transitions, 4 changer transitions 1/31 dead transitions. [2023-08-26 21:14:13,779 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 31 transitions, 203 flow [2023-08-26 21:14:13,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 21:14:13,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 21:14:13,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 334 transitions. [2023-08-26 21:14:13,781 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4394736842105263 [2023-08-26 21:14:13,781 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 334 transitions. [2023-08-26 21:14:13,781 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 334 transitions. [2023-08-26 21:14:13,781 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:14:13,781 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 334 transitions. [2023-08-26 21:14:13,782 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 83.5) internal successors, (334), 4 states have internal predecessors, (334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:14:13,783 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 190.0) internal successors, (950), 5 states have internal predecessors, (950), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:14:13,783 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 190.0) internal successors, (950), 5 states have internal predecessors, (950), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:14:13,783 INFO L175 Difference]: Start difference. First operand has 42 places, 26 transitions, 137 flow. Second operand 4 states and 334 transitions. [2023-08-26 21:14:13,783 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 31 transitions, 203 flow [2023-08-26 21:14:13,785 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 31 transitions, 176 flow, removed 5 selfloop flow, removed 6 redundant places. [2023-08-26 21:14:13,786 INFO L231 Difference]: Finished difference. Result has 35 places, 23 transitions, 103 flow [2023-08-26 21:14:13,786 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=190, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=103, PETRI_PLACES=35, PETRI_TRANSITIONS=23} [2023-08-26 21:14:13,786 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 6 predicate places. [2023-08-26 21:14:13,787 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 23 transitions, 103 flow [2023-08-26 21:14:13,787 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 79.75) internal successors, (319), 4 states have internal predecessors, (319), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:14:13,787 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:14:13,787 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:14:13,787 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-26 21:14:13,787 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-26 21:14:13,788 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:14:13,788 INFO L85 PathProgramCache]: Analyzing trace with hash 1008705195, now seen corresponding path program 1 times [2023-08-26 21:14:13,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:14:13,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394155902] [2023-08-26 21:14:13,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:14:13,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:14:13,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:14:14,218 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 21:14:14,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:14:14,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394155902] [2023-08-26 21:14:14,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [394155902] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:14:14,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:14:14,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 21:14:14,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195695985] [2023-08-26 21:14:14,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:14:14,219 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 21:14:14,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:14:14,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 21:14:14,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-26 21:14:14,220 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 190 [2023-08-26 21:14:14,221 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 23 transitions, 103 flow. Second operand has 5 states, 5 states have (on average 77.8) internal successors, (389), 5 states have internal predecessors, (389), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:14:14,221 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:14:14,221 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 190 [2023-08-26 21:14:14,221 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:14:14,341 INFO L124 PetriNetUnfolderBase]: 66/177 cut-off events. [2023-08-26 21:14:14,342 INFO L125 PetriNetUnfolderBase]: For 197/197 co-relation queries the response was YES. [2023-08-26 21:14:14,342 INFO L83 FinitePrefix]: Finished finitePrefix Result has 551 conditions, 177 events. 66/177 cut-off events. For 197/197 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 773 event pairs, 16 based on Foata normal form. 1/177 useless extension candidates. Maximal degree in co-relation 534. Up to 73 conditions per place. [2023-08-26 21:14:14,343 INFO L140 encePairwiseOnDemand]: 184/190 looper letters, 27 selfloop transitions, 6 changer transitions 24/60 dead transitions. [2023-08-26 21:14:14,343 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 60 transitions, 412 flow [2023-08-26 21:14:14,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-26 21:14:14,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-26 21:14:14,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 489 transitions. [2023-08-26 21:14:14,345 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42894736842105263 [2023-08-26 21:14:14,345 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 489 transitions. [2023-08-26 21:14:14,345 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 489 transitions. [2023-08-26 21:14:14,345 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:14:14,346 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 489 transitions. [2023-08-26 21:14:14,347 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 81.5) internal successors, (489), 6 states have internal predecessors, (489), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:14:14,348 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 190.0) internal successors, (1330), 7 states have internal predecessors, (1330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:14:14,349 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 190.0) internal successors, (1330), 7 states have internal predecessors, (1330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:14:14,349 INFO L175 Difference]: Start difference. First operand has 35 places, 23 transitions, 103 flow. Second operand 6 states and 489 transitions. [2023-08-26 21:14:14,349 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 60 transitions, 412 flow [2023-08-26 21:14:14,350 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 60 transitions, 398 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 21:14:14,351 INFO L231 Difference]: Finished difference. Result has 41 places, 26 transitions, 129 flow [2023-08-26 21:14:14,351 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=190, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=129, PETRI_PLACES=41, PETRI_TRANSITIONS=26} [2023-08-26 21:14:14,352 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 12 predicate places. [2023-08-26 21:14:14,352 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 26 transitions, 129 flow [2023-08-26 21:14:14,352 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 77.8) internal successors, (389), 5 states have internal predecessors, (389), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:14:14,353 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:14:14,353 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:14:14,353 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-26 21:14:14,353 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2023-08-26 21:14:14,353 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:14:14,353 INFO L85 PathProgramCache]: Analyzing trace with hash -785822545, now seen corresponding path program 2 times [2023-08-26 21:14:14,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:14:14,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13922003] [2023-08-26 21:14:14,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:14:14,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:14:14,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-26 21:14:14,431 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-26 21:14:14,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-26 21:14:14,510 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-26 21:14:14,510 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-26 21:14:14,511 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONASSERT (12 of 13 remaining) [2023-08-26 21:14:14,512 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONASSERT (11 of 13 remaining) [2023-08-26 21:14:14,512 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 13 remaining) [2023-08-26 21:14:14,513 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 13 remaining) [2023-08-26 21:14:14,513 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 13 remaining) [2023-08-26 21:14:14,515 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 13 remaining) [2023-08-26 21:14:14,515 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 13 remaining) [2023-08-26 21:14:14,515 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 13 remaining) [2023-08-26 21:14:14,516 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONASSERT (4 of 13 remaining) [2023-08-26 21:14:14,517 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 13 remaining) [2023-08-26 21:14:14,517 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 13 remaining) [2023-08-26 21:14:14,517 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 13 remaining) [2023-08-26 21:14:14,517 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 13 remaining) [2023-08-26 21:14:14,517 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-26 21:14:14,518 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:14:14,524 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-26 21:14:14,524 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-26 21:14:14,587 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.08 09:14:14 BasicIcfg [2023-08-26 21:14:14,587 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-26 21:14:14,588 INFO L158 Benchmark]: Toolchain (without parser) took 7349.55ms. Allocated memory was 356.5MB in the beginning and 513.8MB in the end (delta: 157.3MB). Free memory was 330.5MB in the beginning and 461.9MB in the end (delta: -131.4MB). Peak memory consumption was 26.0MB. Max. memory is 16.0GB. [2023-08-26 21:14:14,589 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 356.5MB. Free memory was 333.4MB in the beginning and 333.2MB in the end (delta: 169.9kB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-26 21:14:14,590 INFO L158 Benchmark]: CACSL2BoogieTranslator took 546.96ms. Allocated memory is still 356.5MB. Free memory was 330.5MB in the beginning and 307.6MB in the end (delta: 22.8MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. [2023-08-26 21:14:14,590 INFO L158 Benchmark]: Boogie Procedure Inliner took 69.85ms. Allocated memory is still 356.5MB. Free memory was 307.6MB in the beginning and 305.7MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-26 21:14:14,590 INFO L158 Benchmark]: Boogie Preprocessor took 37.54ms. Allocated memory is still 356.5MB. Free memory was 305.7MB in the beginning and 303.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-26 21:14:14,591 INFO L158 Benchmark]: RCFGBuilder took 617.68ms. Allocated memory is still 356.5MB. Free memory was 303.6MB in the beginning and 267.9MB in the end (delta: 35.7MB). Peak memory consumption was 35.7MB. Max. memory is 16.0GB. [2023-08-26 21:14:14,591 INFO L158 Benchmark]: TraceAbstraction took 6072.38ms. Allocated memory was 356.5MB in the beginning and 513.8MB in the end (delta: 157.3MB). Free memory was 267.9MB in the beginning and 461.9MB in the end (delta: -194.0MB). There was no memory consumed. Max. memory is 16.0GB. [2023-08-26 21:14:14,595 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 356.5MB. Free memory was 333.4MB in the beginning and 333.2MB in the end (delta: 169.9kB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 546.96ms. Allocated memory is still 356.5MB. Free memory was 330.5MB in the beginning and 307.6MB in the end (delta: 22.8MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 69.85ms. Allocated memory is still 356.5MB. Free memory was 307.6MB in the beginning and 305.7MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 37.54ms. Allocated memory is still 356.5MB. Free memory was 305.7MB in the beginning and 303.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 617.68ms. Allocated memory is still 356.5MB. Free memory was 303.6MB in the beginning and 267.9MB in the end (delta: 35.7MB). Peak memory consumption was 35.7MB. Max. memory is 16.0GB. * TraceAbstraction took 6072.38ms. Allocated memory was 356.5MB in the beginning and 513.8MB in the end (delta: 157.3MB). Free memory was 267.9MB in the beginning and 461.9MB in the end (delta: -194.0MB). There was no memory consumed. 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.2s, 99 PlacesBefore, 29 PlacesAfterwards, 95 TransitionsBefore, 23 TransitionsAfterwards, 1580 CoEnabledTransitionPairs, 7 FixpointIterations, 35 TrivialSequentialCompositions, 44 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 12 ConcurrentYvCompositions, 2 ChoiceCompositions, 93 TotalNumberOfCompositions, 5676 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2363, independent: 2137, independent conditional: 0, independent unconditional: 2137, dependent: 226, dependent conditional: 0, dependent unconditional: 226, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 967, independent: 922, independent conditional: 0, independent unconditional: 922, dependent: 45, dependent conditional: 0, dependent unconditional: 45, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2363, independent: 1215, independent conditional: 0, independent unconditional: 1215, dependent: 181, dependent conditional: 0, dependent unconditional: 181, unknown: 967, unknown conditional: 0, unknown unconditional: 967] , Statistics on independence cache: Total cache size (in pairs): 87, Positive cache size: 68, Positive conditional cache size: 0, Positive unconditional cache size: 68, Negative cache size: 19, Negative conditional cache size: 0, Negative unconditional cache size: 19, 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; [L810] 0 pthread_t t585; [L811] FCALL, FORK 0 pthread_create(&t585, ((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(&t585, ((void *)0), P0, ((void *)0))=-1, t585={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] [L812] 0 pthread_t t586; [L813] FCALL, FORK 0 pthread_create(&t586, ((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(&t586, ((void *)0), P1, ((void *)0))=0, t585={5:0}, t586={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 = 1 [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=1, 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=1, 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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L769] 2 __unbuffered_p1_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [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_EBX = 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=2, __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=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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L788] 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) [L789] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L790] 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 [L791] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L792] 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=2, __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=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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L795] EXPR 2 __unbuffered_cnt + 1 [L795] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L797] 2 return 0; [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 [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, 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=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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L759] EXPR 1 __unbuffered_cnt + 1 [L759] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L761] 1 return 0; [L815] 0 main$tmp_guard0 = __unbuffered_cnt == 2 [L817] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L817] RET 0 assume_abort_if_not(main$tmp_guard0) [L819] 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) [L820] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L821] 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 [L822] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L823] 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=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t585={5:0}, t586={3:0}, weak$$choice2=1, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L826] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 2 && __unbuffered_p1_EBX == 0) [L828] 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", "mix022_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\read(__PRETTY_FUNCTION__)={65:66}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] - 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: 795]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 795]: 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 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: 813]: 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, 119 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: 5.9s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 99 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 99 mSDsluCounter, 11 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2 mSDsCounter, 16 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 431 IncrementalHoareTripleChecker+Invalid, 447 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 16 mSolverCounterUnsat, 9 mSDtfsCounter, 431 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=137occurred in iteration=6, InterpolantAutomatonStates: 34, 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, 1.2s InterpolantComputationTime, 90 NumberOfCodeBlocks, 90 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 66 ConstructedInterpolants, 0 QuantifiedInterpolants, 238 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-08-26 21:14:14,618 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...