/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf --traceabstraction.order.of.the.error.locations.to.be.checked INSUFFICIENT_FIRST -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --cacsl2boogietranslator.check.absence.of.signed.integer.overflows true -i ../../../trunk/examples/svcomp/pthread-wmm/safe029_power.oepc_pso.oepc_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-27 03:58:10,885 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-27 03:58:10,921 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf [2023-08-27 03:58:10,924 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-27 03:58:10,924 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-27 03:58:10,938 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-27 03:58:10,939 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-27 03:58:10,939 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-27 03:58:10,939 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-27 03:58:10,939 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-27 03:58:10,940 INFO L153 SettingsManager]: * Use SBE=true [2023-08-27 03:58:10,940 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-27 03:58:10,940 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-27 03:58:10,940 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-27 03:58:10,941 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-27 03:58:10,941 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-27 03:58:10,941 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-27 03:58:10,941 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-27 03:58:10,941 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-27 03:58:10,942 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-27 03:58:10,942 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-27 03:58:10,942 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-27 03:58:10,942 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-27 03:58:10,942 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-27 03:58:10,943 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-27 03:58:10,943 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-27 03:58:10,943 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-27 03:58:10,943 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-27 03:58:10,943 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-27 03:58:10,944 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-27 03:58:10,944 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-27 03:58:10,944 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-27 03:58:10,944 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-27 03:58:10,944 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-27 03:58:10,944 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-27 03:58:10,944 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Order of the error locations to be checked -> INSUFFICIENT_FIRST Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check absence of signed integer overflows -> true [2023-08-27 03:58:11,208 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-27 03:58:11,245 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-27 03:58:11,247 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-27 03:58:11,248 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-27 03:58:11,249 INFO L274 PluginConnector]: CDTParser initialized [2023-08-27 03:58:11,250 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe029_power.oepc_pso.oepc_rmo.oepc.i [2023-08-27 03:58:12,274 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-27 03:58:12,457 INFO L384 CDTParser]: Found 1 translation units. [2023-08-27 03:58:12,457 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe029_power.oepc_pso.oepc_rmo.oepc.i [2023-08-27 03:58:12,474 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4f51e3b16/6b1c89871803412b9ba4eb0f91026733/FLAG4e853aa10 [2023-08-27 03:58:12,484 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4f51e3b16/6b1c89871803412b9ba4eb0f91026733 [2023-08-27 03:58:12,486 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-27 03:58:12,487 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-27 03:58:12,488 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-27 03:58:12,488 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-27 03:58:12,490 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-27 03:58:12,490 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 03:58:12" (1/1) ... [2023-08-27 03:58:12,491 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@67967956 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:58:12, skipping insertion in model container [2023-08-27 03:58:12,491 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 03:58:12" (1/1) ... [2023-08-27 03:58:12,525 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-27 03:58:12,786 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-27 03:58:12,796 INFO L201 MainTranslator]: Completed pre-run [2023-08-27 03:58:12,810 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-27 03:58:12,812 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-27 03:58:12,833 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-27 03:58:12,862 WARN L669 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-27 03:58:12,863 WARN L669 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-27 03:58:12,868 INFO L206 MainTranslator]: Completed translation [2023-08-27 03:58:12,868 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:58:12 WrapperNode [2023-08-27 03:58:12,869 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-27 03:58:12,871 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-27 03:58:12,871 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-27 03:58:12,871 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-27 03:58:12,876 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:58:12" (1/1) ... [2023-08-27 03:58:12,888 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:58:12" (1/1) ... [2023-08-27 03:58:12,907 INFO L138 Inliner]: procedures = 175, calls = 42, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 136 [2023-08-27 03:58:12,907 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-27 03:58:12,908 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-27 03:58:12,908 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-27 03:58:12,908 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-27 03:58:12,920 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:58:12" (1/1) ... [2023-08-27 03:58:12,921 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:58:12" (1/1) ... [2023-08-27 03:58:12,931 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:58:12" (1/1) ... [2023-08-27 03:58:12,932 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:58:12" (1/1) ... [2023-08-27 03:58:12,936 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:58:12" (1/1) ... [2023-08-27 03:58:12,938 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:58:12" (1/1) ... [2023-08-27 03:58:12,939 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:58:12" (1/1) ... [2023-08-27 03:58:12,940 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:58:12" (1/1) ... [2023-08-27 03:58:12,942 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-27 03:58:12,943 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-27 03:58:12,943 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-27 03:58:12,943 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-27 03:58:12,943 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:58:12" (1/1) ... [2023-08-27 03:58:12,962 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-27 03:58:12,969 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 03:58:12,992 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-27 03:58:12,998 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-27 03:58:13,034 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-27 03:58:13,034 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-27 03:58:13,035 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-27 03:58:13,035 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-27 03:58:13,035 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-27 03:58:13,035 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-27 03:58:13,035 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-27 03:58:13,035 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-27 03:58:13,035 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-27 03:58:13,035 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-27 03:58:13,035 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-27 03:58:13,036 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-27 03:58:13,036 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-27 03:58:13,037 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-27 03:58:13,137 INFO L236 CfgBuilder]: Building ICFG [2023-08-27 03:58:13,138 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-27 03:58:13,385 INFO L277 CfgBuilder]: Performing block encoding [2023-08-27 03:58:13,555 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-27 03:58:13,556 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-27 03:58:13,557 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 03:58:13 BoogieIcfgContainer [2023-08-27 03:58:13,557 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-27 03:58:13,559 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-27 03:58:13,559 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-27 03:58:13,561 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-27 03:58:13,562 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.08 03:58:12" (1/3) ... [2023-08-27 03:58:13,563 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a3f288 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.08 03:58:13, skipping insertion in model container [2023-08-27 03:58:13,563 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:58:12" (2/3) ... [2023-08-27 03:58:13,563 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a3f288 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.08 03:58:13, skipping insertion in model container [2023-08-27 03:58:13,563 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 03:58:13" (3/3) ... [2023-08-27 03:58:13,564 INFO L112 eAbstractionObserver]: Analyzing ICFG safe029_power.oepc_pso.oepc_rmo.oepc.i [2023-08-27 03:58:13,576 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-27 03:58:13,577 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2023-08-27 03:58:13,577 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-27 03:58:13,617 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-27 03:58:13,646 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 98 places, 94 transitions, 198 flow [2023-08-27 03:58:13,690 INFO L124 PetriNetUnfolderBase]: 3/92 cut-off events. [2023-08-27 03:58:13,690 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-27 03:58:13,694 INFO L83 FinitePrefix]: Finished finitePrefix Result has 99 conditions, 92 events. 3/92 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 64 event pairs, 0 based on Foata normal form. 0/83 useless extension candidates. Maximal degree in co-relation 59. Up to 2 conditions per place. [2023-08-27 03:58:13,694 INFO L82 GeneralOperation]: Start removeDead. Operand has 98 places, 94 transitions, 198 flow [2023-08-27 03:58:13,697 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 96 places, 92 transitions, 190 flow [2023-08-27 03:58:13,700 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-27 03:58:13,710 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 96 places, 92 transitions, 190 flow [2023-08-27 03:58:13,713 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 96 places, 92 transitions, 190 flow [2023-08-27 03:58:13,714 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 96 places, 92 transitions, 190 flow [2023-08-27 03:58:13,731 INFO L124 PetriNetUnfolderBase]: 3/92 cut-off events. [2023-08-27 03:58:13,731 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-27 03:58:13,731 INFO L83 FinitePrefix]: Finished finitePrefix Result has 99 conditions, 92 events. 3/92 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 64 event pairs, 0 based on Foata normal form. 0/83 useless extension candidates. Maximal degree in co-relation 59. Up to 2 conditions per place. [2023-08-27 03:58:13,732 INFO L119 LiptonReduction]: Number of co-enabled transitions 1498 [2023-08-27 03:58:16,165 INFO L134 LiptonReduction]: Checked pairs total: 4956 [2023-08-27 03:58:16,165 INFO L136 LiptonReduction]: Total number of compositions: 88 [2023-08-27 03:58:16,177 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-27 03:58:16,200 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;@58a3d276, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-27 03:58:16,200 INFO L358 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2023-08-27 03:58:16,202 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-27 03:58:16,202 INFO L124 PetriNetUnfolderBase]: 0/3 cut-off events. [2023-08-27 03:58:16,202 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-27 03:58:16,202 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:58:16,203 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-27 03:58:16,203 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2023-08-27 03:58:16,206 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:58:16,207 INFO L85 PathProgramCache]: Analyzing trace with hash 450062, now seen corresponding path program 1 times [2023-08-27 03:58:16,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:58:16,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839423942] [2023-08-27 03:58:16,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:58:16,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:58:16,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:58:16,461 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 03:58:16,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:58:16,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839423942] [2023-08-27 03:58:16,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [839423942] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:58:16,463 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:58:16,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-27 03:58:16,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798575963] [2023-08-27 03:58:16,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:58:16,469 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-27 03:58:16,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:58:16,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-27 03:58:16,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-27 03:58:16,490 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 182 [2023-08-27 03:58:16,491 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 24 transitions, 54 flow. Second operand has 3 states, 3 states have (on average 78.0) internal successors, (234), 3 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:58:16,492 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:58:16,492 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 182 [2023-08-27 03:58:16,492 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:58:16,600 INFO L124 PetriNetUnfolderBase]: 264/512 cut-off events. [2023-08-27 03:58:16,600 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-08-27 03:58:16,601 INFO L83 FinitePrefix]: Finished finitePrefix Result has 978 conditions, 512 events. 264/512 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2483 event pairs, 87 based on Foata normal form. 25/413 useless extension candidates. Maximal degree in co-relation 968. Up to 389 conditions per place. [2023-08-27 03:58:16,604 INFO L140 encePairwiseOnDemand]: 178/182 looper letters, 28 selfloop transitions, 2 changer transitions 0/34 dead transitions. [2023-08-27 03:58:16,604 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 34 transitions, 137 flow [2023-08-27 03:58:16,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-27 03:58:16,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-27 03:58:16,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 264 transitions. [2023-08-27 03:58:16,613 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4835164835164835 [2023-08-27 03:58:16,613 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 264 transitions. [2023-08-27 03:58:16,614 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 264 transitions. [2023-08-27 03:58:16,615 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:58:16,616 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 264 transitions. [2023-08-27 03:58:16,618 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 88.0) internal successors, (264), 3 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:58:16,620 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 182.0) internal successors, (728), 4 states have internal predecessors, (728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:58:16,621 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 182.0) internal successors, (728), 4 states have internal predecessors, (728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:58:16,622 INFO L175 Difference]: Start difference. First operand has 30 places, 24 transitions, 54 flow. Second operand 3 states and 264 transitions. [2023-08-27 03:58:16,623 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 34 transitions, 137 flow [2023-08-27 03:58:16,624 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 34 transitions, 134 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-27 03:58:16,625 INFO L231 Difference]: Finished difference. Result has 29 places, 22 transitions, 52 flow [2023-08-27 03:58:16,626 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=48, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=52, PETRI_PLACES=29, PETRI_TRANSITIONS=22} [2023-08-27 03:58:16,628 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, -1 predicate places. [2023-08-27 03:58:16,628 INFO L495 AbstractCegarLoop]: Abstraction has has 29 places, 22 transitions, 52 flow [2023-08-27 03:58:16,628 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 78.0) internal successors, (234), 3 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:58:16,628 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:58:16,628 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-08-27 03:58:16,629 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-27 03:58:16,629 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2023-08-27 03:58:16,629 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:58:16,629 INFO L85 PathProgramCache]: Analyzing trace with hash 523242738, now seen corresponding path program 1 times [2023-08-27 03:58:16,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:58:16,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051924728] [2023-08-27 03:58:16,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:58:16,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:58:16,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:58:16,667 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 03:58:16,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:58:16,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051924728] [2023-08-27 03:58:16,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1051924728] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:58:16,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:58:16,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-27 03:58:16,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763832647] [2023-08-27 03:58:16,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:58:16,669 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-27 03:58:16,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:58:16,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-27 03:58:16,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-27 03:58:16,670 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 182 [2023-08-27 03:58:16,671 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 22 transitions, 52 flow. Second operand has 3 states, 3 states have (on average 75.66666666666667) internal successors, (227), 3 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:58:16,671 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:58:16,671 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 182 [2023-08-27 03:58:16,671 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:58:16,742 INFO L124 PetriNetUnfolderBase]: 183/337 cut-off events. [2023-08-27 03:58:16,742 INFO L125 PetriNetUnfolderBase]: For 29/29 co-relation queries the response was YES. [2023-08-27 03:58:16,742 INFO L83 FinitePrefix]: Finished finitePrefix Result has 713 conditions, 337 events. 183/337 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1405 event pairs, 80 based on Foata normal form. 0/262 useless extension candidates. Maximal degree in co-relation 703. Up to 183 conditions per place. [2023-08-27 03:58:16,743 INFO L140 encePairwiseOnDemand]: 175/182 looper letters, 31 selfloop transitions, 3 changer transitions 0/36 dead transitions. [2023-08-27 03:58:16,744 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 152 flow [2023-08-27 03:58:16,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-27 03:58:16,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-27 03:58:16,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 260 transitions. [2023-08-27 03:58:16,745 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47619047619047616 [2023-08-27 03:58:16,745 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 260 transitions. [2023-08-27 03:58:16,745 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 260 transitions. [2023-08-27 03:58:16,745 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:58:16,746 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 260 transitions. [2023-08-27 03:58:16,746 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 86.66666666666667) internal successors, (260), 3 states have internal predecessors, (260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:58:16,747 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 182.0) internal successors, (728), 4 states have internal predecessors, (728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:58:16,748 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 182.0) internal successors, (728), 4 states have internal predecessors, (728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:58:16,748 INFO L175 Difference]: Start difference. First operand has 29 places, 22 transitions, 52 flow. Second operand 3 states and 260 transitions. [2023-08-27 03:58:16,748 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 152 flow [2023-08-27 03:58:16,748 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 36 transitions, 146 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-27 03:58:16,749 INFO L231 Difference]: Finished difference. Result has 30 places, 24 transitions, 73 flow [2023-08-27 03:58:16,749 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=48, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=73, PETRI_PLACES=30, PETRI_TRANSITIONS=24} [2023-08-27 03:58:16,749 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 0 predicate places. [2023-08-27 03:58:16,749 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 24 transitions, 73 flow [2023-08-27 03:58:16,750 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 75.66666666666667) internal successors, (227), 3 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:58:16,750 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:58:16,750 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:58:16,750 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-27 03:58:16,750 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2023-08-27 03:58:16,750 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:58:16,750 INFO L85 PathProgramCache]: Analyzing trace with hash 1287380188, now seen corresponding path program 1 times [2023-08-27 03:58:16,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:58:16,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908475031] [2023-08-27 03:58:16,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:58:16,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:58:16,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:58:17,265 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 03:58:17,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:58:17,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908475031] [2023-08-27 03:58:17,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [908475031] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:58:17,266 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:58:17,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-27 03:58:17,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65662540] [2023-08-27 03:58:17,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:58:17,266 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-27 03:58:17,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:58:17,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-27 03:58:17,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-27 03:58:17,267 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 182 [2023-08-27 03:58:17,268 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 24 transitions, 73 flow. Second operand has 5 states, 5 states have (on average 66.6) internal successors, (333), 5 states have internal predecessors, (333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:58:17,268 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:58:17,268 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 182 [2023-08-27 03:58:17,268 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:58:17,495 INFO L124 PetriNetUnfolderBase]: 380/678 cut-off events. [2023-08-27 03:58:17,496 INFO L125 PetriNetUnfolderBase]: For 53/55 co-relation queries the response was YES. [2023-08-27 03:58:17,498 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1575 conditions, 678 events. 380/678 cut-off events. For 53/55 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 3012 event pairs, 110 based on Foata normal form. 0/600 useless extension candidates. Maximal degree in co-relation 1564. Up to 444 conditions per place. [2023-08-27 03:58:17,500 INFO L140 encePairwiseOnDemand]: 174/182 looper letters, 49 selfloop transitions, 16 changer transitions 2/69 dead transitions. [2023-08-27 03:58:17,500 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 69 transitions, 321 flow [2023-08-27 03:58:17,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-27 03:58:17,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-27 03:58:17,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 521 transitions. [2023-08-27 03:58:17,502 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4089481946624804 [2023-08-27 03:58:17,502 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 521 transitions. [2023-08-27 03:58:17,503 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 521 transitions. [2023-08-27 03:58:17,503 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:58:17,503 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 521 transitions. [2023-08-27 03:58:17,504 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 74.42857142857143) internal successors, (521), 7 states have internal predecessors, (521), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:58:17,507 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 182.0) internal successors, (1456), 8 states have internal predecessors, (1456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:58:17,507 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 182.0) internal successors, (1456), 8 states have internal predecessors, (1456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:58:17,507 INFO L175 Difference]: Start difference. First operand has 30 places, 24 transitions, 73 flow. Second operand 7 states and 521 transitions. [2023-08-27 03:58:17,507 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 69 transitions, 321 flow [2023-08-27 03:58:17,510 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 69 transitions, 314 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-27 03:58:17,510 INFO L231 Difference]: Finished difference. Result has 39 places, 39 transitions, 175 flow [2023-08-27 03:58:17,511 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=175, PETRI_PLACES=39, PETRI_TRANSITIONS=39} [2023-08-27 03:58:17,512 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 9 predicate places. [2023-08-27 03:58:17,512 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 39 transitions, 175 flow [2023-08-27 03:58:17,512 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 66.6) internal successors, (333), 5 states have internal predecessors, (333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:58:17,512 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:58:17,512 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:58:17,512 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-27 03:58:17,515 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-27 03:58:17,516 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:58:17,516 INFO L85 PathProgramCache]: Analyzing trace with hash 1254087271, now seen corresponding path program 1 times [2023-08-27 03:58:17,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:58:17,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546869656] [2023-08-27 03:58:17,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:58:17,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:58:17,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:58:17,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-27 03:58:17,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:58:17,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546869656] [2023-08-27 03:58:17,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [546869656] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:58:17,982 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:58:17,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-27 03:58:17,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763984044] [2023-08-27 03:58:17,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:58:17,982 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-27 03:58:17,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:58:17,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-27 03:58:17,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-27 03:58:17,985 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 70 out of 182 [2023-08-27 03:58:17,985 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 39 transitions, 175 flow. Second operand has 5 states, 5 states have (on average 71.8) internal successors, (359), 5 states have internal predecessors, (359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:58:17,985 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:58:17,985 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 70 of 182 [2023-08-27 03:58:17,985 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:58:18,144 INFO L124 PetriNetUnfolderBase]: 419/797 cut-off events. [2023-08-27 03:58:18,144 INFO L125 PetriNetUnfolderBase]: For 682/712 co-relation queries the response was YES. [2023-08-27 03:58:18,145 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2362 conditions, 797 events. 419/797 cut-off events. For 682/712 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 4111 event pairs, 136 based on Foata normal form. 46/791 useless extension candidates. Maximal degree in co-relation 2346. Up to 541 conditions per place. [2023-08-27 03:58:18,148 INFO L140 encePairwiseOnDemand]: 177/182 looper letters, 56 selfloop transitions, 7 changer transitions 2/71 dead transitions. [2023-08-27 03:58:18,148 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 71 transitions, 428 flow [2023-08-27 03:58:18,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-27 03:58:18,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-27 03:58:18,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 394 transitions. [2023-08-27 03:58:18,149 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.432967032967033 [2023-08-27 03:58:18,149 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 394 transitions. [2023-08-27 03:58:18,150 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 394 transitions. [2023-08-27 03:58:18,150 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:58:18,150 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 394 transitions. [2023-08-27 03:58:18,151 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 78.8) internal successors, (394), 5 states have internal predecessors, (394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:58:18,152 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 182.0) internal successors, (1092), 6 states have internal predecessors, (1092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:58:18,152 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 182.0) internal successors, (1092), 6 states have internal predecessors, (1092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:58:18,152 INFO L175 Difference]: Start difference. First operand has 39 places, 39 transitions, 175 flow. Second operand 5 states and 394 transitions. [2023-08-27 03:58:18,152 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 71 transitions, 428 flow [2023-08-27 03:58:18,155 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 71 transitions, 428 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-27 03:58:18,156 INFO L231 Difference]: Finished difference. Result has 46 places, 45 transitions, 233 flow [2023-08-27 03:58:18,156 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=175, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=233, PETRI_PLACES=46, PETRI_TRANSITIONS=45} [2023-08-27 03:58:18,156 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 16 predicate places. [2023-08-27 03:58:18,156 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 45 transitions, 233 flow [2023-08-27 03:58:18,157 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 71.8) internal successors, (359), 5 states have internal predecessors, (359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:58:18,157 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:58:18,157 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:58:18,157 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-27 03:58:18,157 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-27 03:58:18,157 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:58:18,157 INFO L85 PathProgramCache]: Analyzing trace with hash 193246997, now seen corresponding path program 1 times [2023-08-27 03:58:18,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:58:18,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044469500] [2023-08-27 03:58:18,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:58:18,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:58:18,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:58:18,503 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 03:58:18,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:58:18,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044469500] [2023-08-27 03:58:18,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1044469500] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:58:18,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:58:18,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-27 03:58:18,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903912364] [2023-08-27 03:58:18,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:58:18,504 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-27 03:58:18,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:58:18,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-27 03:58:18,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-27 03:58:18,505 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 182 [2023-08-27 03:58:18,505 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 45 transitions, 233 flow. Second operand has 5 states, 5 states have (on average 67.0) internal successors, (335), 5 states have internal predecessors, (335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:58:18,506 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:58:18,506 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 182 [2023-08-27 03:58:18,506 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:58:18,812 INFO L124 PetriNetUnfolderBase]: 712/1400 cut-off events. [2023-08-27 03:58:18,812 INFO L125 PetriNetUnfolderBase]: For 1966/1972 co-relation queries the response was YES. [2023-08-27 03:58:18,815 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4570 conditions, 1400 events. 712/1400 cut-off events. For 1966/1972 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 8659 event pairs, 145 based on Foata normal form. 31/1324 useless extension candidates. Maximal degree in co-relation 4549. Up to 556 conditions per place. [2023-08-27 03:58:18,819 INFO L140 encePairwiseOnDemand]: 175/182 looper letters, 71 selfloop transitions, 17 changer transitions 4/94 dead transitions. [2023-08-27 03:58:18,819 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 94 transitions, 630 flow [2023-08-27 03:58:18,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-27 03:58:18,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-27 03:58:18,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 452 transitions. [2023-08-27 03:58:18,821 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4139194139194139 [2023-08-27 03:58:18,821 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 452 transitions. [2023-08-27 03:58:18,821 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 452 transitions. [2023-08-27 03:58:18,821 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:58:18,821 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 452 transitions. [2023-08-27 03:58:18,822 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 75.33333333333333) internal successors, (452), 6 states have internal predecessors, (452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:58:18,823 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 182.0) internal successors, (1274), 7 states have internal predecessors, (1274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:58:18,824 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 182.0) internal successors, (1274), 7 states have internal predecessors, (1274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:58:18,824 INFO L175 Difference]: Start difference. First operand has 46 places, 45 transitions, 233 flow. Second operand 6 states and 452 transitions. [2023-08-27 03:58:18,824 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 94 transitions, 630 flow [2023-08-27 03:58:18,827 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 94 transitions, 626 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-27 03:58:18,828 INFO L231 Difference]: Finished difference. Result has 54 places, 52 transitions, 330 flow [2023-08-27 03:58:18,828 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=230, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=330, PETRI_PLACES=54, PETRI_TRANSITIONS=52} [2023-08-27 03:58:18,829 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 24 predicate places. [2023-08-27 03:58:18,829 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 52 transitions, 330 flow [2023-08-27 03:58:18,829 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 67.0) internal successors, (335), 5 states have internal predecessors, (335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:58:18,829 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:58:18,829 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:58:18,829 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-27 03:58:18,830 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2023-08-27 03:58:18,830 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:58:18,830 INFO L85 PathProgramCache]: Analyzing trace with hash 194349264, now seen corresponding path program 1 times [2023-08-27 03:58:18,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:58:18,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786938070] [2023-08-27 03:58:18,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:58:18,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:58:18,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:58:19,098 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 03:58:19,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:58:19,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [786938070] [2023-08-27 03:58:19,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [786938070] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:58:19,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:58:19,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-27 03:58:19,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093690683] [2023-08-27 03:58:19,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:58:19,099 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-27 03:58:19,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:58:19,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-27 03:58:19,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-08-27 03:58:19,104 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 69 out of 182 [2023-08-27 03:58:19,104 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 52 transitions, 330 flow. Second operand has 6 states, 6 states have (on average 70.66666666666667) internal successors, (424), 6 states have internal predecessors, (424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:58:19,104 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:58:19,104 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 69 of 182 [2023-08-27 03:58:19,104 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:58:19,392 INFO L124 PetriNetUnfolderBase]: 745/1542 cut-off events. [2023-08-27 03:58:19,392 INFO L125 PetriNetUnfolderBase]: For 3172/3213 co-relation queries the response was YES. [2023-08-27 03:58:19,395 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5215 conditions, 1542 events. 745/1542 cut-off events. For 3172/3213 co-relation queries the response was YES. Maximal size of possible extension queue 149. Compared 10284 event pairs, 223 based on Foata normal form. 64/1483 useless extension candidates. Maximal degree in co-relation 5189. Up to 675 conditions per place. [2023-08-27 03:58:19,400 INFO L140 encePairwiseOnDemand]: 176/182 looper letters, 68 selfloop transitions, 19 changer transitions 2/95 dead transitions. [2023-08-27 03:58:19,400 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 95 transitions, 724 flow [2023-08-27 03:58:19,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-27 03:58:19,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-27 03:58:19,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 540 transitions. [2023-08-27 03:58:19,402 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.423861852433281 [2023-08-27 03:58:19,402 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 540 transitions. [2023-08-27 03:58:19,402 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 540 transitions. [2023-08-27 03:58:19,402 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:58:19,402 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 540 transitions. [2023-08-27 03:58:19,404 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 77.14285714285714) internal successors, (540), 7 states have internal predecessors, (540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:58:19,405 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 182.0) internal successors, (1456), 8 states have internal predecessors, (1456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:58:19,406 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 182.0) internal successors, (1456), 8 states have internal predecessors, (1456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:58:19,406 INFO L175 Difference]: Start difference. First operand has 54 places, 52 transitions, 330 flow. Second operand 7 states and 540 transitions. [2023-08-27 03:58:19,406 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 95 transitions, 724 flow [2023-08-27 03:58:19,411 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 95 transitions, 709 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-08-27 03:58:19,413 INFO L231 Difference]: Finished difference. Result has 62 places, 62 transitions, 469 flow [2023-08-27 03:58:19,413 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=316, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=469, PETRI_PLACES=62, PETRI_TRANSITIONS=62} [2023-08-27 03:58:19,415 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 32 predicate places. [2023-08-27 03:58:19,415 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 62 transitions, 469 flow [2023-08-27 03:58:19,415 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 70.66666666666667) internal successors, (424), 6 states have internal predecessors, (424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:58:19,415 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:58:19,415 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:58:19,415 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-27 03:58:19,415 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2023-08-27 03:58:19,415 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:58:19,416 INFO L85 PathProgramCache]: Analyzing trace with hash 177293436, now seen corresponding path program 1 times [2023-08-27 03:58:19,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:58:19,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959828096] [2023-08-27 03:58:19,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:58:19,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:58:19,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:58:19,886 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 03:58:19,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:58:19,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959828096] [2023-08-27 03:58:19,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [959828096] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:58:19,887 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:58:19,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-27 03:58:19,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436385191] [2023-08-27 03:58:19,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:58:19,888 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-27 03:58:19,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:58:19,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-27 03:58:19,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-27 03:58:19,888 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 182 [2023-08-27 03:58:19,889 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 62 transitions, 469 flow. Second operand has 5 states, 5 states have (on average 67.0) internal successors, (335), 5 states have internal predecessors, (335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:58:19,889 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:58:19,889 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 182 [2023-08-27 03:58:19,889 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:58:20,270 INFO L124 PetriNetUnfolderBase]: 845/1717 cut-off events. [2023-08-27 03:58:20,271 INFO L125 PetriNetUnfolderBase]: For 5426/5432 co-relation queries the response was YES. [2023-08-27 03:58:20,274 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6577 conditions, 1717 events. 845/1717 cut-off events. For 5426/5432 co-relation queries the response was YES. Maximal size of possible extension queue 154. Compared 11527 event pairs, 313 based on Foata normal form. 19/1605 useless extension candidates. Maximal degree in co-relation 6547. Up to 1196 conditions per place. [2023-08-27 03:58:20,280 INFO L140 encePairwiseOnDemand]: 172/182 looper letters, 74 selfloop transitions, 39 changer transitions 2/117 dead transitions. [2023-08-27 03:58:20,280 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 117 transitions, 1017 flow [2023-08-27 03:58:20,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-27 03:58:20,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-27 03:58:20,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 664 transitions. [2023-08-27 03:58:20,282 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4053724053724054 [2023-08-27 03:58:20,282 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 664 transitions. [2023-08-27 03:58:20,282 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 664 transitions. [2023-08-27 03:58:20,283 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:58:20,283 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 664 transitions. [2023-08-27 03:58:20,284 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 73.77777777777777) internal successors, (664), 9 states have internal predecessors, (664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:58:20,285 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 182.0) internal successors, (1820), 10 states have internal predecessors, (1820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:58:20,286 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 182.0) internal successors, (1820), 10 states have internal predecessors, (1820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:58:20,286 INFO L175 Difference]: Start difference. First operand has 62 places, 62 transitions, 469 flow. Second operand 9 states and 664 transitions. [2023-08-27 03:58:20,286 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 117 transitions, 1017 flow [2023-08-27 03:58:20,294 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 117 transitions, 969 flow, removed 16 selfloop flow, removed 3 redundant places. [2023-08-27 03:58:20,296 INFO L231 Difference]: Finished difference. Result has 72 places, 75 transitions, 656 flow [2023-08-27 03:58:20,296 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=438, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=656, PETRI_PLACES=72, PETRI_TRANSITIONS=75} [2023-08-27 03:58:20,297 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 42 predicate places. [2023-08-27 03:58:20,298 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 75 transitions, 656 flow [2023-08-27 03:58:20,298 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 67.0) internal successors, (335), 5 states have internal predecessors, (335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:58:20,299 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:58:20,299 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:58:20,300 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-27 03:58:20,300 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2023-08-27 03:58:20,300 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:58:20,300 INFO L85 PathProgramCache]: Analyzing trace with hash 175044696, now seen corresponding path program 2 times [2023-08-27 03:58:20,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:58:20,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112947134] [2023-08-27 03:58:20,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:58:20,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:58:20,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:58:20,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 03:58:20,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:58:20,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112947134] [2023-08-27 03:58:20,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [112947134] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:58:20,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:58:20,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-27 03:58:20,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251093645] [2023-08-27 03:58:20,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:58:20,634 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-27 03:58:20,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:58:20,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-27 03:58:20,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-08-27 03:58:20,635 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 182 [2023-08-27 03:58:20,635 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 75 transitions, 656 flow. Second operand has 6 states, 6 states have (on average 72.66666666666667) internal successors, (436), 6 states have internal predecessors, (436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:58:20,635 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:58:20,635 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 182 [2023-08-27 03:58:20,635 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:58:20,911 INFO L124 PetriNetUnfolderBase]: 898/1891 cut-off events. [2023-08-27 03:58:20,912 INFO L125 PetriNetUnfolderBase]: For 8982/9034 co-relation queries the response was YES. [2023-08-27 03:58:20,916 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7952 conditions, 1891 events. 898/1891 cut-off events. For 8982/9034 co-relation queries the response was YES. Maximal size of possible extension queue 188. Compared 13631 event pairs, 344 based on Foata normal form. 53/1798 useless extension candidates. Maximal degree in co-relation 7917. Up to 1375 conditions per place. [2023-08-27 03:58:20,922 INFO L140 encePairwiseOnDemand]: 175/182 looper letters, 89 selfloop transitions, 30 changer transitions 2/128 dead transitions. [2023-08-27 03:58:20,922 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 128 transitions, 1250 flow [2023-08-27 03:58:20,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-27 03:58:20,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-27 03:58:20,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 630 transitions. [2023-08-27 03:58:20,923 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4326923076923077 [2023-08-27 03:58:20,923 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 630 transitions. [2023-08-27 03:58:20,923 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 630 transitions. [2023-08-27 03:58:20,924 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:58:20,924 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 630 transitions. [2023-08-27 03:58:20,925 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 78.75) internal successors, (630), 8 states have internal predecessors, (630), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:58:20,926 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 182.0) internal successors, (1638), 9 states have internal predecessors, (1638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:58:20,926 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 182.0) internal successors, (1638), 9 states have internal predecessors, (1638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:58:20,926 INFO L175 Difference]: Start difference. First operand has 72 places, 75 transitions, 656 flow. Second operand 8 states and 630 transitions. [2023-08-27 03:58:20,926 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 128 transitions, 1250 flow [2023-08-27 03:58:20,954 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 128 transitions, 1222 flow, removed 14 selfloop flow, removed 0 redundant places. [2023-08-27 03:58:20,955 INFO L231 Difference]: Finished difference. Result has 83 places, 93 transitions, 950 flow [2023-08-27 03:58:20,955 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=630, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=950, PETRI_PLACES=83, PETRI_TRANSITIONS=93} [2023-08-27 03:58:20,956 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 53 predicate places. [2023-08-27 03:58:20,956 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 93 transitions, 950 flow [2023-08-27 03:58:20,956 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 72.66666666666667) internal successors, (436), 6 states have internal predecessors, (436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:58:20,956 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:58:20,956 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:58:20,956 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-27 03:58:20,956 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-27 03:58:20,957 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:58:20,957 INFO L85 PathProgramCache]: Analyzing trace with hash 1729840087, now seen corresponding path program 1 times [2023-08-27 03:58:20,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:58:20,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143405044] [2023-08-27 03:58:20,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:58:20,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:58:20,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:58:21,135 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 03:58:21,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:58:21,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143405044] [2023-08-27 03:58:21,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1143405044] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:58:21,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:58:21,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-27 03:58:21,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204128449] [2023-08-27 03:58:21,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:58:21,136 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-27 03:58:21,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:58:21,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-27 03:58:21,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-08-27 03:58:21,137 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 182 [2023-08-27 03:58:21,138 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 93 transitions, 950 flow. Second operand has 6 states, 6 states have (on average 72.83333333333333) internal successors, (437), 6 states have internal predecessors, (437), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:58:21,138 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:58:21,138 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 182 [2023-08-27 03:58:21,138 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:58:21,455 INFO L124 PetriNetUnfolderBase]: 1103/2335 cut-off events. [2023-08-27 03:58:21,455 INFO L125 PetriNetUnfolderBase]: For 17752/17810 co-relation queries the response was YES. [2023-08-27 03:58:21,461 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11039 conditions, 2335 events. 1103/2335 cut-off events. For 17752/17810 co-relation queries the response was YES. Maximal size of possible extension queue 250. Compared 17813 event pairs, 405 based on Foata normal form. 74/2235 useless extension candidates. Maximal degree in co-relation 10998. Up to 1540 conditions per place. [2023-08-27 03:58:21,470 INFO L140 encePairwiseOnDemand]: 174/182 looper letters, 103 selfloop transitions, 37 changer transitions 2/149 dead transitions. [2023-08-27 03:58:21,470 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 149 transitions, 1749 flow [2023-08-27 03:58:21,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-27 03:58:21,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-27 03:58:21,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 626 transitions. [2023-08-27 03:58:21,472 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42994505494505497 [2023-08-27 03:58:21,472 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 626 transitions. [2023-08-27 03:58:21,472 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 626 transitions. [2023-08-27 03:58:21,472 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:58:21,472 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 626 transitions. [2023-08-27 03:58:21,473 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 78.25) internal successors, (626), 8 states have internal predecessors, (626), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:58:21,475 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 182.0) internal successors, (1638), 9 states have internal predecessors, (1638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:58:21,475 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 182.0) internal successors, (1638), 9 states have internal predecessors, (1638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:58:21,475 INFO L175 Difference]: Start difference. First operand has 83 places, 93 transitions, 950 flow. Second operand 8 states and 626 transitions. [2023-08-27 03:58:21,475 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 149 transitions, 1749 flow [2023-08-27 03:58:21,499 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 149 transitions, 1657 flow, removed 42 selfloop flow, removed 2 redundant places. [2023-08-27 03:58:21,503 INFO L231 Difference]: Finished difference. Result has 90 places, 111 transitions, 1248 flow [2023-08-27 03:58:21,503 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=884, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1248, PETRI_PLACES=90, PETRI_TRANSITIONS=111} [2023-08-27 03:58:21,503 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 60 predicate places. [2023-08-27 03:58:21,504 INFO L495 AbstractCegarLoop]: Abstraction has has 90 places, 111 transitions, 1248 flow [2023-08-27 03:58:21,504 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 72.83333333333333) internal successors, (437), 6 states have internal predecessors, (437), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:58:21,504 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:58:21,504 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:58:21,504 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-27 03:58:21,504 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2023-08-27 03:58:21,504 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:58:21,504 INFO L85 PathProgramCache]: Analyzing trace with hash 1727591347, now seen corresponding path program 2 times [2023-08-27 03:58:21,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:58:21,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508519268] [2023-08-27 03:58:21,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:58:21,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:58:21,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:58:21,803 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 03:58:21,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:58:21,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508519268] [2023-08-27 03:58:21,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1508519268] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:58:21,805 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:58:21,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-27 03:58:21,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337376397] [2023-08-27 03:58:21,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:58:21,806 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-27 03:58:21,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:58:21,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-27 03:58:21,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-08-27 03:58:21,807 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 70 out of 182 [2023-08-27 03:58:21,808 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 111 transitions, 1248 flow. Second operand has 7 states, 7 states have (on average 71.57142857142857) internal successors, (501), 7 states have internal predecessors, (501), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:58:21,808 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:58:21,808 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 70 of 182 [2023-08-27 03:58:21,808 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:58:22,205 INFO L124 PetriNetUnfolderBase]: 1158/2495 cut-off events. [2023-08-27 03:58:22,205 INFO L125 PetriNetUnfolderBase]: For 19859/19924 co-relation queries the response was YES. [2023-08-27 03:58:22,213 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12380 conditions, 2495 events. 1158/2495 cut-off events. For 19859/19924 co-relation queries the response was YES. Maximal size of possible extension queue 271. Compared 19573 event pairs, 287 based on Foata normal form. 82/2387 useless extension candidates. Maximal degree in co-relation 12337. Up to 1256 conditions per place. [2023-08-27 03:58:22,229 INFO L140 encePairwiseOnDemand]: 175/182 looper letters, 88 selfloop transitions, 63 changer transitions 2/160 dead transitions. [2023-08-27 03:58:22,229 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 160 transitions, 1974 flow [2023-08-27 03:58:22,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-27 03:58:22,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-27 03:58:22,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 694 transitions. [2023-08-27 03:58:22,231 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4236874236874237 [2023-08-27 03:58:22,231 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 694 transitions. [2023-08-27 03:58:22,231 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 694 transitions. [2023-08-27 03:58:22,231 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:58:22,232 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 694 transitions. [2023-08-27 03:58:22,233 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 77.11111111111111) internal successors, (694), 9 states have internal predecessors, (694), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:58:22,234 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 182.0) internal successors, (1820), 10 states have internal predecessors, (1820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:58:22,234 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 182.0) internal successors, (1820), 10 states have internal predecessors, (1820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:58:22,234 INFO L175 Difference]: Start difference. First operand has 90 places, 111 transitions, 1248 flow. Second operand 9 states and 694 transitions. [2023-08-27 03:58:22,234 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 160 transitions, 1974 flow [2023-08-27 03:58:22,264 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 160 transitions, 1922 flow, removed 14 selfloop flow, removed 4 redundant places. [2023-08-27 03:58:22,268 INFO L231 Difference]: Finished difference. Result has 97 places, 122 transitions, 1602 flow [2023-08-27 03:58:22,269 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=1196, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1602, PETRI_PLACES=97, PETRI_TRANSITIONS=122} [2023-08-27 03:58:22,269 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 67 predicate places. [2023-08-27 03:58:22,269 INFO L495 AbstractCegarLoop]: Abstraction has has 97 places, 122 transitions, 1602 flow [2023-08-27 03:58:22,270 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 71.57142857142857) internal successors, (501), 7 states have internal predecessors, (501), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:58:22,270 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:58:22,270 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:58:22,270 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-27 03:58:22,270 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2023-08-27 03:58:22,270 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:58:22,270 INFO L85 PathProgramCache]: Analyzing trace with hash 949064557, now seen corresponding path program 1 times [2023-08-27 03:58:22,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:58:22,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887375599] [2023-08-27 03:58:22,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:58:22,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:58:22,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:58:22,389 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 03:58:22,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:58:22,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887375599] [2023-08-27 03:58:22,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1887375599] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:58:22,389 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:58:22,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-27 03:58:22,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269995218] [2023-08-27 03:58:22,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:58:22,389 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-27 03:58:22,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:58:22,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-27 03:58:22,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-27 03:58:22,390 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 182 [2023-08-27 03:58:22,390 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 122 transitions, 1602 flow. Second operand has 4 states, 4 states have (on average 74.75) internal successors, (299), 4 states have internal predecessors, (299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:58:22,390 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:58:22,390 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 182 [2023-08-27 03:58:22,390 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:58:22,516 INFO L124 PetriNetUnfolderBase]: 274/658 cut-off events. [2023-08-27 03:58:22,517 INFO L125 PetriNetUnfolderBase]: For 7422/7449 co-relation queries the response was YES. [2023-08-27 03:58:22,518 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3664 conditions, 658 events. 274/658 cut-off events. For 7422/7449 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 3984 event pairs, 84 based on Foata normal form. 83/596 useless extension candidates. Maximal degree in co-relation 3619. Up to 352 conditions per place. [2023-08-27 03:58:22,520 INFO L140 encePairwiseOnDemand]: 177/182 looper letters, 81 selfloop transitions, 4 changer transitions 0/90 dead transitions. [2023-08-27 03:58:22,520 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 90 transitions, 1236 flow [2023-08-27 03:58:22,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-27 03:58:22,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-27 03:58:22,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 330 transitions. [2023-08-27 03:58:22,521 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4532967032967033 [2023-08-27 03:58:22,521 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 330 transitions. [2023-08-27 03:58:22,521 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 330 transitions. [2023-08-27 03:58:22,521 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:58:22,521 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 330 transitions. [2023-08-27 03:58:22,522 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 82.5) internal successors, (330), 4 states have internal predecessors, (330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:58:22,522 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 182.0) internal successors, (910), 5 states have internal predecessors, (910), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:58:22,523 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 182.0) internal successors, (910), 5 states have internal predecessors, (910), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:58:22,523 INFO L175 Difference]: Start difference. First operand has 97 places, 122 transitions, 1602 flow. Second operand 4 states and 330 transitions. [2023-08-27 03:58:22,523 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 90 transitions, 1236 flow [2023-08-27 03:58:22,532 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 90 transitions, 1088 flow, removed 30 selfloop flow, removed 17 redundant places. [2023-08-27 03:58:22,533 INFO L231 Difference]: Finished difference. Result has 78 places, 67 transitions, 716 flow [2023-08-27 03:58:22,533 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=686, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=716, PETRI_PLACES=78, PETRI_TRANSITIONS=67} [2023-08-27 03:58:22,534 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 48 predicate places. [2023-08-27 03:58:22,534 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 67 transitions, 716 flow [2023-08-27 03:58:22,534 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 74.75) internal successors, (299), 4 states have internal predecessors, (299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:58:22,534 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:58:22,534 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:58:22,534 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-27 03:58:22,534 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2023-08-27 03:58:22,534 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:58:22,534 INFO L85 PathProgramCache]: Analyzing trace with hash -19236293, now seen corresponding path program 1 times [2023-08-27 03:58:22,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:58:22,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782526429] [2023-08-27 03:58:22,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:58:22,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:58:22,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:58:22,569 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 03:58:22,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:58:22,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1782526429] [2023-08-27 03:58:22,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1782526429] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:58:22,569 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:58:22,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-27 03:58:22,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396110835] [2023-08-27 03:58:22,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:58:22,569 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-27 03:58:22,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:58:22,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-27 03:58:22,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-27 03:58:22,570 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 182 [2023-08-27 03:58:22,570 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 67 transitions, 716 flow. Second operand has 4 states, 4 states have (on average 76.5) internal successors, (306), 4 states have internal predecessors, (306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:58:22,570 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:58:22,570 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 182 [2023-08-27 03:58:22,571 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:58:22,654 INFO L124 PetriNetUnfolderBase]: 241/574 cut-off events. [2023-08-27 03:58:22,654 INFO L125 PetriNetUnfolderBase]: For 4489/4520 co-relation queries the response was YES. [2023-08-27 03:58:22,655 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3141 conditions, 574 events. 241/574 cut-off events. For 4489/4520 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 3291 event pairs, 100 based on Foata normal form. 30/552 useless extension candidates. Maximal degree in co-relation 3104. Up to 403 conditions per place. [2023-08-27 03:58:22,656 INFO L140 encePairwiseOnDemand]: 177/182 looper letters, 67 selfloop transitions, 3 changer transitions 0/75 dead transitions. [2023-08-27 03:58:22,656 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 75 transitions, 955 flow [2023-08-27 03:58:22,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-27 03:58:22,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-27 03:58:22,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 326 transitions. [2023-08-27 03:58:22,657 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4478021978021978 [2023-08-27 03:58:22,657 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 326 transitions. [2023-08-27 03:58:22,657 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 326 transitions. [2023-08-27 03:58:22,658 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:58:22,658 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 326 transitions. [2023-08-27 03:58:22,658 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 81.5) internal successors, (326), 4 states have internal predecessors, (326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:58:22,659 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 182.0) internal successors, (910), 5 states have internal predecessors, (910), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:58:22,659 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 182.0) internal successors, (910), 5 states have internal predecessors, (910), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:58:22,659 INFO L175 Difference]: Start difference. First operand has 78 places, 67 transitions, 716 flow. Second operand 4 states and 326 transitions. [2023-08-27 03:58:22,659 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 75 transitions, 955 flow [2023-08-27 03:58:22,667 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 75 transitions, 932 flow, removed 9 selfloop flow, removed 2 redundant places. [2023-08-27 03:58:22,668 INFO L231 Difference]: Finished difference. Result has 77 places, 65 transitions, 697 flow [2023-08-27 03:58:22,668 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=691, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=697, PETRI_PLACES=77, PETRI_TRANSITIONS=65} [2023-08-27 03:58:22,669 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 47 predicate places. [2023-08-27 03:58:22,669 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 65 transitions, 697 flow [2023-08-27 03:58:22,670 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 76.5) internal successors, (306), 4 states have internal predecessors, (306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:58:22,670 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:58:22,670 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:58:22,670 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-27 03:58:22,670 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2023-08-27 03:58:22,670 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:58:22,670 INFO L85 PathProgramCache]: Analyzing trace with hash -19236292, now seen corresponding path program 1 times [2023-08-27 03:58:22,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:58:22,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183209374] [2023-08-27 03:58:22,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:58:22,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:58:22,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:58:22,701 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 03:58:22,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:58:22,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183209374] [2023-08-27 03:58:22,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [183209374] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:58:22,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:58:22,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-27 03:58:22,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613712516] [2023-08-27 03:58:22,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:58:22,701 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-27 03:58:22,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:58:22,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-27 03:58:22,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-27 03:58:22,703 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 182 [2023-08-27 03:58:22,703 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 65 transitions, 697 flow. Second operand has 4 states, 4 states have (on average 76.5) internal successors, (306), 4 states have internal predecessors, (306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:58:22,703 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:58:22,703 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 182 [2023-08-27 03:58:22,703 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:58:22,782 INFO L124 PetriNetUnfolderBase]: 208/490 cut-off events. [2023-08-27 03:58:22,782 INFO L125 PetriNetUnfolderBase]: For 3691/3722 co-relation queries the response was YES. [2023-08-27 03:58:22,787 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2782 conditions, 490 events. 208/490 cut-off events. For 3691/3722 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 2672 event pairs, 51 based on Foata normal form. 30/519 useless extension candidates. Maximal degree in co-relation 2745. Up to 246 conditions per place. [2023-08-27 03:58:22,788 INFO L140 encePairwiseOnDemand]: 177/182 looper letters, 34 selfloop transitions, 5 changer transitions 36/80 dead transitions. [2023-08-27 03:58:22,788 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 80 transitions, 1014 flow [2023-08-27 03:58:22,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-27 03:58:22,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-27 03:58:22,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 330 transitions. [2023-08-27 03:58:22,790 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4532967032967033 [2023-08-27 03:58:22,790 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 330 transitions. [2023-08-27 03:58:22,790 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 330 transitions. [2023-08-27 03:58:22,790 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:58:22,790 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 330 transitions. [2023-08-27 03:58:22,791 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 82.5) internal successors, (330), 4 states have internal predecessors, (330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:58:22,792 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 182.0) internal successors, (910), 5 states have internal predecessors, (910), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:58:22,793 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 182.0) internal successors, (910), 5 states have internal predecessors, (910), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:58:22,793 INFO L175 Difference]: Start difference. First operand has 77 places, 65 transitions, 697 flow. Second operand 4 states and 330 transitions. [2023-08-27 03:58:22,793 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 80 transitions, 1014 flow [2023-08-27 03:58:22,800 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 80 transitions, 1008 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-08-27 03:58:22,800 INFO L231 Difference]: Finished difference. Result has 76 places, 34 transitions, 348 flow [2023-08-27 03:58:22,800 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=683, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=348, PETRI_PLACES=76, PETRI_TRANSITIONS=34} [2023-08-27 03:58:22,801 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 46 predicate places. [2023-08-27 03:58:22,801 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 34 transitions, 348 flow [2023-08-27 03:58:22,801 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 76.5) internal successors, (306), 4 states have internal predecessors, (306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:58:22,801 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:58:22,801 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:58:22,801 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-27 03:58:22,802 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2023-08-27 03:58:22,802 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:58:22,802 INFO L85 PathProgramCache]: Analyzing trace with hash -530210228, now seen corresponding path program 1 times [2023-08-27 03:58:22,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:58:22,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723570283] [2023-08-27 03:58:22,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:58:22,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:58:22,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:58:22,895 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 03:58:22,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:58:22,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723570283] [2023-08-27 03:58:22,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1723570283] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:58:22,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:58:22,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-27 03:58:22,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687880203] [2023-08-27 03:58:22,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:58:22,896 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-27 03:58:22,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:58:22,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-27 03:58:22,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-27 03:58:22,897 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 182 [2023-08-27 03:58:22,898 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 34 transitions, 348 flow. Second operand has 5 states, 5 states have (on average 74.4) internal successors, (372), 5 states have internal predecessors, (372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:58:22,898 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:58:22,898 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 182 [2023-08-27 03:58:22,898 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:58:22,941 INFO L124 PetriNetUnfolderBase]: 28/91 cut-off events. [2023-08-27 03:58:22,941 INFO L125 PetriNetUnfolderBase]: For 718/726 co-relation queries the response was YES. [2023-08-27 03:58:22,942 INFO L83 FinitePrefix]: Finished finitePrefix Result has 551 conditions, 91 events. 28/91 cut-off events. For 718/726 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 297 event pairs, 4 based on Foata normal form. 21/111 useless extension candidates. Maximal degree in co-relation 514. Up to 36 conditions per place. [2023-08-27 03:58:22,942 INFO L140 encePairwiseOnDemand]: 177/182 looper letters, 21 selfloop transitions, 6 changer transitions 10/40 dead transitions. [2023-08-27 03:58:22,942 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 40 transitions, 473 flow [2023-08-27 03:58:22,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-27 03:58:22,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-27 03:58:22,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 384 transitions. [2023-08-27 03:58:22,943 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.421978021978022 [2023-08-27 03:58:22,943 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 384 transitions. [2023-08-27 03:58:22,943 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 384 transitions. [2023-08-27 03:58:22,943 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:58:22,943 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 384 transitions. [2023-08-27 03:58:22,944 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 76.8) internal successors, (384), 5 states have internal predecessors, (384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:58:22,945 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 182.0) internal successors, (1092), 6 states have internal predecessors, (1092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:58:22,945 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 182.0) internal successors, (1092), 6 states have internal predecessors, (1092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:58:22,945 INFO L175 Difference]: Start difference. First operand has 76 places, 34 transitions, 348 flow. Second operand 5 states and 384 transitions. [2023-08-27 03:58:22,945 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 40 transitions, 473 flow [2023-08-27 03:58:22,947 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 40 transitions, 333 flow, removed 50 selfloop flow, removed 18 redundant places. [2023-08-27 03:58:22,947 INFO L231 Difference]: Finished difference. Result has 51 places, 24 transitions, 173 flow [2023-08-27 03:58:22,947 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=210, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=173, PETRI_PLACES=51, PETRI_TRANSITIONS=24} [2023-08-27 03:58:22,948 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 21 predicate places. [2023-08-27 03:58:22,948 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 24 transitions, 173 flow [2023-08-27 03:58:22,948 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 74.4) internal successors, (372), 5 states have internal predecessors, (372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:58:22,948 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:58:22,948 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:58:22,948 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-27 03:58:22,948 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2023-08-27 03:58:22,948 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:58:22,949 INFO L85 PathProgramCache]: Analyzing trace with hash -1064089417, now seen corresponding path program 1 times [2023-08-27 03:58:22,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:58:22,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646984525] [2023-08-27 03:58:22,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:58:22,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:58:22,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:58:23,357 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 03:58:23,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:58:23,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646984525] [2023-08-27 03:58:23,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1646984525] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:58:23,358 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:58:23,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-27 03:58:23,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107001023] [2023-08-27 03:58:23,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:58:23,358 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-27 03:58:23,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:58:23,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-27 03:58:23,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-08-27 03:58:23,359 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 67 out of 182 [2023-08-27 03:58:23,360 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 24 transitions, 173 flow. Second operand has 8 states, 8 states have (on average 69.0) internal successors, (552), 8 states have internal predecessors, (552), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:58:23,360 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:58:23,360 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 67 of 182 [2023-08-27 03:58:23,360 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:58:23,435 INFO L124 PetriNetUnfolderBase]: 17/58 cut-off events. [2023-08-27 03:58:23,435 INFO L125 PetriNetUnfolderBase]: For 145/145 co-relation queries the response was YES. [2023-08-27 03:58:23,436 INFO L83 FinitePrefix]: Finished finitePrefix Result has 294 conditions, 58 events. 17/58 cut-off events. For 145/145 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 107 event pairs, 5 based on Foata normal form. 1/59 useless extension candidates. Maximal degree in co-relation 269. Up to 29 conditions per place. [2023-08-27 03:58:23,436 INFO L140 encePairwiseOnDemand]: 176/182 looper letters, 16 selfloop transitions, 5 changer transitions 12/33 dead transitions. [2023-08-27 03:58:23,436 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 33 transitions, 299 flow [2023-08-27 03:58:23,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-27 03:58:23,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-27 03:58:23,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 430 transitions. [2023-08-27 03:58:23,437 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39377289377289376 [2023-08-27 03:58:23,437 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 430 transitions. [2023-08-27 03:58:23,437 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 430 transitions. [2023-08-27 03:58:23,437 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:58:23,437 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 430 transitions. [2023-08-27 03:58:23,438 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 71.66666666666667) internal successors, (430), 6 states have internal predecessors, (430), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:58:23,439 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 182.0) internal successors, (1274), 7 states have internal predecessors, (1274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:58:23,439 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 182.0) internal successors, (1274), 7 states have internal predecessors, (1274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:58:23,439 INFO L175 Difference]: Start difference. First operand has 51 places, 24 transitions, 173 flow. Second operand 6 states and 430 transitions. [2023-08-27 03:58:23,439 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 33 transitions, 299 flow [2023-08-27 03:58:23,440 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 33 transitions, 201 flow, removed 20 selfloop flow, removed 16 redundant places. [2023-08-27 03:58:23,440 INFO L231 Difference]: Finished difference. Result has 39 places, 20 transitions, 99 flow [2023-08-27 03:58:23,440 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=99, PETRI_PLACES=39, PETRI_TRANSITIONS=20} [2023-08-27 03:58:23,441 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 9 predicate places. [2023-08-27 03:58:23,441 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 20 transitions, 99 flow [2023-08-27 03:58:23,441 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 69.0) internal successors, (552), 8 states have internal predecessors, (552), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:58:23,441 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:58:23,441 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:58:23,441 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-27 03:58:23,441 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2023-08-27 03:58:23,441 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:58:23,441 INFO L85 PathProgramCache]: Analyzing trace with hash 439687119, now seen corresponding path program 2 times [2023-08-27 03:58:23,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:58:23,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743726588] [2023-08-27 03:58:23,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:58:23,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:58:23,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-27 03:58:23,464 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-27 03:58:23,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-27 03:58:23,496 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-27 03:58:23,496 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-27 03:58:23,497 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONASSERT (12 of 13 remaining) [2023-08-27 03:58:23,498 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONASSERT (11 of 13 remaining) [2023-08-27 03:58:23,498 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 13 remaining) [2023-08-27 03:58:23,498 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 13 remaining) [2023-08-27 03:58:23,498 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 13 remaining) [2023-08-27 03:58:23,498 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 13 remaining) [2023-08-27 03:58:23,498 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 13 remaining) [2023-08-27 03:58:23,498 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 13 remaining) [2023-08-27 03:58:23,498 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONASSERT (4 of 13 remaining) [2023-08-27 03:58:23,498 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 13 remaining) [2023-08-27 03:58:23,498 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 13 remaining) [2023-08-27 03:58:23,498 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 13 remaining) [2023-08-27 03:58:23,498 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 13 remaining) [2023-08-27 03:58:23,498 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-08-27 03:58:23,499 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:58:23,502 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-27 03:58:23,502 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-27 03:58:23,538 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.08 03:58:23 BasicIcfg [2023-08-27 03:58:23,538 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-27 03:58:23,539 INFO L158 Benchmark]: Toolchain (without parser) took 11051.94ms. Allocated memory was 331.4MB in the beginning and 717.2MB in the end (delta: 385.9MB). Free memory was 305.6MB in the beginning and 563.7MB in the end (delta: -258.1MB). Peak memory consumption was 129.1MB. Max. memory is 16.0GB. [2023-08-27 03:58:23,539 INFO L158 Benchmark]: CDTParser took 0.40ms. Allocated memory is still 331.4MB. Free memory is still 308.2MB. There was no memory consumed. Max. memory is 16.0GB. [2023-08-27 03:58:23,539 INFO L158 Benchmark]: CACSL2BoogieTranslator took 382.33ms. Allocated memory is still 331.4MB. Free memory was 305.6MB in the beginning and 283.3MB in the end (delta: 22.3MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. [2023-08-27 03:58:23,539 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.78ms. Allocated memory is still 331.4MB. Free memory was 283.3MB in the beginning and 280.6MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-27 03:58:23,539 INFO L158 Benchmark]: Boogie Preprocessor took 34.54ms. Allocated memory is still 331.4MB. Free memory was 280.6MB in the beginning and 278.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-27 03:58:23,539 INFO L158 Benchmark]: RCFGBuilder took 614.67ms. Allocated memory is still 331.4MB. Free memory was 278.5MB in the beginning and 295.5MB in the end (delta: -17.0MB). Peak memory consumption was 27.3MB. Max. memory is 16.0GB. [2023-08-27 03:58:23,540 INFO L158 Benchmark]: TraceAbstraction took 9979.16ms. Allocated memory was 331.4MB in the beginning and 717.2MB in the end (delta: 385.9MB). Free memory was 295.5MB in the beginning and 563.7MB in the end (delta: -268.2MB). Peak memory consumption was 118.7MB. Max. memory is 16.0GB. [2023-08-27 03:58:23,540 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.40ms. Allocated memory is still 331.4MB. Free memory is still 308.2MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 382.33ms. Allocated memory is still 331.4MB. Free memory was 305.6MB in the beginning and 283.3MB in the end (delta: 22.3MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 36.78ms. Allocated memory is still 331.4MB. Free memory was 283.3MB in the beginning and 280.6MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 34.54ms. Allocated memory is still 331.4MB. Free memory was 280.6MB in the beginning and 278.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 614.67ms. Allocated memory is still 331.4MB. Free memory was 278.5MB in the beginning and 295.5MB in the end (delta: -17.0MB). Peak memory consumption was 27.3MB. Max. memory is 16.0GB. * TraceAbstraction took 9979.16ms. Allocated memory was 331.4MB in the beginning and 717.2MB in the end (delta: 385.9MB). Free memory was 295.5MB in the beginning and 563.7MB in the end (delta: -268.2MB). Peak memory consumption was 118.7MB. 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: 2.5s, 96 PlacesBefore, 30 PlacesAfterwards, 92 TransitionsBefore, 24 TransitionsAfterwards, 1498 CoEnabledTransitionPairs, 6 FixpointIterations, 33 TrivialSequentialCompositions, 41 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 12 ConcurrentYvCompositions, 2 ChoiceCompositions, 88 TotalNumberOfCompositions, 4956 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2030, independent: 1850, independent conditional: 0, independent unconditional: 1850, dependent: 180, dependent conditional: 0, dependent unconditional: 180, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 824, independent: 792, independent conditional: 0, independent unconditional: 792, dependent: 32, dependent conditional: 0, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2030, independent: 1058, independent conditional: 0, independent unconditional: 1058, dependent: 148, dependent conditional: 0, dependent unconditional: 148, unknown: 824, unknown conditional: 0, unknown unconditional: 824] , Statistics on independence cache: Total cache size (in pairs): 107, Positive cache size: 91, Positive conditional cache size: 0, Positive unconditional cache size: 91, Negative cache size: 16, Negative conditional cache size: 0, Negative unconditional cache size: 16, 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; [L709] 0 _Bool main$tmp_guard0; [L710] 0 _Bool main$tmp_guard1; [L712] 0 int x = 0; [L714] 0 int y = 0; [L715] 0 _Bool y$flush_delayed; [L716] 0 int y$mem_tmp; [L717] 0 _Bool y$r_buff0_thd0; [L718] 0 _Bool y$r_buff0_thd1; [L719] 0 _Bool y$r_buff0_thd2; [L720] 0 _Bool y$r_buff1_thd0; [L721] 0 _Bool y$r_buff1_thd1; [L722] 0 _Bool y$r_buff1_thd2; [L723] 0 _Bool y$read_delayed; [L724] 0 int *y$read_delayed_var; [L725] 0 int y$w_buff0; [L726] 0 _Bool y$w_buff0_used; [L727] 0 int y$w_buff1; [L728] 0 _Bool y$w_buff1_used; [L729] 0 _Bool weak$$choice0; [L730] 0 _Bool weak$$choice2; [L790] 0 pthread_t t2473; [L791] FCALL, FORK 0 pthread_create(&t2473, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2473, ((void *)0), P0, ((void *)0))=-2, t2473={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] [L734] 1 y$w_buff1 = y$w_buff0 [L735] 1 y$w_buff0 = 2 [L736] 1 y$w_buff1_used = y$w_buff0_used [L737] 1 y$w_buff0_used = (_Bool)1 [L738] CALL 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L738] RET 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L739] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L740] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L741] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L742] 1 y$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L792] 0 pthread_t t2474; [L745] 1 x = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L793] FCALL, FORK 0 pthread_create(&t2474, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2474, ((void *)0), P1, ((void *)0))=-1, t2473={5:0}, t2474={3:0}, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L762] 2 x = 2 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L765] 2 y = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1] [L768] 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) [L769] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L770] 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 [L771] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L772] 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, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1] [L748] 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) [L749] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L750] 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 [L751] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L752] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L755] EXPR 1 __unbuffered_cnt + 1 [L755] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L757] 1 return 0; [L775] EXPR 2 __unbuffered_cnt + 1 [L775] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L777] 2 return 0; [L795] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\result={0:0}, __unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2473={5:0}, t2474={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L797] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L797] RET 0 assume_abort_if_not(main$tmp_guard0) [L799] 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) [L800] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L801] 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 [L802] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L803] 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, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2473={5:0}, t2474={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L806] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L807] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L808] 0 y$flush_delayed = weak$$choice2 [L809] 0 y$mem_tmp = y [L810] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L811] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L812] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L813] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L814] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L815] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L816] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L817] 0 main$tmp_guard1 = !(x == 2 && y == 2) [L818] 0 y = y$flush_delayed ? y$mem_tmp : y [L819] 0 y$flush_delayed = (_Bool)0 [L821] 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", "safe029_power.oepc_pso.oepc_rmo.oepc.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\read(__PRETTY_FUNCTION__)={49:50}, \result={0:0}, __unbuffered_cnt=2, 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=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] - UnprovableResult [Line: 17]: Unable to prove that assertion always holds Unable to prove that assertion always holds Reason: Not analyzed. - UnprovableResult [Line: 755]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 755]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 775]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 775]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 791]: Unable to prove that 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: 793]: 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, 115 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: 9.9s, OverallIterations: 16, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 3.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.5s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 405 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 405 mSDsluCounter, 62 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 32 mSDsCounter, 94 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1235 IncrementalHoareTripleChecker+Invalid, 1329 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 94 mSolverCounterUnsat, 30 mSDtfsCounter, 1235 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 78 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1602occurred in iteration=10, InterpolantAutomatonStates: 88, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 3.5s InterpolantComputationTime, 169 NumberOfCodeBlocks, 169 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 138 ConstructedInterpolants, 0 QuantifiedInterpolants, 1332 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-08-27 03:58:23,568 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...