/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf --traceabstraction.order.of.the.error.locations.to.be.checked PROGRAM_FIRST -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --cacsl2boogietranslator.check.absence.of.signed.integer.overflows true -i ../../../trunk/examples/svcomp/pthread-wmm/safe030_power.oepc_pso.oepc_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-27 10:19:42,604 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-27 10:19:42,673 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf [2023-08-27 10:19:42,677 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-27 10:19:42,678 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-27 10:19:42,700 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-27 10:19:42,701 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-27 10:19:42,701 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-27 10:19:42,702 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-27 10:19:42,705 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-27 10:19:42,705 INFO L153 SettingsManager]: * Use SBE=true [2023-08-27 10:19:42,706 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-27 10:19:42,706 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-27 10:19:42,707 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-27 10:19:42,707 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-27 10:19:42,707 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-27 10:19:42,707 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-27 10:19:42,707 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-27 10:19:42,707 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-27 10:19:42,707 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-27 10:19:42,708 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-27 10:19:42,708 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-27 10:19:42,709 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-27 10:19:42,709 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-27 10:19:42,709 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-27 10:19:42,709 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-27 10:19:42,709 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-27 10:19:42,710 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-27 10:19:42,710 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-27 10:19:42,710 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-27 10:19:42,711 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-27 10:19:42,711 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-27 10:19:42,711 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-27 10:19:42,711 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-27 10:19:42,711 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-27 10:19:42,711 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Order of the error locations to be checked -> PROGRAM_FIRST Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check absence of signed integer overflows -> true [2023-08-27 10:19:42,965 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-27 10:19:42,980 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-27 10:19:42,984 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-27 10:19:42,985 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-27 10:19:42,985 INFO L274 PluginConnector]: CDTParser initialized [2023-08-27 10:19:42,986 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe030_power.oepc_pso.oepc_rmo.oepc.i [2023-08-27 10:19:44,099 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-27 10:19:44,283 INFO L384 CDTParser]: Found 1 translation units. [2023-08-27 10:19:44,283 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe030_power.oepc_pso.oepc_rmo.oepc.i [2023-08-27 10:19:44,300 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/73d96a140/11538e4516b94875a89e7ef64400adff/FLAGae580584c [2023-08-27 10:19:44,310 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/73d96a140/11538e4516b94875a89e7ef64400adff [2023-08-27 10:19:44,311 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-27 10:19:44,312 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-27 10:19:44,313 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-27 10:19:44,313 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-27 10:19:44,315 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-27 10:19:44,316 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 10:19:44" (1/1) ... [2023-08-27 10:19:44,316 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4517a99 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:19:44, skipping insertion in model container [2023-08-27 10:19:44,317 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 10:19:44" (1/1) ... [2023-08-27 10:19:44,346 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-27 10:19:44,622 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-27 10:19:44,630 INFO L201 MainTranslator]: Completed pre-run [2023-08-27 10:19:44,649 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-27 10:19:44,650 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-27 10:19:44,690 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-27 10:19:44,712 WARN L669 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-27 10:19:44,713 WARN L669 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-27 10:19:44,717 INFO L206 MainTranslator]: Completed translation [2023-08-27 10:19:44,718 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:19:44 WrapperNode [2023-08-27 10:19:44,718 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-27 10:19:44,719 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-27 10:19:44,719 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-27 10:19:44,719 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-27 10:19:44,723 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:19:44" (1/1) ... [2023-08-27 10:19:44,747 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:19:44" (1/1) ... [2023-08-27 10:19:44,770 INFO L138 Inliner]: procedures = 176, calls = 55, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 151 [2023-08-27 10:19:44,771 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-27 10:19:44,771 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-27 10:19:44,771 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-27 10:19:44,771 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-27 10:19:44,797 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:19:44" (1/1) ... [2023-08-27 10:19:44,797 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:19:44" (1/1) ... [2023-08-27 10:19:44,800 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:19:44" (1/1) ... [2023-08-27 10:19:44,800 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:19:44" (1/1) ... [2023-08-27 10:19:44,806 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:19:44" (1/1) ... [2023-08-27 10:19:44,807 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:19:44" (1/1) ... [2023-08-27 10:19:44,808 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:19:44" (1/1) ... [2023-08-27 10:19:44,809 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:19:44" (1/1) ... [2023-08-27 10:19:44,811 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-27 10:19:44,812 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-27 10:19:44,812 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-27 10:19:44,812 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-27 10:19:44,812 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:19:44" (1/1) ... [2023-08-27 10:19:44,816 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-27 10:19:44,842 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 10:19:44,862 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-27 10:19:44,868 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-27 10:19:44,892 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-27 10:19:44,892 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-27 10:19:44,892 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-27 10:19:44,893 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-27 10:19:44,893 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-27 10:19:44,893 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-27 10:19:44,893 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-27 10:19:44,893 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-27 10:19:44,893 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-27 10:19:44,893 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-27 10:19:44,894 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-27 10:19:44,894 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-27 10:19:44,894 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-27 10:19:44,894 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-27 10:19:44,894 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-27 10:19:44,896 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-27 10:19:45,038 INFO L236 CfgBuilder]: Building ICFG [2023-08-27 10:19:45,040 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-27 10:19:45,291 INFO L277 CfgBuilder]: Performing block encoding [2023-08-27 10:19:45,404 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-27 10:19:45,404 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-27 10:19:45,407 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 10:19:45 BoogieIcfgContainer [2023-08-27 10:19:45,407 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-27 10:19:45,409 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-27 10:19:45,409 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-27 10:19:45,411 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-27 10:19:45,411 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.08 10:19:44" (1/3) ... [2023-08-27 10:19:45,412 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40b1b072 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.08 10:19:45, skipping insertion in model container [2023-08-27 10:19:45,412 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:19:44" (2/3) ... [2023-08-27 10:19:45,412 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40b1b072 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.08 10:19:45, skipping insertion in model container [2023-08-27 10:19:45,412 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 10:19:45" (3/3) ... [2023-08-27 10:19:45,414 INFO L112 eAbstractionObserver]: Analyzing ICFG safe030_power.oepc_pso.oepc_rmo.oepc.i [2023-08-27 10:19:45,427 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-27 10:19:45,427 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations. [2023-08-27 10:19:45,428 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-27 10:19:45,489 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-27 10:19:45,518 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 123 places, 116 transitions, 247 flow [2023-08-27 10:19:45,551 INFO L124 PetriNetUnfolderBase]: 3/113 cut-off events. [2023-08-27 10:19:45,552 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-27 10:19:45,555 INFO L83 FinitePrefix]: Finished finitePrefix Result has 123 conditions, 113 events. 3/113 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 83 event pairs, 0 based on Foata normal form. 0/102 useless extension candidates. Maximal degree in co-relation 79. Up to 2 conditions per place. [2023-08-27 10:19:45,556 INFO L82 GeneralOperation]: Start removeDead. Operand has 123 places, 116 transitions, 247 flow [2023-08-27 10:19:45,559 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 120 places, 113 transitions, 235 flow [2023-08-27 10:19:45,561 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-27 10:19:45,567 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 120 places, 113 transitions, 235 flow [2023-08-27 10:19:45,569 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 120 places, 113 transitions, 235 flow [2023-08-27 10:19:45,570 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 120 places, 113 transitions, 235 flow [2023-08-27 10:19:45,589 INFO L124 PetriNetUnfolderBase]: 3/113 cut-off events. [2023-08-27 10:19:45,589 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-27 10:19:45,590 INFO L83 FinitePrefix]: Finished finitePrefix Result has 123 conditions, 113 events. 3/113 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 82 event pairs, 0 based on Foata normal form. 0/102 useless extension candidates. Maximal degree in co-relation 79. Up to 2 conditions per place. [2023-08-27 10:19:45,591 INFO L119 LiptonReduction]: Number of co-enabled transitions 2776 [2023-08-27 10:19:48,807 INFO L134 LiptonReduction]: Checked pairs total: 10034 [2023-08-27 10:19:48,807 INFO L136 LiptonReduction]: Total number of compositions: 107 [2023-08-27 10:19:48,821 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-27 10:19:48,827 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;@4d2d7dbf, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-27 10:19:48,828 INFO L358 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2023-08-27 10:19:48,830 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-27 10:19:48,830 INFO L124 PetriNetUnfolderBase]: 0/3 cut-off events. [2023-08-27 10:19:48,830 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-27 10:19:48,830 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:19:48,831 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-27 10:19:48,831 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-27 10:19:48,836 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:19:48,836 INFO L85 PathProgramCache]: Analyzing trace with hash 534761, now seen corresponding path program 1 times [2023-08-27 10:19:48,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:19:48,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882808387] [2023-08-27 10:19:48,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:19:48,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:19:48,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:19:49,101 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 10:19:49,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:19:49,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882808387] [2023-08-27 10:19:49,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [882808387] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:19:49,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:19:49,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-27 10:19:49,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841091446] [2023-08-27 10:19:49,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:19:49,116 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-27 10:19:49,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:19:49,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-27 10:19:49,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-27 10:19:49,139 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 223 [2023-08-27 10:19:49,142 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 29 transitions, 67 flow. Second operand has 3 states, 3 states have (on average 96.0) internal successors, (288), 3 states have internal predecessors, (288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:19:49,142 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:19:49,142 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 223 [2023-08-27 10:19:49,143 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:19:49,465 INFO L124 PetriNetUnfolderBase]: 1464/2440 cut-off events. [2023-08-27 10:19:49,466 INFO L125 PetriNetUnfolderBase]: For 28/28 co-relation queries the response was YES. [2023-08-27 10:19:49,471 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4657 conditions, 2440 events. 1464/2440 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 152. Compared 14682 event pairs, 184 based on Foata normal form. 0/1914 useless extension candidates. Maximal degree in co-relation 4646. Up to 1829 conditions per place. [2023-08-27 10:19:49,480 INFO L140 encePairwiseOnDemand]: 220/223 looper letters, 36 selfloop transitions, 2 changer transitions 0/44 dead transitions. [2023-08-27 10:19:49,480 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 44 transitions, 179 flow [2023-08-27 10:19:49,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-27 10:19:49,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-27 10:19:49,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 324 transitions. [2023-08-27 10:19:49,494 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.484304932735426 [2023-08-27 10:19:49,495 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 324 transitions. [2023-08-27 10:19:49,495 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 324 transitions. [2023-08-27 10:19:49,497 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:19:49,498 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 324 transitions. [2023-08-27 10:19:49,502 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 108.0) internal successors, (324), 3 states have internal predecessors, (324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:19:49,505 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 223.0) internal successors, (892), 4 states have internal predecessors, (892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:19:49,505 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 223.0) internal successors, (892), 4 states have internal predecessors, (892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:19:49,506 INFO L175 Difference]: Start difference. First operand has 39 places, 29 transitions, 67 flow. Second operand 3 states and 324 transitions. [2023-08-27 10:19:49,507 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 44 transitions, 179 flow [2023-08-27 10:19:49,508 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 44 transitions, 174 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-27 10:19:49,509 INFO L231 Difference]: Finished difference. Result has 37 places, 28 transitions, 66 flow [2023-08-27 10:19:49,510 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=223, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=66, PETRI_PLACES=37, PETRI_TRANSITIONS=28} [2023-08-27 10:19:49,512 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, -2 predicate places. [2023-08-27 10:19:49,513 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 28 transitions, 66 flow [2023-08-27 10:19:49,513 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 96.0) internal successors, (288), 3 states have internal predecessors, (288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:19:49,513 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:19:49,513 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-08-27 10:19:49,513 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-27 10:19:49,514 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-27 10:19:49,514 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:19:49,514 INFO L85 PathProgramCache]: Analyzing trace with hash -1248400048, now seen corresponding path program 1 times [2023-08-27 10:19:49,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:19:49,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529220208] [2023-08-27 10:19:49,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:19:49,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:19:49,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:19:49,590 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 10:19:49,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:19:49,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529220208] [2023-08-27 10:19:49,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1529220208] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:19:49,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:19:49,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-27 10:19:49,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390082560] [2023-08-27 10:19:49,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:19:49,592 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-27 10:19:49,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:19:49,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-27 10:19:49,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-27 10:19:49,594 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 223 [2023-08-27 10:19:49,594 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 28 transitions, 66 flow. Second operand has 3 states, 3 states have (on average 92.66666666666667) internal successors, (278), 3 states have internal predecessors, (278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:19:49,594 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:19:49,594 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 223 [2023-08-27 10:19:49,594 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:19:49,792 INFO L124 PetriNetUnfolderBase]: 1175/1839 cut-off events. [2023-08-27 10:19:49,793 INFO L125 PetriNetUnfolderBase]: For 109/109 co-relation queries the response was YES. [2023-08-27 10:19:49,794 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3817 conditions, 1839 events. 1175/1839 cut-off events. For 109/109 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 9130 event pairs, 367 based on Foata normal form. 0/1370 useless extension candidates. Maximal degree in co-relation 3807. Up to 1383 conditions per place. [2023-08-27 10:19:49,799 INFO L140 encePairwiseOnDemand]: 213/223 looper letters, 38 selfloop transitions, 4 changer transitions 0/45 dead transitions. [2023-08-27 10:19:49,799 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 45 transitions, 190 flow [2023-08-27 10:19:49,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-27 10:19:49,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-27 10:19:49,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 321 transitions. [2023-08-27 10:19:49,802 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4798206278026906 [2023-08-27 10:19:49,802 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 321 transitions. [2023-08-27 10:19:49,802 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 321 transitions. [2023-08-27 10:19:49,802 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:19:49,802 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 321 transitions. [2023-08-27 10:19:49,803 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 107.0) internal successors, (321), 3 states have internal predecessors, (321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:19:49,805 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 223.0) internal successors, (892), 4 states have internal predecessors, (892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:19:49,805 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 223.0) internal successors, (892), 4 states have internal predecessors, (892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:19:49,806 INFO L175 Difference]: Start difference. First operand has 37 places, 28 transitions, 66 flow. Second operand 3 states and 321 transitions. [2023-08-27 10:19:49,806 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 45 transitions, 190 flow [2023-08-27 10:19:49,806 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 45 transitions, 184 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-27 10:19:49,807 INFO L231 Difference]: Finished difference. Result has 38 places, 31 transitions, 98 flow [2023-08-27 10:19:49,807 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=223, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=98, PETRI_PLACES=38, PETRI_TRANSITIONS=31} [2023-08-27 10:19:49,808 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, -1 predicate places. [2023-08-27 10:19:49,809 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 31 transitions, 98 flow [2023-08-27 10:19:49,810 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 92.66666666666667) internal successors, (278), 3 states have internal predecessors, (278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:19:49,811 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:19:49,811 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 10:19:49,811 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-27 10:19:49,815 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-27 10:19:49,815 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:19:49,815 INFO L85 PathProgramCache]: Analyzing trace with hash 937428387, now seen corresponding path program 1 times [2023-08-27 10:19:49,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:19:49,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241910253] [2023-08-27 10:19:49,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:19:49,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:19:49,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:19:50,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 10:19:50,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:19:50,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241910253] [2023-08-27 10:19:50,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1241910253] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:19:50,389 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:19:50,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-27 10:19:50,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657381034] [2023-08-27 10:19:50,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:19:50,390 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-27 10:19:50,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:19:50,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-27 10:19:50,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-27 10:19:50,391 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 223 [2023-08-27 10:19:50,391 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 31 transitions, 98 flow. Second operand has 4 states, 4 states have (on average 84.25) internal successors, (337), 4 states have internal predecessors, (337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:19:50,391 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:19:50,391 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 223 [2023-08-27 10:19:50,391 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:19:50,783 INFO L124 PetriNetUnfolderBase]: 2408/3727 cut-off events. [2023-08-27 10:19:50,783 INFO L125 PetriNetUnfolderBase]: For 354/386 co-relation queries the response was YES. [2023-08-27 10:19:50,787 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8775 conditions, 3727 events. 2408/3727 cut-off events. For 354/386 co-relation queries the response was YES. Maximal size of possible extension queue 162. Compared 19880 event pairs, 359 based on Foata normal form. 0/3311 useless extension candidates. Maximal degree in co-relation 8764. Up to 2552 conditions per place. [2023-08-27 10:19:50,802 INFO L140 encePairwiseOnDemand]: 211/223 looper letters, 54 selfloop transitions, 13 changer transitions 0/70 dead transitions. [2023-08-27 10:19:50,802 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 70 transitions, 342 flow [2023-08-27 10:19:50,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-27 10:19:50,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-27 10:19:50,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 391 transitions. [2023-08-27 10:19:50,805 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4383408071748879 [2023-08-27 10:19:50,805 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 391 transitions. [2023-08-27 10:19:50,805 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 391 transitions. [2023-08-27 10:19:50,806 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:19:50,806 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 391 transitions. [2023-08-27 10:19:50,807 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 97.75) internal successors, (391), 4 states have internal predecessors, (391), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:19:50,810 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 223.0) internal successors, (1115), 5 states have internal predecessors, (1115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:19:50,810 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 223.0) internal successors, (1115), 5 states have internal predecessors, (1115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:19:50,811 INFO L175 Difference]: Start difference. First operand has 38 places, 31 transitions, 98 flow. Second operand 4 states and 391 transitions. [2023-08-27 10:19:50,811 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 70 transitions, 342 flow [2023-08-27 10:19:50,817 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 70 transitions, 334 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-27 10:19:50,818 INFO L231 Difference]: Finished difference. Result has 43 places, 43 transitions, 194 flow [2023-08-27 10:19:50,818 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=223, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=194, PETRI_PLACES=43, PETRI_TRANSITIONS=43} [2023-08-27 10:19:50,819 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 4 predicate places. [2023-08-27 10:19:50,819 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 43 transitions, 194 flow [2023-08-27 10:19:50,820 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 84.25) internal successors, (337), 4 states have internal predecessors, (337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:19:50,820 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:19:50,820 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 10:19:50,820 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-27 10:19:50,823 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-27 10:19:50,823 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:19:50,824 INFO L85 PathProgramCache]: Analyzing trace with hash -1004493121, now seen corresponding path program 1 times [2023-08-27 10:19:50,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:19:50,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240028904] [2023-08-27 10:19:50,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:19:50,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:19:50,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:19:50,970 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 10:19:50,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:19:50,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240028904] [2023-08-27 10:19:50,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1240028904] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:19:50,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:19:50,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-27 10:19:50,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037167954] [2023-08-27 10:19:50,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:19:50,971 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-27 10:19:50,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:19:50,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-27 10:19:50,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-27 10:19:50,973 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 223 [2023-08-27 10:19:50,973 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 43 transitions, 194 flow. Second operand has 3 states, 3 states have (on average 96.33333333333333) internal successors, (289), 3 states have internal predecessors, (289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:19:50,973 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:19:50,973 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 223 [2023-08-27 10:19:50,973 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:19:51,272 INFO L124 PetriNetUnfolderBase]: 1844/3015 cut-off events. [2023-08-27 10:19:51,272 INFO L125 PetriNetUnfolderBase]: For 1949/2002 co-relation queries the response was YES. [2023-08-27 10:19:51,276 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9368 conditions, 3015 events. 1844/3015 cut-off events. For 1949/2002 co-relation queries the response was YES. Maximal size of possible extension queue 161. Compared 16829 event pairs, 424 based on Foata normal form. 43/2793 useless extension candidates. Maximal degree in co-relation 9353. Up to 2516 conditions per place. [2023-08-27 10:19:51,288 INFO L140 encePairwiseOnDemand]: 219/223 looper letters, 50 selfloop transitions, 5 changer transitions 0/62 dead transitions. [2023-08-27 10:19:51,288 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 62 transitions, 392 flow [2023-08-27 10:19:51,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-27 10:19:51,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-27 10:19:51,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 314 transitions. [2023-08-27 10:19:51,289 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4693572496263079 [2023-08-27 10:19:51,289 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 314 transitions. [2023-08-27 10:19:51,290 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 314 transitions. [2023-08-27 10:19:51,290 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:19:51,290 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 314 transitions. [2023-08-27 10:19:51,290 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 104.66666666666667) internal successors, (314), 3 states have internal predecessors, (314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:19:51,291 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 223.0) internal successors, (892), 4 states have internal predecessors, (892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:19:51,292 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 223.0) internal successors, (892), 4 states have internal predecessors, (892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:19:51,292 INFO L175 Difference]: Start difference. First operand has 43 places, 43 transitions, 194 flow. Second operand 3 states and 314 transitions. [2023-08-27 10:19:51,292 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 62 transitions, 392 flow [2023-08-27 10:19:51,294 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 62 transitions, 392 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-27 10:19:51,295 INFO L231 Difference]: Finished difference. Result has 46 places, 47 transitions, 239 flow [2023-08-27 10:19:51,295 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=223, PETRI_DIFFERENCE_MINUEND_FLOW=194, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=239, PETRI_PLACES=46, PETRI_TRANSITIONS=47} [2023-08-27 10:19:51,296 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 7 predicate places. [2023-08-27 10:19:51,296 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 47 transitions, 239 flow [2023-08-27 10:19:51,296 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 96.33333333333333) internal successors, (289), 3 states have internal predecessors, (289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:19:51,296 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:19:51,296 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 10:19:51,296 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-27 10:19:51,297 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-27 10:19:51,297 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:19:51,297 INFO L85 PathProgramCache]: Analyzing trace with hash 790952657, now seen corresponding path program 1 times [2023-08-27 10:19:51,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:19:51,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611064474] [2023-08-27 10:19:51,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:19:51,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:19:51,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:19:51,428 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 10:19:51,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:19:51,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611064474] [2023-08-27 10:19:51,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [611064474] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:19:51,429 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:19:51,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-27 10:19:51,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129911809] [2023-08-27 10:19:51,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:19:51,429 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-27 10:19:51,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:19:51,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-27 10:19:51,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-27 10:19:51,430 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 223 [2023-08-27 10:19:51,430 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 47 transitions, 239 flow. Second operand has 3 states, 3 states have (on average 96.66666666666667) internal successors, (290), 3 states have internal predecessors, (290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:19:51,430 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:19:51,430 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 223 [2023-08-27 10:19:51,430 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:19:51,802 INFO L124 PetriNetUnfolderBase]: 2533/4195 cut-off events. [2023-08-27 10:19:51,803 INFO L125 PetriNetUnfolderBase]: For 3385/3507 co-relation queries the response was YES. [2023-08-27 10:19:51,809 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13439 conditions, 4195 events. 2533/4195 cut-off events. For 3385/3507 co-relation queries the response was YES. Maximal size of possible extension queue 266. Compared 26404 event pairs, 795 based on Foata normal form. 153/3859 useless extension candidates. Maximal degree in co-relation 13421. Up to 2004 conditions per place. [2023-08-27 10:19:51,824 INFO L140 encePairwiseOnDemand]: 220/223 looper letters, 58 selfloop transitions, 6 changer transitions 0/71 dead transitions. [2023-08-27 10:19:51,824 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 71 transitions, 471 flow [2023-08-27 10:19:51,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-27 10:19:51,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-27 10:19:51,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 319 transitions. [2023-08-27 10:19:51,825 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.476831091180867 [2023-08-27 10:19:51,825 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 319 transitions. [2023-08-27 10:19:51,825 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 319 transitions. [2023-08-27 10:19:51,825 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:19:51,825 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 319 transitions. [2023-08-27 10:19:51,826 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 106.33333333333333) internal successors, (319), 3 states have internal predecessors, (319), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:19:51,827 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 223.0) internal successors, (892), 4 states have internal predecessors, (892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:19:51,827 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 223.0) internal successors, (892), 4 states have internal predecessors, (892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:19:51,827 INFO L175 Difference]: Start difference. First operand has 46 places, 47 transitions, 239 flow. Second operand 3 states and 319 transitions. [2023-08-27 10:19:51,827 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 71 transitions, 471 flow [2023-08-27 10:19:51,829 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 71 transitions, 466 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-27 10:19:51,830 INFO L231 Difference]: Finished difference. Result has 48 places, 47 transitions, 254 flow [2023-08-27 10:19:51,830 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=223, PETRI_DIFFERENCE_MINUEND_FLOW=234, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=254, PETRI_PLACES=48, PETRI_TRANSITIONS=47} [2023-08-27 10:19:51,830 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 9 predicate places. [2023-08-27 10:19:51,830 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 47 transitions, 254 flow [2023-08-27 10:19:51,831 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 96.66666666666667) internal successors, (290), 3 states have internal predecessors, (290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:19:51,831 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:19:51,831 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 10:19:51,831 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-27 10:19:51,831 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-27 10:19:51,831 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:19:51,831 INFO L85 PathProgramCache]: Analyzing trace with hash 791012239, now seen corresponding path program 1 times [2023-08-27 10:19:51,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:19:51,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716241050] [2023-08-27 10:19:51,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:19:51,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:19:51,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:19:52,290 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 10:19:52,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:19:52,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716241050] [2023-08-27 10:19:52,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [716241050] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:19:52,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:19:52,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-27 10:19:52,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923825424] [2023-08-27 10:19:52,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:19:52,291 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-27 10:19:52,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:19:52,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-27 10:19:52,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-27 10:19:52,292 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 223 [2023-08-27 10:19:52,292 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 47 transitions, 254 flow. Second operand has 4 states, 4 states have (on average 84.75) internal successors, (339), 4 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:19:52,292 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:19:52,292 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 223 [2023-08-27 10:19:52,292 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:19:52,815 INFO L124 PetriNetUnfolderBase]: 3335/5326 cut-off events. [2023-08-27 10:19:52,815 INFO L125 PetriNetUnfolderBase]: For 5265/5324 co-relation queries the response was YES. [2023-08-27 10:19:52,824 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17513 conditions, 5326 events. 3335/5326 cut-off events. For 5265/5324 co-relation queries the response was YES. Maximal size of possible extension queue 271. Compared 31727 event pairs, 765 based on Foata normal form. 10/4848 useless extension candidates. Maximal degree in co-relation 17494. Up to 3598 conditions per place. [2023-08-27 10:19:52,848 INFO L140 encePairwiseOnDemand]: 210/223 looper letters, 69 selfloop transitions, 24 changer transitions 0/96 dead transitions. [2023-08-27 10:19:52,848 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 96 transitions, 687 flow [2023-08-27 10:19:52,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-27 10:19:52,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-27 10:19:52,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 391 transitions. [2023-08-27 10:19:52,850 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4383408071748879 [2023-08-27 10:19:52,850 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 391 transitions. [2023-08-27 10:19:52,850 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 391 transitions. [2023-08-27 10:19:52,850 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:19:52,850 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 391 transitions. [2023-08-27 10:19:52,851 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 97.75) internal successors, (391), 4 states have internal predecessors, (391), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:19:52,853 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 223.0) internal successors, (1115), 5 states have internal predecessors, (1115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:19:52,854 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 223.0) internal successors, (1115), 5 states have internal predecessors, (1115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:19:52,854 INFO L175 Difference]: Start difference. First operand has 48 places, 47 transitions, 254 flow. Second operand 4 states and 391 transitions. [2023-08-27 10:19:52,854 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 96 transitions, 687 flow [2023-08-27 10:19:52,861 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 96 transitions, 666 flow, removed 4 selfloop flow, removed 1 redundant places. [2023-08-27 10:19:52,863 INFO L231 Difference]: Finished difference. Result has 53 places, 65 transitions, 480 flow [2023-08-27 10:19:52,863 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=223, PETRI_DIFFERENCE_MINUEND_FLOW=244, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=480, PETRI_PLACES=53, PETRI_TRANSITIONS=65} [2023-08-27 10:19:52,865 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 14 predicate places. [2023-08-27 10:19:52,865 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 65 transitions, 480 flow [2023-08-27 10:19:52,865 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 84.75) internal successors, (339), 4 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:19:52,866 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:19:52,866 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 10:19:52,866 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-27 10:19:52,866 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-27 10:19:52,866 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:19:52,866 INFO L85 PathProgramCache]: Analyzing trace with hash -36297551, now seen corresponding path program 1 times [2023-08-27 10:19:52,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:19:52,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390867775] [2023-08-27 10:19:52,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:19:52,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:19:52,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:19:52,915 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 10:19:52,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:19:52,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390867775] [2023-08-27 10:19:52,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [390867775] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:19:52,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:19:52,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-27 10:19:52,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968970927] [2023-08-27 10:19:52,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:19:52,916 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-27 10:19:52,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:19:52,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-27 10:19:52,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-27 10:19:52,917 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 223 [2023-08-27 10:19:52,917 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 65 transitions, 480 flow. Second operand has 4 states, 4 states have (on average 93.5) internal successors, (374), 4 states have internal predecessors, (374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:19:52,917 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:19:52,917 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 223 [2023-08-27 10:19:52,917 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:19:53,294 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([396] L792-->L799: Formula: (let ((.cse3 (not (= (mod v_~z$r_buff1_thd3~0_22 256) 0))) (.cse4 (not (= (mod v_~z$w_buff0_used~0_115 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd3~0_24 256) 0)))) (let ((.cse1 (and .cse4 .cse5)) (.cse0 (and (not (= (mod v_~z$w_buff0_used~0_116 256) 0)) .cse5)) (.cse2 (and (not (= (mod v_~z$w_buff1_used~0_111 256) 0)) .cse3))) (and (= v_~z$w_buff0_used~0_115 (ite .cse0 0 v_~z$w_buff0_used~0_116)) (= v_~z$r_buff0_thd3~0_23 (ite .cse1 0 v_~z$r_buff0_thd3~0_24)) (= (ite (or .cse2 .cse1) 0 v_~z$w_buff1_used~0_111) v_~z$w_buff1_used~0_110) (= v_~z~0_67 (ite .cse0 v_~z$w_buff0~0_47 (ite .cse2 v_~z$w_buff1~0_42 v_~z~0_68))) (= (ite (or (and (not (= (mod v_~z$w_buff1_used~0_110 256) 0)) .cse3) (and .cse4 (not (= (mod v_~z$r_buff0_thd3~0_23 256) 0)))) 0 v_~z$r_buff1_thd3~0_22) v_~z$r_buff1_thd3~0_21)))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_116, ~z$w_buff0~0=v_~z$w_buff0~0_47, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_22, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_111, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_24, ~z$w_buff1~0=v_~z$w_buff1~0_42, ~z~0=v_~z~0_68} OutVars{~z$w_buff0_used~0=v_~z$w_buff0_used~0_115, ~z$w_buff0~0=v_~z$w_buff0~0_47, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_21, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_110, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_23, ~z$w_buff1~0=v_~z$w_buff1~0_42, ~z~0=v_~z~0_67} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$r_buff1_thd3~0, ~z$w_buff1_used~0, ~z$r_buff0_thd3~0, ~z~0][84], [Black: 155#(and (= ~z$w_buff1_used~0 0) (= ~z$w_buff1~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0)), 2#ULTIMATE.startEXITtrue, Black: 132#(= ~__unbuffered_cnt~0 0), 16#L799true, 164#(<= 1 ~__unbuffered_cnt~0), 117#L772true, 97#P0EXITtrue, 153#true, Black: 138#(and (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (or (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)))) (not (= 2 ~z~0))) (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= 2 ~x~0)) (not (= ~z$w_buff0~0 2))) (or (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))))), Black: 137#(= ~x~0 0), 150#(= ~y~0 1), Black: 145#(= ~y~0 0), P1Thread1of1ForFork1InUse, 135#true, P0Thread1of1ForFork0InUse, P2Thread1of1ForFork2InUse, Black: 156#(and (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (or (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)))) (not (= 2 ~z~0))) (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= 2 ~x~0)) (not (= ~z$w_buff0~0 2))) (or (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))))]) [2023-08-27 10:19:53,294 INFO L294 olderBase$Statistics]: this new event has 18 ancestors and is cut-off event [2023-08-27 10:19:53,294 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-08-27 10:19:53,294 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-08-27 10:19:53,294 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-08-27 10:19:53,356 INFO L124 PetriNetUnfolderBase]: 2614/4110 cut-off events. [2023-08-27 10:19:53,356 INFO L125 PetriNetUnfolderBase]: For 10998/11470 co-relation queries the response was YES. [2023-08-27 10:19:53,366 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17381 conditions, 4110 events. 2614/4110 cut-off events. For 10998/11470 co-relation queries the response was YES. Maximal size of possible extension queue 248. Compared 24185 event pairs, 374 based on Foata normal form. 342/4069 useless extension candidates. Maximal degree in co-relation 17358. Up to 2546 conditions per place. [2023-08-27 10:19:53,382 INFO L140 encePairwiseOnDemand]: 216/223 looper letters, 80 selfloop transitions, 4 changer transitions 0/96 dead transitions. [2023-08-27 10:19:53,382 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 96 transitions, 896 flow [2023-08-27 10:19:53,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-27 10:19:53,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-27 10:19:53,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 406 transitions. [2023-08-27 10:19:53,383 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4551569506726457 [2023-08-27 10:19:53,383 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 406 transitions. [2023-08-27 10:19:53,383 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 406 transitions. [2023-08-27 10:19:53,383 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:19:53,383 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 406 transitions. [2023-08-27 10:19:53,384 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 101.5) internal successors, (406), 4 states have internal predecessors, (406), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:19:53,385 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 223.0) internal successors, (1115), 5 states have internal predecessors, (1115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:19:53,385 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 223.0) internal successors, (1115), 5 states have internal predecessors, (1115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:19:53,385 INFO L175 Difference]: Start difference. First operand has 53 places, 65 transitions, 480 flow. Second operand 4 states and 406 transitions. [2023-08-27 10:19:53,385 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 96 transitions, 896 flow [2023-08-27 10:19:53,388 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 96 transitions, 896 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-27 10:19:53,389 INFO L231 Difference]: Finished difference. Result has 53 places, 62 transitions, 476 flow [2023-08-27 10:19:53,389 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=223, PETRI_DIFFERENCE_MINUEND_FLOW=468, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=476, PETRI_PLACES=53, PETRI_TRANSITIONS=62} [2023-08-27 10:19:53,390 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 14 predicate places. [2023-08-27 10:19:53,390 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 62 transitions, 476 flow [2023-08-27 10:19:53,390 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 93.5) internal successors, (374), 4 states have internal predecessors, (374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:19:53,390 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:19:53,390 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 10:19:53,390 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-27 10:19:53,391 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-27 10:19:53,391 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:19:53,391 INFO L85 PathProgramCache]: Analyzing trace with hash -116684406, now seen corresponding path program 1 times [2023-08-27 10:19:53,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:19:53,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60376029] [2023-08-27 10:19:53,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:19:53,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:19:53,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:19:53,424 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 10:19:53,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:19:53,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [60376029] [2023-08-27 10:19:53,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [60376029] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:19:53,424 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:19:53,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-27 10:19:53,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527198838] [2023-08-27 10:19:53,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:19:53,425 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-27 10:19:53,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:19:53,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-27 10:19:53,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-27 10:19:53,425 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 223 [2023-08-27 10:19:53,426 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 62 transitions, 476 flow. Second operand has 4 states, 4 states have (on average 93.5) internal successors, (374), 4 states have internal predecessors, (374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:19:53,426 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:19:53,426 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 223 [2023-08-27 10:19:53,426 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:19:53,754 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([396] L792-->L799: Formula: (let ((.cse3 (not (= (mod v_~z$r_buff1_thd3~0_22 256) 0))) (.cse4 (not (= (mod v_~z$w_buff0_used~0_115 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd3~0_24 256) 0)))) (let ((.cse1 (and .cse4 .cse5)) (.cse0 (and (not (= (mod v_~z$w_buff0_used~0_116 256) 0)) .cse5)) (.cse2 (and (not (= (mod v_~z$w_buff1_used~0_111 256) 0)) .cse3))) (and (= v_~z$w_buff0_used~0_115 (ite .cse0 0 v_~z$w_buff0_used~0_116)) (= v_~z$r_buff0_thd3~0_23 (ite .cse1 0 v_~z$r_buff0_thd3~0_24)) (= (ite (or .cse2 .cse1) 0 v_~z$w_buff1_used~0_111) v_~z$w_buff1_used~0_110) (= v_~z~0_67 (ite .cse0 v_~z$w_buff0~0_47 (ite .cse2 v_~z$w_buff1~0_42 v_~z~0_68))) (= (ite (or (and (not (= (mod v_~z$w_buff1_used~0_110 256) 0)) .cse3) (and .cse4 (not (= (mod v_~z$r_buff0_thd3~0_23 256) 0)))) 0 v_~z$r_buff1_thd3~0_22) v_~z$r_buff1_thd3~0_21)))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_116, ~z$w_buff0~0=v_~z$w_buff0~0_47, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_22, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_111, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_24, ~z$w_buff1~0=v_~z$w_buff1~0_42, ~z~0=v_~z~0_68} OutVars{~z$w_buff0_used~0=v_~z$w_buff0_used~0_115, ~z$w_buff0~0=v_~z$w_buff0~0_47, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_21, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_110, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_23, ~z$w_buff1~0=v_~z$w_buff1~0_42, ~z~0=v_~z~0_67} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$r_buff1_thd3~0, ~z$w_buff1_used~0, ~z$r_buff0_thd3~0, ~z~0][82], [Black: 155#(and (= ~z$w_buff1_used~0 0) (= ~z$w_buff1~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0)), 2#ULTIMATE.startEXITtrue, Black: 132#(= ~__unbuffered_cnt~0 0), 16#L799true, 164#(<= 1 ~__unbuffered_cnt~0), 117#L772true, 153#true, Black: 138#(and (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (or (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)))) (not (= 2 ~z~0))) (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= 2 ~x~0)) (not (= ~z$w_buff0~0 2))) (or (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))))), 97#P0EXITtrue, Black: 137#(= ~x~0 0), 150#(= ~y~0 1), Black: 145#(= ~y~0 0), P1Thread1of1ForFork1InUse, 135#true, 169#(<= ~__unbuffered_cnt~0 1), P0Thread1of1ForFork0InUse, P2Thread1of1ForFork2InUse, Black: 156#(and (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (or (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)))) (not (= 2 ~z~0))) (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= 2 ~x~0)) (not (= ~z$w_buff0~0 2))) (or (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))))]) [2023-08-27 10:19:53,754 INFO L294 olderBase$Statistics]: this new event has 18 ancestors and is cut-off event [2023-08-27 10:19:53,754 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-08-27 10:19:53,754 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-08-27 10:19:53,755 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-08-27 10:19:53,787 INFO L124 PetriNetUnfolderBase]: 2166/3379 cut-off events. [2023-08-27 10:19:53,788 INFO L125 PetriNetUnfolderBase]: For 9691/10091 co-relation queries the response was YES. [2023-08-27 10:19:53,794 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15067 conditions, 3379 events. 2166/3379 cut-off events. For 9691/10091 co-relation queries the response was YES. Maximal size of possible extension queue 226. Compared 19125 event pairs, 285 based on Foata normal form. 272/3589 useless extension candidates. Maximal degree in co-relation 15042. Up to 1816 conditions per place. [2023-08-27 10:19:53,805 INFO L140 encePairwiseOnDemand]: 216/223 looper letters, 100 selfloop transitions, 7 changer transitions 0/119 dead transitions. [2023-08-27 10:19:53,805 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 119 transitions, 1110 flow [2023-08-27 10:19:53,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-27 10:19:53,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-27 10:19:53,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 421 transitions. [2023-08-27 10:19:53,807 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47197309417040356 [2023-08-27 10:19:53,807 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 421 transitions. [2023-08-27 10:19:53,807 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 421 transitions. [2023-08-27 10:19:53,807 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:19:53,807 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 421 transitions. [2023-08-27 10:19:53,808 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 105.25) internal successors, (421), 4 states have internal predecessors, (421), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:19:53,809 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 223.0) internal successors, (1115), 5 states have internal predecessors, (1115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:19:53,809 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 223.0) internal successors, (1115), 5 states have internal predecessors, (1115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:19:53,809 INFO L175 Difference]: Start difference. First operand has 53 places, 62 transitions, 476 flow. Second operand 4 states and 421 transitions. [2023-08-27 10:19:53,809 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 119 transitions, 1110 flow [2023-08-27 10:19:53,812 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 119 transitions, 1105 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-27 10:19:53,813 INFO L231 Difference]: Finished difference. Result has 55 places, 65 transitions, 515 flow [2023-08-27 10:19:53,813 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=223, PETRI_DIFFERENCE_MINUEND_FLOW=471, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=515, PETRI_PLACES=55, PETRI_TRANSITIONS=65} [2023-08-27 10:19:53,813 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 16 predicate places. [2023-08-27 10:19:53,813 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 65 transitions, 515 flow [2023-08-27 10:19:53,814 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 93.5) internal successors, (374), 4 states have internal predecessors, (374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:19:53,814 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:19:53,814 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 10:19:53,814 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-27 10:19:53,814 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-27 10:19:53,814 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:19:53,814 INFO L85 PathProgramCache]: Analyzing trace with hash -1393507834, now seen corresponding path program 1 times [2023-08-27 10:19:53,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:19:53,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102321324] [2023-08-27 10:19:53,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:19:53,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:19:53,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:19:53,910 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 10:19:53,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:19:53,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102321324] [2023-08-27 10:19:53,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1102321324] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:19:53,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:19:53,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-27 10:19:53,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028049974] [2023-08-27 10:19:53,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:19:53,911 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-27 10:19:53,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:19:53,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-27 10:19:53,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-27 10:19:53,912 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 223 [2023-08-27 10:19:53,912 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 65 transitions, 515 flow. Second operand has 3 states, 3 states have (on average 97.0) internal successors, (291), 3 states have internal predecessors, (291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:19:53,912 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:19:53,912 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 223 [2023-08-27 10:19:53,912 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:19:54,320 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([396] L792-->L799: Formula: (let ((.cse3 (not (= (mod v_~z$r_buff1_thd3~0_22 256) 0))) (.cse4 (not (= (mod v_~z$w_buff0_used~0_115 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd3~0_24 256) 0)))) (let ((.cse1 (and .cse4 .cse5)) (.cse0 (and (not (= (mod v_~z$w_buff0_used~0_116 256) 0)) .cse5)) (.cse2 (and (not (= (mod v_~z$w_buff1_used~0_111 256) 0)) .cse3))) (and (= v_~z$w_buff0_used~0_115 (ite .cse0 0 v_~z$w_buff0_used~0_116)) (= v_~z$r_buff0_thd3~0_23 (ite .cse1 0 v_~z$r_buff0_thd3~0_24)) (= (ite (or .cse2 .cse1) 0 v_~z$w_buff1_used~0_111) v_~z$w_buff1_used~0_110) (= v_~z~0_67 (ite .cse0 v_~z$w_buff0~0_47 (ite .cse2 v_~z$w_buff1~0_42 v_~z~0_68))) (= (ite (or (and (not (= (mod v_~z$w_buff1_used~0_110 256) 0)) .cse3) (and .cse4 (not (= (mod v_~z$r_buff0_thd3~0_23 256) 0)))) 0 v_~z$r_buff1_thd3~0_22) v_~z$r_buff1_thd3~0_21)))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_116, ~z$w_buff0~0=v_~z$w_buff0~0_47, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_22, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_111, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_24, ~z$w_buff1~0=v_~z$w_buff1~0_42, ~z~0=v_~z~0_68} OutVars{~z$w_buff0_used~0=v_~z$w_buff0_used~0_115, ~z$w_buff0~0=v_~z$w_buff0~0_47, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_21, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_110, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_23, ~z$w_buff1~0=v_~z$w_buff1~0_42, ~z~0=v_~z~0_67} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$r_buff1_thd3~0, ~z$w_buff1_used~0, ~z$r_buff0_thd3~0, ~z~0][53], [Black: 155#(and (= ~z$w_buff1_used~0 0) (= ~z$w_buff1~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0)), 2#ULTIMATE.startEXITtrue, Black: 132#(= ~__unbuffered_cnt~0 0), 164#(<= 1 ~__unbuffered_cnt~0), 16#L799true, 117#L772true, 97#P0EXITtrue, 153#true, Black: 138#(and (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (or (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)))) (not (= 2 ~z~0))) (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= 2 ~x~0)) (not (= ~z$w_buff0~0 2))) (or (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))))), Black: 137#(= ~x~0 0), 174#(= ~x~0 1), 150#(= ~y~0 1), Black: 145#(= ~y~0 0), P1Thread1of1ForFork1InUse, 169#(<= ~__unbuffered_cnt~0 1), 135#true, P0Thread1of1ForFork0InUse, P2Thread1of1ForFork2InUse, Black: 156#(and (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (or (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)))) (not (= 2 ~z~0))) (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= 2 ~x~0)) (not (= ~z$w_buff0~0 2))) (or (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))))]) [2023-08-27 10:19:54,320 INFO L294 olderBase$Statistics]: this new event has 18 ancestors and is cut-off event [2023-08-27 10:19:54,321 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-08-27 10:19:54,321 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-08-27 10:19:54,321 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-08-27 10:19:54,434 INFO L124 PetriNetUnfolderBase]: 3100/4953 cut-off events. [2023-08-27 10:19:54,435 INFO L125 PetriNetUnfolderBase]: For 13587/13934 co-relation queries the response was YES. [2023-08-27 10:19:54,445 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23261 conditions, 4953 events. 3100/4953 cut-off events. For 13587/13934 co-relation queries the response was YES. Maximal size of possible extension queue 320. Compared 30343 event pairs, 708 based on Foata normal form. 325/5153 useless extension candidates. Maximal degree in co-relation 23235. Up to 2601 conditions per place. [2023-08-27 10:19:54,463 INFO L140 encePairwiseOnDemand]: 220/223 looper letters, 82 selfloop transitions, 6 changer transitions 0/96 dead transitions. [2023-08-27 10:19:54,463 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 96 transitions, 902 flow [2023-08-27 10:19:54,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-27 10:19:54,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-27 10:19:54,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 321 transitions. [2023-08-27 10:19:54,465 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4798206278026906 [2023-08-27 10:19:54,465 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 321 transitions. [2023-08-27 10:19:54,465 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 321 transitions. [2023-08-27 10:19:54,465 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:19:54,465 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 321 transitions. [2023-08-27 10:19:54,466 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 107.0) internal successors, (321), 3 states have internal predecessors, (321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:19:54,466 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 223.0) internal successors, (892), 4 states have internal predecessors, (892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:19:54,467 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 223.0) internal successors, (892), 4 states have internal predecessors, (892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:19:54,467 INFO L175 Difference]: Start difference. First operand has 55 places, 65 transitions, 515 flow. Second operand 3 states and 321 transitions. [2023-08-27 10:19:54,467 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 96 transitions, 902 flow [2023-08-27 10:19:54,471 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 96 transitions, 876 flow, removed 6 selfloop flow, removed 2 redundant places. [2023-08-27 10:19:54,472 INFO L231 Difference]: Finished difference. Result has 56 places, 65 transitions, 521 flow [2023-08-27 10:19:54,472 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=223, PETRI_DIFFERENCE_MINUEND_FLOW=501, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=521, PETRI_PLACES=56, PETRI_TRANSITIONS=65} [2023-08-27 10:19:54,472 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 17 predicate places. [2023-08-27 10:19:54,473 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 65 transitions, 521 flow [2023-08-27 10:19:54,473 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 97.0) internal successors, (291), 3 states have internal predecessors, (291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:19:54,473 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:19:54,473 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 10:19:54,473 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-27 10:19:54,473 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-27 10:19:54,473 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:19:54,473 INFO L85 PathProgramCache]: Analyzing trace with hash -1253243157, now seen corresponding path program 1 times [2023-08-27 10:19:54,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:19:54,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921334167] [2023-08-27 10:19:54,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:19:54,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:19:54,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:19:55,124 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 10:19:55,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:19:55,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1921334167] [2023-08-27 10:19:55,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1921334167] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:19:55,125 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:19:55,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-27 10:19:55,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199333869] [2023-08-27 10:19:55,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:19:55,125 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-27 10:19:55,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:19:55,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-27 10:19:55,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-08-27 10:19:55,126 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 223 [2023-08-27 10:19:55,126 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 65 transitions, 521 flow. Second operand has 5 states, 5 states have (on average 84.4) internal successors, (422), 5 states have internal predecessors, (422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:19:55,126 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:19:55,126 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 223 [2023-08-27 10:19:55,126 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:19:55,711 INFO L124 PetriNetUnfolderBase]: 3964/6098 cut-off events. [2023-08-27 10:19:55,712 INFO L125 PetriNetUnfolderBase]: For 16394/16394 co-relation queries the response was YES. [2023-08-27 10:19:55,726 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28013 conditions, 6098 events. 3964/6098 cut-off events. For 16394/16394 co-relation queries the response was YES. Maximal size of possible extension queue 307. Compared 34690 event pairs, 417 based on Foata normal form. 12/6038 useless extension candidates. Maximal degree in co-relation 27987. Up to 4015 conditions per place. [2023-08-27 10:19:55,746 INFO L140 encePairwiseOnDemand]: 210/223 looper letters, 103 selfloop transitions, 34 changer transitions 3/140 dead transitions. [2023-08-27 10:19:55,747 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 140 transitions, 1333 flow [2023-08-27 10:19:55,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-27 10:19:55,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-27 10:19:55,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 486 transitions. [2023-08-27 10:19:55,748 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4358744394618834 [2023-08-27 10:19:55,748 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 486 transitions. [2023-08-27 10:19:55,748 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 486 transitions. [2023-08-27 10:19:55,749 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:19:55,749 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 486 transitions. [2023-08-27 10:19:55,750 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 97.2) internal successors, (486), 5 states have internal predecessors, (486), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:19:55,751 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 223.0) internal successors, (1338), 6 states have internal predecessors, (1338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:19:55,751 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 223.0) internal successors, (1338), 6 states have internal predecessors, (1338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:19:55,751 INFO L175 Difference]: Start difference. First operand has 56 places, 65 transitions, 521 flow. Second operand 5 states and 486 transitions. [2023-08-27 10:19:55,751 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 140 transitions, 1333 flow [2023-08-27 10:19:55,761 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 140 transitions, 1318 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-27 10:19:55,762 INFO L231 Difference]: Finished difference. Result has 62 places, 87 transitions, 885 flow [2023-08-27 10:19:55,763 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=223, PETRI_DIFFERENCE_MINUEND_FLOW=515, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=885, PETRI_PLACES=62, PETRI_TRANSITIONS=87} [2023-08-27 10:19:55,763 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 23 predicate places. [2023-08-27 10:19:55,763 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 87 transitions, 885 flow [2023-08-27 10:19:55,764 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 84.4) internal successors, (422), 5 states have internal predecessors, (422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:19:55,764 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:19:55,764 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 10:19:55,764 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-27 10:19:55,764 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-27 10:19:55,764 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:19:55,764 INFO L85 PathProgramCache]: Analyzing trace with hash 1059324526, now seen corresponding path program 1 times [2023-08-27 10:19:55,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:19:55,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151235642] [2023-08-27 10:19:55,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:19:55,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:19:55,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:19:55,980 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 10:19:55,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:19:55,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151235642] [2023-08-27 10:19:55,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1151235642] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:19:55,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:19:55,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-27 10:19:55,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939349667] [2023-08-27 10:19:55,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:19:55,981 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-27 10:19:55,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:19:55,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-27 10:19:55,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-08-27 10:19:55,982 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 223 [2023-08-27 10:19:55,982 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 87 transitions, 885 flow. Second operand has 5 states, 5 states have (on average 91.4) internal successors, (457), 5 states have internal predecessors, (457), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:19:55,982 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:19:55,982 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 223 [2023-08-27 10:19:55,982 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:19:56,594 INFO L124 PetriNetUnfolderBase]: 3670/5710 cut-off events. [2023-08-27 10:19:56,594 INFO L125 PetriNetUnfolderBase]: For 24360/25225 co-relation queries the response was YES. [2023-08-27 10:19:56,606 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31368 conditions, 5710 events. 3670/5710 cut-off events. For 24360/25225 co-relation queries the response was YES. Maximal size of possible extension queue 342. Compared 33613 event pairs, 668 based on Foata normal form. 573/6154 useless extension candidates. Maximal degree in co-relation 31338. Up to 4835 conditions per place. [2023-08-27 10:19:56,624 INFO L140 encePairwiseOnDemand]: 217/223 looper letters, 98 selfloop transitions, 16 changer transitions 0/128 dead transitions. [2023-08-27 10:19:56,624 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 128 transitions, 1492 flow [2023-08-27 10:19:56,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-27 10:19:56,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-27 10:19:56,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 403 transitions. [2023-08-27 10:19:56,626 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4517937219730942 [2023-08-27 10:19:56,626 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 403 transitions. [2023-08-27 10:19:56,626 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 403 transitions. [2023-08-27 10:19:56,626 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:19:56,626 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 403 transitions. [2023-08-27 10:19:56,627 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 100.75) internal successors, (403), 4 states have internal predecessors, (403), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:19:56,628 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 223.0) internal successors, (1115), 5 states have internal predecessors, (1115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:19:56,628 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 223.0) internal successors, (1115), 5 states have internal predecessors, (1115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:19:56,628 INFO L175 Difference]: Start difference. First operand has 62 places, 87 transitions, 885 flow. Second operand 4 states and 403 transitions. [2023-08-27 10:19:56,628 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 128 transitions, 1492 flow [2023-08-27 10:19:56,637 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 128 transitions, 1486 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-08-27 10:19:56,639 INFO L231 Difference]: Finished difference. Result has 65 places, 95 transitions, 1023 flow [2023-08-27 10:19:56,639 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=223, PETRI_DIFFERENCE_MINUEND_FLOW=879, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1023, PETRI_PLACES=65, PETRI_TRANSITIONS=95} [2023-08-27 10:19:56,639 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 26 predicate places. [2023-08-27 10:19:56,639 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 95 transitions, 1023 flow [2023-08-27 10:19:56,639 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 91.4) internal successors, (457), 5 states have internal predecessors, (457), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:19:56,639 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:19:56,639 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 10:19:56,640 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-27 10:19:56,640 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-27 10:19:56,640 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:19:56,640 INFO L85 PathProgramCache]: Analyzing trace with hash -1519253426, now seen corresponding path program 1 times [2023-08-27 10:19:56,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:19:56,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730826421] [2023-08-27 10:19:56,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:19:56,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:19:56,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:19:56,878 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 10:19:56,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:19:56,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730826421] [2023-08-27 10:19:56,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [730826421] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:19:56,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:19:56,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-27 10:19:56,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250062140] [2023-08-27 10:19:56,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:19:56,878 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-27 10:19:56,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:19:56,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-27 10:19:56,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-08-27 10:19:56,879 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 223 [2023-08-27 10:19:56,880 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 95 transitions, 1023 flow. Second operand has 6 states, 6 states have (on average 91.16666666666667) internal successors, (547), 6 states have internal predecessors, (547), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:19:56,880 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:19:56,880 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 223 [2023-08-27 10:19:56,880 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:19:57,619 INFO L124 PetriNetUnfolderBase]: 4320/6733 cut-off events. [2023-08-27 10:19:57,620 INFO L125 PetriNetUnfolderBase]: For 34240/35105 co-relation queries the response was YES. [2023-08-27 10:19:57,640 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38962 conditions, 6733 events. 4320/6733 cut-off events. For 34240/35105 co-relation queries the response was YES. Maximal size of possible extension queue 417. Compared 41190 event pairs, 447 based on Foata normal form. 665/7248 useless extension candidates. Maximal degree in co-relation 38930. Up to 4650 conditions per place. [2023-08-27 10:19:57,666 INFO L140 encePairwiseOnDemand]: 216/223 looper letters, 112 selfloop transitions, 22 changer transitions 0/148 dead transitions. [2023-08-27 10:19:57,666 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 148 transitions, 1759 flow [2023-08-27 10:19:57,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-27 10:19:57,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-27 10:19:57,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 590 transitions. [2023-08-27 10:19:57,668 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44095665171898357 [2023-08-27 10:19:57,668 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 590 transitions. [2023-08-27 10:19:57,668 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 590 transitions. [2023-08-27 10:19:57,668 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:19:57,668 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 590 transitions. [2023-08-27 10:19:57,669 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 98.33333333333333) internal successors, (590), 6 states have internal predecessors, (590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:19:57,670 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 223.0) internal successors, (1561), 7 states have internal predecessors, (1561), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:19:57,671 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 223.0) internal successors, (1561), 7 states have internal predecessors, (1561), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:19:57,671 INFO L175 Difference]: Start difference. First operand has 65 places, 95 transitions, 1023 flow. Second operand 6 states and 590 transitions. [2023-08-27 10:19:57,671 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 148 transitions, 1759 flow [2023-08-27 10:19:57,704 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 148 transitions, 1748 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-08-27 10:19:57,705 INFO L231 Difference]: Finished difference. Result has 71 places, 101 transitions, 1171 flow [2023-08-27 10:19:57,705 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=223, PETRI_DIFFERENCE_MINUEND_FLOW=1012, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1171, PETRI_PLACES=71, PETRI_TRANSITIONS=101} [2023-08-27 10:19:57,706 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 32 predicate places. [2023-08-27 10:19:57,706 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 101 transitions, 1171 flow [2023-08-27 10:19:57,706 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 91.16666666666667) internal successors, (547), 6 states have internal predecessors, (547), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:19:57,706 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:19:57,706 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 10:19:57,706 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-27 10:19:57,706 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-27 10:19:57,706 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:19:57,707 INFO L85 PathProgramCache]: Analyzing trace with hash -420035838, now seen corresponding path program 1 times [2023-08-27 10:19:57,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:19:57,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253109694] [2023-08-27 10:19:57,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:19:57,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:19:57,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:19:57,801 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 10:19:57,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:19:57,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253109694] [2023-08-27 10:19:57,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1253109694] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:19:57,801 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:19:57,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-27 10:19:57,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345012378] [2023-08-27 10:19:57,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:19:57,802 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-27 10:19:57,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:19:57,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-27 10:19:57,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-27 10:19:57,803 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 223 [2023-08-27 10:19:57,803 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 101 transitions, 1171 flow. Second operand has 4 states, 4 states have (on average 92.25) internal successors, (369), 4 states have internal predecessors, (369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:19:57,803 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:19:57,803 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 223 [2023-08-27 10:19:57,803 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:19:58,434 INFO L124 PetriNetUnfolderBase]: 2626/4338 cut-off events. [2023-08-27 10:19:58,434 INFO L125 PetriNetUnfolderBase]: For 37828/39408 co-relation queries the response was YES. [2023-08-27 10:19:58,444 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27102 conditions, 4338 events. 2626/4338 cut-off events. For 37828/39408 co-relation queries the response was YES. Maximal size of possible extension queue 305. Compared 27803 event pairs, 252 based on Foata normal form. 1579/5812 useless extension candidates. Maximal degree in co-relation 27067. Up to 2681 conditions per place. [2023-08-27 10:19:58,461 INFO L140 encePairwiseOnDemand]: 217/223 looper letters, 191 selfloop transitions, 8 changer transitions 3/219 dead transitions. [2023-08-27 10:19:58,461 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 219 transitions, 3039 flow [2023-08-27 10:19:58,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-27 10:19:58,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-27 10:19:58,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 504 transitions. [2023-08-27 10:19:58,463 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45201793721973094 [2023-08-27 10:19:58,463 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 504 transitions. [2023-08-27 10:19:58,463 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 504 transitions. [2023-08-27 10:19:58,463 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:19:58,463 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 504 transitions. [2023-08-27 10:19:58,464 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 100.8) internal successors, (504), 5 states have internal predecessors, (504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:19:58,465 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 223.0) internal successors, (1338), 6 states have internal predecessors, (1338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:19:58,466 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 223.0) internal successors, (1338), 6 states have internal predecessors, (1338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:19:58,466 INFO L175 Difference]: Start difference. First operand has 71 places, 101 transitions, 1171 flow. Second operand 5 states and 504 transitions. [2023-08-27 10:19:58,466 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 219 transitions, 3039 flow [2023-08-27 10:19:58,495 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 219 transitions, 2989 flow, removed 20 selfloop flow, removed 2 redundant places. [2023-08-27 10:19:58,497 INFO L231 Difference]: Finished difference. Result has 76 places, 98 transitions, 1151 flow [2023-08-27 10:19:58,497 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=223, PETRI_DIFFERENCE_MINUEND_FLOW=1078, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1151, PETRI_PLACES=76, PETRI_TRANSITIONS=98} [2023-08-27 10:19:58,497 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 37 predicate places. [2023-08-27 10:19:58,498 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 98 transitions, 1151 flow [2023-08-27 10:19:58,498 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 92.25) internal successors, (369), 4 states have internal predecessors, (369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:19:58,498 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:19:58,498 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 10:19:58,498 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-27 10:19:58,498 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-27 10:19:58,498 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:19:58,498 INFO L85 PathProgramCache]: Analyzing trace with hash 1907040355, now seen corresponding path program 1 times [2023-08-27 10:19:58,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:19:58,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261696197] [2023-08-27 10:19:58,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:19:58,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:19:58,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:19:58,603 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 10:19:58,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:19:58,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261696197] [2023-08-27 10:19:58,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [261696197] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:19:58,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:19:58,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-27 10:19:58,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906280525] [2023-08-27 10:19:58,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:19:58,603 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-27 10:19:58,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:19:58,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-27 10:19:58,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-27 10:19:58,604 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 223 [2023-08-27 10:19:58,605 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 98 transitions, 1151 flow. Second operand has 5 states, 5 states have (on average 91.8) internal successors, (459), 5 states have internal predecessors, (459), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:19:58,605 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:19:58,605 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 223 [2023-08-27 10:19:58,605 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:19:58,998 INFO L124 PetriNetUnfolderBase]: 1733/2938 cut-off events. [2023-08-27 10:19:58,998 INFO L125 PetriNetUnfolderBase]: For 30500/31680 co-relation queries the response was YES. [2023-08-27 10:19:59,005 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18630 conditions, 2938 events. 1733/2938 cut-off events. For 30500/31680 co-relation queries the response was YES. Maximal size of possible extension queue 234. Compared 18248 event pairs, 110 based on Foata normal form. 1071/3901 useless extension candidates. Maximal degree in co-relation 18592. Up to 1576 conditions per place. [2023-08-27 10:19:59,015 INFO L140 encePairwiseOnDemand]: 217/223 looper letters, 198 selfloop transitions, 15 changer transitions 3/232 dead transitions. [2023-08-27 10:19:59,015 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 232 transitions, 3195 flow [2023-08-27 10:19:59,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-27 10:19:59,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-27 10:19:59,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 703 transitions. [2023-08-27 10:19:59,030 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45035233824471493 [2023-08-27 10:19:59,030 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 703 transitions. [2023-08-27 10:19:59,030 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 703 transitions. [2023-08-27 10:19:59,030 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:19:59,030 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 703 transitions. [2023-08-27 10:19:59,031 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 100.42857142857143) internal successors, (703), 7 states have internal predecessors, (703), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:19:59,033 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 223.0) internal successors, (1784), 8 states have internal predecessors, (1784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:19:59,033 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 223.0) internal successors, (1784), 8 states have internal predecessors, (1784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:19:59,033 INFO L175 Difference]: Start difference. First operand has 76 places, 98 transitions, 1151 flow. Second operand 7 states and 703 transitions. [2023-08-27 10:19:59,033 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 232 transitions, 3195 flow [2023-08-27 10:19:59,061 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 232 transitions, 3171 flow, removed 1 selfloop flow, removed 3 redundant places. [2023-08-27 10:19:59,063 INFO L231 Difference]: Finished difference. Result has 82 places, 93 transitions, 1084 flow [2023-08-27 10:19:59,063 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=223, PETRI_DIFFERENCE_MINUEND_FLOW=1011, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1084, PETRI_PLACES=82, PETRI_TRANSITIONS=93} [2023-08-27 10:19:59,064 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 43 predicate places. [2023-08-27 10:19:59,064 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 93 transitions, 1084 flow [2023-08-27 10:19:59,064 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 91.8) internal successors, (459), 5 states have internal predecessors, (459), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:19:59,064 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:19:59,064 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 10:19:59,064 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-27 10:19:59,064 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting P2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-27 10:19:59,065 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:19:59,065 INFO L85 PathProgramCache]: Analyzing trace with hash 1637340650, now seen corresponding path program 1 times [2023-08-27 10:19:59,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:19:59,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980705470] [2023-08-27 10:19:59,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:19:59,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:19:59,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:19:59,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 10:19:59,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:19:59,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980705470] [2023-08-27 10:19:59,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1980705470] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:19:59,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:19:59,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-27 10:19:59,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608875786] [2023-08-27 10:19:59,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:19:59,118 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-27 10:19:59,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:19:59,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-27 10:19:59,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-27 10:19:59,119 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 223 [2023-08-27 10:19:59,119 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 93 transitions, 1084 flow. Second operand has 5 states, 5 states have (on average 94.0) internal successors, (470), 5 states have internal predecessors, (470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:19:59,119 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:19:59,119 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 223 [2023-08-27 10:19:59,119 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:19:59,443 INFO L124 PetriNetUnfolderBase]: 1698/2890 cut-off events. [2023-08-27 10:19:59,443 INFO L125 PetriNetUnfolderBase]: For 26307/27060 co-relation queries the response was YES. [2023-08-27 10:19:59,450 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19590 conditions, 2890 events. 1698/2890 cut-off events. For 26307/27060 co-relation queries the response was YES. Maximal size of possible extension queue 246. Compared 17914 event pairs, 195 based on Foata normal form. 478/3342 useless extension candidates. Maximal degree in co-relation 19550. Up to 1555 conditions per place. [2023-08-27 10:19:59,453 INFO L140 encePairwiseOnDemand]: 216/223 looper letters, 78 selfloop transitions, 10 changer transitions 43/144 dead transitions. [2023-08-27 10:19:59,454 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 144 transitions, 1982 flow [2023-08-27 10:19:59,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-27 10:19:59,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-27 10:19:59,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 507 transitions. [2023-08-27 10:19:59,455 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4547085201793722 [2023-08-27 10:19:59,455 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 507 transitions. [2023-08-27 10:19:59,455 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 507 transitions. [2023-08-27 10:19:59,456 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:19:59,456 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 507 transitions. [2023-08-27 10:19:59,456 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 101.4) internal successors, (507), 5 states have internal predecessors, (507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:19:59,457 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 223.0) internal successors, (1338), 6 states have internal predecessors, (1338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:19:59,458 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 223.0) internal successors, (1338), 6 states have internal predecessors, (1338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:19:59,458 INFO L175 Difference]: Start difference. First operand has 82 places, 93 transitions, 1084 flow. Second operand 5 states and 507 transitions. [2023-08-27 10:19:59,458 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 144 transitions, 1982 flow [2023-08-27 10:19:59,494 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 144 transitions, 1955 flow, removed 1 selfloop flow, removed 4 redundant places. [2023-08-27 10:19:59,495 INFO L231 Difference]: Finished difference. Result has 79 places, 66 transitions, 760 flow [2023-08-27 10:19:59,495 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=223, PETRI_DIFFERENCE_MINUEND_FLOW=1039, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=760, PETRI_PLACES=79, PETRI_TRANSITIONS=66} [2023-08-27 10:19:59,496 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 40 predicate places. [2023-08-27 10:19:59,496 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 66 transitions, 760 flow [2023-08-27 10:19:59,496 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 94.0) internal successors, (470), 5 states have internal predecessors, (470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:19:59,496 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:19:59,496 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 10:19:59,496 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-27 10:19:59,496 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-27 10:19:59,497 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:19:59,497 INFO L85 PathProgramCache]: Analyzing trace with hash -639531452, now seen corresponding path program 1 times [2023-08-27 10:19:59,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:19:59,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258134028] [2023-08-27 10:19:59,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:19:59,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:19:59,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:19:59,617 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 10:19:59,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:19:59,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1258134028] [2023-08-27 10:19:59,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1258134028] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:19:59,619 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:19:59,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-27 10:19:59,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197031810] [2023-08-27 10:19:59,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:19:59,620 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-27 10:19:59,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:19:59,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-27 10:19:59,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-27 10:19:59,621 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 223 [2023-08-27 10:19:59,621 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 66 transitions, 760 flow. Second operand has 6 states, 6 states have (on average 91.66666666666667) internal successors, (550), 6 states have internal predecessors, (550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:19:59,621 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:19:59,621 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 223 [2023-08-27 10:19:59,621 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:19:59,784 INFO L124 PetriNetUnfolderBase]: 549/1025 cut-off events. [2023-08-27 10:19:59,784 INFO L125 PetriNetUnfolderBase]: For 7835/7954 co-relation queries the response was YES. [2023-08-27 10:19:59,787 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6696 conditions, 1025 events. 549/1025 cut-off events. For 7835/7954 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 5626 event pairs, 58 based on Foata normal form. 115/1123 useless extension candidates. Maximal degree in co-relation 6656. Up to 524 conditions per place. [2023-08-27 10:19:59,789 INFO L140 encePairwiseOnDemand]: 217/223 looper letters, 49 selfloop transitions, 10 changer transitions 57/121 dead transitions. [2023-08-27 10:19:59,789 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 121 transitions, 1578 flow [2023-08-27 10:19:59,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-27 10:19:59,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-27 10:19:59,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 677 transitions. [2023-08-27 10:19:59,791 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4336963484945548 [2023-08-27 10:19:59,791 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 677 transitions. [2023-08-27 10:19:59,791 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 677 transitions. [2023-08-27 10:19:59,791 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:19:59,791 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 677 transitions. [2023-08-27 10:19:59,792 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 96.71428571428571) internal successors, (677), 7 states have internal predecessors, (677), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:19:59,793 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 223.0) internal successors, (1784), 8 states have internal predecessors, (1784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:19:59,794 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 223.0) internal successors, (1784), 8 states have internal predecessors, (1784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:19:59,794 INFO L175 Difference]: Start difference. First operand has 79 places, 66 transitions, 760 flow. Second operand 7 states and 677 transitions. [2023-08-27 10:19:59,794 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 121 transitions, 1578 flow [2023-08-27 10:19:59,802 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 121 transitions, 1454 flow, removed 42 selfloop flow, removed 11 redundant places. [2023-08-27 10:19:59,803 INFO L231 Difference]: Finished difference. Result has 72 places, 43 transitions, 424 flow [2023-08-27 10:19:59,803 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=223, PETRI_DIFFERENCE_MINUEND_FLOW=679, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=424, PETRI_PLACES=72, PETRI_TRANSITIONS=43} [2023-08-27 10:19:59,803 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 33 predicate places. [2023-08-27 10:19:59,803 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 43 transitions, 424 flow [2023-08-27 10:19:59,804 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 91.66666666666667) internal successors, (550), 6 states have internal predecessors, (550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:19:59,804 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:19:59,804 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 10:19:59,804 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-08-27 10:19:59,804 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-27 10:19:59,804 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:19:59,804 INFO L85 PathProgramCache]: Analyzing trace with hash 1999220311, now seen corresponding path program 1 times [2023-08-27 10:19:59,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:19:59,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909601027] [2023-08-27 10:19:59,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:19:59,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:19:59,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:20:00,298 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 10:20:00,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:20:00,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909601027] [2023-08-27 10:20:00,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1909601027] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:20:00,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:20:00,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-27 10:20:00,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277098398] [2023-08-27 10:20:00,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:20:00,299 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-27 10:20:00,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:20:00,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-27 10:20:00,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-08-27 10:20:00,300 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 223 [2023-08-27 10:20:00,301 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 43 transitions, 424 flow. Second operand has 7 states, 7 states have (on average 91.71428571428571) internal successors, (642), 7 states have internal predecessors, (642), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:20:00,301 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:20:00,301 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 223 [2023-08-27 10:20:00,301 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:20:00,424 INFO L124 PetriNetUnfolderBase]: 130/263 cut-off events. [2023-08-27 10:20:00,424 INFO L125 PetriNetUnfolderBase]: For 1048/1048 co-relation queries the response was YES. [2023-08-27 10:20:00,425 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1504 conditions, 263 events. 130/263 cut-off events. For 1048/1048 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 866 event pairs, 18 based on Foata normal form. 1/264 useless extension candidates. Maximal degree in co-relation 1469. Up to 181 conditions per place. [2023-08-27 10:20:00,425 INFO L140 encePairwiseOnDemand]: 216/223 looper letters, 41 selfloop transitions, 16 changer transitions 8/68 dead transitions. [2023-08-27 10:20:00,425 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 68 transitions, 721 flow [2023-08-27 10:20:00,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-27 10:20:00,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-27 10:20:00,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 577 transitions. [2023-08-27 10:20:00,427 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4312406576980568 [2023-08-27 10:20:00,427 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 577 transitions. [2023-08-27 10:20:00,427 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 577 transitions. [2023-08-27 10:20:00,427 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:20:00,427 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 577 transitions. [2023-08-27 10:20:00,428 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 96.16666666666667) internal successors, (577), 6 states have internal predecessors, (577), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:20:00,429 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 223.0) internal successors, (1561), 7 states have internal predecessors, (1561), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:20:00,430 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 223.0) internal successors, (1561), 7 states have internal predecessors, (1561), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:20:00,430 INFO L175 Difference]: Start difference. First operand has 72 places, 43 transitions, 424 flow. Second operand 6 states and 577 transitions. [2023-08-27 10:20:00,430 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 68 transitions, 721 flow [2023-08-27 10:20:00,432 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 68 transitions, 531 flow, removed 32 selfloop flow, removed 20 redundant places. [2023-08-27 10:20:00,433 INFO L231 Difference]: Finished difference. Result has 54 places, 44 transitions, 329 flow [2023-08-27 10:20:00,433 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=223, PETRI_DIFFERENCE_MINUEND_FLOW=272, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=329, PETRI_PLACES=54, PETRI_TRANSITIONS=44} [2023-08-27 10:20:00,433 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 15 predicate places. [2023-08-27 10:20:00,433 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 44 transitions, 329 flow [2023-08-27 10:20:00,433 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 91.71428571428571) internal successors, (642), 7 states have internal predecessors, (642), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:20:00,433 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:20:00,434 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 10:20:00,434 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-08-27 10:20:00,434 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-27 10:20:00,434 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:20:00,434 INFO L85 PathProgramCache]: Analyzing trace with hash 2134584555, now seen corresponding path program 2 times [2023-08-27 10:20:00,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:20:00,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633270012] [2023-08-27 10:20:00,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:20:00,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:20:00,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:20:01,030 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 10:20:01,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:20:01,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633270012] [2023-08-27 10:20:01,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [633270012] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:20:01,030 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:20:01,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-27 10:20:01,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070577459] [2023-08-27 10:20:01,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:20:01,031 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-27 10:20:01,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:20:01,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-27 10:20:01,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2023-08-27 10:20:01,032 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 223 [2023-08-27 10:20:01,033 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 44 transitions, 329 flow. Second operand has 9 states, 9 states have (on average 88.11111111111111) internal successors, (793), 9 states have internal predecessors, (793), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:20:01,033 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:20:01,033 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 223 [2023-08-27 10:20:01,033 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:20:01,154 INFO L124 PetriNetUnfolderBase]: 132/279 cut-off events. [2023-08-27 10:20:01,154 INFO L125 PetriNetUnfolderBase]: For 773/773 co-relation queries the response was YES. [2023-08-27 10:20:01,155 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1335 conditions, 279 events. 132/279 cut-off events. For 773/773 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 968 event pairs, 44 based on Foata normal form. 1/280 useless extension candidates. Maximal degree in co-relation 1313. Up to 151 conditions per place. [2023-08-27 10:20:01,155 INFO L140 encePairwiseOnDemand]: 218/223 looper letters, 39 selfloop transitions, 6 changer transitions 22/69 dead transitions. [2023-08-27 10:20:01,155 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 69 transitions, 611 flow [2023-08-27 10:20:01,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-27 10:20:01,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-27 10:20:01,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 468 transitions. [2023-08-27 10:20:01,157 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41973094170403585 [2023-08-27 10:20:01,157 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 468 transitions. [2023-08-27 10:20:01,157 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 468 transitions. [2023-08-27 10:20:01,157 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:20:01,157 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 468 transitions. [2023-08-27 10:20:01,158 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 93.6) internal successors, (468), 5 states have internal predecessors, (468), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:20:01,159 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 223.0) internal successors, (1338), 6 states have internal predecessors, (1338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:20:01,159 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 223.0) internal successors, (1338), 6 states have internal predecessors, (1338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:20:01,159 INFO L175 Difference]: Start difference. First operand has 54 places, 44 transitions, 329 flow. Second operand 5 states and 468 transitions. [2023-08-27 10:20:01,159 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 69 transitions, 611 flow [2023-08-27 10:20:01,161 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 69 transitions, 592 flow, removed 3 selfloop flow, removed 3 redundant places. [2023-08-27 10:20:01,162 INFO L231 Difference]: Finished difference. Result has 57 places, 38 transitions, 281 flow [2023-08-27 10:20:01,162 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=223, PETRI_DIFFERENCE_MINUEND_FLOW=314, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=281, PETRI_PLACES=57, PETRI_TRANSITIONS=38} [2023-08-27 10:20:01,162 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 18 predicate places. [2023-08-27 10:20:01,162 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 38 transitions, 281 flow [2023-08-27 10:20:01,163 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 88.11111111111111) internal successors, (793), 9 states have internal predecessors, (793), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:20:01,163 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:20:01,163 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 10:20:01,163 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-08-27 10:20:01,163 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-27 10:20:01,164 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:20:01,164 INFO L85 PathProgramCache]: Analyzing trace with hash 2144926867, now seen corresponding path program 3 times [2023-08-27 10:20:01,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:20:01,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962429728] [2023-08-27 10:20:01,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:20:01,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:20:01,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-27 10:20:01,198 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-27 10:20:01,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-27 10:20:01,269 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-27 10:20:01,269 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-27 10:20:01,270 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONASSERT (17 of 18 remaining) [2023-08-27 10:20:01,271 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONASSERT (16 of 18 remaining) [2023-08-27 10:20:01,271 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 18 remaining) [2023-08-27 10:20:01,272 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 18 remaining) [2023-08-27 10:20:01,272 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 18 remaining) [2023-08-27 10:20:01,272 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 18 remaining) [2023-08-27 10:20:01,272 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 18 remaining) [2023-08-27 10:20:01,273 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 18 remaining) [2023-08-27 10:20:01,273 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (9 of 18 remaining) [2023-08-27 10:20:01,273 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 18 remaining) [2023-08-27 10:20:01,273 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (7 of 18 remaining) [2023-08-27 10:20:01,273 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONASSERT (6 of 18 remaining) [2023-08-27 10:20:01,273 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 18 remaining) [2023-08-27 10:20:01,273 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 18 remaining) [2023-08-27 10:20:01,273 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 18 remaining) [2023-08-27 10:20:01,273 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 18 remaining) [2023-08-27 10:20:01,273 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 18 remaining) [2023-08-27 10:20:01,273 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 18 remaining) [2023-08-27 10:20:01,273 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-08-27 10:20:01,273 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 10:20:01,277 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-27 10:20:01,278 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-27 10:20:01,338 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.08 10:20:01 BasicIcfg [2023-08-27 10:20:01,338 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-27 10:20:01,338 INFO L158 Benchmark]: Toolchain (without parser) took 17025.86ms. Allocated memory was 316.7MB in the beginning and 1.4GB in the end (delta: 1.1GB). Free memory was 274.9MB in the beginning and 1.1GB in the end (delta: -817.4MB). Peak memory consumption was 293.1MB. Max. memory is 16.0GB. [2023-08-27 10:20:01,338 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 316.7MB. Free memory was 294.7MB in the beginning and 294.5MB in the end (delta: 157.4kB). There was no memory consumed. Max. memory is 16.0GB. [2023-08-27 10:20:01,338 INFO L158 Benchmark]: CACSL2BoogieTranslator took 404.81ms. Allocated memory is still 316.7MB. Free memory was 274.9MB in the beginning and 251.9MB in the end (delta: 23.0MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. [2023-08-27 10:20:01,339 INFO L158 Benchmark]: Boogie Procedure Inliner took 52.31ms. Allocated memory is still 316.7MB. Free memory was 251.9MB in the beginning and 248.7MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-27 10:20:01,339 INFO L158 Benchmark]: Boogie Preprocessor took 39.99ms. Allocated memory is still 316.7MB. Free memory was 248.7MB in the beginning and 246.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-27 10:20:01,339 INFO L158 Benchmark]: RCFGBuilder took 595.12ms. Allocated memory is still 316.7MB. Free memory was 246.6MB in the beginning and 207.8MB in the end (delta: 38.8MB). Peak memory consumption was 39.8MB. Max. memory is 16.0GB. [2023-08-27 10:20:01,339 INFO L158 Benchmark]: TraceAbstraction took 15929.15ms. Allocated memory was 316.7MB in the beginning and 1.4GB in the end (delta: 1.1GB). Free memory was 207.8MB in the beginning and 1.1GB in the end (delta: -884.4MB). Peak memory consumption was 226.0MB. Max. memory is 16.0GB. [2023-08-27 10:20:01,340 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.11ms. Allocated memory is still 316.7MB. Free memory was 294.7MB in the beginning and 294.5MB in the end (delta: 157.4kB). There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 404.81ms. Allocated memory is still 316.7MB. Free memory was 274.9MB in the beginning and 251.9MB in the end (delta: 23.0MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 52.31ms. Allocated memory is still 316.7MB. Free memory was 251.9MB in the beginning and 248.7MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 39.99ms. Allocated memory is still 316.7MB. Free memory was 248.7MB in the beginning and 246.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 595.12ms. Allocated memory is still 316.7MB. Free memory was 246.6MB in the beginning and 207.8MB in the end (delta: 38.8MB). Peak memory consumption was 39.8MB. Max. memory is 16.0GB. * TraceAbstraction took 15929.15ms. Allocated memory was 316.7MB in the beginning and 1.4GB in the end (delta: 1.1GB). Free memory was 207.8MB in the beginning and 1.1GB in the end (delta: -884.4MB). Peak memory consumption was 226.0MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 267]: Unsoundness Warning unspecified type, defaulting to int C: short [267] - GenericResultAtLocation [Line: 267]: Unsoundness Warning unspecified type, defaulting to int C: short [267] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.2s, 120 PlacesBefore, 39 PlacesAfterwards, 113 TransitionsBefore, 29 TransitionsAfterwards, 2776 CoEnabledTransitionPairs, 7 FixpointIterations, 36 TrivialSequentialCompositions, 52 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 16 ConcurrentYvCompositions, 3 ChoiceCompositions, 107 TotalNumberOfCompositions, 10034 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3185, independent: 2901, independent conditional: 0, independent unconditional: 2901, dependent: 284, dependent conditional: 0, dependent unconditional: 284, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1568, independent: 1503, independent conditional: 0, independent unconditional: 1503, dependent: 65, dependent conditional: 0, dependent unconditional: 65, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3185, independent: 1398, independent conditional: 0, independent unconditional: 1398, dependent: 219, dependent conditional: 0, dependent unconditional: 219, unknown: 1568, unknown conditional: 0, unknown unconditional: 1568] , Statistics on independence cache: Total cache size (in pairs): 149, Positive cache size: 123, Positive conditional cache size: 0, Positive unconditional cache size: 123, Negative cache size: 26, Negative conditional cache size: 0, Negative unconditional cache size: 26, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 17]: assertion can be violated assertion can be violated We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L710] 0 _Bool main$tmp_guard0; [L711] 0 _Bool main$tmp_guard1; [L713] 0 int x = 0; [L715] 0 int y = 0; [L717] 0 int z = 0; [L718] 0 _Bool z$flush_delayed; [L719] 0 int z$mem_tmp; [L720] 0 _Bool z$r_buff0_thd0; [L721] 0 _Bool z$r_buff0_thd1; [L722] 0 _Bool z$r_buff0_thd2; [L723] 0 _Bool z$r_buff0_thd3; [L724] 0 _Bool z$r_buff1_thd0; [L725] 0 _Bool z$r_buff1_thd1; [L726] 0 _Bool z$r_buff1_thd2; [L727] 0 _Bool z$r_buff1_thd3; [L728] 0 _Bool z$read_delayed; [L729] 0 int *z$read_delayed_var; [L730] 0 int z$w_buff0; [L731] 0 _Bool z$w_buff0_used; [L732] 0 int z$w_buff1; [L733] 0 _Bool z$w_buff1_used; [L734] 0 _Bool weak$$choice0; [L735] 0 _Bool weak$$choice2; [L816] 0 pthread_t t2489; [L817] FCALL, FORK 0 pthread_create(&t2489, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2489, ((void *)0), P0, ((void *)0))=-2, t2489={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L818] 0 pthread_t t2490; [L819] FCALL, FORK 0 pthread_create(&t2490, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2490, ((void *)0), P1, ((void *)0))=-1, t2489={5:0}, t2490={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L820] 0 pthread_t t2491; [L821] FCALL, FORK 0 pthread_create(&t2491, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2491, ((void *)0), P2, ((void *)0))=0, t2489={5:0}, t2490={6:0}, t2491={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L739] 1 z$w_buff1 = z$w_buff0 [L740] 1 z$w_buff0 = 2 [L741] 1 z$w_buff1_used = z$w_buff0_used [L742] 1 z$w_buff0_used = (_Bool)1 [L743] CALL 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L743] RET 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L744] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L745] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L746] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L747] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L748] 1 z$r_buff0_thd1 = (_Bool)1 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=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L751] 1 x = 1 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=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L768] 2 x = 2 VAL [__unbuffered_cnt=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=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L771] 2 y = 1 VAL [__unbuffered_cnt=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=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L774] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L775] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L776] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L777] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L778] 2 z$r_buff1_thd2 = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 VAL [__unbuffered_cnt=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=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L788] 3 y = 2 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=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L791] 3 z = 1 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=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=1] [L754] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L755] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L756] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L757] 1 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L758] 1 z$r_buff1_thd1 = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L761] EXPR 1 __unbuffered_cnt + 1 [L761] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L763] 1 return 0; [L781] EXPR 2 __unbuffered_cnt + 1 [L781] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L783] 2 return 0; [L794] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L795] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L796] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L797] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L798] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 VAL [\result={0:0}, __unbuffered_cnt=2, 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=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L801] EXPR 3 __unbuffered_cnt + 1 [L801] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L803] 3 return 0; [L823] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L825] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L825] RET 0 assume_abort_if_not(main$tmp_guard0) [L827] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L828] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L829] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L830] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L831] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2489={5:0}, t2490={6:0}, t2491={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L834] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L835] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L836] 0 z$flush_delayed = weak$$choice2 [L837] 0 z$mem_tmp = z [L838] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L839] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L840] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L841] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L842] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L843] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L844] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L845] 0 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2) [L846] 0 z = z$flush_delayed ? z$mem_tmp : z [L847] 0 z$flush_delayed = (_Bool)0 [L849] 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", "safe030_power.oepc_pso.oepc_rmo.oepc.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\read(__PRETTY_FUNCTION__)={49:50}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] - UnprovableResult [Line: 17]: Unable to prove that assertion always holds Unable to prove that assertion always holds Reason: Not analyzed. - UnprovableResult [Line: 761]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 761]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 781]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 781]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 801]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 801]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 819]: 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: 817]: 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: 821]: 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 7 procedures, 148 locations, 18 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: 15.8s, OverallIterations: 19, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 7.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 420 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 420 mSDsluCounter, 41 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 19 mSDsCounter, 127 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1363 IncrementalHoareTripleChecker+Invalid, 1490 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 127 mSolverCounterUnsat, 22 mSDtfsCounter, 1363 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 61 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1171occurred in iteration=12, InterpolantAutomatonStates: 81, 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, 4.0s InterpolantComputationTime, 251 NumberOfCodeBlocks, 251 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 212 ConstructedInterpolants, 0 QuantifiedInterpolants, 1928 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-08-27 10:20:01,385 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...