/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 -i ../../../trunk/examples/svcomp/weaver/popl20-min-max-inc.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-24 15:15:58,544 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-24 15:15:58,580 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-24 15:15:58,583 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-24 15:15:58,583 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-24 15:15:58,597 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-24 15:15:58,598 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-24 15:15:58,598 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-24 15:15:58,598 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-24 15:15:58,599 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-24 15:15:58,599 INFO L153 SettingsManager]: * Use SBE=true [2023-08-24 15:15:58,599 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-24 15:15:58,599 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-24 15:15:58,600 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-24 15:15:58,600 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-24 15:15:58,600 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-24 15:15:58,601 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-24 15:15:58,601 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-24 15:15:58,601 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-24 15:15:58,601 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-24 15:15:58,601 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-24 15:15:58,602 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-24 15:15:58,602 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-24 15:15:58,602 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-24 15:15:58,603 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-24 15:15:58,603 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-24 15:15:58,603 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-24 15:15:58,603 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-24 15:15:58,603 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-24 15:15:58,604 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-24 15:15:58,604 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-24 15:15:58,604 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-24 15:15:58,604 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-24 15:15:58,605 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-24 15:15:58,605 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-24 15:15:58,605 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 [2023-08-24 15:15:58,839 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-24 15:15:58,858 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-24 15:15:58,860 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-24 15:15:58,861 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-24 15:15:58,861 INFO L274 PluginConnector]: CDTParser initialized [2023-08-24 15:15:58,862 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-min-max-inc.wvr.c [2023-08-24 15:15:59,811 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-24 15:15:59,977 INFO L384 CDTParser]: Found 1 translation units. [2023-08-24 15:15:59,977 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-min-max-inc.wvr.c [2023-08-24 15:15:59,995 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e61c8db28/29bcb152e7dc4d538e7b01815bc815c5/FLAGc488de4c2 [2023-08-24 15:16:00,006 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e61c8db28/29bcb152e7dc4d538e7b01815bc815c5 [2023-08-24 15:16:00,010 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-24 15:16:00,012 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-24 15:16:00,014 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-24 15:16:00,014 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-24 15:16:00,016 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-24 15:16:00,017 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.08 03:16:00" (1/1) ... [2023-08-24 15:16:00,018 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@70de9080 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 03:16:00, skipping insertion in model container [2023-08-24 15:16:00,018 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.08 03:16:00" (1/1) ... [2023-08-24 15:16:00,037 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-24 15:16:00,176 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-min-max-inc.wvr.c[3018,3031] [2023-08-24 15:16:00,185 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-24 15:16:00,194 INFO L201 MainTranslator]: Completed pre-run [2023-08-24 15:16:00,224 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-min-max-inc.wvr.c[3018,3031] [2023-08-24 15:16:00,229 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-24 15:16:00,233 WARN L669 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-24 15:16:00,233 WARN L669 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-24 15:16:00,238 INFO L206 MainTranslator]: Completed translation [2023-08-24 15:16:00,239 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 03:16:00 WrapperNode [2023-08-24 15:16:00,240 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-24 15:16:00,240 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-24 15:16:00,240 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-24 15:16:00,240 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-24 15:16:00,244 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 03:16:00" (1/1) ... [2023-08-24 15:16:00,258 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 03:16:00" (1/1) ... [2023-08-24 15:16:00,272 INFO L138 Inliner]: procedures = 26, calls = 63, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 141 [2023-08-24 15:16:00,272 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-24 15:16:00,273 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-24 15:16:00,273 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-24 15:16:00,273 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-24 15:16:00,280 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 03:16:00" (1/1) ... [2023-08-24 15:16:00,280 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 03:16:00" (1/1) ... [2023-08-24 15:16:00,282 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 03:16:00" (1/1) ... [2023-08-24 15:16:00,283 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 03:16:00" (1/1) ... [2023-08-24 15:16:00,287 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 03:16:00" (1/1) ... [2023-08-24 15:16:00,289 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 03:16:00" (1/1) ... [2023-08-24 15:16:00,290 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 03:16:00" (1/1) ... [2023-08-24 15:16:00,291 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 03:16:00" (1/1) ... [2023-08-24 15:16:00,292 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-24 15:16:00,293 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-24 15:16:00,293 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-24 15:16:00,293 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-24 15:16:00,293 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 03:16:00" (1/1) ... [2023-08-24 15:16:00,297 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-24 15:16:00,306 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 15:16:00,314 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-24 15:16:00,332 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-24 15:16:00,339 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-24 15:16:00,339 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-24 15:16:00,339 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-24 15:16:00,339 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-24 15:16:00,340 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-08-24 15:16:00,340 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-08-24 15:16:00,340 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-08-24 15:16:00,340 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-08-24 15:16:00,340 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-08-24 15:16:00,340 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-08-24 15:16:00,340 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2023-08-24 15:16:00,340 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2023-08-24 15:16:00,340 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-24 15:16:00,340 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-24 15:16:00,340 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-24 15:16:00,340 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-08-24 15:16:00,341 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-24 15:16:00,341 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-24 15:16:00,341 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-24 15:16:00,342 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-24 15:16:00,412 INFO L236 CfgBuilder]: Building ICFG [2023-08-24 15:16:00,414 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-24 15:16:00,619 INFO L277 CfgBuilder]: Performing block encoding [2023-08-24 15:16:00,673 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-24 15:16:00,673 INFO L302 CfgBuilder]: Removed 4 assume(true) statements. [2023-08-24 15:16:00,674 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.08 03:16:00 BoogieIcfgContainer [2023-08-24 15:16:00,675 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-24 15:16:00,676 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-24 15:16:00,676 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-24 15:16:00,678 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-24 15:16:00,678 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.08 03:16:00" (1/3) ... [2023-08-24 15:16:00,678 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@506833ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.08 03:16:00, skipping insertion in model container [2023-08-24 15:16:00,679 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 03:16:00" (2/3) ... [2023-08-24 15:16:00,679 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@506833ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.08 03:16:00, skipping insertion in model container [2023-08-24 15:16:00,679 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.08 03:16:00" (3/3) ... [2023-08-24 15:16:00,680 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-min-max-inc.wvr.c [2023-08-24 15:16:00,690 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-24 15:16:00,690 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-08-24 15:16:00,690 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-24 15:16:00,757 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2023-08-24 15:16:00,778 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 167 places, 166 transitions, 364 flow [2023-08-24 15:16:00,846 INFO L124 PetriNetUnfolderBase]: 12/162 cut-off events. [2023-08-24 15:16:00,846 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-08-24 15:16:00,850 INFO L83 FinitePrefix]: Finished finitePrefix Result has 179 conditions, 162 events. 12/162 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 132 event pairs, 0 based on Foata normal form. 0/149 useless extension candidates. Maximal degree in co-relation 130. Up to 2 conditions per place. [2023-08-24 15:16:00,850 INFO L82 GeneralOperation]: Start removeDead. Operand has 167 places, 166 transitions, 364 flow [2023-08-24 15:16:00,854 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 151 places, 150 transitions, 324 flow [2023-08-24 15:16:00,856 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-24 15:16:00,860 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 151 places, 150 transitions, 324 flow [2023-08-24 15:16:00,862 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 151 places, 150 transitions, 324 flow [2023-08-24 15:16:00,862 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 151 places, 150 transitions, 324 flow [2023-08-24 15:16:00,882 INFO L124 PetriNetUnfolderBase]: 12/150 cut-off events. [2023-08-24 15:16:00,882 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-08-24 15:16:00,882 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 150 events. 12/150 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 131 event pairs, 0 based on Foata normal form. 0/138 useless extension candidates. Maximal degree in co-relation 130. Up to 2 conditions per place. [2023-08-24 15:16:00,884 INFO L119 LiptonReduction]: Number of co-enabled transitions 2548 [2023-08-24 15:16:05,668 INFO L134 LiptonReduction]: Checked pairs total: 3658 [2023-08-24 15:16:05,668 INFO L136 LiptonReduction]: Total number of compositions: 137 [2023-08-24 15:16:05,678 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-24 15:16:05,689 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;@5bd3cd6b, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-24 15:16:05,689 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2023-08-24 15:16:05,693 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-24 15:16:05,693 INFO L124 PetriNetUnfolderBase]: 4/30 cut-off events. [2023-08-24 15:16:05,693 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-08-24 15:16:05,694 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 15:16:05,694 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 15:16:05,694 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-24 15:16:05,697 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 15:16:05,697 INFO L85 PathProgramCache]: Analyzing trace with hash -924532907, now seen corresponding path program 1 times [2023-08-24 15:16:05,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 15:16:05,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739669617] [2023-08-24 15:16:05,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 15:16:05,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 15:16:05,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 15:16:06,055 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-24 15:16:06,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 15:16:06,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739669617] [2023-08-24 15:16:06,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1739669617] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 15:16:06,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 15:16:06,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-24 15:16:06,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003410362] [2023-08-24 15:16:06,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 15:16:06,062 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-24 15:16:06,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 15:16:06,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-24 15:16:06,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-24 15:16:06,081 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 303 [2023-08-24 15:16:06,085 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 31 transitions, 86 flow. Second operand has 4 states, 4 states have (on average 136.5) internal successors, (546), 4 states have internal predecessors, (546), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 15:16:06,085 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 15:16:06,085 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 303 [2023-08-24 15:16:06,086 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 15:16:06,283 INFO L124 PetriNetUnfolderBase]: 1410/1888 cut-off events. [2023-08-24 15:16:06,283 INFO L125 PetriNetUnfolderBase]: For 79/79 co-relation queries the response was YES. [2023-08-24 15:16:06,287 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3978 conditions, 1888 events. 1410/1888 cut-off events. For 79/79 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 7213 event pairs, 760 based on Foata normal form. 0/1422 useless extension candidates. Maximal degree in co-relation 3477. Up to 1542 conditions per place. [2023-08-24 15:16:06,294 INFO L140 encePairwiseOnDemand]: 299/303 looper letters, 42 selfloop transitions, 3 changer transitions 0/46 dead transitions. [2023-08-24 15:16:06,294 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 46 transitions, 215 flow [2023-08-24 15:16:06,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-24 15:16:06,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-24 15:16:06,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 566 transitions. [2023-08-24 15:16:06,309 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.466996699669967 [2023-08-24 15:16:06,310 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 566 transitions. [2023-08-24 15:16:06,310 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 566 transitions. [2023-08-24 15:16:06,313 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 15:16:06,314 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 566 transitions. [2023-08-24 15:16:06,318 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 141.5) internal successors, (566), 4 states have internal predecessors, (566), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 15:16:06,322 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 303.0) internal successors, (1515), 5 states have internal predecessors, (1515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 15:16:06,323 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 303.0) internal successors, (1515), 5 states have internal predecessors, (1515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 15:16:06,324 INFO L175 Difference]: Start difference. First operand has 40 places, 31 transitions, 86 flow. Second operand 4 states and 566 transitions. [2023-08-24 15:16:06,324 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 46 transitions, 215 flow [2023-08-24 15:16:06,330 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 46 transitions, 193 flow, removed 0 selfloop flow, removed 8 redundant places. [2023-08-24 15:16:06,331 INFO L231 Difference]: Finished difference. Result has 36 places, 32 transitions, 84 flow [2023-08-24 15:16:06,332 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=303, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=84, PETRI_PLACES=36, PETRI_TRANSITIONS=32} [2023-08-24 15:16:06,335 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, -4 predicate places. [2023-08-24 15:16:06,335 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 32 transitions, 84 flow [2023-08-24 15:16:06,335 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 136.5) internal successors, (546), 4 states have internal predecessors, (546), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 15:16:06,335 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 15:16:06,335 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 15:16:06,336 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-24 15:16:06,336 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-24 15:16:06,337 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 15:16:06,337 INFO L85 PathProgramCache]: Analyzing trace with hash -1308158109, now seen corresponding path program 1 times [2023-08-24 15:16:06,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 15:16:06,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364963717] [2023-08-24 15:16:06,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 15:16:06,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 15:16:06,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 15:16:06,463 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 15:16:06,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 15:16:06,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364963717] [2023-08-24 15:16:06,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [364963717] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 15:16:06,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 15:16:06,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-24 15:16:06,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342758465] [2023-08-24 15:16:06,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 15:16:06,466 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-24 15:16:06,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 15:16:06,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-24 15:16:06,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-24 15:16:06,467 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 303 [2023-08-24 15:16:06,468 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 32 transitions, 84 flow. Second operand has 4 states, 4 states have (on average 137.0) internal successors, (548), 4 states have internal predecessors, (548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 15:16:06,468 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 15:16:06,468 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 303 [2023-08-24 15:16:06,468 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 15:16:06,628 INFO L124 PetriNetUnfolderBase]: 1718/2336 cut-off events. [2023-08-24 15:16:06,628 INFO L125 PetriNetUnfolderBase]: For 527/527 co-relation queries the response was YES. [2023-08-24 15:16:06,631 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5313 conditions, 2336 events. 1718/2336 cut-off events. For 527/527 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 8122 event pairs, 977 based on Foata normal form. 0/1943 useless extension candidates. Maximal degree in co-relation 1800. Up to 1790 conditions per place. [2023-08-24 15:16:06,638 INFO L140 encePairwiseOnDemand]: 299/303 looper letters, 47 selfloop transitions, 3 changer transitions 0/50 dead transitions. [2023-08-24 15:16:06,638 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 50 transitions, 233 flow [2023-08-24 15:16:06,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-24 15:16:06,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-24 15:16:06,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 569 transitions. [2023-08-24 15:16:06,640 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46947194719471946 [2023-08-24 15:16:06,640 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 569 transitions. [2023-08-24 15:16:06,640 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 569 transitions. [2023-08-24 15:16:06,640 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 15:16:06,640 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 569 transitions. [2023-08-24 15:16:06,641 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 142.25) internal successors, (569), 4 states have internal predecessors, (569), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 15:16:06,643 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 303.0) internal successors, (1515), 5 states have internal predecessors, (1515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 15:16:06,643 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 303.0) internal successors, (1515), 5 states have internal predecessors, (1515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 15:16:06,643 INFO L175 Difference]: Start difference. First operand has 36 places, 32 transitions, 84 flow. Second operand 4 states and 569 transitions. [2023-08-24 15:16:06,643 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 50 transitions, 233 flow [2023-08-24 15:16:06,644 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 50 transitions, 223 flow, removed 2 selfloop flow, removed 2 redundant places. [2023-08-24 15:16:06,645 INFO L231 Difference]: Finished difference. Result has 38 places, 33 transitions, 92 flow [2023-08-24 15:16:06,645 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=303, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=92, PETRI_PLACES=38, PETRI_TRANSITIONS=33} [2023-08-24 15:16:06,645 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, -2 predicate places. [2023-08-24 15:16:06,646 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 33 transitions, 92 flow [2023-08-24 15:16:06,646 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 137.0) internal successors, (548), 4 states have internal predecessors, (548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 15:16:06,646 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 15:16:06,646 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 15:16:06,646 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-24 15:16:06,646 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-24 15:16:06,647 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 15:16:06,647 INFO L85 PathProgramCache]: Analyzing trace with hash -1319455662, now seen corresponding path program 1 times [2023-08-24 15:16:06,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 15:16:06,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380727446] [2023-08-24 15:16:06,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 15:16:06,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 15:16:06,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 15:16:06,701 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-24 15:16:06,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 15:16:06,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380727446] [2023-08-24 15:16:06,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [380727446] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 15:16:06,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 15:16:06,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-24 15:16:06,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655115306] [2023-08-24 15:16:06,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 15:16:06,702 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-24 15:16:06,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 15:16:06,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-24 15:16:06,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-24 15:16:06,703 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 303 [2023-08-24 15:16:06,703 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 33 transitions, 92 flow. Second operand has 4 states, 4 states have (on average 137.0) internal successors, (548), 4 states have internal predecessors, (548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 15:16:06,703 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 15:16:06,703 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 303 [2023-08-24 15:16:06,703 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 15:16:06,895 INFO L124 PetriNetUnfolderBase]: 1632/2234 cut-off events. [2023-08-24 15:16:06,895 INFO L125 PetriNetUnfolderBase]: For 531/686 co-relation queries the response was YES. [2023-08-24 15:16:06,897 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5582 conditions, 2234 events. 1632/2234 cut-off events. For 531/686 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 8451 event pairs, 977 based on Foata normal form. 155/1997 useless extension candidates. Maximal degree in co-relation 1676. Up to 1790 conditions per place. [2023-08-24 15:16:06,903 INFO L140 encePairwiseOnDemand]: 299/303 looper letters, 46 selfloop transitions, 3 changer transitions 0/50 dead transitions. [2023-08-24 15:16:06,903 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 50 transitions, 240 flow [2023-08-24 15:16:06,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-24 15:16:06,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-24 15:16:06,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 566 transitions. [2023-08-24 15:16:06,905 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.466996699669967 [2023-08-24 15:16:06,905 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 566 transitions. [2023-08-24 15:16:06,905 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 566 transitions. [2023-08-24 15:16:06,905 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 15:16:06,905 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 566 transitions. [2023-08-24 15:16:06,906 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 141.5) internal successors, (566), 4 states have internal predecessors, (566), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 15:16:06,907 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 303.0) internal successors, (1515), 5 states have internal predecessors, (1515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 15:16:06,908 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 303.0) internal successors, (1515), 5 states have internal predecessors, (1515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 15:16:06,908 INFO L175 Difference]: Start difference. First operand has 38 places, 33 transitions, 92 flow. Second operand 4 states and 566 transitions. [2023-08-24 15:16:06,908 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 50 transitions, 240 flow [2023-08-24 15:16:06,910 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 50 transitions, 231 flow, removed 2 selfloop flow, removed 2 redundant places. [2023-08-24 15:16:06,911 INFO L231 Difference]: Finished difference. Result has 40 places, 34 transitions, 100 flow [2023-08-24 15:16:06,911 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=303, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=100, PETRI_PLACES=40, PETRI_TRANSITIONS=34} [2023-08-24 15:16:06,912 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 0 predicate places. [2023-08-24 15:16:06,914 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 34 transitions, 100 flow [2023-08-24 15:16:06,914 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 137.0) internal successors, (548), 4 states have internal predecessors, (548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 15:16:06,915 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 15:16:06,915 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 15:16:06,915 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-24 15:16:06,915 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-24 15:16:06,915 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 15:16:06,915 INFO L85 PathProgramCache]: Analyzing trace with hash 409706382, now seen corresponding path program 1 times [2023-08-24 15:16:06,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 15:16:06,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077299815] [2023-08-24 15:16:06,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 15:16:06,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 15:16:06,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 15:16:07,014 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-24 15:16:07,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 15:16:07,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077299815] [2023-08-24 15:16:07,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2077299815] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 15:16:07,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 15:16:07,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-24 15:16:07,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575051509] [2023-08-24 15:16:07,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 15:16:07,016 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-24 15:16:07,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 15:16:07,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-24 15:16:07,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-24 15:16:07,018 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 303 [2023-08-24 15:16:07,018 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 34 transitions, 100 flow. Second operand has 3 states, 3 states have (on average 131.66666666666666) internal successors, (395), 3 states have internal predecessors, (395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 15:16:07,018 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 15:16:07,018 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 303 [2023-08-24 15:16:07,018 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 15:16:07,155 INFO L124 PetriNetUnfolderBase]: 1632/2235 cut-off events. [2023-08-24 15:16:07,155 INFO L125 PetriNetUnfolderBase]: For 884/1039 co-relation queries the response was YES. [2023-08-24 15:16:07,157 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5797 conditions, 2235 events. 1632/2235 cut-off events. For 884/1039 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 8181 event pairs, 1243 based on Foata normal form. 155/1994 useless extension candidates. Maximal degree in co-relation 1879. Up to 2223 conditions per place. [2023-08-24 15:16:07,164 INFO L140 encePairwiseOnDemand]: 300/303 looper letters, 32 selfloop transitions, 2 changer transitions 0/35 dead transitions. [2023-08-24 15:16:07,164 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 35 transitions, 170 flow [2023-08-24 15:16:07,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-24 15:16:07,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-24 15:16:07,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 398 transitions. [2023-08-24 15:16:07,165 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43784378437843785 [2023-08-24 15:16:07,165 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 398 transitions. [2023-08-24 15:16:07,165 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 398 transitions. [2023-08-24 15:16:07,166 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 15:16:07,166 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 398 transitions. [2023-08-24 15:16:07,166 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 132.66666666666666) internal successors, (398), 3 states have internal predecessors, (398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 15:16:07,168 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 303.0) internal successors, (1212), 4 states have internal predecessors, (1212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 15:16:07,168 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 303.0) internal successors, (1212), 4 states have internal predecessors, (1212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 15:16:07,168 INFO L175 Difference]: Start difference. First operand has 40 places, 34 transitions, 100 flow. Second operand 3 states and 398 transitions. [2023-08-24 15:16:07,168 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 35 transitions, 170 flow [2023-08-24 15:16:07,169 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 35 transitions, 164 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-08-24 15:16:07,170 INFO L231 Difference]: Finished difference. Result has 41 places, 35 transitions, 106 flow [2023-08-24 15:16:07,170 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=303, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=106, PETRI_PLACES=41, PETRI_TRANSITIONS=35} [2023-08-24 15:16:07,170 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 1 predicate places. [2023-08-24 15:16:07,170 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 35 transitions, 106 flow [2023-08-24 15:16:07,171 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 131.66666666666666) internal successors, (395), 3 states have internal predecessors, (395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 15:16:07,171 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 15:16:07,171 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 15:16:07,171 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-24 15:16:07,171 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-24 15:16:07,171 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 15:16:07,171 INFO L85 PathProgramCache]: Analyzing trace with hash -1402270999, now seen corresponding path program 1 times [2023-08-24 15:16:07,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 15:16:07,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070798443] [2023-08-24 15:16:07,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 15:16:07,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 15:16:07,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 15:16:07,542 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-24 15:16:07,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 15:16:07,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070798443] [2023-08-24 15:16:07,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2070798443] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 15:16:07,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [376987878] [2023-08-24 15:16:07,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 15:16:07,543 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 15:16:07,543 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 15:16:07,554 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-24 15:16:07,587 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-08-24 15:16:07,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 15:16:07,658 INFO L262 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 36 conjunts are in the unsatisfiable core [2023-08-24 15:16:07,663 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 15:16:07,825 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-24 15:16:07,829 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2023-08-24 15:16:07,949 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 22 [2023-08-24 15:16:07,994 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 27 [2023-08-24 15:16:08,048 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-24 15:16:08,048 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 15:16:08,624 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-24 15:16:08,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [376987878] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 15:16:08,624 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 15:16:08,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 12, 10] total 27 [2023-08-24 15:16:08,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647179269] [2023-08-24 15:16:08,624 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 15:16:08,624 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-08-24 15:16:08,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 15:16:08,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-08-24 15:16:08,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=616, Unknown=6, NotChecked=0, Total=756 [2023-08-24 15:16:08,627 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 303 [2023-08-24 15:16:08,629 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 35 transitions, 106 flow. Second operand has 28 states, 28 states have (on average 100.14285714285714) internal successors, (2804), 28 states have internal predecessors, (2804), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 15:16:08,629 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 15:16:08,629 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 303 [2023-08-24 15:16:08,629 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 15:16:14,919 INFO L124 PetriNetUnfolderBase]: 20996/28805 cut-off events. [2023-08-24 15:16:14,919 INFO L125 PetriNetUnfolderBase]: For 7965/7965 co-relation queries the response was YES. [2023-08-24 15:16:14,942 INFO L83 FinitePrefix]: Finished finitePrefix Result has 74417 conditions, 28805 events. 20996/28805 cut-off events. For 7965/7965 co-relation queries the response was YES. Maximal size of possible extension queue 1058. Compared 160815 event pairs, 1096 based on Foata normal form. 16/22751 useless extension candidates. Maximal degree in co-relation 74403. Up to 6136 conditions per place. [2023-08-24 15:16:14,990 INFO L140 encePairwiseOnDemand]: 289/303 looper letters, 418 selfloop transitions, 142 changer transitions 538/1098 dead transitions. [2023-08-24 15:16:14,990 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 1098 transitions, 5454 flow [2023-08-24 15:16:14,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2023-08-24 15:16:14,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2023-08-24 15:16:15,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 7603 transitions. [2023-08-24 15:16:15,004 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36900601824888374 [2023-08-24 15:16:15,004 INFO L72 ComplementDD]: Start complementDD. Operand 68 states and 7603 transitions. [2023-08-24 15:16:15,004 INFO L73 IsDeterministic]: Start isDeterministic. Operand 68 states and 7603 transitions. [2023-08-24 15:16:15,007 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 15:16:15,007 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 68 states and 7603 transitions. [2023-08-24 15:16:15,017 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 69 states, 68 states have (on average 111.80882352941177) internal successors, (7603), 68 states have internal predecessors, (7603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 15:16:15,037 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 69 states, 69 states have (on average 303.0) internal successors, (20907), 69 states have internal predecessors, (20907), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 15:16:15,041 INFO L81 ComplementDD]: Finished complementDD. Result has 69 states, 69 states have (on average 303.0) internal successors, (20907), 69 states have internal predecessors, (20907), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 15:16:15,041 INFO L175 Difference]: Start difference. First operand has 41 places, 35 transitions, 106 flow. Second operand 68 states and 7603 transitions. [2023-08-24 15:16:15,041 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 1098 transitions, 5454 flow [2023-08-24 15:16:15,124 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 1098 transitions, 5450 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-08-24 15:16:15,129 INFO L231 Difference]: Finished difference. Result has 168 places, 206 transitions, 1473 flow [2023-08-24 15:16:15,130 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=303, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=68, PETRI_FLOW=1473, PETRI_PLACES=168, PETRI_TRANSITIONS=206} [2023-08-24 15:16:15,130 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 128 predicate places. [2023-08-24 15:16:15,130 INFO L495 AbstractCegarLoop]: Abstraction has has 168 places, 206 transitions, 1473 flow [2023-08-24 15:16:15,131 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 100.14285714285714) internal successors, (2804), 28 states have internal predecessors, (2804), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 15:16:15,131 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 15:16:15,131 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 15:16:15,138 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-08-24 15:16:15,335 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 15:16:15,336 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-24 15:16:15,336 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 15:16:15,336 INFO L85 PathProgramCache]: Analyzing trace with hash -1959356175, now seen corresponding path program 2 times [2023-08-24 15:16:15,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 15:16:15,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917376560] [2023-08-24 15:16:15,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 15:16:15,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 15:16:15,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 15:16:15,529 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-08-24 15:16:15,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 15:16:15,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917376560] [2023-08-24 15:16:15,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [917376560] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 15:16:15,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 15:16:15,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-24 15:16:15,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939801013] [2023-08-24 15:16:15,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 15:16:15,531 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-24 15:16:15,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 15:16:15,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-24 15:16:15,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-24 15:16:15,532 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 139 out of 303 [2023-08-24 15:16:15,533 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 206 transitions, 1473 flow. Second operand has 4 states, 4 states have (on average 146.5) internal successors, (586), 4 states have internal predecessors, (586), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 15:16:15,533 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 15:16:15,533 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 139 of 303 [2023-08-24 15:16:15,533 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 15:16:18,194 INFO L124 PetriNetUnfolderBase]: 15452/21644 cut-off events. [2023-08-24 15:16:18,194 INFO L125 PetriNetUnfolderBase]: For 754590/756772 co-relation queries the response was YES. [2023-08-24 15:16:18,281 INFO L83 FinitePrefix]: Finished finitePrefix Result has 154570 conditions, 21644 events. 15452/21644 cut-off events. For 754590/756772 co-relation queries the response was YES. Maximal size of possible extension queue 929. Compared 124405 event pairs, 2108 based on Foata normal form. 1433/22649 useless extension candidates. Maximal degree in co-relation 154490. Up to 12907 conditions per place. [2023-08-24 15:16:18,342 INFO L140 encePairwiseOnDemand]: 299/303 looper letters, 168 selfloop transitions, 6 changer transitions 311/488 dead transitions. [2023-08-24 15:16:18,342 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 488 transitions, 4621 flow [2023-08-24 15:16:18,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-24 15:16:18,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-24 15:16:18,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 767 transitions. [2023-08-24 15:16:18,344 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5062706270627063 [2023-08-24 15:16:18,344 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 767 transitions. [2023-08-24 15:16:18,344 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 767 transitions. [2023-08-24 15:16:18,345 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 15:16:18,345 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 767 transitions. [2023-08-24 15:16:18,346 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 153.4) internal successors, (767), 5 states have internal predecessors, (767), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 15:16:18,347 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 303.0) internal successors, (1818), 6 states have internal predecessors, (1818), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 15:16:18,347 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 303.0) internal successors, (1818), 6 states have internal predecessors, (1818), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 15:16:18,347 INFO L175 Difference]: Start difference. First operand has 168 places, 206 transitions, 1473 flow. Second operand 5 states and 767 transitions. [2023-08-24 15:16:18,347 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 488 transitions, 4621 flow [2023-08-24 15:16:20,033 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 488 transitions, 4348 flow, removed 136 selfloop flow, removed 29 redundant places. [2023-08-24 15:16:20,037 INFO L231 Difference]: Finished difference. Result has 112 places, 137 transitions, 914 flow [2023-08-24 15:16:20,037 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=303, PETRI_DIFFERENCE_MINUEND_FLOW=1368, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=206, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=200, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=914, PETRI_PLACES=112, PETRI_TRANSITIONS=137} [2023-08-24 15:16:20,037 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 72 predicate places. [2023-08-24 15:16:20,037 INFO L495 AbstractCegarLoop]: Abstraction has has 112 places, 137 transitions, 914 flow [2023-08-24 15:16:20,037 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 146.5) internal successors, (586), 4 states have internal predecessors, (586), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 15:16:20,038 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 15:16:20,038 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 15:16:20,038 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-24 15:16:20,038 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-24 15:16:20,038 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 15:16:20,038 INFO L85 PathProgramCache]: Analyzing trace with hash 1437768239, now seen corresponding path program 3 times [2023-08-24 15:16:20,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 15:16:20,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900244742] [2023-08-24 15:16:20,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 15:16:20,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 15:16:20,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 15:16:20,515 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-24 15:16:20,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 15:16:20,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1900244742] [2023-08-24 15:16:20,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1900244742] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 15:16:20,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [308869717] [2023-08-24 15:16:20,516 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-24 15:16:20,516 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 15:16:20,516 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 15:16:20,517 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-24 15:16:20,540 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-08-24 15:16:20,671 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-08-24 15:16:20,671 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-24 15:16:20,673 INFO L262 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 37 conjunts are in the unsatisfiable core [2023-08-24 15:16:20,675 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 15:16:20,727 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-08-24 15:16:20,773 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-24 15:16:20,775 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-24 15:16:20,831 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-08-24 15:16:20,857 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-24 15:16:20,857 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 15:16:21,020 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_282 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_282) c_~A~0.base) c_~A~0.offset))) (or (<= c_~min~0 (+ .cse0 1)) (<= 2147483647 .cse0)))) is different from false [2023-08-24 15:16:21,132 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_282 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_282) c_~A~0.base) c_~A~0.offset))) (or (<= 2147483647 .cse0) (<= (select (select |c_#memory_int| c_~A~0.base) c_~A~0.offset) (+ .cse0 1))))) is different from false [2023-08-24 15:16:21,141 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 15:16:21,142 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 69 treesize of output 54 [2023-08-24 15:16:21,145 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 72 [2023-08-24 15:16:21,154 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 15:16:21,154 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 35 [2023-08-24 15:16:21,157 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 23 [2023-08-24 15:16:25,224 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 1 not checked. [2023-08-24 15:16:25,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [308869717] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 15:16:25,225 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 15:16:25,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 11] total 29 [2023-08-24 15:16:25,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419468994] [2023-08-24 15:16:25,225 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 15:16:25,225 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2023-08-24 15:16:25,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 15:16:25,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2023-08-24 15:16:25,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=657, Unknown=6, NotChecked=110, Total=930 [2023-08-24 15:16:25,228 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 303 [2023-08-24 15:16:25,230 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 137 transitions, 914 flow. Second operand has 31 states, 31 states have (on average 104.0) internal successors, (3224), 31 states have internal predecessors, (3224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 15:16:25,230 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 15:16:25,230 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 303 [2023-08-24 15:16:25,230 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 15:16:35,223 INFO L124 PetriNetUnfolderBase]: 32960/45169 cut-off events. [2023-08-24 15:16:35,223 INFO L125 PetriNetUnfolderBase]: For 1214744/1214744 co-relation queries the response was YES. [2023-08-24 15:16:35,383 INFO L83 FinitePrefix]: Finished finitePrefix Result has 310239 conditions, 45169 events. 32960/45169 cut-off events. For 1214744/1214744 co-relation queries the response was YES. Maximal size of possible extension queue 1644. Compared 266853 event pairs, 1554 based on Foata normal form. 23/45191 useless extension candidates. Maximal degree in co-relation 310184. Up to 11973 conditions per place. [2023-08-24 15:16:35,482 INFO L140 encePairwiseOnDemand]: 290/303 looper letters, 568 selfloop transitions, 267 changer transitions 1348/2183 dead transitions. [2023-08-24 15:16:35,482 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 183 places, 2183 transitions, 21860 flow [2023-08-24 15:16:35,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2023-08-24 15:16:35,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2023-08-24 15:16:35,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 10005 transitions. [2023-08-24 15:16:35,496 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3752250225022502 [2023-08-24 15:16:35,496 INFO L72 ComplementDD]: Start complementDD. Operand 88 states and 10005 transitions. [2023-08-24 15:16:35,496 INFO L73 IsDeterministic]: Start isDeterministic. Operand 88 states and 10005 transitions. [2023-08-24 15:16:35,500 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 15:16:35,501 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 88 states and 10005 transitions. [2023-08-24 15:16:35,513 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 89 states, 88 states have (on average 113.69318181818181) internal successors, (10005), 88 states have internal predecessors, (10005), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 15:16:35,544 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 89 states, 89 states have (on average 303.0) internal successors, (26967), 89 states have internal predecessors, (26967), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 15:16:35,550 INFO L81 ComplementDD]: Finished complementDD. Result has 89 states, 89 states have (on average 303.0) internal successors, (26967), 89 states have internal predecessors, (26967), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 15:16:35,550 INFO L175 Difference]: Start difference. First operand has 112 places, 137 transitions, 914 flow. Second operand 88 states and 10005 transitions. [2023-08-24 15:16:35,550 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 183 places, 2183 transitions, 21860 flow [2023-08-24 15:16:43,396 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 2183 transitions, 19182 flow, removed 1260 selfloop flow, removed 15 redundant places. [2023-08-24 15:16:43,406 INFO L231 Difference]: Finished difference. Result has 243 places, 375 transitions, 4213 flow [2023-08-24 15:16:43,407 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=303, PETRI_DIFFERENCE_MINUEND_FLOW=848, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=137, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=59, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=88, PETRI_FLOW=4213, PETRI_PLACES=243, PETRI_TRANSITIONS=375} [2023-08-24 15:16:43,407 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 203 predicate places. [2023-08-24 15:16:43,407 INFO L495 AbstractCegarLoop]: Abstraction has has 243 places, 375 transitions, 4213 flow [2023-08-24 15:16:43,408 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 104.0) internal successors, (3224), 31 states have internal predecessors, (3224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 15:16:43,408 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 15:16:43,408 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 15:16:43,420 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-08-24 15:16:43,613 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2023-08-24 15:16:43,613 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-24 15:16:43,614 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 15:16:43,614 INFO L85 PathProgramCache]: Analyzing trace with hash -1175093357, now seen corresponding path program 4 times [2023-08-24 15:16:43,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 15:16:43,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890350237] [2023-08-24 15:16:43,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 15:16:43,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 15:16:43,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 15:16:44,038 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-24 15:16:44,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 15:16:44,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890350237] [2023-08-24 15:16:44,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1890350237] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 15:16:44,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [352756629] [2023-08-24 15:16:44,038 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-08-24 15:16:44,038 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 15:16:44,038 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 15:16:44,039 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-24 15:16:44,041 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-08-24 15:16:44,136 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-08-24 15:16:44,137 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-24 15:16:44,138 INFO L262 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 28 conjunts are in the unsatisfiable core [2023-08-24 15:16:44,140 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 15:16:44,268 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-24 15:16:44,269 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 27 [2023-08-24 15:16:44,307 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-24 15:16:44,308 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 27 [2023-08-24 15:16:44,376 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 15:16:44,376 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 18 [2023-08-24 15:16:44,402 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-24 15:16:44,402 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 15:16:44,553 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_348 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_348) c_~A~0.base) c_~A~0.offset))) (or (<= 2147483647 .cse0) (<= c_~min~0 (+ .cse0 1))))) is different from false [2023-08-24 15:16:46,320 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 15:16:46,321 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 158 treesize of output 114 [2023-08-24 15:16:46,326 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 49 [2023-08-24 15:16:46,329 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 81 [2023-08-24 15:16:46,367 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-24 15:16:46,368 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-24 15:16:46,397 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 1 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-24 15:16:46,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [352756629] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 15:16:46,397 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 15:16:46,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 10] total 26 [2023-08-24 15:16:46,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125524924] [2023-08-24 15:16:46,397 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 15:16:46,398 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-08-24 15:16:46,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 15:16:46,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-08-24 15:16:46,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=564, Unknown=16, NotChecked=50, Total=756 [2023-08-24 15:16:46,400 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 303 [2023-08-24 15:16:46,401 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 243 places, 375 transitions, 4213 flow. Second operand has 28 states, 28 states have (on average 112.96428571428571) internal successors, (3163), 28 states have internal predecessors, (3163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 15:16:46,401 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 15:16:46,401 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 303 [2023-08-24 15:16:46,401 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 15:16:55,861 INFO L124 PetriNetUnfolderBase]: 32319/45056 cut-off events. [2023-08-24 15:16:55,861 INFO L125 PetriNetUnfolderBase]: For 5114047/5117537 co-relation queries the response was YES. [2023-08-24 15:16:56,278 INFO L83 FinitePrefix]: Finished finitePrefix Result has 543437 conditions, 45056 events. 32319/45056 cut-off events. For 5114047/5117537 co-relation queries the response was YES. Maximal size of possible extension queue 1838. Compared 281040 event pairs, 4103 based on Foata normal form. 1841/46228 useless extension candidates. Maximal degree in co-relation 543320. Up to 12981 conditions per place. [2023-08-24 15:16:56,479 INFO L140 encePairwiseOnDemand]: 293/303 looper letters, 376 selfloop transitions, 288 changer transitions 412/1099 dead transitions. [2023-08-24 15:16:56,480 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 216 places, 1099 transitions, 17082 flow [2023-08-24 15:16:56,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-08-24 15:16:56,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2023-08-24 15:16:56,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 3659 transitions. [2023-08-24 15:16:56,484 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40253025302530254 [2023-08-24 15:16:56,484 INFO L72 ComplementDD]: Start complementDD. Operand 30 states and 3659 transitions. [2023-08-24 15:16:56,484 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 3659 transitions. [2023-08-24 15:16:56,484 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 15:16:56,484 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 30 states and 3659 transitions. [2023-08-24 15:16:56,488 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 31 states, 30 states have (on average 121.96666666666667) internal successors, (3659), 30 states have internal predecessors, (3659), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 15:16:56,494 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 31 states, 31 states have (on average 303.0) internal successors, (9393), 31 states have internal predecessors, (9393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 15:16:56,495 INFO L81 ComplementDD]: Finished complementDD. Result has 31 states, 31 states have (on average 303.0) internal successors, (9393), 31 states have internal predecessors, (9393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 15:16:56,495 INFO L175 Difference]: Start difference. First operand has 243 places, 375 transitions, 4213 flow. Second operand 30 states and 3659 transitions. [2023-08-24 15:16:56,495 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 216 places, 1099 transitions, 17082 flow [2023-08-24 15:17:12,654 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 171 places, 1099 transitions, 13767 flow, removed 1555 selfloop flow, removed 45 redundant places. [2023-08-24 15:17:12,663 INFO L231 Difference]: Finished difference. Result has 196 places, 507 transitions, 6753 flow [2023-08-24 15:17:12,663 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=303, PETRI_DIFFERENCE_MINUEND_FLOW=3737, PETRI_DIFFERENCE_MINUEND_PLACES=142, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=375, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=174, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=162, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=6753, PETRI_PLACES=196, PETRI_TRANSITIONS=507} [2023-08-24 15:17:12,663 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 156 predicate places. [2023-08-24 15:17:12,663 INFO L495 AbstractCegarLoop]: Abstraction has has 196 places, 507 transitions, 6753 flow [2023-08-24 15:17:12,664 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 112.96428571428571) internal successors, (3163), 28 states have internal predecessors, (3163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 15:17:12,664 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 15:17:12,664 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 15:17:12,668 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-08-24 15:17:12,868 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 15:17:12,868 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-24 15:17:12,868 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 15:17:12,869 INFO L85 PathProgramCache]: Analyzing trace with hash 1649871177, now seen corresponding path program 5 times [2023-08-24 15:17:12,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 15:17:12,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76339905] [2023-08-24 15:17:12,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 15:17:12,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 15:17:12,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 15:17:13,023 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-08-24 15:17:13,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 15:17:13,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76339905] [2023-08-24 15:17:13,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [76339905] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 15:17:13,023 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 15:17:13,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-24 15:17:13,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603104956] [2023-08-24 15:17:13,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 15:17:13,024 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-24 15:17:13,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 15:17:13,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-24 15:17:13,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-24 15:17:13,025 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 139 out of 303 [2023-08-24 15:17:13,025 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 196 places, 507 transitions, 6753 flow. Second operand has 4 states, 4 states have (on average 146.5) internal successors, (586), 4 states have internal predecessors, (586), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 15:17:13,025 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 15:17:13,025 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 139 of 303 [2023-08-24 15:17:13,025 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 15:17:19,961 INFO L124 PetriNetUnfolderBase]: 30311/42705 cut-off events. [2023-08-24 15:17:19,961 INFO L125 PetriNetUnfolderBase]: For 2447818/2450968 co-relation queries the response was YES. [2023-08-24 15:17:20,259 INFO L83 FinitePrefix]: Finished finitePrefix Result has 408567 conditions, 42705 events. 30311/42705 cut-off events. For 2447818/2450968 co-relation queries the response was YES. Maximal size of possible extension queue 1707. Compared 268923 event pairs, 7241 based on Foata normal form. 1671/43804 useless extension candidates. Maximal degree in co-relation 408467. Up to 33067 conditions per place. [2023-08-24 15:17:20,413 INFO L140 encePairwiseOnDemand]: 299/303 looper letters, 479 selfloop transitions, 29 changer transitions 263/794 dead transitions. [2023-08-24 15:17:20,414 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 183 places, 794 transitions, 12253 flow [2023-08-24 15:17:20,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-24 15:17:20,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-24 15:17:20,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 761 transitions. [2023-08-24 15:17:20,415 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5023102310231023 [2023-08-24 15:17:20,415 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 761 transitions. [2023-08-24 15:17:20,415 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 761 transitions. [2023-08-24 15:17:20,415 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 15:17:20,415 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 761 transitions. [2023-08-24 15:17:20,416 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 152.2) internal successors, (761), 5 states have internal predecessors, (761), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 15:17:20,417 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 303.0) internal successors, (1818), 6 states have internal predecessors, (1818), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 15:17:20,417 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 303.0) internal successors, (1818), 6 states have internal predecessors, (1818), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 15:17:20,418 INFO L175 Difference]: Start difference. First operand has 196 places, 507 transitions, 6753 flow. Second operand 5 states and 761 transitions. [2023-08-24 15:17:20,418 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 183 places, 794 transitions, 12253 flow [2023-08-24 15:17:29,485 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 164 places, 794 transitions, 11811 flow, removed 190 selfloop flow, removed 19 redundant places. [2023-08-24 15:17:29,492 INFO L231 Difference]: Finished difference. Result has 166 places, 491 transitions, 6419 flow [2023-08-24 15:17:29,492 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=303, PETRI_DIFFERENCE_MINUEND_FLOW=6511, PETRI_DIFFERENCE_MINUEND_PLACES=160, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=507, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=478, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=6419, PETRI_PLACES=166, PETRI_TRANSITIONS=491} [2023-08-24 15:17:29,493 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 126 predicate places. [2023-08-24 15:17:29,493 INFO L495 AbstractCegarLoop]: Abstraction has has 166 places, 491 transitions, 6419 flow [2023-08-24 15:17:29,493 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 146.5) internal successors, (586), 4 states have internal predecessors, (586), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 15:17:29,493 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 15:17:29,493 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 15:17:29,493 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-24 15:17:29,493 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-24 15:17:29,494 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 15:17:29,494 INFO L85 PathProgramCache]: Analyzing trace with hash -2116204567, now seen corresponding path program 6 times [2023-08-24 15:17:29,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 15:17:29,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250587368] [2023-08-24 15:17:29,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 15:17:29,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 15:17:29,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 15:17:29,682 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-24 15:17:29,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 15:17:29,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250587368] [2023-08-24 15:17:29,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1250587368] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 15:17:29,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [568576014] [2023-08-24 15:17:29,683 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-08-24 15:17:29,683 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 15:17:29,683 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 15:17:29,685 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-24 15:17:29,687 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-08-24 15:17:29,975 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2023-08-24 15:17:29,975 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-24 15:17:29,976 INFO L262 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 22 conjunts are in the unsatisfiable core [2023-08-24 15:17:29,978 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 15:17:30,082 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-08-24 15:17:30,106 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-24 15:17:30,107 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 15:17:30,319 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-24 15:17:30,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [568576014] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 15:17:30,320 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 15:17:30,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 9, 7] total 20 [2023-08-24 15:17:30,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386161300] [2023-08-24 15:17:30,320 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 15:17:30,321 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-08-24 15:17:30,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 15:17:30,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-08-24 15:17:30,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=324, Unknown=0, NotChecked=0, Total=420 [2023-08-24 15:17:30,323 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 303 [2023-08-24 15:17:30,324 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 491 transitions, 6419 flow. Second operand has 21 states, 21 states have (on average 114.80952380952381) internal successors, (2411), 21 states have internal predecessors, (2411), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 15:17:30,324 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 15:17:30,324 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 303 [2023-08-24 15:17:30,324 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 15:18:02,418 INFO L124 PetriNetUnfolderBase]: 131655/184391 cut-off events. [2023-08-24 15:18:02,418 INFO L125 PetriNetUnfolderBase]: For 7986297/7992617 co-relation queries the response was YES. [2023-08-24 15:18:04,126 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1614025 conditions, 184391 events. 131655/184391 cut-off events. For 7986297/7992617 co-relation queries the response was YES. Maximal size of possible extension queue 7006. Compared 1364160 event pairs, 12350 based on Foata normal form. 3735/187088 useless extension candidates. Maximal degree in co-relation 1613940. Up to 55124 conditions per place. [2023-08-24 15:18:04,559 INFO L140 encePairwiseOnDemand]: 291/303 looper letters, 643 selfloop transitions, 637 changer transitions 2616/3919 dead transitions. [2023-08-24 15:18:04,559 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 241 places, 3919 transitions, 59019 flow [2023-08-24 15:18:04,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2023-08-24 15:18:04,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2023-08-24 15:18:04,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 9745 transitions. [2023-08-24 15:18:04,570 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41232969450791235 [2023-08-24 15:18:04,570 INFO L72 ComplementDD]: Start complementDD. Operand 78 states and 9745 transitions. [2023-08-24 15:18:04,570 INFO L73 IsDeterministic]: Start isDeterministic. Operand 78 states and 9745 transitions. [2023-08-24 15:18:04,574 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 15:18:04,574 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 78 states and 9745 transitions. [2023-08-24 15:18:04,585 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 79 states, 78 states have (on average 124.93589743589743) internal successors, (9745), 78 states have internal predecessors, (9745), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 15:18:04,600 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 79 states, 79 states have (on average 303.0) internal successors, (23937), 79 states have internal predecessors, (23937), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 15:18:04,601 INFO L81 ComplementDD]: Finished complementDD. Result has 79 states, 79 states have (on average 303.0) internal successors, (23937), 79 states have internal predecessors, (23937), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 15:18:04,601 INFO L175 Difference]: Start difference. First operand has 166 places, 491 transitions, 6419 flow. Second operand 78 states and 9745 transitions. [2023-08-24 15:18:04,601 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 241 places, 3919 transitions, 59019 flow [2023-08-24 15:19:18,057 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 238 places, 3919 transitions, 58469 flow, removed 102 selfloop flow, removed 3 redundant places. [2023-08-24 15:19:18,084 INFO L231 Difference]: Finished difference. Result has 313 places, 915 transitions, 15553 flow [2023-08-24 15:19:18,084 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=303, PETRI_DIFFERENCE_MINUEND_FLOW=6351, PETRI_DIFFERENCE_MINUEND_PLACES=161, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=491, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=187, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=235, PETRI_DIFFERENCE_SUBTRAHEND_STATES=78, PETRI_FLOW=15553, PETRI_PLACES=313, PETRI_TRANSITIONS=915} [2023-08-24 15:19:18,085 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 273 predicate places. [2023-08-24 15:19:18,085 INFO L495 AbstractCegarLoop]: Abstraction has has 313 places, 915 transitions, 15553 flow [2023-08-24 15:19:18,085 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 114.80952380952381) internal successors, (2411), 21 states have internal predecessors, (2411), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 15:19:18,085 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 15:19:18,085 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 15:19:18,090 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-08-24 15:19:18,286 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 15:19:18,286 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-24 15:19:18,286 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 15:19:18,286 INFO L85 PathProgramCache]: Analyzing trace with hash 1753172259, now seen corresponding path program 7 times [2023-08-24 15:19:18,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 15:19:18,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771277383] [2023-08-24 15:19:18,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 15:19:18,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 15:19:18,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 15:19:18,653 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-24 15:19:18,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 15:19:18,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771277383] [2023-08-24 15:19:18,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1771277383] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 15:19:18,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [676345921] [2023-08-24 15:19:18,653 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-08-24 15:19:18,653 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 15:19:18,653 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 15:19:18,654 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-24 15:19:18,656 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-08-24 15:19:18,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 15:19:18,758 INFO L262 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 40 conjunts are in the unsatisfiable core [2023-08-24 15:19:18,762 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 15:19:18,790 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-08-24 15:19:18,816 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-08-24 15:19:18,861 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-24 15:19:18,862 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-24 15:19:18,886 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-24 15:19:18,887 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-24 15:19:18,941 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-08-24 15:19:18,967 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 21 [2023-08-24 15:19:18,997 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-24 15:19:18,997 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 15:19:19,059 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 25 [2023-08-24 15:19:22,262 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_513 (Array Int Int)) (v_ArrVal_512 (Array Int Int))) (let ((.cse0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_512) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_513) c_~A~0.base) c_~A~0.offset))) (or (<= 2147483647 .cse0) (< (select (select |c_#memory_int| c_~A~0.base) c_~A~0.offset) (+ 2 .cse0))))) is different from false [2023-08-24 15:19:22,275 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_513 (Array Int Int)) (v_ArrVal_512 (Array Int Int)) (v_ArrVal_511 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_511))) (let ((.cse1 (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_512) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_513) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (< (select (select .cse0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (+ 2 .cse1)) (<= 2147483647 .cse1))))) is different from false [2023-08-24 15:19:22,281 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 15:19:22,281 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 78 treesize of output 54 [2023-08-24 15:19:22,286 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 3355 treesize of output 3067 [2023-08-24 15:19:22,299 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 121 treesize of output 113 [2023-08-24 15:19:22,304 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 151 treesize of output 143 [2023-08-24 15:19:22,308 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 193 treesize of output 177 [2023-08-24 15:19:22,360 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 1 not checked. [2023-08-24 15:19:22,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [676345921] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 15:19:22,360 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 15:19:22,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 11, 10] total 26 [2023-08-24 15:19:22,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470426627] [2023-08-24 15:19:22,360 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 15:19:22,360 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-08-24 15:19:22,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 15:19:22,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-08-24 15:19:22,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=535, Unknown=12, NotChecked=98, Total=756 [2023-08-24 15:19:22,362 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 303 [2023-08-24 15:19:22,364 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 313 places, 915 transitions, 15553 flow. Second operand has 28 states, 28 states have (on average 104.10714285714286) internal successors, (2915), 28 states have internal predecessors, (2915), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 15:19:22,364 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 15:19:22,364 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 303 [2023-08-24 15:19:22,364 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 15:19:53,105 INFO L124 PetriNetUnfolderBase]: 72494/102147 cut-off events. [2023-08-24 15:19:53,106 INFO L125 PetriNetUnfolderBase]: For 17351787/17355089 co-relation queries the response was YES. [2023-08-24 15:19:54,942 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1405986 conditions, 102147 events. 72494/102147 cut-off events. For 17351787/17355089 co-relation queries the response was YES. Maximal size of possible extension queue 3528. Compared 706981 event pairs, 18934 based on Foata normal form. 1924/103523 useless extension candidates. Maximal degree in co-relation 1405827. Up to 47308 conditions per place. [2023-08-24 15:19:55,516 INFO L140 encePairwiseOnDemand]: 292/303 looper letters, 772 selfloop transitions, 174 changer transitions 960/1927 dead transitions. [2023-08-24 15:19:55,516 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 284 places, 1927 transitions, 38317 flow [2023-08-24 15:19:55,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-08-24 15:19:55,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2023-08-24 15:19:55,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 2474 transitions. [2023-08-24 15:19:55,522 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37113711371137115 [2023-08-24 15:19:55,523 INFO L72 ComplementDD]: Start complementDD. Operand 22 states and 2474 transitions. [2023-08-24 15:19:55,523 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 2474 transitions. [2023-08-24 15:19:55,523 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 15:19:55,523 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 22 states and 2474 transitions. [2023-08-24 15:19:55,525 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 23 states, 22 states have (on average 112.45454545454545) internal successors, (2474), 22 states have internal predecessors, (2474), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 15:19:55,528 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 23 states, 23 states have (on average 303.0) internal successors, (6969), 23 states have internal predecessors, (6969), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 15:19:55,528 INFO L81 ComplementDD]: Finished complementDD. Result has 23 states, 23 states have (on average 303.0) internal successors, (6969), 23 states have internal predecessors, (6969), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 15:19:55,528 INFO L175 Difference]: Start difference. First operand has 313 places, 915 transitions, 15553 flow. Second operand 22 states and 2474 transitions. [2023-08-24 15:19:55,529 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 284 places, 1927 transitions, 38317 flow [2023-08-24 15:21:47,769 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 240 places, 1927 transitions, 34684 flow, removed 1677 selfloop flow, removed 44 redundant places. [2023-08-24 15:21:47,786 INFO L231 Difference]: Finished difference. Result has 254 places, 801 transitions, 13663 flow [2023-08-24 15:21:47,787 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=303, PETRI_DIFFERENCE_MINUEND_FLOW=14164, PETRI_DIFFERENCE_MINUEND_PLACES=219, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=915, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=144, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=752, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=13663, PETRI_PLACES=254, PETRI_TRANSITIONS=801} [2023-08-24 15:21:47,787 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 214 predicate places. [2023-08-24 15:21:47,787 INFO L495 AbstractCegarLoop]: Abstraction has has 254 places, 801 transitions, 13663 flow [2023-08-24 15:21:47,787 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 104.10714285714286) internal successors, (2915), 28 states have internal predecessors, (2915), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 15:21:47,788 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 15:21:47,788 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 15:21:47,793 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-08-24 15:21:47,993 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2023-08-24 15:21:47,993 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-24 15:21:47,993 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 15:21:47,993 INFO L85 PathProgramCache]: Analyzing trace with hash -1299191251, now seen corresponding path program 8 times [2023-08-24 15:21:47,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 15:21:47,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583662978] [2023-08-24 15:21:47,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 15:21:47,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 15:21:48,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 15:21:48,483 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-24 15:21:48,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 15:21:48,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583662978] [2023-08-24 15:21:48,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1583662978] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 15:21:48,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1471696551] [2023-08-24 15:21:48,484 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-24 15:21:48,484 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 15:21:48,484 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 15:21:48,485 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-24 15:21:48,491 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-08-24 15:21:48,750 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-24 15:21:48,750 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-24 15:21:48,752 INFO L262 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 46 conjunts are in the unsatisfiable core [2023-08-24 15:21:48,757 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 15:21:48,764 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-24 15:21:48,766 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 32 [2023-08-24 15:21:48,865 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-24 15:21:48,946 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-24 15:21:49,010 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2023-08-24 15:21:49,041 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-24 15:21:49,042 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-08-24 15:21:49,105 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2023-08-24 15:21:49,126 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-24 15:21:49,127 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 15:21:49,284 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_586 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_586) c_~A~0.base) c_~A~0.offset))) (or (<= 2147483647 .cse0) (<= c_~min~0 (+ 1 .cse0))))) is different from false [2023-08-24 15:21:57,362 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_584 Int) (v_ArrVal_586 (Array Int Int))) (let ((.cse0 (select |c_#memory_int| c_~A~0.base))) (let ((.cse1 (select (select (store (store |c_#memory_int| c_~A~0.base (store .cse0 c_~A~0.offset v_ArrVal_584)) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_586) c_~A~0.base) c_~A~0.offset))) (or (< v_ArrVal_584 (+ (select .cse0 c_~A~0.offset) 1)) (<= c_~min~0 (+ 1 .cse1)) (<= 2147483647 .cse1))))) is different from false [2023-08-24 15:21:57,378 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_584 Int) (v_ArrVal_583 (Array Int Int)) (v_ArrVal_586 (Array Int Int))) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_583))) (let ((.cse0 (select .cse2 c_~A~0.base))) (let ((.cse1 (select (select (store (store .cse2 c_~A~0.base (store .cse0 c_~A~0.offset v_ArrVal_584)) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_586) c_~A~0.base) c_~A~0.offset))) (or (< v_ArrVal_584 (+ (select .cse0 c_~A~0.offset) 1)) (<= c_~min~0 (+ .cse1 1)) (<= 2147483647 .cse1)))))) is different from false [2023-08-24 15:21:57,436 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| c_~A~0.base))) (and (forall ((v_ArrVal_584 Int) (v_ArrVal_583 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_583))) (let ((.cse4 (select .cse3 c_~A~0.base))) (or (forall ((v_ArrVal_586 (Array Int Int))) (let ((.cse1 (select (select (store (store .cse3 c_~A~0.base (store .cse4 c_~A~0.offset v_ArrVal_584)) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_586) c_~A~0.base) c_~A~0.offset))) (or (forall ((thread1Thread1of1ForFork2_~i~0 Int)) (let ((.cse0 (select .cse2 (+ c_~A~0.offset (* thread1Thread1of1ForFork2_~i~0 4))))) (or (< c_~min~0 .cse0) (<= .cse0 (+ .cse1 1))))) (<= 2147483647 .cse1)))) (< v_ArrVal_584 (+ (select .cse4 c_~A~0.offset) 1)))))) (or (forall ((thread1Thread1of1ForFork2_~i~0 Int)) (<= (select .cse2 (+ c_~A~0.offset (* thread1Thread1of1ForFork2_~i~0 4))) c_~min~0)) (forall ((v_ArrVal_584 Int) (v_ArrVal_583 (Array Int Int)) (v_ArrVal_586 (Array Int Int))) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_583))) (let ((.cse5 (select .cse7 c_~A~0.base))) (let ((.cse6 (select (select (store (store .cse7 c_~A~0.base (store .cse5 c_~A~0.offset v_ArrVal_584)) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_586) c_~A~0.base) c_~A~0.offset))) (or (< v_ArrVal_584 (+ (select .cse5 c_~A~0.offset) 1)) (<= c_~min~0 (+ .cse6 1)) (<= 2147483647 .cse6))))))))) is different from false [2023-08-24 15:21:59,678 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 15:21:59,678 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1413 treesize of output 1277 [2023-08-24 15:21:59,695 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 615 treesize of output 599 [2023-08-24 15:21:59,705 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 599 treesize of output 595 [2023-08-24 15:21:59,720 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 15:21:59,720 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 595 treesize of output 596 [2023-08-24 15:21:59,736 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 15:21:59,739 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 587 treesize of output 564 [2023-08-24 15:21:59,753 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 555 treesize of output 539 [2023-08-24 15:21:59,764 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 539 treesize of output 535 [2023-08-24 15:22:00,480 INFO L209 tifierPushTermWalker]: Run 10 iterations without descend maybe there is a nontermination bug. [2023-08-24 15:22:00,509 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 2 not checked. [2023-08-24 15:22:00,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1471696551] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 15:22:00,509 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 15:22:00,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 13] total 33 [2023-08-24 15:22:00,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513738748] [2023-08-24 15:22:00,510 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 15:22:00,510 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2023-08-24 15:22:00,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 15:22:00,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2023-08-24 15:22:00,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=769, Unknown=16, NotChecked=244, Total=1190 [2023-08-24 15:22:00,512 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 303 [2023-08-24 15:22:00,514 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 254 places, 801 transitions, 13663 flow. Second operand has 35 states, 35 states have (on average 103.48571428571428) internal successors, (3622), 35 states have internal predecessors, (3622), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 15:22:00,514 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 15:22:00,514 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 303 [2023-08-24 15:22:00,514 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 15:22:31,116 INFO L124 PetriNetUnfolderBase]: 78737/110835 cut-off events. [2023-08-24 15:22:31,116 INFO L125 PetriNetUnfolderBase]: For 12283956/12283956 co-relation queries the response was YES. [2023-08-24 15:22:32,572 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1325864 conditions, 110835 events. 78737/110835 cut-off events. For 12283956/12283956 co-relation queries the response was YES. Maximal size of possible extension queue 4115. Compared 773118 event pairs, 8312 based on Foata normal form. 114/110948 useless extension candidates. Maximal degree in co-relation 1325731. Up to 33339 conditions per place. [2023-08-24 15:22:32,916 INFO L140 encePairwiseOnDemand]: 293/303 looper letters, 699 selfloop transitions, 350 changer transitions 901/1950 dead transitions. [2023-08-24 15:22:32,916 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 272 places, 1950 transitions, 39900 flow [2023-08-24 15:22:32,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-08-24 15:22:32,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2023-08-24 15:22:32,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 3405 transitions. [2023-08-24 15:22:32,920 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37458745874587457 [2023-08-24 15:22:32,920 INFO L72 ComplementDD]: Start complementDD. Operand 30 states and 3405 transitions. [2023-08-24 15:22:32,920 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 3405 transitions. [2023-08-24 15:22:32,920 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 15:22:32,920 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 30 states and 3405 transitions. [2023-08-24 15:22:32,923 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 31 states, 30 states have (on average 113.5) internal successors, (3405), 30 states have internal predecessors, (3405), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 15:22:32,927 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 31 states, 31 states have (on average 303.0) internal successors, (9393), 31 states have internal predecessors, (9393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 15:22:32,928 INFO L81 ComplementDD]: Finished complementDD. Result has 31 states, 31 states have (on average 303.0) internal successors, (9393), 31 states have internal predecessors, (9393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 15:22:32,928 INFO L175 Difference]: Start difference. First operand has 254 places, 801 transitions, 13663 flow. Second operand 30 states and 3405 transitions. [2023-08-24 15:22:32,928 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 272 places, 1950 transitions, 39900 flow [2023-08-24 15:23:31,969 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 258 places, 1950 transitions, 38216 flow, removed 766 selfloop flow, removed 14 redundant places. [2023-08-24 15:23:31,987 INFO L231 Difference]: Finished difference. Result has 279 places, 761 transitions, 14026 flow [2023-08-24 15:23:31,987 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=303, PETRI_DIFFERENCE_MINUEND_FLOW=13197, PETRI_DIFFERENCE_MINUEND_PLACES=229, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=801, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=214, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=537, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=14026, PETRI_PLACES=279, PETRI_TRANSITIONS=761} [2023-08-24 15:23:31,987 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 239 predicate places. [2023-08-24 15:23:31,988 INFO L495 AbstractCegarLoop]: Abstraction has has 279 places, 761 transitions, 14026 flow [2023-08-24 15:23:31,988 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 103.48571428571428) internal successors, (3622), 35 states have internal predecessors, (3622), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 15:23:31,988 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 15:23:31,988 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 15:23:31,999 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-08-24 15:23:32,193 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 15:23:32,193 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-24 15:23:32,194 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 15:23:32,194 INFO L85 PathProgramCache]: Analyzing trace with hash 283401285, now seen corresponding path program 9 times [2023-08-24 15:23:32,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 15:23:32,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487373687] [2023-08-24 15:23:32,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 15:23:32,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 15:23:32,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 15:23:32,463 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-24 15:23:32,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 15:23:32,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1487373687] [2023-08-24 15:23:32,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1487373687] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 15:23:32,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [103362985] [2023-08-24 15:23:32,465 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-24 15:23:32,465 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 15:23:32,465 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 15:23:32,465 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-24 15:23:32,468 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-08-24 15:23:32,671 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-08-24 15:23:32,671 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-24 15:23:32,673 INFO L262 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 29 conjunts are in the unsatisfiable core [2023-08-24 15:23:32,674 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 15:23:32,766 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-24 15:23:32,766 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-24 15:23:32,781 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-08-24 15:23:32,802 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-24 15:23:32,802 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 15:23:33,014 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 19 [2023-08-24 15:23:33,038 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-24 15:23:33,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [103362985] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 15:23:33,038 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 15:23:33,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 8] total 20 [2023-08-24 15:23:33,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347903515] [2023-08-24 15:23:33,038 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 15:23:33,038 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-08-24 15:23:33,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 15:23:33,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-08-24 15:23:33,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=370, Unknown=1, NotChecked=0, Total=462 [2023-08-24 15:23:33,040 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 303 [2023-08-24 15:23:33,041 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 279 places, 761 transitions, 14026 flow. Second operand has 22 states, 22 states have (on average 116.63636363636364) internal successors, (2566), 22 states have internal predecessors, (2566), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 15:23:33,041 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 15:23:33,041 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 303 [2023-08-24 15:23:33,041 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand