/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -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-SemanticLbe.epf --rcfgbuilder.only.consider.context.switches.at.boundaries.of.atomic.blocks true -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/popl20-min-max-dec.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.dk.datarace-free-lbe-02cf818-m [2023-11-17 12:16:18,798 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-17 12:16:18,854 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-SemanticLbe.epf [2023-11-17 12:16:18,883 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-17 12:16:18,883 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-17 12:16:18,884 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-17 12:16:18,884 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-17 12:16:18,884 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-17 12:16:18,885 INFO L153 SettingsManager]: * Use SBE=true [2023-11-17 12:16:18,885 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-17 12:16:18,885 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-17 12:16:18,885 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-17 12:16:18,886 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-17 12:16:18,886 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-17 12:16:18,886 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-17 12:16:18,886 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-17 12:16:18,886 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-17 12:16:18,887 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-17 12:16:18,887 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-17 12:16:18,887 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-17 12:16:18,887 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-17 12:16:18,890 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-17 12:16:18,891 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-17 12:16:18,891 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-11-17 12:16:18,893 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-17 12:16:18,894 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-17 12:16:18,895 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-17 12:16:18,895 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-17 12:16:18,895 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-17 12:16:18,895 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-17 12:16:18,896 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-17 12:16:18,896 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-17 12:16:18,896 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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.rcfgbuilder: Only consider context switches at boundaries of atomic blocks -> true [2023-11-17 12:16:19,091 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-17 12:16:19,118 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-17 12:16:19,120 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-17 12:16:19,121 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-17 12:16:19,121 INFO L274 PluginConnector]: CDTParser initialized [2023-11-17 12:16:19,122 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-min-max-dec.wvr.c [2023-11-17 12:16:20,261 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-17 12:16:20,426 INFO L384 CDTParser]: Found 1 translation units. [2023-11-17 12:16:20,427 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-min-max-dec.wvr.c [2023-11-17 12:16:20,434 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1e9116409/ab601b65bdbf4bed86ef1ad1b95236fd/FLAG01f3524a0 [2023-11-17 12:16:20,448 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1e9116409/ab601b65bdbf4bed86ef1ad1b95236fd [2023-11-17 12:16:20,450 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-17 12:16:20,452 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-11-17 12:16:20,454 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-17 12:16:20,454 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-17 12:16:20,457 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-17 12:16:20,457 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 12:16:20" (1/1) ... [2023-11-17 12:16:20,458 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6167ff36 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:16:20, skipping insertion in model container [2023-11-17 12:16:20,459 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 12:16:20" (1/1) ... [2023-11-17 12:16:20,484 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-17 12:16:20,602 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-dec.wvr.c[3071,3084] [2023-11-17 12:16:20,608 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-17 12:16:20,614 INFO L202 MainTranslator]: Completed pre-run [2023-11-17 12:16:20,630 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-dec.wvr.c[3071,3084] [2023-11-17 12:16:20,632 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-17 12:16:20,638 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-17 12:16:20,638 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-17 12:16:20,642 INFO L206 MainTranslator]: Completed translation [2023-11-17 12:16:20,643 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:16:20 WrapperNode [2023-11-17 12:16:20,643 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-17 12:16:20,644 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-17 12:16:20,644 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-17 12:16:20,644 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-17 12:16:20,648 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:16:20" (1/1) ... [2023-11-17 12:16:20,654 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:16:20" (1/1) ... [2023-11-17 12:16:20,672 INFO L138 Inliner]: procedures = 26, calls = 63, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 141 [2023-11-17 12:16:20,672 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-17 12:16:20,672 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-17 12:16:20,673 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-17 12:16:20,673 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-17 12:16:20,681 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:16:20" (1/1) ... [2023-11-17 12:16:20,681 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:16:20" (1/1) ... [2023-11-17 12:16:20,697 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:16:20" (1/1) ... [2023-11-17 12:16:20,697 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:16:20" (1/1) ... [2023-11-17 12:16:20,703 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:16:20" (1/1) ... [2023-11-17 12:16:20,706 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:16:20" (1/1) ... [2023-11-17 12:16:20,707 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:16:20" (1/1) ... [2023-11-17 12:16:20,708 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:16:20" (1/1) ... [2023-11-17 12:16:20,726 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-17 12:16:20,727 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-17 12:16:20,727 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-17 12:16:20,727 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-17 12:16:20,728 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:16:20" (1/1) ... [2023-11-17 12:16:20,733 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-17 12:16:20,746 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 12:16:20,791 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-11-17 12:16:20,813 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-11-17 12:16:20,821 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-17 12:16:20,821 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-17 12:16:20,821 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-17 12:16:20,821 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-17 12:16:20,821 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-11-17 12:16:20,822 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-11-17 12:16:20,822 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-11-17 12:16:20,822 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-11-17 12:16:20,822 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-11-17 12:16:20,822 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-11-17 12:16:20,823 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2023-11-17 12:16:20,823 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2023-11-17 12:16:20,823 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-17 12:16:20,823 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-17 12:16:20,823 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-17 12:16:20,823 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-17 12:16:20,823 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-17 12:16:20,823 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-17 12:16:20,824 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-17 12:16:20,825 WARN L211 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-17 12:16:20,929 INFO L239 CfgBuilder]: Building ICFG [2023-11-17 12:16:20,931 INFO L265 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-17 12:16:21,184 INFO L280 CfgBuilder]: Performing block encoding [2023-11-17 12:16:21,419 INFO L302 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-17 12:16:21,419 INFO L307 CfgBuilder]: Removed 4 assume(true) statements. [2023-11-17 12:16:21,420 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.11 12:16:21 BoogieIcfgContainer [2023-11-17 12:16:21,420 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-17 12:16:21,422 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-17 12:16:21,422 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-17 12:16:21,424 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-17 12:16:21,424 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.11 12:16:20" (1/3) ... [2023-11-17 12:16:21,425 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@158b54c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 12:16:21, skipping insertion in model container [2023-11-17 12:16:21,425 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:16:20" (2/3) ... [2023-11-17 12:16:21,425 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@158b54c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 12:16:21, skipping insertion in model container [2023-11-17 12:16:21,425 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.11 12:16:21" (3/3) ... [2023-11-17 12:16:21,426 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-min-max-dec.wvr.c [2023-11-17 12:16:21,438 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-17 12:16:21,438 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-17 12:16:21,439 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-17 12:16:21,493 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2023-11-17 12:16:21,524 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 58 places, 49 transitions, 126 flow [2023-11-17 12:16:21,555 INFO L124 PetriNetUnfolderBase]: 4/45 cut-off events. [2023-11-17 12:16:21,556 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-11-17 12:16:21,559 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62 conditions, 45 events. 4/45 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 84 event pairs, 0 based on Foata normal form. 0/40 useless extension candidates. Maximal degree in co-relation 37. Up to 2 conditions per place. [2023-11-17 12:16:21,559 INFO L82 GeneralOperation]: Start removeDead. Operand has 58 places, 49 transitions, 126 flow [2023-11-17 12:16:21,564 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 53 places, 44 transitions, 112 flow [2023-11-17 12:16:21,567 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-11-17 12:16:21,577 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 53 places, 44 transitions, 112 flow [2023-11-17 12:16:21,580 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 53 places, 44 transitions, 112 flow [2023-11-17 12:16:21,580 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 53 places, 44 transitions, 112 flow [2023-11-17 12:16:21,595 INFO L124 PetriNetUnfolderBase]: 4/44 cut-off events. [2023-11-17 12:16:21,595 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-11-17 12:16:21,596 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61 conditions, 44 events. 4/44 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 83 event pairs, 0 based on Foata normal form. 0/40 useless extension candidates. Maximal degree in co-relation 37. Up to 2 conditions per place. [2023-11-17 12:16:21,597 INFO L119 LiptonReduction]: Number of co-enabled transitions 750 [2023-11-17 12:16:22,249 INFO L134 LiptonReduction]: Checked pairs total: 1170 [2023-11-17 12:16:22,250 INFO L136 LiptonReduction]: Total number of compositions: 13 [2023-11-17 12:16:22,264 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-17 12:16:22,269 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=LoopHeads, 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;@39dc5624, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-17 12:16:22,269 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2023-11-17 12:16:22,280 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-17 12:16:22,280 INFO L124 PetriNetUnfolderBase]: 4/30 cut-off events. [2023-11-17 12:16:22,280 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-11-17 12:16:22,280 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 12:16:22,281 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-11-17 12:16:22,281 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-11-17 12:16:22,284 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 12:16:22,284 INFO L85 PathProgramCache]: Analyzing trace with hash 1980727026, now seen corresponding path program 1 times [2023-11-17 12:16:22,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 12:16:22,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317409374] [2023-11-17 12:16:22,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 12:16:22,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 12:16:22,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 12:16:22,626 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 12:16:22,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 12:16:22,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317409374] [2023-11-17 12:16:22,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1317409374] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 12:16:22,627 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 12:16:22,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-17 12:16:22,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121805542] [2023-11-17 12:16:22,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 12:16:22,634 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-17 12:16:22,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 12:16:22,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-17 12:16:22,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-17 12:16:22,653 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 62 [2023-11-17 12:16:22,654 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 31 transitions, 86 flow. Second operand has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 12:16:22,654 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 12:16:22,654 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 62 [2023-11-17 12:16:22,655 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 12:16:22,888 INFO L124 PetriNetUnfolderBase]: 1312/1790 cut-off events. [2023-11-17 12:16:22,888 INFO L125 PetriNetUnfolderBase]: For 126/126 co-relation queries the response was YES. [2023-11-17 12:16:22,891 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3791 conditions, 1790 events. 1312/1790 cut-off events. For 126/126 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 5907 event pairs, 787 based on Foata normal form. 0/1455 useless extension candidates. Maximal degree in co-relation 3330. Up to 1474 conditions per place. [2023-11-17 12:16:22,897 INFO L140 encePairwiseOnDemand]: 58/62 looper letters, 44 selfloop transitions, 3 changer transitions 0/47 dead transitions. [2023-11-17 12:16:22,898 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 47 transitions, 221 flow [2023-11-17 12:16:22,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-17 12:16:22,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-17 12:16:22,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 96 transitions. [2023-11-17 12:16:22,906 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3870967741935484 [2023-11-17 12:16:22,906 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 96 transitions. [2023-11-17 12:16:22,906 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 96 transitions. [2023-11-17 12:16:22,907 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 12:16:22,908 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 96 transitions. [2023-11-17 12:16:22,909 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 12:16:22,911 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 62.0) internal successors, (310), 5 states have internal predecessors, (310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 12:16:22,911 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 62.0) internal successors, (310), 5 states have internal predecessors, (310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 12:16:22,912 INFO L175 Difference]: Start difference. First operand has 40 places, 31 transitions, 86 flow. Second operand 4 states and 96 transitions. [2023-11-17 12:16:22,913 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 47 transitions, 221 flow [2023-11-17 12:16:22,917 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 47 transitions, 199 flow, removed 0 selfloop flow, removed 8 redundant places. [2023-11-17 12:16:22,918 INFO L231 Difference]: Finished difference. Result has 36 places, 32 transitions, 84 flow [2023-11-17 12:16:22,919 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, 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-11-17 12:16:22,921 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, -4 predicate places. [2023-11-17 12:16:22,921 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 32 transitions, 84 flow [2023-11-17 12:16:22,921 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 12:16:22,921 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 12:16:22,921 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-11-17 12:16:22,922 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-17 12:16:22,922 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-11-17 12:16:22,922 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 12:16:22,922 INFO L85 PathProgramCache]: Analyzing trace with hash -1360453289, now seen corresponding path program 1 times [2023-11-17 12:16:22,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 12:16:22,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121895185] [2023-11-17 12:16:22,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 12:16:22,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 12:16:22,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 12:16:23,012 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 12:16:23,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 12:16:23,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121895185] [2023-11-17 12:16:23,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1121895185] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 12:16:23,013 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 12:16:23,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-17 12:16:23,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740328016] [2023-11-17 12:16:23,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 12:16:23,014 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-17 12:16:23,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 12:16:23,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-17 12:16:23,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-17 12:16:23,014 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 62 [2023-11-17 12:16:23,015 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 32 transitions, 84 flow. Second operand has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 12:16:23,015 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 12:16:23,015 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 62 [2023-11-17 12:16:23,015 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 12:16:23,237 INFO L124 PetriNetUnfolderBase]: 1632/2222 cut-off events. [2023-11-17 12:16:23,237 INFO L125 PetriNetUnfolderBase]: For 515/515 co-relation queries the response was YES. [2023-11-17 12:16:23,239 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5065 conditions, 2222 events. 1632/2222 cut-off events. For 515/515 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 7645 event pairs, 977 based on Foata normal form. 0/1833 useless extension candidates. Maximal degree in co-relation 1796. Up to 1790 conditions per place. [2023-11-17 12:16:23,245 INFO L140 encePairwiseOnDemand]: 58/62 looper letters, 46 selfloop transitions, 3 changer transitions 0/49 dead transitions. [2023-11-17 12:16:23,245 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 49 transitions, 229 flow [2023-11-17 12:16:23,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-17 12:16:23,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-17 12:16:23,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 96 transitions. [2023-11-17 12:16:23,248 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3870967741935484 [2023-11-17 12:16:23,248 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 96 transitions. [2023-11-17 12:16:23,248 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 96 transitions. [2023-11-17 12:16:23,249 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 12:16:23,250 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 96 transitions. [2023-11-17 12:16:23,251 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 12:16:23,252 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 62.0) internal successors, (310), 5 states have internal predecessors, (310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 12:16:23,252 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 62.0) internal successors, (310), 5 states have internal predecessors, (310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 12:16:23,252 INFO L175 Difference]: Start difference. First operand has 36 places, 32 transitions, 84 flow. Second operand 4 states and 96 transitions. [2023-11-17 12:16:23,252 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 49 transitions, 229 flow [2023-11-17 12:16:23,254 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 49 transitions, 219 flow, removed 2 selfloop flow, removed 2 redundant places. [2023-11-17 12:16:23,255 INFO L231 Difference]: Finished difference. Result has 38 places, 33 transitions, 92 flow [2023-11-17 12:16:23,255 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, 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-11-17 12:16:23,256 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, -2 predicate places. [2023-11-17 12:16:23,256 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 33 transitions, 92 flow [2023-11-17 12:16:23,257 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 12:16:23,259 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 12:16:23,259 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-11-17 12:16:23,263 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-17 12:16:23,263 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-11-17 12:16:23,263 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 12:16:23,263 INFO L85 PathProgramCache]: Analyzing trace with hash 543140395, now seen corresponding path program 1 times [2023-11-17 12:16:23,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 12:16:23,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369694670] [2023-11-17 12:16:23,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 12:16:23,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 12:16:23,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 12:16:23,372 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-17 12:16:23,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 12:16:23,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369694670] [2023-11-17 12:16:23,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [369694670] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 12:16:23,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 12:16:23,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-17 12:16:23,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847631407] [2023-11-17 12:16:23,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 12:16:23,376 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-17 12:16:23,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 12:16:23,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-17 12:16:23,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-17 12:16:23,377 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 62 [2023-11-17 12:16:23,377 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 33 transitions, 92 flow. Second operand has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 12:16:23,378 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 12:16:23,378 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 62 [2023-11-17 12:16:23,378 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 12:16:23,616 INFO L124 PetriNetUnfolderBase]: 2138/2902 cut-off events. [2023-11-17 12:16:23,616 INFO L125 PetriNetUnfolderBase]: For 964/964 co-relation queries the response was YES. [2023-11-17 12:16:23,618 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7067 conditions, 2902 events. 2138/2902 cut-off events. For 964/964 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 10519 event pairs, 1243 based on Foata normal form. 0/2449 useless extension candidates. Maximal degree in co-relation 2239. Up to 2222 conditions per place. [2023-11-17 12:16:23,626 INFO L140 encePairwiseOnDemand]: 58/62 looper letters, 49 selfloop transitions, 3 changer transitions 0/52 dead transitions. [2023-11-17 12:16:23,626 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 52 transitions, 253 flow [2023-11-17 12:16:23,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-17 12:16:23,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-17 12:16:23,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 101 transitions. [2023-11-17 12:16:23,629 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40725806451612906 [2023-11-17 12:16:23,629 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 101 transitions. [2023-11-17 12:16:23,629 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 101 transitions. [2023-11-17 12:16:23,630 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 12:16:23,630 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 101 transitions. [2023-11-17 12:16:23,631 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 25.25) internal successors, (101), 4 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 12:16:23,631 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 62.0) internal successors, (310), 5 states have internal predecessors, (310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 12:16:23,631 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 62.0) internal successors, (310), 5 states have internal predecessors, (310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 12:16:23,632 INFO L175 Difference]: Start difference. First operand has 38 places, 33 transitions, 92 flow. Second operand 4 states and 101 transitions. [2023-11-17 12:16:23,632 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 52 transitions, 253 flow [2023-11-17 12:16:23,633 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 52 transitions, 243 flow, removed 2 selfloop flow, removed 2 redundant places. [2023-11-17 12:16:23,634 INFO L231 Difference]: Finished difference. Result has 40 places, 34 transitions, 100 flow [2023-11-17 12:16:23,634 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, 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-11-17 12:16:23,635 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 0 predicate places. [2023-11-17 12:16:23,635 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 34 transitions, 100 flow [2023-11-17 12:16:23,635 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 12:16:23,635 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 12:16:23,635 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-11-17 12:16:23,635 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-17 12:16:23,635 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-11-17 12:16:23,636 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 12:16:23,636 INFO L85 PathProgramCache]: Analyzing trace with hash 1265999243, now seen corresponding path program 1 times [2023-11-17 12:16:23,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 12:16:23,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129250725] [2023-11-17 12:16:23,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 12:16:23,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 12:16:23,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 12:16:23,706 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-17 12:16:23,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 12:16:23,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129250725] [2023-11-17 12:16:23,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1129250725] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 12:16:23,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 12:16:23,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-17 12:16:23,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297133348] [2023-11-17 12:16:23,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 12:16:23,707 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-17 12:16:23,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 12:16:23,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-17 12:16:23,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-17 12:16:23,708 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 62 [2023-11-17 12:16:23,708 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 34 transitions, 100 flow. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 12:16:23,708 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 12:16:23,708 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 62 [2023-11-17 12:16:23,708 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 12:16:23,895 INFO L124 PetriNetUnfolderBase]: 2138/2903 cut-off events. [2023-11-17 12:16:23,895 INFO L125 PetriNetUnfolderBase]: For 1301/1301 co-relation queries the response was YES. [2023-11-17 12:16:23,898 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7648 conditions, 2903 events. 2138/2903 cut-off events. For 1301/1301 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 10167 event pairs, 1685 based on Foata normal form. 0/2450 useless extension candidates. Maximal degree in co-relation 2581. Up to 2903 conditions per place. [2023-11-17 12:16:23,907 INFO L140 encePairwiseOnDemand]: 59/62 looper letters, 33 selfloop transitions, 2 changer transitions 0/35 dead transitions. [2023-11-17 12:16:23,907 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 35 transitions, 172 flow [2023-11-17 12:16:23,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 12:16:23,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-17 12:16:23,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 81 transitions. [2023-11-17 12:16:23,908 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43548387096774194 [2023-11-17 12:16:23,908 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 81 transitions. [2023-11-17 12:16:23,908 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 81 transitions. [2023-11-17 12:16:23,908 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 12:16:23,908 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 81 transitions. [2023-11-17 12:16:23,909 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 12:16:23,909 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 62.0) internal successors, (248), 4 states have internal predecessors, (248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 12:16:23,909 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 62.0) internal successors, (248), 4 states have internal predecessors, (248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 12:16:23,909 INFO L175 Difference]: Start difference. First operand has 40 places, 34 transitions, 100 flow. Second operand 3 states and 81 transitions. [2023-11-17 12:16:23,909 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 35 transitions, 172 flow [2023-11-17 12:16:23,911 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 35 transitions, 166 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-11-17 12:16:23,911 INFO L231 Difference]: Finished difference. Result has 41 places, 35 transitions, 106 flow [2023-11-17 12:16:23,911 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, 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-11-17 12:16:23,912 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 1 predicate places. [2023-11-17 12:16:23,912 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 35 transitions, 106 flow [2023-11-17 12:16:23,912 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 12:16:23,912 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 12:16:23,912 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-11-17 12:16:23,912 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-17 12:16:23,913 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-11-17 12:16:23,913 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 12:16:23,913 INFO L85 PathProgramCache]: Analyzing trace with hash -835635148, now seen corresponding path program 1 times [2023-11-17 12:16:23,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 12:16:23,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132811790] [2023-11-17 12:16:23,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 12:16:23,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 12:16:23,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 12:16:24,228 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-17 12:16:24,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 12:16:24,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132811790] [2023-11-17 12:16:24,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1132811790] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 12:16:24,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [63345084] [2023-11-17 12:16:24,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 12:16:24,229 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 12:16:24,229 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 12:16:24,232 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-11-17 12:16:24,261 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-11-17 12:16:24,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 12:16:24,347 INFO L262 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 24 conjunts are in the unsatisfiable core [2023-11-17 12:16:24,352 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 12:16:24,516 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-17 12:16:24,525 INFO L378 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 11 [2023-11-17 12:16:24,648 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-17 12:16:24,649 INFO L378 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 23 treesize of output 16 [2023-11-17 12:16:24,679 INFO L378 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-11-17 12:16:24,704 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-17 12:16:24,705 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 12:16:25,357 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (+ c_~min~0 1)) (.cse2 (+ (* c_thread1Thread1of1ForFork3_~i~0 4) c_~A~0.offset))) (and (forall ((v_ArrVal_119 (Array Int Int))) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_119))) (or (forall ((v_ArrVal_120 (Array Int Int))) (let ((.cse0 (select (select (store .cse1 |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_120) c_~A~0.base) c_~A~0.offset))) (or (< 2147483646 .cse0) (< c_~min~0 (+ 2 .cse0))))) (< (select (select .cse1 c_~A~0.base) .cse2) .cse3)))) (forall ((v_ArrVal_119 (Array Int Int))) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_119))) (let ((.cse4 (select .cse6 c_~A~0.base))) (or (< (select .cse4 .cse2) .cse3) (forall ((v_ArrVal_120 (Array Int Int))) (let ((.cse5 (select (select (store .cse6 |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_120) c_~A~0.base) c_~A~0.offset))) (or (< (select .cse4 c_~A~0.offset) (+ .cse5 1)) (< c_~min~0 (+ .cse5 3)) (< 2147483645 .cse5)))))))) (forall ((v_ArrVal_119 (Array Int Int))) (let ((.cse10 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_119))) (let ((.cse7 (select .cse10 c_~A~0.base))) (let ((.cse9 (select .cse7 .cse2))) (or (forall ((v_ArrVal_120 (Array Int Int))) (let ((.cse8 (select (select (store .cse10 |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_120) c_~A~0.base) c_~A~0.offset))) (or (< (select .cse7 c_~A~0.offset) (+ .cse8 1)) (< .cse9 (+ .cse8 3)) (< 2147483645 .cse8)))) (< c_~min~0 .cse9)))))) (forall ((v_ArrVal_119 (Array Int Int))) (let ((.cse13 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_119))) (let ((.cse11 (select (select .cse13 c_~A~0.base) .cse2))) (or (forall ((v_ArrVal_120 (Array Int Int))) (let ((.cse12 (select (select (store .cse13 |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_120) c_~A~0.base) c_~A~0.offset))) (or (< .cse11 (+ 2 .cse12)) (< 2147483646 .cse12)))) (< c_~min~0 .cse11))))))) is different from false [2023-11-17 12:16:25,406 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse7 (+ c_~min~0 1))) (and (forall ((v_ArrVal_119 (Array Int Int))) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_119))) (let ((.cse0 (select (select .cse2 c_~A~0.base) c_~A~0.offset))) (or (forall ((v_ArrVal_120 (Array Int Int))) (let ((.cse1 (select (select (store .cse2 |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_120) c_~A~0.base) c_~A~0.offset))) (or (< .cse0 (+ .cse1 3)) (< 2147483645 .cse1)))) (< c_~min~0 .cse0))))) (forall ((v_ArrVal_119 (Array Int Int))) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_119))) (let ((.cse3 (select (select .cse5 c_~A~0.base) c_~A~0.offset))) (or (forall ((v_ArrVal_120 (Array Int Int))) (let ((.cse4 (select (select (store .cse5 |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_120) c_~A~0.base) c_~A~0.offset))) (or (< .cse3 (+ 2 .cse4)) (< 2147483646 .cse4)))) (< c_~min~0 .cse3))))) (forall ((v_ArrVal_119 (Array Int Int))) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_119))) (or (< (select (select .cse6 c_~A~0.base) c_~A~0.offset) .cse7) (forall ((v_ArrVal_120 (Array Int Int))) (let ((.cse8 (select (select (store .cse6 |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_120) c_~A~0.base) c_~A~0.offset))) (or (< c_~min~0 (+ .cse8 3)) (< 2147483645 .cse8))))))) (forall ((v_ArrVal_119 (Array Int Int))) (let ((.cse9 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_119))) (or (< (select (select .cse9 c_~A~0.base) c_~A~0.offset) .cse7) (forall ((v_ArrVal_120 (Array Int Int))) (let ((.cse10 (select (select (store .cse9 |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_120) c_~A~0.base) c_~A~0.offset))) (or (< 2147483646 .cse10) (< c_~min~0 (+ 2 .cse10)))))))))) is different from false [2023-11-17 12:16:25,491 INFO L378 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 1221 treesize of output 1097 [2023-11-17 12:16:25,520 INFO L378 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 211 treesize of output 203 [2023-11-17 12:16:25,526 INFO L378 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 203 treesize of output 199 [2023-11-17 12:16:25,531 INFO L378 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 199 treesize of output 193 [2023-11-17 12:16:25,536 INFO L378 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 185 [2023-11-17 12:16:25,542 INFO L378 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 185 treesize of output 181 [2023-11-17 12:16:25,548 INFO L378 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 181 treesize of output 179 [2023-11-17 12:16:25,554 INFO L378 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 179 treesize of output 177 [2023-11-17 12:16:25,563 INFO L378 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 177 treesize of output 173 [2023-11-17 12:16:25,566 INFO L209 tifierPushTermWalker]: Run 10 iterations without descend maybe there is a nontermination bug. [2023-11-17 12:16:27,676 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 1 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-17 12:16:27,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [63345084] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 12:16:27,677 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 12:16:27,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 11, 11] total 28 [2023-11-17 12:16:27,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510810670] [2023-11-17 12:16:27,677 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 12:16:27,677 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2023-11-17 12:16:27,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 12:16:27,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2023-11-17 12:16:27,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=639, Unknown=9, NotChecked=106, Total=870 [2023-11-17 12:16:27,679 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 62 [2023-11-17 12:16:27,679 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 35 transitions, 106 flow. Second operand has 30 states, 30 states have (on average 14.1) internal successors, (423), 30 states have internal predecessors, (423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 12:16:27,680 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 12:16:27,680 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 62 [2023-11-17 12:16:27,680 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 12:16:35,313 INFO L124 PetriNetUnfolderBase]: 20596/28341 cut-off events. [2023-11-17 12:16:35,313 INFO L125 PetriNetUnfolderBase]: For 8016/8016 co-relation queries the response was YES. [2023-11-17 12:16:35,372 INFO L83 FinitePrefix]: Finished finitePrefix Result has 73690 conditions, 28341 events. 20596/28341 cut-off events. For 8016/8016 co-relation queries the response was YES. Maximal size of possible extension queue 1002. Compared 157893 event pairs, 1182 based on Foata normal form. 18/22029 useless extension candidates. Maximal degree in co-relation 73676. Up to 6275 conditions per place. [2023-11-17 12:16:35,429 INFO L140 encePairwiseOnDemand]: 49/62 looper letters, 500 selfloop transitions, 159 changer transitions 618/1277 dead transitions. [2023-11-17 12:16:35,429 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 1277 transitions, 6413 flow [2023-11-17 12:16:35,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2023-11-17 12:16:35,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2023-11-17 12:16:35,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 2207 transitions. [2023-11-17 12:16:35,437 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.391173342786246 [2023-11-17 12:16:35,437 INFO L72 ComplementDD]: Start complementDD. Operand 91 states and 2207 transitions. [2023-11-17 12:16:35,437 INFO L73 IsDeterministic]: Start isDeterministic. Operand 91 states and 2207 transitions. [2023-11-17 12:16:35,438 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 12:16:35,438 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 91 states and 2207 transitions. [2023-11-17 12:16:35,443 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 92 states, 91 states have (on average 24.252747252747252) internal successors, (2207), 91 states have internal predecessors, (2207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 12:16:35,454 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 92 states, 92 states have (on average 62.0) internal successors, (5704), 92 states have internal predecessors, (5704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 12:16:35,454 INFO L81 ComplementDD]: Finished complementDD. Result has 92 states, 92 states have (on average 62.0) internal successors, (5704), 92 states have internal predecessors, (5704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 12:16:35,455 INFO L175 Difference]: Start difference. First operand has 41 places, 35 transitions, 106 flow. Second operand 91 states and 2207 transitions. [2023-11-17 12:16:35,455 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 1277 transitions, 6413 flow [2023-11-17 12:16:35,568 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 1277 transitions, 6409 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-11-17 12:16:35,575 INFO L231 Difference]: Finished difference. Result has 209 places, 212 transitions, 1573 flow [2023-11-17 12:16:35,575 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=91, PETRI_FLOW=1573, PETRI_PLACES=209, PETRI_TRANSITIONS=212} [2023-11-17 12:16:35,576 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 169 predicate places. [2023-11-17 12:16:35,576 INFO L495 AbstractCegarLoop]: Abstraction has has 209 places, 212 transitions, 1573 flow [2023-11-17 12:16:35,576 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 14.1) internal successors, (423), 30 states have internal predecessors, (423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 12:16:35,576 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 12:16:35,576 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-11-17 12:16:35,589 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-11-17 12:16:35,781 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-11-17 12:16:35,781 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-11-17 12:16:35,782 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 12:16:35,782 INFO L85 PathProgramCache]: Analyzing trace with hash -1641153900, now seen corresponding path program 2 times [2023-11-17 12:16:35,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 12:16:35,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208165594] [2023-11-17 12:16:35,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 12:16:35,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 12:16:35,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 12:16:35,965 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-17 12:16:35,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 12:16:35,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208165594] [2023-11-17 12:16:35,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1208165594] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 12:16:35,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 12:16:35,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-17 12:16:35,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723834452] [2023-11-17 12:16:35,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 12:16:35,966 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-17 12:16:35,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 12:16:35,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-17 12:16:35,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-17 12:16:35,966 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 62 [2023-11-17 12:16:35,967 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 209 places, 212 transitions, 1573 flow. Second operand has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 12:16:35,967 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 12:16:35,967 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 62 [2023-11-17 12:16:35,967 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 12:16:39,679 INFO L124 PetriNetUnfolderBase]: 17976/25005 cut-off events. [2023-11-17 12:16:39,679 INFO L125 PetriNetUnfolderBase]: For 1069248/1069248 co-relation queries the response was YES. [2023-11-17 12:16:39,860 INFO L83 FinitePrefix]: Finished finitePrefix Result has 181912 conditions, 25005 events. 17976/25005 cut-off events. For 1069248/1069248 co-relation queries the response was YES. Maximal size of possible extension queue 870. Compared 140260 event pairs, 2674 based on Foata normal form. 18/25023 useless extension candidates. Maximal degree in co-relation 181813. Up to 15077 conditions per place. [2023-11-17 12:16:40,021 INFO L140 encePairwiseOnDemand]: 58/62 looper letters, 218 selfloop transitions, 10 changer transitions 340/568 dead transitions. [2023-11-17 12:16:40,022 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 568 transitions, 5309 flow [2023-11-17 12:16:40,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-17 12:16:40,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-17 12:16:40,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 146 transitions. [2023-11-17 12:16:40,023 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47096774193548385 [2023-11-17 12:16:40,023 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 146 transitions. [2023-11-17 12:16:40,023 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 146 transitions. [2023-11-17 12:16:40,023 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 12:16:40,023 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 146 transitions. [2023-11-17 12:16:40,023 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 29.2) internal successors, (146), 5 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 12:16:40,025 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 62.0) internal successors, (372), 6 states have internal predecessors, (372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 12:16:40,025 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 62.0) internal successors, (372), 6 states have internal predecessors, (372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 12:16:40,025 INFO L175 Difference]: Start difference. First operand has 209 places, 212 transitions, 1573 flow. Second operand 5 states and 146 transitions. [2023-11-17 12:16:40,025 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 568 transitions, 5309 flow [2023-11-17 12:16:44,277 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 568 transitions, 4930 flow, removed 188 selfloop flow, removed 38 redundant places. [2023-11-17 12:16:44,281 INFO L231 Difference]: Finished difference. Result has 133 places, 174 transitions, 1188 flow [2023-11-17 12:16:44,282 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=1412, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=212, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=202, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1188, PETRI_PLACES=133, PETRI_TRANSITIONS=174} [2023-11-17 12:16:44,282 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 93 predicate places. [2023-11-17 12:16:44,282 INFO L495 AbstractCegarLoop]: Abstraction has has 133 places, 174 transitions, 1188 flow [2023-11-17 12:16:44,282 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 12:16:44,282 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 12:16:44,283 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-11-17 12:16:44,283 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-17 12:16:44,283 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-11-17 12:16:44,283 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 12:16:44,283 INFO L85 PathProgramCache]: Analyzing trace with hash 1959653120, now seen corresponding path program 3 times [2023-11-17 12:16:44,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 12:16:44,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216717832] [2023-11-17 12:16:44,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 12:16:44,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 12:16:44,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 12:16:44,769 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-17 12:16:44,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 12:16:44,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1216717832] [2023-11-17 12:16:44,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1216717832] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 12:16:44,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1271210722] [2023-11-17 12:16:44,770 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-17 12:16:44,771 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 12:16:44,771 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 12:16:44,789 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-11-17 12:16:44,813 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-11-17 12:16:44,952 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-11-17 12:16:44,952 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-17 12:16:44,954 INFO L262 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 30 conjunts are in the unsatisfiable core [2023-11-17 12:16:44,957 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 12:16:45,077 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-17 12:16:45,079 INFO L378 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 11 [2023-11-17 12:16:45,109 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-17 12:16:45,110 INFO L378 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 11 [2023-11-17 12:16:45,148 INFO L378 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 25 treesize of output 13 [2023-11-17 12:16:45,222 INFO L378 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-11-17 12:16:45,254 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-17 12:16:45,254 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 12:16:45,493 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_188 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_188) c_~A~0.base) c_~A~0.offset))) (or (< c_~min~0 (+ .cse0 1)) (< 2147483647 .cse0)))) is different from false [2023-11-17 12:16:45,509 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_188 (Array Int Int)) (v_ArrVal_187 (Array Int Int))) (let ((.cse0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_187) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_188) c_~A~0.base) c_~A~0.offset))) (or (< 2147483647 .cse0) (< c_~min~0 (+ .cse0 1))))) is different from false [2023-11-17 12:16:45,658 INFO L378 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 113 treesize of output 97 [2023-11-17 12:16:45,664 INFO L378 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-11-17 12:16:45,669 INFO L378 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 45 treesize of output 41 [2023-11-17 12:16:45,741 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 1 not checked. [2023-11-17 12:16:45,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1271210722] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 12:16:45,741 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 12:16:45,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12, 13] total 33 [2023-11-17 12:16:45,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901808721] [2023-11-17 12:16:45,741 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 12:16:45,742 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2023-11-17 12:16:45,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 12:16:45,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2023-11-17 12:16:45,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=865, Unknown=6, NotChecked=126, Total=1190 [2023-11-17 12:16:45,745 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 62 [2023-11-17 12:16:45,745 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 174 transitions, 1188 flow. Second operand has 35 states, 35 states have (on average 12.6) internal successors, (441), 35 states have internal predecessors, (441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 12:16:45,745 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 12:16:45,745 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 62 [2023-11-17 12:16:45,745 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 12:17:05,299 INFO L124 PetriNetUnfolderBase]: 63286/88161 cut-off events. [2023-11-17 12:17:05,299 INFO L125 PetriNetUnfolderBase]: For 2296244/2296244 co-relation queries the response was YES. [2023-11-17 12:17:06,087 INFO L83 FinitePrefix]: Finished finitePrefix Result has 544806 conditions, 88161 events. 63286/88161 cut-off events. For 2296244/2296244 co-relation queries the response was YES. Maximal size of possible extension queue 2931. Compared 581307 event pairs, 5812 based on Foata normal form. 100/88261 useless extension candidates. Maximal degree in co-relation 544741. Up to 23681 conditions per place. [2023-11-17 12:17:06,298 INFO L140 encePairwiseOnDemand]: 48/62 looper letters, 912 selfloop transitions, 395 changer transitions 1907/3214 dead transitions. [2023-11-17 12:17:06,299 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 259 places, 3214 transitions, 32093 flow [2023-11-17 12:17:06,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 135 states. [2023-11-17 12:17:06,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2023-11-17 12:17:06,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 3009 transitions. [2023-11-17 12:17:06,309 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3594982078853047 [2023-11-17 12:17:06,309 INFO L72 ComplementDD]: Start complementDD. Operand 135 states and 3009 transitions. [2023-11-17 12:17:06,309 INFO L73 IsDeterministic]: Start isDeterministic. Operand 135 states and 3009 transitions. [2023-11-17 12:17:06,314 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 12:17:06,314 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 135 states and 3009 transitions. [2023-11-17 12:17:06,319 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 136 states, 135 states have (on average 22.288888888888888) internal successors, (3009), 135 states have internal predecessors, (3009), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 12:17:06,327 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 136 states, 136 states have (on average 62.0) internal successors, (8432), 136 states have internal predecessors, (8432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 12:17:06,328 INFO L81 ComplementDD]: Finished complementDD. Result has 136 states, 136 states have (on average 62.0) internal successors, (8432), 136 states have internal predecessors, (8432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 12:17:06,328 INFO L175 Difference]: Start difference. First operand has 133 places, 174 transitions, 1188 flow. Second operand 135 states and 3009 transitions. [2023-11-17 12:17:06,328 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 259 places, 3214 transitions, 32093 flow [2023-11-17 12:17:16,045 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 247 places, 3214 transitions, 28936 flow, removed 1450 selfloop flow, removed 12 redundant places. [2023-11-17 12:17:16,062 INFO L231 Difference]: Finished difference. Result has 363 places, 550 transitions, 6219 flow [2023-11-17 12:17:16,063 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=1125, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=174, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=80, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=135, PETRI_FLOW=6219, PETRI_PLACES=363, PETRI_TRANSITIONS=550} [2023-11-17 12:17:16,063 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 323 predicate places. [2023-11-17 12:17:16,063 INFO L495 AbstractCegarLoop]: Abstraction has has 363 places, 550 transitions, 6219 flow [2023-11-17 12:17:16,063 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 12.6) internal successors, (441), 35 states have internal predecessors, (441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 12:17:16,064 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 12:17:16,064 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-11-17 12:17:16,069 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-11-17 12:17:16,269 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-11-17 12:17:16,269 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-11-17 12:17:16,270 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 12:17:16,270 INFO L85 PathProgramCache]: Analyzing trace with hash -822208374, now seen corresponding path program 4 times [2023-11-17 12:17:16,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 12:17:16,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338032765] [2023-11-17 12:17:16,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 12:17:16,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 12:17:16,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 12:17:16,656 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-17 12:17:16,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 12:17:16,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338032765] [2023-11-17 12:17:16,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1338032765] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 12:17:16,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [880671741] [2023-11-17 12:17:16,656 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-17 12:17:16,656 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 12:17:16,656 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 12:17:16,657 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-11-17 12:17:16,689 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-11-17 12:17:16,760 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-17 12:17:16,761 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-17 12:17:16,762 INFO L262 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 36 conjunts are in the unsatisfiable core [2023-11-17 12:17:16,764 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 12:17:16,789 INFO L378 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 15 treesize of output 1 [2023-11-17 12:17:16,818 INFO L378 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 8 treesize of output 1 [2023-11-17 12:17:16,921 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-17 12:17:16,922 INFO L378 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 11 [2023-11-17 12:17:16,968 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-17 12:17:16,969 INFO L378 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 23 treesize of output 16 [2023-11-17 12:17:17,039 INFO L160 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 12:17:17,040 INFO L165 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2023-11-17 12:17:17,041 INFO L378 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-11-17 12:17:17,071 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-17 12:17:17,071 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 12:17:17,348 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_238 (Array Int Int)) (v_ArrVal_237 (Array Int Int))) (let ((.cse0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_237) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_238) c_~A~0.base) c_~A~0.offset))) (or (< 2147483646 .cse0) (< c_~min~0 (+ .cse0 2))))) (forall ((v_ArrVal_238 (Array Int Int)) (v_ArrVal_237 (Array Int Int))) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_237))) (let ((.cse1 (select (select (store .cse2 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_238) c_~A~0.base) c_~A~0.offset))) (or (< 2147483645 .cse1) (< (select (select .cse2 c_~A~0.base) c_~A~0.offset) (+ .cse1 1)) (< c_~min~0 (+ .cse1 3))))))) is different from false [2023-11-17 12:17:17,613 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| c_~A~0.base) c_~A~0.offset))) (and (forall ((v_ArrVal_238 (Array Int Int)) (v_ArrVal_237 (Array Int Int))) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_237))) (let ((.cse1 (select (select (store .cse2 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_238) c_~A~0.base) c_~A~0.offset))) (or (< .cse0 (+ .cse1 3)) (< 2147483645 .cse1) (< (select (select .cse2 c_~A~0.base) c_~A~0.offset) (+ .cse1 1)))))) (forall ((v_ArrVal_238 (Array Int Int)) (v_ArrVal_237 (Array Int Int))) (let ((.cse3 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_237) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_238) c_~A~0.base) c_~A~0.offset))) (or (< .cse0 (+ .cse3 2)) (< 2147483646 .cse3)))))) is different from false [2023-11-17 12:17:17,647 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_238 (Array Int Int)) (v_ArrVal_237 (Array Int Int)) (v_ArrVal_236 (Array Int Int))) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_236))) (let ((.cse1 (store .cse2 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_237))) (let ((.cse0 (select (select (store .cse1 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_238) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (< 2147483645 .cse0) (< (select (select .cse1 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (+ .cse0 1)) (< (select (select .cse2 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (+ 3 .cse0))))))) (forall ((v_ArrVal_238 (Array Int Int)) (v_ArrVal_237 (Array Int Int)) (v_ArrVal_236 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_236))) (let ((.cse3 (select (select (store (store .cse4 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_237) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_238) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (< 2147483646 .cse3) (< (select (select .cse4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (+ 2 .cse3))))))) is different from false [2023-11-17 12:17:17,655 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 12:17:17,656 INFO L378 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-11-17 12:17:17,658 INFO L378 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 401 treesize of output 365 [2023-11-17 12:17:17,665 INFO L378 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 111 treesize of output 103 [2023-11-17 12:17:17,668 INFO L378 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 207 treesize of output 191 [2023-11-17 12:17:17,671 INFO L378 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 191 treesize of output 183 [2023-11-17 12:17:17,721 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-11-17 12:17:17,722 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 130 treesize of output 1 [2023-11-17 12:17:17,737 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 2 not checked. [2023-11-17 12:17:17,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [880671741] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 12:17:17,738 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 12:17:17,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 13, 12] total 32 [2023-11-17 12:17:17,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982522361] [2023-11-17 12:17:17,738 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 12:17:17,738 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2023-11-17 12:17:17,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 12:17:17,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2023-11-17 12:17:17,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=787, Unknown=16, NotChecked=180, Total=1122 [2023-11-17 12:17:17,740 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 62 [2023-11-17 12:17:17,740 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 363 places, 550 transitions, 6219 flow. Second operand has 34 states, 34 states have (on average 13.735294117647058) internal successors, (467), 34 states have internal predecessors, (467), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 12:17:17,740 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 12:17:17,740 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 62 [2023-11-17 12:17:17,740 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 12:17:49,328 INFO L124 PetriNetUnfolderBase]: 64666/91199 cut-off events. [2023-11-17 12:17:49,328 INFO L125 PetriNetUnfolderBase]: For 16818522/16818522 co-relation queries the response was YES.