/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf --traceabstraction.order.of.the.error.locations.to.be.checked PROGRAM_FIRST -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/popl20-two-queue.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-24 16:34:31,562 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-24 16:34:31,615 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf [2023-08-24 16:34:31,620 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-24 16:34:31,621 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-24 16:34:31,644 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-24 16:34:31,645 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-24 16:34:31,645 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-24 16:34:31,646 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-24 16:34:31,648 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-24 16:34:31,649 INFO L153 SettingsManager]: * Use SBE=true [2023-08-24 16:34:31,649 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-24 16:34:31,649 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-24 16:34:31,650 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-24 16:34:31,650 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-24 16:34:31,650 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-24 16:34:31,650 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-24 16:34:31,650 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-24 16:34:31,650 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-24 16:34:31,651 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-24 16:34:31,651 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-24 16:34:31,651 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-24 16:34:31,651 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-24 16:34:31,652 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-24 16:34:31,652 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-24 16:34:31,652 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-24 16:34:31,652 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-24 16:34:31,653 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-24 16:34:31,653 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-24 16:34:31,653 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-24 16:34:31,654 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-24 16:34:31,654 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-24 16:34:31,654 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-24 16:34:31,654 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-24 16:34:31,654 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-24 16:34:31,654 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Order of the error locations to be checked -> PROGRAM_FIRST [2023-08-24 16:34:31,912 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-24 16:34:31,926 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-24 16:34:31,928 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-24 16:34:31,928 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-24 16:34:31,933 INFO L274 PluginConnector]: CDTParser initialized [2023-08-24 16:34:31,934 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-two-queue.wvr.c [2023-08-24 16:34:32,919 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-24 16:34:33,114 INFO L384 CDTParser]: Found 1 translation units. [2023-08-24 16:34:33,115 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-two-queue.wvr.c [2023-08-24 16:34:33,121 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e42a4b8a7/941030aa9ad74a1791946cbda41ddabb/FLAG111209479 [2023-08-24 16:34:33,134 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e42a4b8a7/941030aa9ad74a1791946cbda41ddabb [2023-08-24 16:34:33,142 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-24 16:34:33,143 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-24 16:34:33,145 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-24 16:34:33,146 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-24 16:34:33,148 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-24 16:34:33,149 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.08 04:34:33" (1/1) ... [2023-08-24 16:34:33,149 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3bf6b905 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 04:34:33, skipping insertion in model container [2023-08-24 16:34:33,150 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.08 04:34:33" (1/1) ... [2023-08-24 16:34:33,170 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-24 16:34:33,315 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-two-queue.wvr.c[2987,3000] [2023-08-24 16:34:33,323 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-24 16:34:33,330 INFO L201 MainTranslator]: Completed pre-run [2023-08-24 16:34:33,361 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-two-queue.wvr.c[2987,3000] [2023-08-24 16:34:33,364 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-24 16:34:33,369 WARN L669 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-24 16:34:33,369 WARN L669 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-24 16:34:33,375 INFO L206 MainTranslator]: Completed translation [2023-08-24 16:34:33,376 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 04:34:33 WrapperNode [2023-08-24 16:34:33,376 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-24 16:34:33,377 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-24 16:34:33,377 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-24 16:34:33,377 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-24 16:34:33,381 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 04:34:33" (1/1) ... [2023-08-24 16:34:33,396 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 04:34:33" (1/1) ... [2023-08-24 16:34:33,417 INFO L138 Inliner]: procedures = 24, calls = 43, calls flagged for inlining = 13, calls inlined = 15, statements flattened = 209 [2023-08-24 16:34:33,417 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-24 16:34:33,418 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-24 16:34:33,418 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-24 16:34:33,418 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-24 16:34:33,423 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 04:34:33" (1/1) ... [2023-08-24 16:34:33,423 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 04:34:33" (1/1) ... [2023-08-24 16:34:33,425 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 04:34:33" (1/1) ... [2023-08-24 16:34:33,425 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 04:34:33" (1/1) ... [2023-08-24 16:34:33,429 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 04:34:33" (1/1) ... [2023-08-24 16:34:33,432 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 04:34:33" (1/1) ... [2023-08-24 16:34:33,433 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 04:34:33" (1/1) ... [2023-08-24 16:34:33,433 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 04:34:33" (1/1) ... [2023-08-24 16:34:33,446 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-24 16:34:33,446 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-24 16:34:33,446 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-24 16:34:33,446 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-24 16:34:33,447 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 04:34:33" (1/1) ... [2023-08-24 16:34:33,450 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-24 16:34:33,467 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 16:34:33,492 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-24 16:34:33,511 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-24 16:34:33,520 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-24 16:34:33,521 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-08-24 16:34:33,521 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-08-24 16:34:33,521 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-08-24 16:34:33,521 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-08-24 16:34:33,521 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-24 16:34:33,521 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-24 16:34:33,521 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-24 16:34:33,522 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-24 16:34:33,522 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-24 16:34:33,522 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-08-24 16:34:33,522 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-24 16:34:33,522 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-24 16:34:33,522 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-24 16:34:33,522 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-24 16:34:33,524 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-24 16:34:33,587 INFO L236 CfgBuilder]: Building ICFG [2023-08-24 16:34:33,588 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-24 16:34:33,790 INFO L277 CfgBuilder]: Performing block encoding [2023-08-24 16:34:33,867 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-24 16:34:33,868 INFO L302 CfgBuilder]: Removed 4 assume(true) statements. [2023-08-24 16:34:33,869 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.08 04:34:33 BoogieIcfgContainer [2023-08-24 16:34:33,869 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-24 16:34:33,871 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-24 16:34:33,871 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-24 16:34:33,874 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-24 16:34:33,874 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.08 04:34:33" (1/3) ... [2023-08-24 16:34:33,875 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4883b5ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.08 04:34:33, skipping insertion in model container [2023-08-24 16:34:33,875 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 04:34:33" (2/3) ... [2023-08-24 16:34:33,875 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4883b5ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.08 04:34:33, skipping insertion in model container [2023-08-24 16:34:33,875 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.08 04:34:33" (3/3) ... [2023-08-24 16:34:33,876 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-two-queue.wvr.c [2023-08-24 16:34:33,888 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-24 16:34:33,889 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-08-24 16:34:33,889 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-24 16:34:33,978 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-08-24 16:34:34,010 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 166 places, 172 transitions, 360 flow [2023-08-24 16:34:34,086 INFO L124 PetriNetUnfolderBase]: 13/170 cut-off events. [2023-08-24 16:34:34,086 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-08-24 16:34:34,090 INFO L83 FinitePrefix]: Finished finitePrefix Result has 179 conditions, 170 events. 13/170 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 85 event pairs, 0 based on Foata normal form. 0/156 useless extension candidates. Maximal degree in co-relation 137. Up to 2 conditions per place. [2023-08-24 16:34:34,090 INFO L82 GeneralOperation]: Start removeDead. Operand has 166 places, 172 transitions, 360 flow [2023-08-24 16:34:34,095 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 156 places, 162 transitions, 336 flow [2023-08-24 16:34:34,098 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-24 16:34:34,107 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 156 places, 162 transitions, 336 flow [2023-08-24 16:34:34,110 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 156 places, 162 transitions, 336 flow [2023-08-24 16:34:34,110 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 156 places, 162 transitions, 336 flow [2023-08-24 16:34:34,144 INFO L124 PetriNetUnfolderBase]: 13/162 cut-off events. [2023-08-24 16:34:34,146 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-08-24 16:34:34,147 INFO L83 FinitePrefix]: Finished finitePrefix Result has 171 conditions, 162 events. 13/162 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 85 event pairs, 0 based on Foata normal form. 0/149 useless extension candidates. Maximal degree in co-relation 137. Up to 2 conditions per place. [2023-08-24 16:34:34,149 INFO L119 LiptonReduction]: Number of co-enabled transitions 500 [2023-08-24 16:34:39,466 INFO L134 LiptonReduction]: Checked pairs total: 854 [2023-08-24 16:34:39,466 INFO L136 LiptonReduction]: Total number of compositions: 168 [2023-08-24 16:34:39,480 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-24 16:34:39,484 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@1ab18710, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-24 16:34:39,484 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-08-24 16:34:39,489 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-24 16:34:39,489 INFO L124 PetriNetUnfolderBase]: 4/18 cut-off events. [2023-08-24 16:34:39,489 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-08-24 16:34:39,489 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 16:34:39,490 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 16:34:39,490 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-24 16:34:39,494 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 16:34:39,494 INFO L85 PathProgramCache]: Analyzing trace with hash -548603558, now seen corresponding path program 1 times [2023-08-24 16:34:39,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 16:34:39,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551509862] [2023-08-24 16:34:39,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 16:34:39,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 16:34:39,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 16:34:39,859 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 16:34:39,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 16:34:39,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551509862] [2023-08-24 16:34:39,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [551509862] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 16:34:39,860 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 16:34:39,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-24 16:34:39,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482861706] [2023-08-24 16:34:39,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 16:34:39,866 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-24 16:34:39,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 16:34:39,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-24 16:34:39,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-24 16:34:39,883 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 143 out of 340 [2023-08-24 16:34:39,885 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 22 places, 19 transitions, 50 flow. Second operand has 3 states, 3 states have (on average 147.33333333333334) internal successors, (442), 3 states have internal predecessors, (442), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 16:34:39,885 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 16:34:39,885 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 143 of 340 [2023-08-24 16:34:39,886 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 16:34:39,946 INFO L124 PetriNetUnfolderBase]: 81/147 cut-off events. [2023-08-24 16:34:39,946 INFO L125 PetriNetUnfolderBase]: For 13/13 co-relation queries the response was YES. [2023-08-24 16:34:39,946 INFO L83 FinitePrefix]: Finished finitePrefix Result has 320 conditions, 147 events. 81/147 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 401 event pairs, 24 based on Foata normal form. 1/114 useless extension candidates. Maximal degree in co-relation 240. Up to 88 conditions per place. [2023-08-24 16:34:39,948 INFO L140 encePairwiseOnDemand]: 336/340 looper letters, 27 selfloop transitions, 3 changer transitions 1/31 dead transitions. [2023-08-24 16:34:39,948 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 24 places, 31 transitions, 145 flow [2023-08-24 16:34:39,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-24 16:34:39,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-24 16:34:39,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 461 transitions. [2023-08-24 16:34:39,959 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4519607843137255 [2023-08-24 16:34:39,959 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 461 transitions. [2023-08-24 16:34:39,959 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 461 transitions. [2023-08-24 16:34:39,961 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 16:34:39,962 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 461 transitions. [2023-08-24 16:34:39,965 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 153.66666666666666) internal successors, (461), 3 states have internal predecessors, (461), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 16:34:39,968 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 340.0) internal successors, (1360), 4 states have internal predecessors, (1360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 16:34:39,968 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 340.0) internal successors, (1360), 4 states have internal predecessors, (1360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 16:34:39,970 INFO L175 Difference]: Start difference. First operand has 22 places, 19 transitions, 50 flow. Second operand 3 states and 461 transitions. [2023-08-24 16:34:39,970 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 24 places, 31 transitions, 145 flow [2023-08-24 16:34:39,971 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 20 places, 31 transitions, 131 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-24 16:34:39,972 INFO L231 Difference]: Finished difference. Result has 21 places, 21 transitions, 61 flow [2023-08-24 16:34:39,973 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=340, PETRI_DIFFERENCE_MINUEND_FLOW=42, PETRI_DIFFERENCE_MINUEND_PLACES=18, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=61, PETRI_PLACES=21, PETRI_TRANSITIONS=21} [2023-08-24 16:34:39,976 INFO L281 CegarLoopForPetriNet]: 22 programPoint places, -1 predicate places. [2023-08-24 16:34:39,976 INFO L495 AbstractCegarLoop]: Abstraction has has 21 places, 21 transitions, 61 flow [2023-08-24 16:34:39,976 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 147.33333333333334) internal successors, (442), 3 states have internal predecessors, (442), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 16:34:39,976 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 16:34:39,977 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 16:34:39,977 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-24 16:34:39,977 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-24 16:34:39,977 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 16:34:39,977 INFO L85 PathProgramCache]: Analyzing trace with hash 1349241612, now seen corresponding path program 1 times [2023-08-24 16:34:39,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 16:34:39,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55053452] [2023-08-24 16:34:39,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 16:34:39,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 16:34:39,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 16:34:40,063 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 16:34:40,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 16:34:40,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55053452] [2023-08-24 16:34:40,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [55053452] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 16:34:40,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 16:34:40,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-24 16:34:40,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113383079] [2023-08-24 16:34:40,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 16:34:40,065 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-24 16:34:40,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 16:34:40,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-24 16:34:40,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-24 16:34:40,066 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 141 out of 340 [2023-08-24 16:34:40,067 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 21 places, 21 transitions, 61 flow. Second operand has 4 states, 4 states have (on average 144.75) internal successors, (579), 4 states have internal predecessors, (579), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 16:34:40,067 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 16:34:40,067 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 141 of 340 [2023-08-24 16:34:40,067 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 16:34:40,136 INFO L124 PetriNetUnfolderBase]: 96/184 cut-off events. [2023-08-24 16:34:40,136 INFO L125 PetriNetUnfolderBase]: For 13/13 co-relation queries the response was YES. [2023-08-24 16:34:40,137 INFO L83 FinitePrefix]: Finished finitePrefix Result has 438 conditions, 184 events. 96/184 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 600 event pairs, 13 based on Foata normal form. 0/148 useless extension candidates. Maximal degree in co-relation 118. Up to 53 conditions per place. [2023-08-24 16:34:40,137 INFO L140 encePairwiseOnDemand]: 333/340 looper letters, 39 selfloop transitions, 9 changer transitions 1/49 dead transitions. [2023-08-24 16:34:40,137 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 25 places, 49 transitions, 228 flow [2023-08-24 16:34:40,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-24 16:34:40,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-24 16:34:40,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 755 transitions. [2023-08-24 16:34:40,140 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4441176470588235 [2023-08-24 16:34:40,140 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 755 transitions. [2023-08-24 16:34:40,140 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 755 transitions. [2023-08-24 16:34:40,141 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 16:34:40,141 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 755 transitions. [2023-08-24 16:34:40,142 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 151.0) internal successors, (755), 5 states have internal predecessors, (755), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 16:34:40,144 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 340.0) internal successors, (2040), 6 states have internal predecessors, (2040), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 16:34:40,145 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 340.0) internal successors, (2040), 6 states have internal predecessors, (2040), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 16:34:40,145 INFO L175 Difference]: Start difference. First operand has 21 places, 21 transitions, 61 flow. Second operand 5 states and 755 transitions. [2023-08-24 16:34:40,145 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 25 places, 49 transitions, 228 flow [2023-08-24 16:34:40,146 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 24 places, 49 transitions, 225 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-24 16:34:40,146 INFO L231 Difference]: Finished difference. Result has 28 places, 26 transitions, 118 flow [2023-08-24 16:34:40,146 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=340, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=20, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=118, PETRI_PLACES=28, PETRI_TRANSITIONS=26} [2023-08-24 16:34:40,147 INFO L281 CegarLoopForPetriNet]: 22 programPoint places, 6 predicate places. [2023-08-24 16:34:40,147 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 26 transitions, 118 flow [2023-08-24 16:34:40,147 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 144.75) internal successors, (579), 4 states have internal predecessors, (579), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 16:34:40,148 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 16:34:40,148 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 16:34:40,148 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-24 16:34:40,148 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-24 16:34:40,148 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 16:34:40,148 INFO L85 PathProgramCache]: Analyzing trace with hash 1770384088, now seen corresponding path program 2 times [2023-08-24 16:34:40,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 16:34:40,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058897955] [2023-08-24 16:34:40,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 16:34:40,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 16:34:40,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 16:34:40,224 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 16:34:40,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 16:34:40,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058897955] [2023-08-24 16:34:40,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2058897955] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 16:34:40,225 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 16:34:40,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-24 16:34:40,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759787490] [2023-08-24 16:34:40,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 16:34:40,226 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-24 16:34:40,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 16:34:40,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-24 16:34:40,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-24 16:34:40,227 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 141 out of 340 [2023-08-24 16:34:40,228 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 26 transitions, 118 flow. Second operand has 4 states, 4 states have (on average 144.75) internal successors, (579), 4 states have internal predecessors, (579), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 16:34:40,228 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 16:34:40,228 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 141 of 340 [2023-08-24 16:34:40,228 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 16:34:40,308 INFO L124 PetriNetUnfolderBase]: 90/166 cut-off events. [2023-08-24 16:34:40,309 INFO L125 PetriNetUnfolderBase]: For 173/173 co-relation queries the response was YES. [2023-08-24 16:34:40,309 INFO L83 FinitePrefix]: Finished finitePrefix Result has 558 conditions, 166 events. 90/166 cut-off events. For 173/173 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 513 event pairs, 7 based on Foata normal form. 2/166 useless extension candidates. Maximal degree in co-relation 233. Up to 112 conditions per place. [2023-08-24 16:34:40,310 INFO L140 encePairwiseOnDemand]: 334/340 looper letters, 34 selfloop transitions, 5 changer transitions 4/43 dead transitions. [2023-08-24 16:34:40,310 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 43 transitions, 270 flow [2023-08-24 16:34:40,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-24 16:34:40,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-24 16:34:40,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 603 transitions. [2023-08-24 16:34:40,312 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44338235294117645 [2023-08-24 16:34:40,313 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 603 transitions. [2023-08-24 16:34:40,313 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 603 transitions. [2023-08-24 16:34:40,313 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 16:34:40,313 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 603 transitions. [2023-08-24 16:34:40,314 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 150.75) internal successors, (603), 4 states have internal predecessors, (603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 16:34:40,315 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 340.0) internal successors, (1700), 5 states have internal predecessors, (1700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 16:34:40,316 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 340.0) internal successors, (1700), 5 states have internal predecessors, (1700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 16:34:40,316 INFO L175 Difference]: Start difference. First operand has 28 places, 26 transitions, 118 flow. Second operand 4 states and 603 transitions. [2023-08-24 16:34:40,316 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 43 transitions, 270 flow [2023-08-24 16:34:40,318 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 43 transitions, 270 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-24 16:34:40,318 INFO L231 Difference]: Finished difference. Result has 33 places, 28 transitions, 152 flow [2023-08-24 16:34:40,318 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=340, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=152, PETRI_PLACES=33, PETRI_TRANSITIONS=28} [2023-08-24 16:34:40,319 INFO L281 CegarLoopForPetriNet]: 22 programPoint places, 11 predicate places. [2023-08-24 16:34:40,321 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 28 transitions, 152 flow [2023-08-24 16:34:40,322 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 144.75) internal successors, (579), 4 states have internal predecessors, (579), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 16:34:40,322 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 16:34:40,322 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 16:34:40,322 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-24 16:34:40,322 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-24 16:34:40,323 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 16:34:40,323 INFO L85 PathProgramCache]: Analyzing trace with hash -338241371, now seen corresponding path program 1 times [2023-08-24 16:34:40,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 16:34:40,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907413823] [2023-08-24 16:34:40,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 16:34:40,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 16:34:40,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 16:34:40,395 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 16:34:40,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 16:34:40,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907413823] [2023-08-24 16:34:40,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [907413823] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 16:34:40,397 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 16:34:40,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-24 16:34:40,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354342279] [2023-08-24 16:34:40,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 16:34:40,398 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-24 16:34:40,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 16:34:40,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-24 16:34:40,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-24 16:34:40,400 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 141 out of 340 [2023-08-24 16:34:40,401 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 28 transitions, 152 flow. Second operand has 4 states, 4 states have (on average 144.75) internal successors, (579), 4 states have internal predecessors, (579), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 16:34:40,401 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 16:34:40,401 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 141 of 340 [2023-08-24 16:34:40,401 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 16:34:40,475 INFO L124 PetriNetUnfolderBase]: 104/200 cut-off events. [2023-08-24 16:34:40,475 INFO L125 PetriNetUnfolderBase]: For 249/249 co-relation queries the response was YES. [2023-08-24 16:34:40,477 INFO L83 FinitePrefix]: Finished finitePrefix Result has 735 conditions, 200 events. 104/200 cut-off events. For 249/249 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 655 event pairs, 12 based on Foata normal form. 8/206 useless extension candidates. Maximal degree in co-relation 235. Up to 82 conditions per place. [2023-08-24 16:34:40,479 INFO L140 encePairwiseOnDemand]: 333/340 looper letters, 43 selfloop transitions, 10 changer transitions 2/55 dead transitions. [2023-08-24 16:34:40,479 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 55 transitions, 362 flow [2023-08-24 16:34:40,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-24 16:34:40,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-24 16:34:40,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 756 transitions. [2023-08-24 16:34:40,481 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4447058823529412 [2023-08-24 16:34:40,481 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 756 transitions. [2023-08-24 16:34:40,481 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 756 transitions. [2023-08-24 16:34:40,482 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 16:34:40,482 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 756 transitions. [2023-08-24 16:34:40,483 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 151.2) internal successors, (756), 5 states have internal predecessors, (756), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 16:34:40,485 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 340.0) internal successors, (2040), 6 states have internal predecessors, (2040), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 16:34:40,486 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 340.0) internal successors, (2040), 6 states have internal predecessors, (2040), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 16:34:40,486 INFO L175 Difference]: Start difference. First operand has 33 places, 28 transitions, 152 flow. Second operand 5 states and 756 transitions. [2023-08-24 16:34:40,486 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 55 transitions, 362 flow [2023-08-24 16:34:40,491 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 55 transitions, 348 flow, removed 2 selfloop flow, removed 3 redundant places. [2023-08-24 16:34:40,492 INFO L231 Difference]: Finished difference. Result has 37 places, 31 transitions, 203 flow [2023-08-24 16:34:40,492 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=340, PETRI_DIFFERENCE_MINUEND_FLOW=138, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=203, PETRI_PLACES=37, PETRI_TRANSITIONS=31} [2023-08-24 16:34:40,493 INFO L281 CegarLoopForPetriNet]: 22 programPoint places, 15 predicate places. [2023-08-24 16:34:40,493 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 31 transitions, 203 flow [2023-08-24 16:34:40,494 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 144.75) internal successors, (579), 4 states have internal predecessors, (579), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 16:34:40,494 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 16:34:40,494 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 16:34:40,494 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-24 16:34:40,494 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-24 16:34:40,494 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 16:34:40,495 INFO L85 PathProgramCache]: Analyzing trace with hash 1547485969, now seen corresponding path program 2 times [2023-08-24 16:34:40,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 16:34:40,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716213381] [2023-08-24 16:34:40,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 16:34:40,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 16:34:40,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 16:34:40,574 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 16:34:40,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 16:34:40,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716213381] [2023-08-24 16:34:40,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [716213381] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 16:34:40,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 16:34:40,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-24 16:34:40,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084035651] [2023-08-24 16:34:40,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 16:34:40,575 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-24 16:34:40,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 16:34:40,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-24 16:34:40,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-24 16:34:40,576 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 141 out of 340 [2023-08-24 16:34:40,577 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 31 transitions, 203 flow. Second operand has 4 states, 4 states have (on average 144.75) internal successors, (579), 4 states have internal predecessors, (579), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 16:34:40,577 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 16:34:40,577 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 141 of 340 [2023-08-24 16:34:40,577 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 16:34:40,639 INFO L124 PetriNetUnfolderBase]: 89/169 cut-off events. [2023-08-24 16:34:40,639 INFO L125 PetriNetUnfolderBase]: For 386/386 co-relation queries the response was YES. [2023-08-24 16:34:40,640 INFO L83 FinitePrefix]: Finished finitePrefix Result has 716 conditions, 169 events. 89/169 cut-off events. For 386/386 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 506 event pairs, 11 based on Foata normal form. 4/171 useless extension candidates. Maximal degree in co-relation 245. Up to 97 conditions per place. [2023-08-24 16:34:40,640 INFO L140 encePairwiseOnDemand]: 333/340 looper letters, 34 selfloop transitions, 9 changer transitions 7/50 dead transitions. [2023-08-24 16:34:40,640 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 50 transitions, 382 flow [2023-08-24 16:34:40,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-24 16:34:40,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-24 16:34:40,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 747 transitions. [2023-08-24 16:34:40,642 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43941176470588234 [2023-08-24 16:34:40,642 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 747 transitions. [2023-08-24 16:34:40,642 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 747 transitions. [2023-08-24 16:34:40,643 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 16:34:40,643 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 747 transitions. [2023-08-24 16:34:40,644 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 149.4) internal successors, (747), 5 states have internal predecessors, (747), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 16:34:40,646 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 340.0) internal successors, (2040), 6 states have internal predecessors, (2040), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 16:34:40,646 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 340.0) internal successors, (2040), 6 states have internal predecessors, (2040), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 16:34:40,646 INFO L175 Difference]: Start difference. First operand has 37 places, 31 transitions, 203 flow. Second operand 5 states and 747 transitions. [2023-08-24 16:34:40,646 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 50 transitions, 382 flow [2023-08-24 16:34:40,647 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 50 transitions, 375 flow, removed 2 selfloop flow, removed 1 redundant places. [2023-08-24 16:34:40,648 INFO L231 Difference]: Finished difference. Result has 42 places, 33 transitions, 245 flow [2023-08-24 16:34:40,648 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=340, PETRI_DIFFERENCE_MINUEND_FLOW=184, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=245, PETRI_PLACES=42, PETRI_TRANSITIONS=33} [2023-08-24 16:34:40,649 INFO L281 CegarLoopForPetriNet]: 22 programPoint places, 20 predicate places. [2023-08-24 16:34:40,649 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 33 transitions, 245 flow [2023-08-24 16:34:40,649 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 144.75) internal successors, (579), 4 states have internal predecessors, (579), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 16:34:40,649 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 16:34:40,649 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 16:34:40,649 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-24 16:34:40,649 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-24 16:34:40,650 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 16:34:40,650 INFO L85 PathProgramCache]: Analyzing trace with hash 854332043, now seen corresponding path program 1 times [2023-08-24 16:34:40,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 16:34:40,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322480190] [2023-08-24 16:34:40,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 16:34:40,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 16:34:40,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 16:34:40,709 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 16:34:40,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 16:34:40,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322480190] [2023-08-24 16:34:40,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1322480190] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 16:34:40,710 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 16:34:40,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-24 16:34:40,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958123082] [2023-08-24 16:34:40,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 16:34:40,710 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-24 16:34:40,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 16:34:40,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-24 16:34:40,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-24 16:34:40,712 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 340 [2023-08-24 16:34:40,712 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 33 transitions, 245 flow. Second operand has 4 states, 4 states have (on average 131.25) internal successors, (525), 4 states have internal predecessors, (525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 16:34:40,712 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 16:34:40,712 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 340 [2023-08-24 16:34:40,712 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 16:34:40,764 INFO L124 PetriNetUnfolderBase]: 88/169 cut-off events. [2023-08-24 16:34:40,764 INFO L125 PetriNetUnfolderBase]: For 571/571 co-relation queries the response was YES. [2023-08-24 16:34:40,764 INFO L83 FinitePrefix]: Finished finitePrefix Result has 759 conditions, 169 events. 88/169 cut-off events. For 571/571 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 428 event pairs, 46 based on Foata normal form. 8/172 useless extension candidates. Maximal degree in co-relation 529. Up to 153 conditions per place. [2023-08-24 16:34:40,765 INFO L140 encePairwiseOnDemand]: 333/340 looper letters, 32 selfloop transitions, 2 changer transitions 10/44 dead transitions. [2023-08-24 16:34:40,765 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 44 transitions, 363 flow [2023-08-24 16:34:40,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-24 16:34:40,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-24 16:34:40,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 667 transitions. [2023-08-24 16:34:40,766 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39235294117647057 [2023-08-24 16:34:40,766 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 667 transitions. [2023-08-24 16:34:40,767 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 667 transitions. [2023-08-24 16:34:40,767 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 16:34:40,767 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 667 transitions. [2023-08-24 16:34:40,768 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 133.4) internal successors, (667), 5 states have internal predecessors, (667), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 16:34:40,769 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 340.0) internal successors, (2040), 6 states have internal predecessors, (2040), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 16:34:40,770 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 340.0) internal successors, (2040), 6 states have internal predecessors, (2040), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 16:34:40,770 INFO L175 Difference]: Start difference. First operand has 42 places, 33 transitions, 245 flow. Second operand 5 states and 667 transitions. [2023-08-24 16:34:40,770 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 44 transitions, 363 flow [2023-08-24 16:34:40,771 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 44 transitions, 348 flow, removed 6 selfloop flow, removed 1 redundant places. [2023-08-24 16:34:40,772 INFO L231 Difference]: Finished difference. Result has 47 places, 34 transitions, 252 flow [2023-08-24 16:34:40,772 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=340, PETRI_DIFFERENCE_MINUEND_FLOW=230, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=252, PETRI_PLACES=47, PETRI_TRANSITIONS=34} [2023-08-24 16:34:40,773 INFO L281 CegarLoopForPetriNet]: 22 programPoint places, 25 predicate places. [2023-08-24 16:34:40,773 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 34 transitions, 252 flow [2023-08-24 16:34:40,773 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 131.25) internal successors, (525), 4 states have internal predecessors, (525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 16:34:40,773 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 16:34:40,773 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 16:34:40,773 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-24 16:34:40,773 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-24 16:34:40,774 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 16:34:40,774 INFO L85 PathProgramCache]: Analyzing trace with hash 923556379, now seen corresponding path program 1 times [2023-08-24 16:34:40,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 16:34:40,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819486483] [2023-08-24 16:34:40,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 16:34:40,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 16:34:40,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 16:34:40,832 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-24 16:34:40,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 16:34:40,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819486483] [2023-08-24 16:34:40,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1819486483] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 16:34:40,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 16:34:40,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-24 16:34:40,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463327715] [2023-08-24 16:34:40,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 16:34:40,833 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-24 16:34:40,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 16:34:40,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-24 16:34:40,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-24 16:34:40,834 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 340 [2023-08-24 16:34:40,834 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 34 transitions, 252 flow. Second operand has 4 states, 4 states have (on average 131.5) internal successors, (526), 4 states have internal predecessors, (526), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 16:34:40,834 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 16:34:40,834 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 340 [2023-08-24 16:34:40,834 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 16:34:40,885 INFO L124 PetriNetUnfolderBase]: 84/162 cut-off events. [2023-08-24 16:34:40,885 INFO L125 PetriNetUnfolderBase]: For 539/539 co-relation queries the response was YES. [2023-08-24 16:34:40,886 INFO L83 FinitePrefix]: Finished finitePrefix Result has 759 conditions, 162 events. 84/162 cut-off events. For 539/539 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 410 event pairs, 44 based on Foata normal form. 8/167 useless extension candidates. Maximal degree in co-relation 730. Up to 154 conditions per place. [2023-08-24 16:34:40,886 INFO L140 encePairwiseOnDemand]: 335/340 looper letters, 33 selfloop transitions, 2 changer transitions 6/41 dead transitions. [2023-08-24 16:34:40,887 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 41 transitions, 362 flow [2023-08-24 16:34:40,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-24 16:34:40,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-24 16:34:40,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 536 transitions. [2023-08-24 16:34:40,888 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3941176470588235 [2023-08-24 16:34:40,888 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 536 transitions. [2023-08-24 16:34:40,888 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 536 transitions. [2023-08-24 16:34:40,888 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 16:34:40,888 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 536 transitions. [2023-08-24 16:34:40,889 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 134.0) internal successors, (536), 4 states have internal predecessors, (536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 16:34:40,890 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 340.0) internal successors, (1700), 5 states have internal predecessors, (1700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 16:34:40,891 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 340.0) internal successors, (1700), 5 states have internal predecessors, (1700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 16:34:40,891 INFO L175 Difference]: Start difference. First operand has 47 places, 34 transitions, 252 flow. Second operand 4 states and 536 transitions. [2023-08-24 16:34:40,891 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 41 transitions, 362 flow [2023-08-24 16:34:40,892 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 41 transitions, 346 flow, removed 7 selfloop flow, removed 2 redundant places. [2023-08-24 16:34:40,893 INFO L231 Difference]: Finished difference. Result has 48 places, 35 transitions, 260 flow [2023-08-24 16:34:40,893 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=340, PETRI_DIFFERENCE_MINUEND_FLOW=242, PETRI_DIFFERENCE_MINUEND_PLACES=43, 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=4, PETRI_FLOW=260, PETRI_PLACES=48, PETRI_TRANSITIONS=35} [2023-08-24 16:34:40,893 INFO L281 CegarLoopForPetriNet]: 22 programPoint places, 26 predicate places. [2023-08-24 16:34:40,894 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 35 transitions, 260 flow [2023-08-24 16:34:40,894 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 131.5) internal successors, (526), 4 states have internal predecessors, (526), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 16:34:40,894 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 16:34:40,894 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 16:34:40,894 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-24 16:34:40,894 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-24 16:34:40,894 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 16:34:40,895 INFO L85 PathProgramCache]: Analyzing trace with hash -611597168, now seen corresponding path program 1 times [2023-08-24 16:34:40,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 16:34:40,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526581929] [2023-08-24 16:34:40,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 16:34:40,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 16:34:40,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 16:34:40,965 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-24 16:34:40,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 16:34:40,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526581929] [2023-08-24 16:34:40,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1526581929] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 16:34:40,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 16:34:40,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-24 16:34:40,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419449152] [2023-08-24 16:34:40,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 16:34:40,966 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-24 16:34:40,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 16:34:40,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-24 16:34:40,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-24 16:34:40,967 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 150 out of 340 [2023-08-24 16:34:40,967 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 35 transitions, 260 flow. Second operand has 3 states, 3 states have (on average 156.33333333333334) internal successors, (469), 3 states have internal predecessors, (469), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 16:34:40,967 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 16:34:40,967 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 150 of 340 [2023-08-24 16:34:40,967 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 16:34:40,997 INFO L124 PetriNetUnfolderBase]: 62/119 cut-off events. [2023-08-24 16:34:40,997 INFO L125 PetriNetUnfolderBase]: For 418/418 co-relation queries the response was YES. [2023-08-24 16:34:40,998 INFO L83 FinitePrefix]: Finished finitePrefix Result has 572 conditions, 119 events. 62/119 cut-off events. For 418/418 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 254 event pairs, 5 based on Foata normal form. 4/122 useless extension candidates. Maximal degree in co-relation 537. Up to 102 conditions per place. [2023-08-24 16:34:40,998 INFO L140 encePairwiseOnDemand]: 337/340 looper letters, 33 selfloop transitions, 3 changer transitions 0/36 dead transitions. [2023-08-24 16:34:40,998 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 36 transitions, 334 flow [2023-08-24 16:34:40,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-24 16:34:40,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-24 16:34:40,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 473 transitions. [2023-08-24 16:34:40,999 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46372549019607845 [2023-08-24 16:34:41,000 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 473 transitions. [2023-08-24 16:34:41,000 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 473 transitions. [2023-08-24 16:34:41,000 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 16:34:41,000 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 473 transitions. [2023-08-24 16:34:41,001 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 157.66666666666666) internal successors, (473), 3 states have internal predecessors, (473), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 16:34:41,002 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 340.0) internal successors, (1360), 4 states have internal predecessors, (1360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 16:34:41,002 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 340.0) internal successors, (1360), 4 states have internal predecessors, (1360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 16:34:41,002 INFO L175 Difference]: Start difference. First operand has 48 places, 35 transitions, 260 flow. Second operand 3 states and 473 transitions. [2023-08-24 16:34:41,002 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 36 transitions, 334 flow [2023-08-24 16:34:41,004 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 36 transitions, 324 flow, removed 4 selfloop flow, removed 1 redundant places. [2023-08-24 16:34:41,004 INFO L231 Difference]: Finished difference. Result has 49 places, 35 transitions, 261 flow [2023-08-24 16:34:41,004 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=340, PETRI_DIFFERENCE_MINUEND_FLOW=250, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=261, PETRI_PLACES=49, PETRI_TRANSITIONS=35} [2023-08-24 16:34:41,005 INFO L281 CegarLoopForPetriNet]: 22 programPoint places, 27 predicate places. [2023-08-24 16:34:41,005 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 35 transitions, 261 flow [2023-08-24 16:34:41,005 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 156.33333333333334) internal successors, (469), 3 states have internal predecessors, (469), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 16:34:41,005 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 16:34:41,005 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 16:34:41,005 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-24 16:34:41,005 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-24 16:34:41,005 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 16:34:41,006 INFO L85 PathProgramCache]: Analyzing trace with hash 1156671294, now seen corresponding path program 2 times [2023-08-24 16:34:41,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 16:34:41,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272851642] [2023-08-24 16:34:41,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 16:34:41,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 16:34:41,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 16:34:42,553 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 16:34:42,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 16:34:42,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272851642] [2023-08-24 16:34:42,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1272851642] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 16:34:42,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1286265540] [2023-08-24 16:34:42,554 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-24 16:34:42,554 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 16:34:42,554 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 16:34:42,556 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-24 16:34:42,562 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-08-24 16:34:42,652 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-24 16:34:42,653 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-24 16:34:42,655 INFO L262 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 42 conjunts are in the unsatisfiable core [2023-08-24 16:34:42,659 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 16:34:42,984 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-24 16:34:42,984 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 16:34:43,297 INFO L322 Elim1Store]: treesize reduction 22, result has 89.8 percent of original size [2023-08-24 16:34:43,298 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 80 treesize of output 216 [2023-08-24 16:34:44,285 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-24 16:34:44,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1286265540] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 16:34:44,286 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 16:34:44,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 7] total 23 [2023-08-24 16:34:44,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267492926] [2023-08-24 16:34:44,286 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 16:34:44,286 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-08-24 16:34:44,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 16:34:44,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-08-24 16:34:44,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=526, Unknown=0, NotChecked=0, Total=600 [2023-08-24 16:34:44,295 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 340 [2023-08-24 16:34:44,296 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 35 transitions, 261 flow. Second operand has 25 states, 25 states have (on average 85.08) internal successors, (2127), 25 states have internal predecessors, (2127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 16:34:44,296 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 16:34:44,296 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 340 [2023-08-24 16:34:44,296 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 16:34:46,985 INFO L124 PetriNetUnfolderBase]: 394/729 cut-off events. [2023-08-24 16:34:46,985 INFO L125 PetriNetUnfolderBase]: For 2473/2473 co-relation queries the response was YES. [2023-08-24 16:34:46,989 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3430 conditions, 729 events. 394/729 cut-off events. For 2473/2473 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 3336 event pairs, 23 based on Foata normal form. 5/731 useless extension candidates. Maximal degree in co-relation 2781. Up to 209 conditions per place. [2023-08-24 16:34:46,992 INFO L140 encePairwiseOnDemand]: 329/340 looper letters, 142 selfloop transitions, 113 changer transitions 3/258 dead transitions. [2023-08-24 16:34:46,992 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 258 transitions, 2417 flow [2023-08-24 16:34:46,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2023-08-24 16:34:46,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2023-08-24 16:34:47,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 3519 transitions. [2023-08-24 16:34:47,002 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.25875 [2023-08-24 16:34:47,003 INFO L72 ComplementDD]: Start complementDD. Operand 40 states and 3519 transitions. [2023-08-24 16:34:47,003 INFO L73 IsDeterministic]: Start isDeterministic. Operand 40 states and 3519 transitions. [2023-08-24 16:34:47,004 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 16:34:47,004 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 40 states and 3519 transitions. [2023-08-24 16:34:47,010 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 41 states, 40 states have (on average 87.975) internal successors, (3519), 40 states have internal predecessors, (3519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 16:34:47,024 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 41 states, 41 states have (on average 340.0) internal successors, (13940), 41 states have internal predecessors, (13940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 16:34:47,026 INFO L81 ComplementDD]: Finished complementDD. Result has 41 states, 41 states have (on average 340.0) internal successors, (13940), 41 states have internal predecessors, (13940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 16:34:47,026 INFO L175 Difference]: Start difference. First operand has 49 places, 35 transitions, 261 flow. Second operand 40 states and 3519 transitions. [2023-08-24 16:34:47,026 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 258 transitions, 2417 flow [2023-08-24 16:34:47,031 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 258 transitions, 2340 flow, removed 10 selfloop flow, removed 3 redundant places. [2023-08-24 16:34:47,039 INFO L231 Difference]: Finished difference. Result has 95 places, 155 transitions, 1646 flow [2023-08-24 16:34:47,039 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=340, PETRI_DIFFERENCE_MINUEND_FLOW=249, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=11, PETRI_DIFFERENCE_SUBTRAHEND_STATES=40, PETRI_FLOW=1646, PETRI_PLACES=95, PETRI_TRANSITIONS=155} [2023-08-24 16:34:47,040 INFO L281 CegarLoopForPetriNet]: 22 programPoint places, 73 predicate places. [2023-08-24 16:34:47,040 INFO L495 AbstractCegarLoop]: Abstraction has has 95 places, 155 transitions, 1646 flow [2023-08-24 16:34:47,041 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 85.08) internal successors, (2127), 25 states have internal predecessors, (2127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 16:34:47,041 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 16:34:47,041 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 16:34:47,065 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-08-24 16:34:47,247 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 16:34:47,247 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-24 16:34:47,247 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 16:34:47,247 INFO L85 PathProgramCache]: Analyzing trace with hash -1608765606, now seen corresponding path program 3 times [2023-08-24 16:34:47,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 16:34:47,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338125025] [2023-08-24 16:34:47,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 16:34:47,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 16:34:47,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 16:34:48,120 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 16:34:48,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 16:34:48,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338125025] [2023-08-24 16:34:48,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1338125025] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 16:34:48,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1035862530] [2023-08-24 16:34:48,120 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-24 16:34:48,120 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 16:34:48,120 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 16:34:48,121 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-24 16:34:48,123 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-08-24 16:34:48,279 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-08-24 16:34:48,279 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-24 16:34:48,280 INFO L262 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 56 conjunts are in the unsatisfiable core [2023-08-24 16:34:48,282 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 16:34:48,367 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-08-24 16:34:48,444 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-08-24 16:34:48,505 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-08-24 16:34:48,706 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-24 16:34:48,706 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 16:34:49,304 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 16:34:49,304 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 147 treesize of output 99 [2023-08-24 16:34:49,366 INFO L322 Elim1Store]: treesize reduction 4, result has 95.7 percent of original size [2023-08-24 16:34:49,366 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 1257 treesize of output 1177 [2023-08-24 16:34:49,416 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 16:34:49,416 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 529 treesize of output 543 [2023-08-24 16:34:49,461 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 16:34:49,462 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 474 treesize of output 422 [2023-08-24 16:35:08,987 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 16:35:08,988 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 121 treesize of output 85 [2023-08-24 16:35:09,012 INFO L322 Elim1Store]: treesize reduction 69, result has 25.8 percent of original size [2023-08-24 16:35:09,012 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 455 treesize of output 430 [2023-08-24 16:35:09,025 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-24 16:35:09,027 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-24 16:35:09,031 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 16:35:09,032 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 192 treesize of output 184 [2023-08-24 16:35:09,039 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-24 16:35:09,041 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-24 16:35:09,045 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 16:35:09,046 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 206 treesize of output 174 [2023-08-24 16:35:09,374 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-24 16:35:09,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1035862530] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 16:35:09,374 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 16:35:09,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 29 [2023-08-24 16:35:09,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193328642] [2023-08-24 16:35:09,375 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 16:35:09,375 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2023-08-24 16:35:09,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 16:35:09,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2023-08-24 16:35:09,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=811, Unknown=2, NotChecked=0, Total=930 [2023-08-24 16:35:09,378 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 340 [2023-08-24 16:35:09,395 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 155 transitions, 1646 flow. Second operand has 31 states, 31 states have (on average 82.6774193548387) internal successors, (2563), 31 states have internal predecessors, (2563), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 16:35:09,395 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 16:35:09,395 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 340 [2023-08-24 16:35:09,395 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 16:35:18,259 WARN L234 SmtUtils]: Spent 8.22s on a formula simplification. DAG size of input: 100 DAG size of output: 87 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-24 16:35:20,552 INFO L124 PetriNetUnfolderBase]: 634/1161 cut-off events. [2023-08-24 16:35:20,552 INFO L125 PetriNetUnfolderBase]: For 4473/4473 co-relation queries the response was YES. [2023-08-24 16:35:20,556 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6132 conditions, 1161 events. 634/1161 cut-off events. For 4473/4473 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 6079 event pairs, 16 based on Foata normal form. 4/1164 useless extension candidates. Maximal degree in co-relation 5547. Up to 563 conditions per place. [2023-08-24 16:35:20,560 INFO L140 encePairwiseOnDemand]: 327/340 looper letters, 149 selfloop transitions, 187 changer transitions 5/341 dead transitions. [2023-08-24 16:35:20,561 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 341 transitions, 3769 flow [2023-08-24 16:35:20,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2023-08-24 16:35:20,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2023-08-24 16:35:20,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 3251 transitions. [2023-08-24 16:35:20,568 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.251625386996904 [2023-08-24 16:35:20,568 INFO L72 ComplementDD]: Start complementDD. Operand 38 states and 3251 transitions. [2023-08-24 16:35:20,568 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 3251 transitions. [2023-08-24 16:35:20,569 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 16:35:20,569 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 38 states and 3251 transitions. [2023-08-24 16:35:20,574 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 39 states, 38 states have (on average 85.55263157894737) internal successors, (3251), 38 states have internal predecessors, (3251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 16:35:20,584 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 39 states, 39 states have (on average 340.0) internal successors, (13260), 39 states have internal predecessors, (13260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 16:35:20,586 INFO L81 ComplementDD]: Finished complementDD. Result has 39 states, 39 states have (on average 340.0) internal successors, (13260), 39 states have internal predecessors, (13260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 16:35:20,586 INFO L175 Difference]: Start difference. First operand has 95 places, 155 transitions, 1646 flow. Second operand 38 states and 3251 transitions. [2023-08-24 16:35:20,586 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 341 transitions, 3769 flow [2023-08-24 16:35:20,600 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 341 transitions, 3379 flow, removed 185 selfloop flow, removed 4 redundant places. [2023-08-24 16:35:20,605 INFO L231 Difference]: Finished difference. Result has 137 places, 261 transitions, 2983 flow [2023-08-24 16:35:20,606 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=340, PETRI_DIFFERENCE_MINUEND_FLOW=1406, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=155, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=97, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=38, PETRI_FLOW=2983, PETRI_PLACES=137, PETRI_TRANSITIONS=261} [2023-08-24 16:35:20,606 INFO L281 CegarLoopForPetriNet]: 22 programPoint places, 115 predicate places. [2023-08-24 16:35:20,606 INFO L495 AbstractCegarLoop]: Abstraction has has 137 places, 261 transitions, 2983 flow [2023-08-24 16:35:20,607 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 82.6774193548387) internal successors, (2563), 31 states have internal predecessors, (2563), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 16:35:20,607 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 16:35:20,607 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 16:35:20,627 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-08-24 16:35:20,812 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,SelfDestructingSolverStorable9 [2023-08-24 16:35:20,812 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-24 16:35:20,812 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 16:35:20,812 INFO L85 PathProgramCache]: Analyzing trace with hash 948166696, now seen corresponding path program 4 times [2023-08-24 16:35:20,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 16:35:20,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986746530] [2023-08-24 16:35:20,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 16:35:20,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 16:35:20,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 16:35:22,000 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 16:35:22,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 16:35:22,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [986746530] [2023-08-24 16:35:22,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [986746530] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 16:35:22,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1271466759] [2023-08-24 16:35:22,001 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-08-24 16:35:22,001 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 16:35:22,001 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 16:35:22,002 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-24 16:35:22,004 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-08-24 16:35:22,085 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-08-24 16:35:22,086 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-24 16:35:22,087 INFO L262 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 58 conjunts are in the unsatisfiable core [2023-08-24 16:35:22,089 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 16:35:22,315 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-24 16:35:22,316 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-08-24 16:35:22,539 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-24 16:35:22,539 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-24 16:35:22,545 INFO L322 Elim1Store]: treesize reduction 8, result has 60.0 percent of original size [2023-08-24 16:35:22,545 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 28 [2023-08-24 16:35:22,598 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 16:35:22,598 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 16:35:23,379 INFO L322 Elim1Store]: treesize reduction 22, result has 92.8 percent of original size [2023-08-24 16:35:23,379 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 215 treesize of output 443 [2023-08-24 16:35:23,417 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 16:35:23,417 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 155 treesize of output 178 [2023-08-24 16:35:23,450 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 16:35:23,450 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 137 treesize of output 160 [2023-08-24 16:36:00,764 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 16:36:00,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1271466759] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 16:36:00,765 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 16:36:00,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 34 [2023-08-24 16:36:00,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108124670] [2023-08-24 16:36:00,765 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 16:36:00,766 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2023-08-24 16:36:00,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 16:36:00,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2023-08-24 16:36:00,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=1138, Unknown=4, NotChecked=0, Total=1260 [2023-08-24 16:36:00,770 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 340 [2023-08-24 16:36:00,781 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 261 transitions, 2983 flow. Second operand has 36 states, 36 states have (on average 82.36111111111111) internal successors, (2965), 36 states have internal predecessors, (2965), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 16:36:00,781 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 16:36:00,781 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 340 [2023-08-24 16:36:00,781 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 16:36:08,677 INFO L124 PetriNetUnfolderBase]: 973/1814 cut-off events. [2023-08-24 16:36:08,677 INFO L125 PetriNetUnfolderBase]: For 8303/8303 co-relation queries the response was YES. [2023-08-24 16:36:08,684 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10389 conditions, 1814 events. 973/1814 cut-off events. For 8303/8303 co-relation queries the response was YES. Maximal size of possible extension queue 159. Compared 10767 event pairs, 42 based on Foata normal form. 3/1817 useless extension candidates. Maximal degree in co-relation 9651. Up to 647 conditions per place. [2023-08-24 16:36:08,694 INFO L140 encePairwiseOnDemand]: 327/340 looper letters, 168 selfloop transitions, 337 changer transitions 14/519 dead transitions. [2023-08-24 16:36:08,694 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 519 transitions, 6360 flow [2023-08-24 16:36:08,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2023-08-24 16:36:08,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2023-08-24 16:36:08,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 4259 transitions. [2023-08-24 16:36:08,700 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2505294117647059 [2023-08-24 16:36:08,700 INFO L72 ComplementDD]: Start complementDD. Operand 50 states and 4259 transitions. [2023-08-24 16:36:08,700 INFO L73 IsDeterministic]: Start isDeterministic. Operand 50 states and 4259 transitions. [2023-08-24 16:36:08,701 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 16:36:08,701 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 50 states and 4259 transitions. [2023-08-24 16:36:08,706 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 51 states, 50 states have (on average 85.18) internal successors, (4259), 50 states have internal predecessors, (4259), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 16:36:08,717 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 51 states, 51 states have (on average 340.0) internal successors, (17340), 51 states have internal predecessors, (17340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 16:36:08,719 INFO L81 ComplementDD]: Finished complementDD. Result has 51 states, 51 states have (on average 340.0) internal successors, (17340), 51 states have internal predecessors, (17340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 16:36:08,719 INFO L175 Difference]: Start difference. First operand has 137 places, 261 transitions, 2983 flow. Second operand 50 states and 4259 transitions. [2023-08-24 16:36:08,719 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 186 places, 519 transitions, 6360 flow [2023-08-24 16:36:08,774 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 177 places, 519 transitions, 6076 flow, removed 128 selfloop flow, removed 9 redundant places. [2023-08-24 16:36:08,780 INFO L231 Difference]: Finished difference. Result has 197 places, 423 transitions, 5902 flow [2023-08-24 16:36:08,780 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=340, PETRI_DIFFERENCE_MINUEND_FLOW=2784, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=261, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=198, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=50, PETRI_FLOW=5902, PETRI_PLACES=197, PETRI_TRANSITIONS=423} [2023-08-24 16:36:08,781 INFO L281 CegarLoopForPetriNet]: 22 programPoint places, 175 predicate places. [2023-08-24 16:36:08,781 INFO L495 AbstractCegarLoop]: Abstraction has has 197 places, 423 transitions, 5902 flow [2023-08-24 16:36:08,782 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 82.36111111111111) internal successors, (2965), 36 states have internal predecessors, (2965), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 16:36:08,782 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 16:36:08,782 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 16:36:08,809 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-08-24 16:36:08,987 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 16:36:08,988 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-24 16:36:08,988 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 16:36:08,988 INFO L85 PathProgramCache]: Analyzing trace with hash 539242676, now seen corresponding path program 5 times [2023-08-24 16:36:08,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 16:36:08,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088706192] [2023-08-24 16:36:08,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 16:36:08,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 16:36:09,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 16:36:09,086 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-24 16:36:09,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 16:36:09,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088706192] [2023-08-24 16:36:09,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1088706192] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 16:36:09,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 16:36:09,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-24 16:36:09,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560073257] [2023-08-24 16:36:09,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 16:36:09,087 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-24 16:36:09,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 16:36:09,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-24 16:36:09,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-24 16:36:09,088 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 150 out of 340 [2023-08-24 16:36:09,088 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 197 places, 423 transitions, 5902 flow. Second operand has 3 states, 3 states have (on average 156.33333333333334) internal successors, (469), 3 states have internal predecessors, (469), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 16:36:09,088 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 16:36:09,088 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 150 of 340 [2023-08-24 16:36:09,088 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 16:36:09,297 INFO L124 PetriNetUnfolderBase]: 789/1469 cut-off events. [2023-08-24 16:36:09,298 INFO L125 PetriNetUnfolderBase]: For 10858/10858 co-relation queries the response was YES. [2023-08-24 16:36:09,303 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9871 conditions, 1469 events. 789/1469 cut-off events. For 10858/10858 co-relation queries the response was YES. Maximal size of possible extension queue 145. Compared 8142 event pairs, 89 based on Foata normal form. 6/1475 useless extension candidates. Maximal degree in co-relation 9765. Up to 1404 conditions per place. [2023-08-24 16:36:09,310 INFO L140 encePairwiseOnDemand]: 337/340 looper letters, 334 selfloop transitions, 10 changer transitions 0/344 dead transitions. [2023-08-24 16:36:09,310 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 344 transitions, 5469 flow [2023-08-24 16:36:09,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-24 16:36:09,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-24 16:36:09,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 475 transitions. [2023-08-24 16:36:09,311 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46568627450980393 [2023-08-24 16:36:09,311 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 475 transitions. [2023-08-24 16:36:09,311 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 475 transitions. [2023-08-24 16:36:09,311 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 16:36:09,311 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 475 transitions. [2023-08-24 16:36:09,312 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 158.33333333333334) internal successors, (475), 3 states have internal predecessors, (475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 16:36:09,312 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 340.0) internal successors, (1360), 4 states have internal predecessors, (1360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 16:36:09,313 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 340.0) internal successors, (1360), 4 states have internal predecessors, (1360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 16:36:09,313 INFO L175 Difference]: Start difference. First operand has 197 places, 423 transitions, 5902 flow. Second operand 3 states and 475 transitions. [2023-08-24 16:36:09,313 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 185 places, 344 transitions, 5469 flow [2023-08-24 16:36:09,364 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 163 places, 344 transitions, 4959 flow, removed 103 selfloop flow, removed 22 redundant places. [2023-08-24 16:36:09,370 INFO L231 Difference]: Finished difference. Result has 164 places, 342 transitions, 4298 flow [2023-08-24 16:36:09,370 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=340, PETRI_DIFFERENCE_MINUEND_FLOW=4266, PETRI_DIFFERENCE_MINUEND_PLACES=161, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=342, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=332, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=4298, PETRI_PLACES=164, PETRI_TRANSITIONS=342} [2023-08-24 16:36:09,371 INFO L281 CegarLoopForPetriNet]: 22 programPoint places, 142 predicate places. [2023-08-24 16:36:09,371 INFO L495 AbstractCegarLoop]: Abstraction has has 164 places, 342 transitions, 4298 flow [2023-08-24 16:36:09,371 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 156.33333333333334) internal successors, (469), 3 states have internal predecessors, (469), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 16:36:09,371 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 16:36:09,371 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 16:36:09,371 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-24 16:36:09,371 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-24 16:36:09,371 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 16:36:09,371 INFO L85 PathProgramCache]: Analyzing trace with hash 526711720, now seen corresponding path program 6 times [2023-08-24 16:36:09,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 16:36:09,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831977668] [2023-08-24 16:36:09,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 16:36:09,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 16:36:09,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 16:36:10,423 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 16:36:10,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 16:36:10,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831977668] [2023-08-24 16:36:10,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1831977668] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 16:36:10,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1937595718] [2023-08-24 16:36:10,428 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-08-24 16:36:10,428 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 16:36:10,428 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 16:36:10,430 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-24 16:36:10,432 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-08-24 16:36:10,574 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2023-08-24 16:36:10,574 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-24 16:36:10,576 INFO L262 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 37 conjunts are in the unsatisfiable core [2023-08-24 16:36:10,577 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 16:36:10,759 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-24 16:36:10,759 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 16:36:10,995 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 16:36:10,996 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 91 treesize of output 263 [2023-08-24 16:36:14,652 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-24 16:36:14,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1937595718] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 16:36:14,653 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 16:36:14,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 6, 6] total 22 [2023-08-24 16:36:14,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632529978] [2023-08-24 16:36:14,656 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 16:36:14,656 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-08-24 16:36:14,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 16:36:14,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-08-24 16:36:14,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=486, Unknown=0, NotChecked=0, Total=552 [2023-08-24 16:36:14,658 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 340 [2023-08-24 16:36:14,659 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 342 transitions, 4298 flow. Second operand has 24 states, 24 states have (on average 81.20833333333333) internal successors, (1949), 24 states have internal predecessors, (1949), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 16:36:14,659 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 16:36:14,659 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 340 [2023-08-24 16:36:14,660 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 16:36:15,935 INFO L124 PetriNetUnfolderBase]: 912/1693 cut-off events. [2023-08-24 16:36:15,936 INFO L125 PetriNetUnfolderBase]: For 10075/10075 co-relation queries the response was YES. [2023-08-24 16:36:15,942 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10744 conditions, 1693 events. 912/1693 cut-off events. For 10075/10075 co-relation queries the response was YES. Maximal size of possible extension queue 164. Compared 9798 event pairs, 68 based on Foata normal form. 3/1696 useless extension candidates. Maximal degree in co-relation 10519. Up to 1136 conditions per place. [2023-08-24 16:36:15,949 INFO L140 encePairwiseOnDemand]: 327/340 looper letters, 209 selfloop transitions, 219 changer transitions 2/430 dead transitions. [2023-08-24 16:36:15,949 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 430 transitions, 5994 flow [2023-08-24 16:36:15,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-08-24 16:36:15,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2023-08-24 16:36:15,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 1841 transitions. [2023-08-24 16:36:15,953 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.24612299465240642 [2023-08-24 16:36:15,953 INFO L72 ComplementDD]: Start complementDD. Operand 22 states and 1841 transitions. [2023-08-24 16:36:15,953 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 1841 transitions. [2023-08-24 16:36:15,954 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 16:36:15,954 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 22 states and 1841 transitions. [2023-08-24 16:36:15,957 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 23 states, 22 states have (on average 83.68181818181819) internal successors, (1841), 22 states have internal predecessors, (1841), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 16:36:15,964 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 23 states, 23 states have (on average 340.0) internal successors, (7820), 23 states have internal predecessors, (7820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 16:36:15,964 INFO L81 ComplementDD]: Finished complementDD. Result has 23 states, 23 states have (on average 340.0) internal successors, (7820), 23 states have internal predecessors, (7820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 16:36:15,964 INFO L175 Difference]: Start difference. First operand has 164 places, 342 transitions, 4298 flow. Second operand 22 states and 1841 transitions. [2023-08-24 16:36:15,964 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 185 places, 430 transitions, 5994 flow [2023-08-24 16:36:16,011 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 183 places, 430 transitions, 5957 flow, removed 2 selfloop flow, removed 2 redundant places. [2023-08-24 16:36:16,016 INFO L231 Difference]: Finished difference. Result has 189 places, 386 transitions, 5567 flow [2023-08-24 16:36:16,016 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=340, PETRI_DIFFERENCE_MINUEND_FLOW=4261, PETRI_DIFFERENCE_MINUEND_PLACES=162, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=342, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=176, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=143, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=5567, PETRI_PLACES=189, PETRI_TRANSITIONS=386} [2023-08-24 16:36:16,017 INFO L281 CegarLoopForPetriNet]: 22 programPoint places, 167 predicate places. [2023-08-24 16:36:16,017 INFO L495 AbstractCegarLoop]: Abstraction has has 189 places, 386 transitions, 5567 flow [2023-08-24 16:36:16,018 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 81.20833333333333) internal successors, (1949), 24 states have internal predecessors, (1949), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 16:36:16,018 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 16:36:16,018 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 16:36:16,027 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-08-24 16:36:16,227 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 16:36:16,228 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-24 16:36:16,228 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 16:36:16,228 INFO L85 PathProgramCache]: Analyzing trace with hash 353330820, now seen corresponding path program 7 times [2023-08-24 16:36:16,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 16:36:16,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773226403] [2023-08-24 16:36:16,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 16:36:16,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 16:36:16,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 16:36:17,474 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 16:36:17,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 16:36:17,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773226403] [2023-08-24 16:36:17,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1773226403] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 16:36:17,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1503932100] [2023-08-24 16:36:17,475 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-08-24 16:36:17,475 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 16:36:17,475 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 16:36:17,476 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-24 16:36:17,478 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-08-24 16:36:17,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 16:36:17,561 INFO L262 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 52 conjunts are in the unsatisfiable core [2023-08-24 16:36:17,562 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 16:36:17,930 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 16:36:17,931 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 16:36:18,229 INFO L322 Elim1Store]: treesize reduction 22, result has 89.8 percent of original size [2023-08-24 16:36:18,230 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 98 treesize of output 226 [2023-08-24 16:36:20,978 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 16:36:20,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1503932100] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 16:36:20,979 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 16:36:20,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 30 [2023-08-24 16:36:20,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750958789] [2023-08-24 16:36:20,979 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 16:36:20,979 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2023-08-24 16:36:20,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 16:36:20,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2023-08-24 16:36:20,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=861, Unknown=0, NotChecked=0, Total=992 [2023-08-24 16:36:20,983 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 340 [2023-08-24 16:36:20,984 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 189 places, 386 transitions, 5567 flow. Second operand has 32 states, 32 states have (on average 79.625) internal successors, (2548), 32 states have internal predecessors, (2548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 16:36:20,984 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 16:36:20,984 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 340 [2023-08-24 16:36:20,984 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 16:36:24,225 INFO L124 PetriNetUnfolderBase]: 1089/2019 cut-off events. [2023-08-24 16:36:24,225 INFO L125 PetriNetUnfolderBase]: For 15734/15734 co-relation queries the response was YES. [2023-08-24 16:36:24,232 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13778 conditions, 2019 events. 1089/2019 cut-off events. For 15734/15734 co-relation queries the response was YES. Maximal size of possible extension queue 190. Compared 12267 event pairs, 72 based on Foata normal form. 3/2022 useless extension candidates. Maximal degree in co-relation 13561. Up to 955 conditions per place. [2023-08-24 16:36:24,241 INFO L140 encePairwiseOnDemand]: 328/340 looper letters, 177 selfloop transitions, 358 changer transitions 5/540 dead transitions. [2023-08-24 16:36:24,241 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 226 places, 540 transitions, 8264 flow [2023-08-24 16:36:24,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2023-08-24 16:36:24,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2023-08-24 16:36:24,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 3147 transitions. [2023-08-24 16:36:24,270 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.24357585139318885 [2023-08-24 16:36:24,270 INFO L72 ComplementDD]: Start complementDD. Operand 38 states and 3147 transitions. [2023-08-24 16:36:24,270 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 3147 transitions. [2023-08-24 16:36:24,271 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 16:36:24,271 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 38 states and 3147 transitions. [2023-08-24 16:36:24,274 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 39 states, 38 states have (on average 82.8157894736842) internal successors, (3147), 38 states have internal predecessors, (3147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 16:36:24,279 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 39 states, 39 states have (on average 340.0) internal successors, (13260), 39 states have internal predecessors, (13260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 16:36:24,280 INFO L81 ComplementDD]: Finished complementDD. Result has 39 states, 39 states have (on average 340.0) internal successors, (13260), 39 states have internal predecessors, (13260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 16:36:24,280 INFO L175 Difference]: Start difference. First operand has 189 places, 386 transitions, 5567 flow. Second operand 38 states and 3147 transitions. [2023-08-24 16:36:24,281 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 226 places, 540 transitions, 8264 flow [2023-08-24 16:36:24,364 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 213 places, 540 transitions, 8076 flow, removed 57 selfloop flow, removed 13 redundant places. [2023-08-24 16:36:24,371 INFO L231 Difference]: Finished difference. Result has 222 places, 458 transitions, 7526 flow [2023-08-24 16:36:24,371 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=340, PETRI_DIFFERENCE_MINUEND_FLOW=5387, PETRI_DIFFERENCE_MINUEND_PLACES=176, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=386, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=291, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=38, PETRI_FLOW=7526, PETRI_PLACES=222, PETRI_TRANSITIONS=458} [2023-08-24 16:36:24,372 INFO L281 CegarLoopForPetriNet]: 22 programPoint places, 200 predicate places. [2023-08-24 16:36:24,372 INFO L495 AbstractCegarLoop]: Abstraction has has 222 places, 458 transitions, 7526 flow [2023-08-24 16:36:24,372 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 79.625) internal successors, (2548), 32 states have internal predecessors, (2548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 16:36:24,372 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 16:36:24,372 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 16:36:24,377 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-08-24 16:36:24,577 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2023-08-24 16:36:24,577 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-24 16:36:24,577 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 16:36:24,578 INFO L85 PathProgramCache]: Analyzing trace with hash 35664844, now seen corresponding path program 8 times [2023-08-24 16:36:24,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 16:36:24,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138535151] [2023-08-24 16:36:24,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 16:36:24,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 16:36:24,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 16:36:25,500 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 16:36:25,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 16:36:25,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138535151] [2023-08-24 16:36:25,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [138535151] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 16:36:25,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [420732396] [2023-08-24 16:36:25,500 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-24 16:36:25,500 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 16:36:25,500 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 16:36:25,501 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-24 16:36:25,503 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-08-24 16:36:25,580 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-24 16:36:25,580 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-24 16:36:25,582 INFO L262 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 58 conjunts are in the unsatisfiable core [2023-08-24 16:36:25,584 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 16:36:25,597 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-24 16:36:25,598 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-24 16:36:25,605 INFO L322 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-08-24 16:36:25,605 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 20 [2023-08-24 16:36:25,652 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2023-08-24 16:36:25,713 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-24 16:36:25,713 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-08-24 16:36:25,762 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-08-24 16:36:25,790 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-08-24 16:36:25,895 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-24 16:36:25,895 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2023-08-24 16:36:26,074 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-24 16:36:26,074 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 16:36:27,516 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 16:36:27,517 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 130 treesize of output 94 [2023-08-24 16:36:27,561 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 16:36:27,561 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 2019 treesize of output 1999 [2023-08-24 16:36:27,619 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 16:36:27,619 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 430 treesize of output 462 [2023-08-24 16:36:27,651 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 16:36:27,652 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 395 treesize of output 363 [2023-08-24 16:36:27,701 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 16:36:27,702 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 274 treesize of output 330 [2023-08-24 16:37:31,552 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 16:37:31,553 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 159 treesize of output 111 [2023-08-24 16:37:31,620 INFO L322 Elim1Store]: treesize reduction 4, result has 95.7 percent of original size [2023-08-24 16:37:31,621 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 15061 treesize of output 14069 [2023-08-24 16:37:31,764 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 16:37:31,765 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 1895 treesize of output 1747 [2023-08-24 16:37:31,862 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 16:37:31,865 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 1667 treesize of output 1633 [2023-08-24 16:37:31,922 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 16:37:31,923 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1530 treesize of output 1138 [2023-08-24 16:38:51,439 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 16:38:51,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [420732396] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 16:38:51,440 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 16:38:51,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 11] total 31 [2023-08-24 16:38:51,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661692013] [2023-08-24 16:38:51,440 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 16:38:51,440 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2023-08-24 16:38:51,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 16:38:51,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2023-08-24 16:38:51,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=926, Unknown=10, NotChecked=0, Total=1056 [2023-08-24 16:38:51,442 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 340 [2023-08-24 16:38:51,443 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 222 places, 458 transitions, 7526 flow. Second operand has 33 states, 33 states have (on average 79.60606060606061) internal successors, (2627), 33 states have internal predecessors, (2627), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 16:38:51,443 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 16:38:51,443 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 340 [2023-08-24 16:38:51,443 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 16:38:58,872 WARN L234 SmtUtils]: Spent 6.87s on a formula simplification. DAG size of input: 125 DAG size of output: 122 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-24 16:39:03,362 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.72s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 16:39:15,767 WARN L234 SmtUtils]: Spent 9.52s on a formula simplification that was a NOOP. DAG size: 118 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-24 16:39:22,423 WARN L234 SmtUtils]: Spent 6.05s on a formula simplification that was a NOOP. DAG size: 67 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-24 16:40:25,135 WARN L234 SmtUtils]: Spent 59.36s on a formula simplification. DAG size of input: 219 DAG size of output: 161 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-24 16:41:34,147 WARN L234 SmtUtils]: Spent 1.05m on a formula simplification. DAG size of input: 219 DAG size of output: 158 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-24 16:41:36,027 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.79s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 16:42:41,188 WARN L234 SmtUtils]: Spent 1.03m on a formula simplification. DAG size of input: 218 DAG size of output: 159 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-24 16:43:02,631 WARN L234 SmtUtils]: Spent 19.13s on a formula simplification. DAG size of input: 214 DAG size of output: 166 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-24 16:43:10,480 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 16:43:30,386 WARN L234 SmtUtils]: Spent 17.18s on a formula simplification. DAG size of input: 218 DAG size of output: 172 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-24 16:43:33,063 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 16:43:39,840 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 16:43:43,581 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 16:44:07,589 WARN L234 SmtUtils]: Spent 19.99s on a formula simplification. DAG size of input: 215 DAG size of output: 168 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-24 16:44:24,873 WARN L234 SmtUtils]: Spent 14.56s on a formula simplification. DAG size of input: 223 DAG size of output: 176 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-24 16:44:51,884 WARN L234 SmtUtils]: Spent 22.55s on a formula simplification. DAG size of input: 225 DAG size of output: 179 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-24 16:44:51,906 INFO L124 PetriNetUnfolderBase]: 1549/2922 cut-off events. [2023-08-24 16:44:51,906 INFO L125 PetriNetUnfolderBase]: For 28654/28654 co-relation queries the response was YES. [2023-08-24 16:44:51,919 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21924 conditions, 2922 events. 1549/2922 cut-off events. For 28654/28654 co-relation queries the response was YES. Maximal size of possible extension queue 284. Compared 19605 event pairs, 60 based on Foata normal form. 23/2945 useless extension candidates. Maximal degree in co-relation 21605. Up to 898 conditions per place. [2023-08-24 16:44:51,929 INFO L140 encePairwiseOnDemand]: 327/340 looper letters, 282 selfloop transitions, 501 changer transitions 25/808 dead transitions. [2023-08-24 16:44:51,929 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 284 places, 808 transitions, 13656 flow [2023-08-24 16:44:51,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2023-08-24 16:44:51,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2023-08-24 16:44:51,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 5210 transitions. [2023-08-24 16:44:51,934 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.24323062558356676 [2023-08-24 16:44:51,934 INFO L72 ComplementDD]: Start complementDD. Operand 63 states and 5210 transitions. [2023-08-24 16:44:51,934 INFO L73 IsDeterministic]: Start isDeterministic. Operand 63 states and 5210 transitions. [2023-08-24 16:44:51,935 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 16:44:51,936 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 63 states and 5210 transitions. [2023-08-24 16:44:51,941 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 64 states, 63 states have (on average 82.6984126984127) internal successors, (5210), 63 states have internal predecessors, (5210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 16:44:51,972 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 64 states, 64 states have (on average 340.0) internal successors, (21760), 64 states have internal predecessors, (21760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 16:44:51,973 INFO L81 ComplementDD]: Finished complementDD. Result has 64 states, 64 states have (on average 340.0) internal successors, (21760), 64 states have internal predecessors, (21760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 16:44:51,973 INFO L175 Difference]: Start difference. First operand has 222 places, 458 transitions, 7526 flow. Second operand 63 states and 5210 transitions. [2023-08-24 16:44:51,973 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 284 places, 808 transitions, 13656 flow [2023-08-24 16:44:52,218 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 269 places, 808 transitions, 13301 flow, removed 149 selfloop flow, removed 15 redundant places. [2023-08-24 16:44:52,228 INFO L231 Difference]: Finished difference. Result has 288 places, 647 transitions, 12218 flow [2023-08-24 16:44:52,229 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=340, PETRI_DIFFERENCE_MINUEND_FLOW=7154, PETRI_DIFFERENCE_MINUEND_PLACES=207, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=452, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=330, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=63, PETRI_FLOW=12218, PETRI_PLACES=288, PETRI_TRANSITIONS=647} [2023-08-24 16:44:52,229 INFO L281 CegarLoopForPetriNet]: 22 programPoint places, 266 predicate places. [2023-08-24 16:44:52,229 INFO L495 AbstractCegarLoop]: Abstraction has has 288 places, 647 transitions, 12218 flow [2023-08-24 16:44:52,229 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 79.60606060606061) internal successors, (2627), 33 states have internal predecessors, (2627), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 16:44:52,229 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 16:44:52,230 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 16:44:52,235 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-08-24 16:44:52,434 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-08-24 16:44:52,434 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-24 16:44:52,435 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 16:44:52,435 INFO L85 PathProgramCache]: Analyzing trace with hash -564469912, now seen corresponding path program 9 times [2023-08-24 16:44:52,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 16:44:52,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844107449] [2023-08-24 16:44:52,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 16:44:52,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 16:44:52,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 16:44:53,358 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 16:44:53,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 16:44:53,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [844107449] [2023-08-24 16:44:53,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [844107449] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 16:44:53,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2026056742] [2023-08-24 16:44:53,359 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-24 16:44:53,359 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 16:44:53,359 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 16:44:53,360 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-24 16:44:53,362 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-08-24 16:44:53,445 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-08-24 16:44:53,445 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-24 16:44:53,446 INFO L262 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 63 conjunts are in the unsatisfiable core [2023-08-24 16:44:53,447 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 16:44:53,600 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2023-08-24 16:44:53,664 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-08-24 16:44:53,756 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-24 16:44:53,757 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2023-08-24 16:44:53,965 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 16:44:53,965 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 16:44:54,206 WARN L839 $PredicateComparison]: unable to prove that (or (<= c_~n1~0 c_~q1_back~0) (< c_~q1_back~0 0) (<= c_~n2~0 c_~q2_front~0) (< c_~q2_front~0 0) (let ((.cse1 (+ (* c_~q1_back~0 4) c_~q1~0.offset)) (.cse4 (+ c_~q2~0.offset (* c_~q2_front~0 4))) (.cse2 (+ (* c_~q1_front~0 4) c_~q1~0.offset))) (and (forall ((v_ArrVal_428 (Array Int Int)) (~q1~0.base Int)) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_428))) (let ((.cse0 (select .cse3 ~q1~0.base))) (or (not (= c_~j~0 (select .cse0 .cse1))) (<= (select .cse0 .cse2) (select (select .cse3 c_~q2~0.base) .cse4)))))) (forall ((v_ArrVal_428 (Array Int Int)) (~q1~0.base Int)) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_428))) (let ((.cse5 (select .cse6 ~q1~0.base))) (or (not (= c_~j~0 (select .cse5 .cse1))) (< (select (select .cse6 c_~q2~0.base) .cse4) (+ (select .cse5 .cse2) 1))))))))) is different from false [2023-08-24 16:44:54,518 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 16:44:54,519 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 113 treesize of output 77 [2023-08-24 16:44:54,584 INFO L322 Elim1Store]: treesize reduction 4, result has 95.7 percent of original size [2023-08-24 16:44:54,584 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 510 treesize of output 518 [2023-08-24 16:44:54,612 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 16:44:54,613 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 406 treesize of output 338 [2023-08-24 16:44:54,657 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 16:44:54,657 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 322 treesize of output 342 [2023-08-24 16:45:11,161 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 16:45:11,161 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 115 treesize of output 79 [2023-08-24 16:45:11,164 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-24 16:45:11,189 INFO L322 Elim1Store]: treesize reduction 69, result has 25.8 percent of original size [2023-08-24 16:45:11,190 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 632 treesize of output 535 [2023-08-24 16:45:11,203 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-24 16:45:11,205 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-24 16:45:11,211 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 16:45:11,211 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 258 treesize of output 226 [2023-08-24 16:45:11,219 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-24 16:45:11,220 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 137 treesize of output 101 [2023-08-24 16:45:11,501 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 16:45:11,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2026056742] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 16:45:11,501 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 16:45:11,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 10] total 31 [2023-08-24 16:45:11,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019790724] [2023-08-24 16:45:11,501 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 16:45:11,503 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2023-08-24 16:45:11,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 16:45:11,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2023-08-24 16:45:11,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=877, Unknown=13, NotChecked=60, Total=1056 [2023-08-24 16:45:11,509 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 340 [2023-08-24 16:45:11,510 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 288 places, 647 transitions, 12218 flow. Second operand has 33 states, 33 states have (on average 82.66666666666667) internal successors, (2728), 33 states have internal predecessors, (2728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 16:45:11,510 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 16:45:11,510 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 340 [2023-08-24 16:45:11,510 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 16:45:12,208 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (<= c_~n1~0 c_~q1_back~0)) (.cse1 (< |c_ULTIMATE.start_create_fresh_int_array_~i~1#1| |c_ULTIMATE.start_create_fresh_int_array_~size#1|)) (.cse2 (< c_~q1_back~0 0)) (.cse3 (< c_~q2_front~0 0))) (and (or (< 0 c_~q2_front~0) .cse0 .cse1 (and (<= c_~j~0 c_~i~0) (< c_~i~0 (+ c_~j~0 1)) (= c_~q2_front~0 c_~q2_back~0) (<= |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t2~0#1.base|) (= c_~q1_back~0 c_~q1_front~0)) .cse2 .cse3) (<= c_~i~0 c_~j~0) (< c_~j~0 (+ c_~i~0 1)) (or .cse0 .cse1 .cse2 (let ((.cse7 (+ (* c_~q1_back~0 4) c_~q1~0.offset)) (.cse10 (+ (* c_~q2_front~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse8 (+ (* c_~q1_front~0 4) c_~q1~0.offset)) (.cse5 (+ (* c_~q2_back~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (and (forall ((v_ArrVal_427 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_427))) (or (not (= (select (select .cse4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse5) c_~i~0)) (forall ((v_ArrVal_428 (Array Int Int)) (~q1~0.base Int)) (let ((.cse9 (store .cse4 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_428))) (let ((.cse6 (select .cse9 ~q1~0.base))) (or (not (= c_~j~0 (select .cse6 .cse7))) (<= (select .cse6 .cse8) (select (select .cse9 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse10))))))))) (forall ((v_ArrVal_427 (Array Int Int))) (let ((.cse13 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_427))) (or (forall ((v_ArrVal_428 (Array Int Int)) (~q1~0.base Int)) (let ((.cse12 (store .cse13 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_428))) (let ((.cse11 (select .cse12 ~q1~0.base))) (or (not (= c_~j~0 (select .cse11 .cse7))) (< (select (select .cse12 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse10) (+ (select .cse11 .cse8) 1)))))) (not (= (select (select .cse13 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse5) c_~i~0))))))) (<= c_~n2~0 c_~q2_front~0) .cse3))) is different from false [2023-08-24 16:45:12,591 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (<= c_~n1~0 c_~q1_back~0)) (.cse5 (< (+ 1 |c_ULTIMATE.start_create_fresh_int_array_~i~1#1|) |c_ULTIMATE.start_create_fresh_int_array_~size#1|)) (.cse6 (< c_~q1_back~0 0)) (.cse8 (<= c_~n2~0 c_~q2_front~0)) (.cse7 (< c_~q2_front~0 0)) (.cse1 (<= c_~j~0 c_~i~0)) (.cse2 (< c_~i~0 (+ c_~j~0 1))) (.cse3 (= c_~q2_front~0 c_~q2_back~0)) (.cse4 (= c_~q1_back~0 c_~q1_front~0))) (and (<= c_~i~0 c_~j~0) (or (< 0 c_~q2_front~0) .cse0 (and .cse1 .cse2 .cse3 (<= |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t2~0#1.base|) .cse4) .cse5 .cse6 .cse7) (or .cse0 .cse6 .cse8 .cse7 (not (= c_~i~0 (select (select |c_#memory_int| c_~q2~0.base) (+ (* c_~q2_back~0 4) c_~q2~0.offset)))) (let ((.cse10 (+ (* c_~q1_back~0 4) c_~q1~0.offset)) (.cse13 (+ c_~q2~0.offset (* c_~q2_front~0 4))) (.cse11 (+ (* c_~q1_front~0 4) c_~q1~0.offset))) (and (forall ((v_ArrVal_428 (Array Int Int)) (~q1~0.base Int)) (let ((.cse12 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_428))) (let ((.cse9 (select .cse12 ~q1~0.base))) (or (not (= c_~j~0 (select .cse9 .cse10))) (<= (select .cse9 .cse11) (select (select .cse12 c_~q2~0.base) .cse13)))))) (forall ((v_ArrVal_428 (Array Int Int)) (~q1~0.base Int)) (let ((.cse15 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_428))) (let ((.cse14 (select .cse15 ~q1~0.base))) (or (not (= c_~j~0 (select .cse14 .cse10))) (< (select (select .cse15 c_~q2~0.base) .cse13) (+ (select .cse14 .cse11) 1))))))))) (< c_~j~0 (+ c_~i~0 1)) (or .cse0 .cse5 .cse6 .cse8 .cse7 (and .cse1 .cse2 .cse3 .cse4 (not (= |c_ULTIMATE.start_main_~#t2~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)))))) is different from false [2023-08-24 16:45:14,039 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse14 (+ c_~j~0 1)) (.cse15 (select |c_#memory_int| c_~q2~0.base)) (.cse19 (+ c_~q2~0.offset (* c_~q2_front~0 4)))) (let ((.cse7 (+ (* c_~q1_back~0 4) c_~q1~0.offset)) (.cse6 (+ (* c_~q1_front~0 4) c_~q1~0.offset)) (.cse4 (select .cse15 .cse19)) (.cse16 (<= c_~i~0 c_~N~0)) (.cse0 (<= c_~n1~0 c_~q1_back~0)) (.cse13 (< (+ 1 |c_ULTIMATE.start_create_fresh_int_array_~i~1#1|) |c_ULTIMATE.start_create_fresh_int_array_~size#1|)) (.cse1 (< c_~q1_back~0 0)) (.cse2 (<= c_~n2~0 c_~q2_front~0)) (.cse3 (< c_~q2_front~0 0)) (.cse9 (<= c_~j~0 c_~i~0)) (.cse10 (< c_~i~0 .cse14)) (.cse11 (= c_~q2_front~0 c_~q2_back~0)) (.cse12 (= c_~q1_back~0 c_~q1_front~0))) (and (= c_~q2~0.offset 0) (= c_~q1~0.offset 0) (or .cse0 .cse1 .cse2 .cse3 (and (forall ((~q1~0.base Int)) (let ((.cse5 (select |c_#memory_int| ~q1~0.base))) (or (< .cse4 (+ (select .cse5 .cse6) 1)) (not (= c_~j~0 (select .cse5 .cse7)))))) (forall ((~q1~0.base Int)) (let ((.cse8 (select |c_#memory_int| ~q1~0.base))) (or (not (= c_~j~0 (select .cse8 .cse7))) (<= (select .cse8 .cse6) .cse4)))))) (or (= c_~q1_front~0 0) (and (< 0 (+ c_~q1_front~0 1)) (<= (+ c_~q1_front~0 c_~n1~0) 1)) (not (= c_~q1_back~0 0))) (not (= |c_ULTIMATE.start_main_~#t2~0#1.base| c_~q2~0.base)) (or (< 0 c_~q2_front~0) .cse0 (and .cse9 .cse10 .cse11 (<= |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t2~0#1.base|) .cse12) .cse13 .cse1 .cse3) (<= .cse14 c_~N~0) (= 0 (select .cse15 0)) (<= 1 c_~N~0) (= c_~q2_front~0 0) .cse16 (exists ((~q1~0.base Int) (v_~q1_front~0_92 Int)) (and (= (select (select |c_#memory_int| ~q1~0.base) (* 4 v_~q1_front~0_92)) 0) (<= 0 v_~q1_front~0_92) (<= v_~q1_front~0_92 0))) (or .cse0 .cse1 .cse2 .cse3 (not (= c_~i~0 (select .cse15 (+ (* c_~q2_back~0 4) c_~q2~0.offset)))) (and (forall ((v_ArrVal_428 (Array Int Int)) (~q1~0.base Int)) (let ((.cse18 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_428))) (let ((.cse17 (select .cse18 ~q1~0.base))) (or (not (= c_~j~0 (select .cse17 .cse7))) (<= (select .cse17 .cse6) (select (select .cse18 c_~q2~0.base) .cse19)))))) (forall ((v_ArrVal_428 (Array Int Int)) (~q1~0.base Int)) (let ((.cse21 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_428))) (let ((.cse20 (select .cse21 ~q1~0.base))) (or (not (= c_~j~0 (select .cse20 .cse7))) (< (select (select .cse21 c_~q2~0.base) .cse19) (+ (select .cse20 .cse6) 1)))))))) (or (<= c_~n1~0 1) (<= c_~q1_back~0 0)) (< c_~j~0 (+ c_~i~0 1)) (<= c_~n2~0 1) (= .cse4 0) (or (<= c_~i~0 c_~j~0) .cse16) (or .cse0 .cse13 .cse1 .cse2 .cse3 (and .cse9 .cse10 .cse11 .cse12 (not (= |c_ULTIMATE.start_main_~#t2~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)))) (<= 1 c_~i~0) (= c_~i~0 1)))) is different from false [2023-08-24 16:45:18,574 INFO L124 PetriNetUnfolderBase]: 1999/3786 cut-off events. [2023-08-24 16:45:18,575 INFO L125 PetriNetUnfolderBase]: For 54452/54452 co-relation queries the response was YES. [2023-08-24 16:45:18,597 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31293 conditions, 3786 events. 1999/3786 cut-off events. For 54452/54452 co-relation queries the response was YES. Maximal size of possible extension queue 336. Compared 26530 event pairs, 280 based on Foata normal form. 7/3793 useless extension candidates. Maximal degree in co-relation 31015. Up to 1676 conditions per place. [2023-08-24 16:45:18,626 INFO L140 encePairwiseOnDemand]: 326/340 looper letters, 458 selfloop transitions, 447 changer transitions 11/916 dead transitions. [2023-08-24 16:45:18,627 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 331 places, 916 transitions, 18293 flow [2023-08-24 16:45:18,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2023-08-24 16:45:18,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2023-08-24 16:45:18,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 3778 transitions. [2023-08-24 16:45:18,630 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2525401069518717 [2023-08-24 16:45:18,630 INFO L72 ComplementDD]: Start complementDD. Operand 44 states and 3778 transitions. [2023-08-24 16:45:18,630 INFO L73 IsDeterministic]: Start isDeterministic. Operand 44 states and 3778 transitions. [2023-08-24 16:45:18,631 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 16:45:18,631 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 44 states and 3778 transitions. [2023-08-24 16:45:18,634 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 45 states, 44 states have (on average 85.86363636363636) internal successors, (3778), 44 states have internal predecessors, (3778), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 16:45:18,641 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 45 states, 45 states have (on average 340.0) internal successors, (15300), 45 states have internal predecessors, (15300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 16:45:18,641 INFO L81 ComplementDD]: Finished complementDD. Result has 45 states, 45 states have (on average 340.0) internal successors, (15300), 45 states have internal predecessors, (15300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 16:45:18,641 INFO L175 Difference]: Start difference. First operand has 288 places, 647 transitions, 12218 flow. Second operand 44 states and 3778 transitions. [2023-08-24 16:45:18,641 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 331 places, 916 transitions, 18293 flow [2023-08-24 16:45:19,095 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 310 places, 916 transitions, 17738 flow, removed 228 selfloop flow, removed 21 redundant places. [2023-08-24 16:45:19,108 INFO L231 Difference]: Finished difference. Result has 330 places, 792 transitions, 16612 flow [2023-08-24 16:45:19,109 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=340, PETRI_DIFFERENCE_MINUEND_FLOW=11836, PETRI_DIFFERENCE_MINUEND_PLACES=267, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=647, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=319, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=286, PETRI_DIFFERENCE_SUBTRAHEND_STATES=44, PETRI_FLOW=16612, PETRI_PLACES=330, PETRI_TRANSITIONS=792} [2023-08-24 16:45:19,109 INFO L281 CegarLoopForPetriNet]: 22 programPoint places, 308 predicate places. [2023-08-24 16:45:19,109 INFO L495 AbstractCegarLoop]: Abstraction has has 330 places, 792 transitions, 16612 flow [2023-08-24 16:45:19,109 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 82.66666666666667) internal successors, (2728), 33 states have internal predecessors, (2728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 16:45:19,109 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 16:45:19,109 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 16:45:19,114 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-08-24 16:45:19,314 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 16:45:19,314 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-24 16:45:19,314 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 16:45:19,314 INFO L85 PathProgramCache]: Analyzing trace with hash 1348864098, now seen corresponding path program 10 times [2023-08-24 16:45:19,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 16:45:19,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102951527] [2023-08-24 16:45:19,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 16:45:19,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 16:45:19,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 16:45:20,356 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 16:45:20,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 16:45:20,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [102951527] [2023-08-24 16:45:20,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [102951527] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 16:45:20,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1730801627] [2023-08-24 16:45:20,357 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-08-24 16:45:20,357 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 16:45:20,357 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 16:45:20,358 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-24 16:45:20,359 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-08-24 16:45:20,436 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-08-24 16:45:20,436 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-24 16:45:20,438 INFO L262 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 49 conjunts are in the unsatisfiable core [2023-08-24 16:45:20,440 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 16:45:20,536 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2023-08-24 16:45:20,586 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-08-24 16:45:20,650 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-24 16:45:20,651 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2023-08-24 16:45:20,813 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-24 16:45:20,814 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 16:45:21,142 WARN L839 $PredicateComparison]: unable to prove that (or (< c_~q2_back~0 0) (<= c_~n2~0 c_~q2_back~0) (not (= c_~i~0 (select (select |c_#memory_int| c_~q2~0.base) (+ (* c_~q2_back~0 4) c_~q2~0.offset)))) (let ((.cse3 (* c_~q1_front~0 4)) (.cse2 (* c_~q1_back~0 4)) (.cse5 (+ c_~q2~0.offset (* c_~q2_front~0 4)))) (and (forall ((v_ArrVal_470 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_470))) (let ((.cse0 (select (select .cse4 c_~q2~0.base) .cse5))) (or (< .cse0 c_~j~0) (forall ((~q1~0.offset Int) (~q1~0.base Int)) (let ((.cse1 (select .cse4 ~q1~0.base))) (or (not (= c_~j~0 (select .cse1 (+ .cse2 ~q1~0.offset)))) (< .cse0 (+ (select .cse1 (+ .cse3 ~q1~0.offset)) 1))))))))) (forall ((v_ArrVal_470 (Array Int Int))) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_470))) (or (forall ((~q1~0.offset Int) (~q1~0.base Int)) (let ((.cse6 (select .cse7 ~q1~0.base))) (or (< (select .cse6 (+ .cse3 ~q1~0.offset)) (+ c_~j~0 1)) (not (= c_~j~0 (select .cse6 (+ .cse2 ~q1~0.offset))))))) (< (select (select .cse7 c_~q2~0.base) .cse5) c_~j~0))))))) is different from false [2023-08-24 16:45:21,243 WARN L839 $PredicateComparison]: unable to prove that (or (< c_~q2_back~0 0) (< |c_ULTIMATE.start_create_fresh_int_array_~i~1#1| |c_ULTIMATE.start_create_fresh_int_array_~size#1|) (<= c_~n2~0 c_~q2_back~0) (let ((.cse6 (+ (* c_~q2_back~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse2 (* c_~q1_front~0 4)) (.cse1 (* c_~q1_back~0 4)) (.cse4 (+ (* c_~q2_front~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (and (forall ((v_ArrVal_469 (Array Int Int))) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_469))) (or (forall ((v_ArrVal_470 (Array Int Int))) (let ((.cse3 (store .cse5 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_470))) (or (forall ((~q1~0.offset Int) (~q1~0.base Int)) (let ((.cse0 (select .cse3 ~q1~0.base))) (or (not (= (select .cse0 (+ .cse1 ~q1~0.offset)) c_~j~0)) (< (select .cse0 (+ .cse2 ~q1~0.offset)) (+ c_~j~0 1))))) (< (select (select .cse3 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse4) c_~j~0)))) (not (= (select (select .cse5 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse6) c_~i~0))))) (forall ((v_ArrVal_469 (Array Int Int))) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_469))) (or (not (= (select (select .cse7 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse6) c_~i~0)) (forall ((v_ArrVal_470 (Array Int Int))) (let ((.cse10 (store .cse7 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_470))) (let ((.cse8 (select (select .cse10 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse4))) (or (forall ((~q1~0.offset Int) (~q1~0.base Int)) (let ((.cse9 (select .cse10 ~q1~0.base))) (or (< .cse8 (+ (select .cse9 (+ .cse2 ~q1~0.offset)) 1)) (not (= (select .cse9 (+ .cse1 ~q1~0.offset)) c_~j~0))))) (< .cse8 c_~j~0))))))))))) is different from false [2023-08-24 16:45:21,273 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 16:45:21,274 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 144 treesize of output 96 [2023-08-24 16:45:21,339 INFO L322 Elim1Store]: treesize reduction 4, result has 95.7 percent of original size [2023-08-24 16:45:21,339 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 1139 treesize of output 1067 [2023-08-24 16:45:21,374 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 16:45:21,374 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 497 treesize of output 417 [2023-08-24 16:45:21,420 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 16:45:21,420 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 380 treesize of output 394 [2023-08-24 16:45:36,107 INFO L322 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-08-24 16:45:36,108 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 118 treesize of output 1 [2023-08-24 16:45:36,215 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 2 not checked. [2023-08-24 16:45:36,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1730801627] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 16:45:36,215 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 16:45:36,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 10] total 31 [2023-08-24 16:45:36,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509683631] [2023-08-24 16:45:36,215 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 16:45:36,215 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2023-08-24 16:45:36,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 16:45:36,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2023-08-24 16:45:36,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=832, Unknown=7, NotChecked=118, Total=1056 [2023-08-24 16:45:36,218 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 340 [2023-08-24 16:45:36,219 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 330 places, 792 transitions, 16612 flow. Second operand has 33 states, 33 states have (on average 82.66666666666667) internal successors, (2728), 33 states have internal predecessors, (2728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 16:45:36,219 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 16:45:36,219 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 340 [2023-08-24 16:45:36,219 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 16:45:37,252 WARN L839 $PredicateComparison]: unable to prove that (and (= c_~i~0 0) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t2~0#1.base|) (= c_~q2_front~0 c_~q2_back~0) (= c_~q1_back~0 c_~q1_front~0) (or (< c_~q2_back~0 0) (<= c_~n2~0 c_~q2_back~0) (not (= c_~i~0 (select (select |c_#memory_int| c_~q2~0.base) (+ (* c_~q2_back~0 4) c_~q2~0.offset)))) (let ((.cse3 (* c_~q1_front~0 4)) (.cse2 (* c_~q1_back~0 4)) (.cse5 (+ c_~q2~0.offset (* c_~q2_front~0 4)))) (and (forall ((v_ArrVal_470 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_470))) (let ((.cse0 (select (select .cse4 c_~q2~0.base) .cse5))) (or (< .cse0 c_~j~0) (forall ((~q1~0.offset Int) (~q1~0.base Int)) (let ((.cse1 (select .cse4 ~q1~0.base))) (or (not (= c_~j~0 (select .cse1 (+ .cse2 ~q1~0.offset)))) (< .cse0 (+ (select .cse1 (+ .cse3 ~q1~0.offset)) 1))))))))) (forall ((v_ArrVal_470 (Array Int Int))) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_470))) (or (forall ((~q1~0.offset Int) (~q1~0.base Int)) (let ((.cse6 (select .cse7 ~q1~0.base))) (or (< (select .cse6 (+ .cse3 ~q1~0.offset)) (+ c_~j~0 1)) (not (= c_~j~0 (select .cse6 (+ .cse2 ~q1~0.offset))))))) (< (select (select .cse7 c_~q2~0.base) .cse5) c_~j~0))))))) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t1~0#1.base|) (= c_~j~0 0)) is different from false [2023-08-24 16:45:40,255 INFO L124 PetriNetUnfolderBase]: 2466/4666 cut-off events. [2023-08-24 16:45:40,255 INFO L125 PetriNetUnfolderBase]: For 87253/87253 co-relation queries the response was YES. [2023-08-24 16:45:40,285 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44174 conditions, 4666 events. 2466/4666 cut-off events. For 87253/87253 co-relation queries the response was YES. Maximal size of possible extension queue 419. Compared 34197 event pairs, 185 based on Foata normal form. 4/4670 useless extension candidates. Maximal degree in co-relation 43906. Up to 1698 conditions per place. [2023-08-24 16:45:40,305 INFO L140 encePairwiseOnDemand]: 327/340 looper letters, 229 selfloop transitions, 842 changer transitions 5/1076 dead transitions. [2023-08-24 16:45:40,305 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 368 places, 1076 transitions, 24105 flow [2023-08-24 16:45:40,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2023-08-24 16:45:40,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2023-08-24 16:45:40,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 3333 transitions. [2023-08-24 16:45:40,310 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2513574660633484 [2023-08-24 16:45:40,310 INFO L72 ComplementDD]: Start complementDD. Operand 39 states and 3333 transitions. [2023-08-24 16:45:40,310 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 3333 transitions. [2023-08-24 16:45:40,310 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 16:45:40,310 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 39 states and 3333 transitions. [2023-08-24 16:45:40,408 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 40 states, 39 states have (on average 85.46153846153847) internal successors, (3333), 39 states have internal predecessors, (3333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 16:45:40,414 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 40 states, 40 states have (on average 340.0) internal successors, (13600), 40 states have internal predecessors, (13600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 16:45:40,414 INFO L81 ComplementDD]: Finished complementDD. Result has 40 states, 40 states have (on average 340.0) internal successors, (13600), 40 states have internal predecessors, (13600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 16:45:40,414 INFO L175 Difference]: Start difference. First operand has 330 places, 792 transitions, 16612 flow. Second operand 39 states and 3333 transitions. [2023-08-24 16:45:40,414 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 368 places, 1076 transitions, 24105 flow [2023-08-24 16:45:41,069 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 355 places, 1076 transitions, 23865 flow, removed 98 selfloop flow, removed 13 redundant places. [2023-08-24 16:45:41,086 INFO L231 Difference]: Finished difference. Result has 363 places, 980 transitions, 22978 flow [2023-08-24 16:45:41,086 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=340, PETRI_DIFFERENCE_MINUEND_FLOW=16406, PETRI_DIFFERENCE_MINUEND_PLACES=317, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=792, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=660, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=39, PETRI_FLOW=22978, PETRI_PLACES=363, PETRI_TRANSITIONS=980} [2023-08-24 16:45:41,087 INFO L281 CegarLoopForPetriNet]: 22 programPoint places, 341 predicate places. [2023-08-24 16:45:41,087 INFO L495 AbstractCegarLoop]: Abstraction has has 363 places, 980 transitions, 22978 flow [2023-08-24 16:45:41,087 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 82.66666666666667) internal successors, (2728), 33 states have internal predecessors, (2728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 16:45:41,087 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 16:45:41,087 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 16:45:41,092 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-08-24 16:45:41,291 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2023-08-24 16:45:41,291 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-24 16:45:41,291 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 16:45:41,292 INFO L85 PathProgramCache]: Analyzing trace with hash 603046995, now seen corresponding path program 11 times [2023-08-24 16:45:41,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 16:45:41,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613081749] [2023-08-24 16:45:41,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 16:45:41,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 16:45:41,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 16:45:42,493 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 16:45:42,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 16:45:42,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613081749] [2023-08-24 16:45:42,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [613081749] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 16:45:42,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [593883943] [2023-08-24 16:45:42,494 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-08-24 16:45:42,494 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 16:45:42,494 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 16:45:42,495 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-24 16:45:42,496 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-08-24 16:45:42,588 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2023-08-24 16:45:42,588 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-24 16:45:42,590 INFO L262 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 74 conjunts are in the unsatisfiable core [2023-08-24 16:45:42,593 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 16:45:42,616 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-24 16:45:42,617 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-24 16:45:42,625 INFO L322 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-08-24 16:45:42,625 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 16 [2023-08-24 16:45:42,695 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-08-24 16:45:42,756 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-24 16:45:42,757 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-24 16:45:42,770 INFO L322 Elim1Store]: treesize reduction 20, result has 39.4 percent of original size [2023-08-24 16:45:42,770 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 21 treesize of output 25 [2023-08-24 16:45:42,815 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-08-24 16:45:42,840 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-08-24 16:45:42,865 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-08-24 16:45:42,969 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2023-08-24 16:45:43,185 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 20 [2023-08-24 16:45:43,261 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-24 16:45:43,261 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 16:45:43,893 WARN L839 $PredicateComparison]: unable to prove that (or (<= c_~n1~0 c_~q1_back~0) (< c_~q1_back~0 0) (let ((.cse1 (* c_~q2_back~0 4)) (.cse3 (+ (* c_~q1_back~0 4) c_~q1~0.offset)) (.cse7 (* c_~q2_front~0 4)) (.cse5 (+ c_~j~0 1)) (.cse4 (+ (* c_~q1_front~0 4) c_~q1~0.offset))) (and (forall ((~q2~0.offset Int) (v_ArrVal_522 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_522))) (or (not (= c_~i~0 (select (select .cse0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ ~q2~0.offset .cse1)))) (forall ((v_ArrVal_523 (Array Int Int))) (let ((.cse6 (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_523))) (let ((.cse2 (select .cse6 c_~q1~0.base))) (or (not (= c_~j~0 (select .cse2 .cse3))) (< (select .cse2 .cse4) .cse5) (< (select (select .cse6 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ ~q2~0.offset .cse7)) c_~j~0)))))))) (forall ((~q2~0.offset Int) (v_ArrVal_522 (Array Int Int))) (let ((.cse8 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_522))) (or (not (= c_~i~0 (select (select .cse8 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ ~q2~0.offset .cse1)))) (forall ((v_ArrVal_523 (Array Int Int))) (let ((.cse10 (store .cse8 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_523))) (let ((.cse9 (select .cse10 c_~q1~0.base))) (or (not (= c_~j~0 (select .cse9 .cse3))) (< (select (select .cse10 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ ~q2~0.offset .cse7)) .cse5) (< (select .cse9 .cse4) c_~j~0)))))))))) (< c_~q2_front~0 0)) is different from false [2023-08-24 16:45:43,935 WARN L839 $PredicateComparison]: unable to prove that (or (<= c_~n1~0 c_~q1_back~0) (< c_~q1_back~0 0) (let ((.cse7 (* c_~q2_back~0 4)) (.cse1 (+ (* c_~q1_back~0 4) c_~q1~0.offset)) (.cse2 (+ (* c_~q1_front~0 4) c_~q1~0.offset)) (.cse5 (+ c_~j~0 1)) (.cse4 (* c_~q2_front~0 4))) (and (forall ((~q2~0.offset Int) (v_ArrVal_522 (Array Int Int)) (v_ArrVal_521 (Array Int Int))) (let ((.cse6 (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_521) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_522))) (or (forall ((v_ArrVal_523 (Array Int Int))) (let ((.cse3 (store .cse6 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_523))) (let ((.cse0 (select .cse3 c_~q1~0.base))) (or (not (= c_~j~0 (select .cse0 .cse1))) (< (select .cse0 .cse2) c_~j~0) (< (select (select .cse3 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ ~q2~0.offset .cse4)) .cse5))))) (not (= (select (select .cse6 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ ~q2~0.offset .cse7)) c_~i~0))))) (forall ((~q2~0.offset Int) (v_ArrVal_522 (Array Int Int)) (v_ArrVal_521 (Array Int Int))) (let ((.cse8 (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_521) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_522))) (or (not (= (select (select .cse8 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ ~q2~0.offset .cse7)) c_~i~0)) (forall ((v_ArrVal_523 (Array Int Int))) (let ((.cse10 (store .cse8 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_523))) (let ((.cse9 (select .cse10 c_~q1~0.base))) (or (not (= c_~j~0 (select .cse9 .cse1))) (< (select .cse9 .cse2) .cse5) (< (select (select .cse10 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ ~q2~0.offset .cse4)) c_~j~0)))))))))) (< c_~q2_front~0 0)) is different from false [2023-08-24 16:45:44,228 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 16:45:44,229 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 130 treesize of output 94 [2023-08-24 16:45:44,241 INFO L322 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-08-24 16:45:44,242 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 483 treesize of output 470 [2023-08-24 16:45:44,277 INFO L322 Elim1Store]: treesize reduction 8, result has 80.5 percent of original size [2023-08-24 16:45:44,277 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 328 treesize of output 300 [2023-08-24 16:45:44,287 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-24 16:45:44,314 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 16:45:44,315 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 250 treesize of output 298 [2023-08-24 16:45:44,329 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-24 16:45:44,356 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 16:45:44,356 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 287 treesize of output 323 [2023-08-24 16:45:48,581 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 16:45:48,581 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 130 treesize of output 94 [2023-08-24 16:45:48,593 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 16:45:48,593 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 799 treesize of output 775 [2023-08-24 16:45:48,633 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 16:45:48,633 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 347 treesize of output 391 [2023-08-24 16:45:48,677 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 16:45:48,677 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 252 treesize of output 308 [2023-08-24 16:45:48,709 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 16:45:48,709 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 280 treesize of output 260 [2023-08-24 16:46:02,938 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 2 not checked. [2023-08-24 16:46:02,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [593883943] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 16:46:02,939 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 16:46:02,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 12] total 35 [2023-08-24 16:46:02,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143495150] [2023-08-24 16:46:02,939 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 16:46:02,939 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2023-08-24 16:46:02,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 16:46:02,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2023-08-24 16:46:02,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=1079, Unknown=4, NotChecked=134, Total=1332 [2023-08-24 16:46:02,941 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 340 [2023-08-24 16:46:02,947 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 363 places, 980 transitions, 22978 flow. Second operand has 37 states, 37 states have (on average 79.48648648648648) internal successors, (2941), 37 states have internal predecessors, (2941), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 16:46:02,948 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 16:46:02,948 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 340 [2023-08-24 16:46:02,948 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 16:46:03,787 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse7 (+ c_~j~0 1))) (let ((.cse0 (<= c_~n1~0 c_~q1_back~0)) (.cse1 (< c_~q1_back~0 0)) (.cse13 (< c_~q2_front~0 0)) (.cse15 (< c_~i~0 .cse7))) (and (or .cse0 .cse1 (let ((.cse9 (* c_~q2_back~0 4)) (.cse3 (+ (* c_~q1_back~0 4) c_~q1~0.offset)) (.cse4 (+ (* c_~q1_front~0 4) c_~q1~0.offset)) (.cse6 (* c_~q2_front~0 4))) (and (forall ((~q2~0.offset Int) (v_ArrVal_522 (Array Int Int)) (v_ArrVal_521 (Array Int Int))) (let ((.cse8 (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_521) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_522))) (or (forall ((v_ArrVal_523 (Array Int Int))) (let ((.cse5 (store .cse8 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_523))) (let ((.cse2 (select .cse5 c_~q1~0.base))) (or (not (= c_~j~0 (select .cse2 .cse3))) (< (select .cse2 .cse4) c_~j~0) (< (select (select .cse5 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ ~q2~0.offset .cse6)) .cse7))))) (not (= (select (select .cse8 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ ~q2~0.offset .cse9)) c_~i~0))))) (forall ((~q2~0.offset Int) (v_ArrVal_522 (Array Int Int)) (v_ArrVal_521 (Array Int Int))) (let ((.cse10 (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_521) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_522))) (or (not (= (select (select .cse10 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ ~q2~0.offset .cse9)) c_~i~0)) (forall ((v_ArrVal_523 (Array Int Int))) (let ((.cse12 (store .cse10 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_523))) (let ((.cse11 (select .cse12 c_~q1~0.base))) (or (not (= c_~j~0 (select .cse11 .cse3))) (< (select .cse11 .cse4) .cse7) (< (select (select .cse12 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ ~q2~0.offset .cse6)) c_~j~0)))))))))) .cse13) (or .cse0 (let ((.cse14 (forall ((|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_101| Int)) (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_101|) 0))))) (and (or .cse14 .cse15) (or .cse14 (= c_~q2_front~0 c_~q2_back~0)) (not (= (select |c_#valid| |c_ULTIMATE.start_main_~#t2~0#1.base|) 0)) (or (< c_~i~0 c_~j~0) .cse14 (= c_~q1_back~0 c_~q1_front~0)))) (< (+ 1 |c_ULTIMATE.start_create_fresh_int_array_~i~1#1|) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse1 .cse13) (<= c_~j~0 c_~i~0) .cse15))) is different from false [2023-08-24 16:46:04,178 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (<= c_~n1~0 c_~q1_back~0)) (.cse1 (< c_~q1_back~0 0)) (.cse9 (* c_~q2_back~0 4)) (.cse3 (+ (* c_~q1_back~0 4) c_~q1~0.offset)) (.cse6 (* c_~q2_front~0 4)) (.cse7 (+ c_~j~0 1)) (.cse4 (+ (* c_~q1_front~0 4) c_~q1~0.offset)) (.cse13 (< c_~q2_front~0 0))) (and (or .cse0 .cse1 (and (forall ((~q2~0.offset Int) (v_ArrVal_522 (Array Int Int)) (v_ArrVal_521 (Array Int Int))) (let ((.cse8 (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_521) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_522))) (or (forall ((v_ArrVal_523 (Array Int Int))) (let ((.cse5 (store .cse8 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_523))) (let ((.cse2 (select .cse5 c_~q1~0.base))) (or (not (= c_~j~0 (select .cse2 .cse3))) (< (select .cse2 .cse4) c_~j~0) (< (select (select .cse5 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ ~q2~0.offset .cse6)) .cse7))))) (not (= (select (select .cse8 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ ~q2~0.offset .cse9)) c_~i~0))))) (forall ((~q2~0.offset Int) (v_ArrVal_522 (Array Int Int)) (v_ArrVal_521 (Array Int Int))) (let ((.cse10 (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_521) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_522))) (or (not (= (select (select .cse10 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ ~q2~0.offset .cse9)) c_~i~0)) (forall ((v_ArrVal_523 (Array Int Int))) (let ((.cse12 (store .cse10 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_523))) (let ((.cse11 (select .cse12 c_~q1~0.base))) (or (not (= c_~j~0 (select .cse11 .cse3))) (< (select .cse11 .cse4) .cse7) (< (select (select .cse12 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ ~q2~0.offset .cse6)) c_~j~0))))))))) .cse13) (or .cse0 .cse1 (and (forall ((~q2~0.offset Int) (v_ArrVal_522 (Array Int Int))) (let ((.cse14 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_522))) (or (not (= c_~i~0 (select (select .cse14 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ ~q2~0.offset .cse9)))) (forall ((v_ArrVal_523 (Array Int Int))) (let ((.cse16 (store .cse14 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_523))) (let ((.cse15 (select .cse16 c_~q1~0.base))) (or (not (= c_~j~0 (select .cse15 .cse3))) (< (select .cse15 .cse4) .cse7) (< (select (select .cse16 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ ~q2~0.offset .cse6)) c_~j~0)))))))) (forall ((~q2~0.offset Int) (v_ArrVal_522 (Array Int Int))) (let ((.cse17 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_522))) (or (not (= c_~i~0 (select (select .cse17 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ ~q2~0.offset .cse9)))) (forall ((v_ArrVal_523 (Array Int Int))) (let ((.cse19 (store .cse17 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_523))) (let ((.cse18 (select .cse19 c_~q1~0.base))) (or (not (= c_~j~0 (select .cse18 .cse3))) (< (select (select .cse19 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ ~q2~0.offset .cse6)) .cse7) (< (select .cse18 .cse4) c_~j~0))))))))) .cse13))) is different from false [2023-08-24 16:46:05,927 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.73s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 16:46:05,932 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse5 (+ c_~j~0 1))) (and (or (<= c_~n1~0 c_~q1_back~0) (< c_~q1_back~0 0) (let ((.cse7 (* c_~q2_back~0 4)) (.cse1 (+ (* c_~q1_back~0 4) c_~q1~0.offset)) (.cse2 (+ (* c_~q1_front~0 4) c_~q1~0.offset)) (.cse4 (* c_~q2_front~0 4))) (and (forall ((~q2~0.offset Int) (v_ArrVal_522 (Array Int Int)) (v_ArrVal_521 (Array Int Int))) (let ((.cse6 (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_521) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_522))) (or (forall ((v_ArrVal_523 (Array Int Int))) (let ((.cse3 (store .cse6 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_523))) (let ((.cse0 (select .cse3 c_~q1~0.base))) (or (not (= c_~j~0 (select .cse0 .cse1))) (< (select .cse0 .cse2) c_~j~0) (< (select (select .cse3 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ ~q2~0.offset .cse4)) .cse5))))) (not (= (select (select .cse6 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ ~q2~0.offset .cse7)) c_~i~0))))) (forall ((~q2~0.offset Int) (v_ArrVal_522 (Array Int Int)) (v_ArrVal_521 (Array Int Int))) (let ((.cse8 (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_521) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_522))) (or (not (= (select (select .cse8 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ ~q2~0.offset .cse7)) c_~i~0)) (forall ((v_ArrVal_523 (Array Int Int))) (let ((.cse10 (store .cse8 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_523))) (let ((.cse9 (select .cse10 c_~q1~0.base))) (or (not (= c_~j~0 (select .cse9 .cse1))) (< (select .cse9 .cse2) .cse5) (< (select (select .cse10 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ ~q2~0.offset .cse4)) c_~j~0)))))))))) (< c_~q2_front~0 0)) (<= c_~j~0 c_~i~0) (< c_~i~0 .cse5))) is different from false [2023-08-24 16:46:13,000 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-24 16:46:48,062 WARN L234 SmtUtils]: Spent 34.58s on a formula simplification. DAG size of input: 119 DAG size of output: 107 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-24 16:46:55,772 INFO L124 PetriNetUnfolderBase]: 2714/5124 cut-off events. [2023-08-24 16:46:55,773 INFO L125 PetriNetUnfolderBase]: For 106661/106661 co-relation queries the response was YES. [2023-08-24 16:46:55,810 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52303 conditions, 5124 events. 2714/5124 cut-off events. For 106661/106661 co-relation queries the response was YES. Maximal size of possible extension queue 476. Compared 38240 event pairs, 246 based on Foata normal form. 12/5136 useless extension candidates. Maximal degree in co-relation 51973. Up to 2419 conditions per place. [2023-08-24 16:46:55,834 INFO L140 encePairwiseOnDemand]: 327/340 looper letters, 321 selfloop transitions, 879 changer transitions 17/1217 dead transitions. [2023-08-24 16:46:55,834 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 411 places, 1217 transitions, 29528 flow [2023-08-24 16:46:55,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2023-08-24 16:46:55,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2023-08-24 16:46:55,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 4111 transitions. [2023-08-24 16:46:55,845 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.24182352941176471 [2023-08-24 16:46:55,845 INFO L72 ComplementDD]: Start complementDD. Operand 50 states and 4111 transitions. [2023-08-24 16:46:55,845 INFO L73 IsDeterministic]: Start isDeterministic. Operand 50 states and 4111 transitions. [2023-08-24 16:46:55,847 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 16:46:55,847 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 50 states and 4111 transitions. [2023-08-24 16:46:55,852 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 51 states, 50 states have (on average 82.22) internal successors, (4111), 50 states have internal predecessors, (4111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 16:46:55,863 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 51 states, 51 states have (on average 340.0) internal successors, (17340), 51 states have internal predecessors, (17340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 16:46:55,986 INFO L81 ComplementDD]: Finished complementDD. Result has 51 states, 51 states have (on average 340.0) internal successors, (17340), 51 states have internal predecessors, (17340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 16:46:55,986 INFO L175 Difference]: Start difference. First operand has 363 places, 980 transitions, 22978 flow. Second operand 50 states and 4111 transitions. [2023-08-24 16:46:55,986 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 411 places, 1217 transitions, 29528 flow [2023-08-24 16:46:57,120 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 391 places, 1217 transitions, 29141 flow, removed 114 selfloop flow, removed 20 redundant places. [2023-08-24 16:46:57,142 INFO L231 Difference]: Finished difference. Result has 404 places, 1106 transitions, 28721 flow [2023-08-24 16:46:57,143 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=340, PETRI_DIFFERENCE_MINUEND_FLOW=22447, PETRI_DIFFERENCE_MINUEND_PLACES=342, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=972, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=746, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=183, PETRI_DIFFERENCE_SUBTRAHEND_STATES=50, PETRI_FLOW=28721, PETRI_PLACES=404, PETRI_TRANSITIONS=1106} [2023-08-24 16:46:57,143 INFO L281 CegarLoopForPetriNet]: 22 programPoint places, 382 predicate places. [2023-08-24 16:46:57,143 INFO L495 AbstractCegarLoop]: Abstraction has has 404 places, 1106 transitions, 28721 flow [2023-08-24 16:46:57,144 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 79.48648648648648) internal successors, (2941), 37 states have internal predecessors, (2941), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 16:46:57,144 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 16:46:57,144 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 16:46:57,150 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-08-24 16:46:57,348 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2023-08-24 16:46:57,348 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-24 16:46:57,348 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 16:46:57,348 INFO L85 PathProgramCache]: Analyzing trace with hash -739675636, now seen corresponding path program 12 times [2023-08-24 16:46:57,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 16:46:57,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663217090] [2023-08-24 16:46:57,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 16:46:57,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 16:46:57,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 16:46:57,428 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-24 16:46:57,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 16:46:57,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663217090] [2023-08-24 16:46:57,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [663217090] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 16:46:57,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1150697334] [2023-08-24 16:46:57,428 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-08-24 16:46:57,429 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 16:46:57,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 16:46:57,454 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-24 16:46:57,472 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-08-24 16:46:57,632 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2023-08-24 16:46:57,632 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-24 16:46:57,633 INFO L262 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 13 conjunts are in the unsatisfiable core [2023-08-24 16:46:57,634 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 16:46:57,727 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-24 16:46:57,727 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 16:46:57,891 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-24 16:46:57,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1150697334] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 16:46:57,892 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 16:46:57,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 18 [2023-08-24 16:46:57,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074932005] [2023-08-24 16:46:57,892 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 16:46:57,892 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-08-24 16:46:57,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 16:46:57,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-08-24 16:46:57,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=228, Unknown=0, NotChecked=0, Total=306 [2023-08-24 16:46:57,893 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 340 [2023-08-24 16:46:57,894 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 404 places, 1106 transitions, 28721 flow. Second operand has 18 states, 18 states have (on average 125.72222222222223) internal successors, (2263), 18 states have internal predecessors, (2263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 16:46:57,894 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 16:46:57,894 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 340 [2023-08-24 16:46:57,894 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 16:46:59,019 INFO L124 PetriNetUnfolderBase]: 1470/3009 cut-off events. [2023-08-24 16:46:59,019 INFO L125 PetriNetUnfolderBase]: For 87619/87619 co-relation queries the response was YES. [2023-08-24 16:46:59,038 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32287 conditions, 3009 events. 1470/3009 cut-off events. For 87619/87619 co-relation queries the response was YES. Maximal size of possible extension queue 307. Compared 22018 event pairs, 501 based on Foata normal form. 292/3301 useless extension candidates. Maximal degree in co-relation 32178. Up to 2150 conditions per place. [2023-08-24 16:46:59,047 INFO L140 encePairwiseOnDemand]: 334/340 looper letters, 519 selfloop transitions, 16 changer transitions 126/661 dead transitions. [2023-08-24 16:46:59,047 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 366 places, 661 transitions, 17608 flow [2023-08-24 16:46:59,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-24 16:46:59,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-24 16:46:59,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1033 transitions. [2023-08-24 16:46:59,049 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37977941176470587 [2023-08-24 16:46:59,049 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1033 transitions. [2023-08-24 16:46:59,049 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1033 transitions. [2023-08-24 16:46:59,049 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 16:46:59,049 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1033 transitions. [2023-08-24 16:46:59,050 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 129.125) internal successors, (1033), 8 states have internal predecessors, (1033), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 16:46:59,051 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 340.0) internal successors, (3060), 9 states have internal predecessors, (3060), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 16:46:59,051 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 340.0) internal successors, (3060), 9 states have internal predecessors, (3060), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 16:46:59,051 INFO L175 Difference]: Start difference. First operand has 404 places, 1106 transitions, 28721 flow. Second operand 8 states and 1033 transitions. [2023-08-24 16:46:59,051 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 366 places, 661 transitions, 17608 flow [2023-08-24 16:46:59,557 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 321 places, 661 transitions, 16614 flow, removed 187 selfloop flow, removed 45 redundant places. [2023-08-24 16:46:59,568 INFO L231 Difference]: Finished difference. Result has 324 places, 522 transitions, 12645 flow [2023-08-24 16:46:59,568 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=340, PETRI_DIFFERENCE_MINUEND_FLOW=14405, PETRI_DIFFERENCE_MINUEND_PLACES=314, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=614, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=598, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=12645, PETRI_PLACES=324, PETRI_TRANSITIONS=522} [2023-08-24 16:46:59,568 INFO L281 CegarLoopForPetriNet]: 22 programPoint places, 302 predicate places. [2023-08-24 16:46:59,569 INFO L495 AbstractCegarLoop]: Abstraction has has 324 places, 522 transitions, 12645 flow [2023-08-24 16:46:59,569 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 125.72222222222223) internal successors, (2263), 18 states have internal predecessors, (2263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 16:46:59,569 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 16:46:59,569 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 16:46:59,576 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-08-24 16:46:59,770 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 16:46:59,771 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-24 16:46:59,772 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 16:46:59,772 INFO L85 PathProgramCache]: Analyzing trace with hash -1867144729, now seen corresponding path program 13 times [2023-08-24 16:46:59,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 16:46:59,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901378350] [2023-08-24 16:46:59,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 16:46:59,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 16:46:59,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 16:47:01,432 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 16:47:01,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 16:47:01,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901378350] [2023-08-24 16:47:01,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1901378350] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 16:47:01,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [473781340] [2023-08-24 16:47:01,433 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-08-24 16:47:01,433 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 16:47:01,434 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 16:47:01,435 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-24 16:47:01,436 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-08-24 16:47:01,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 16:47:01,531 INFO L262 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 46 conjunts are in the unsatisfiable core [2023-08-24 16:47:01,532 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 16:47:01,561 INFO L322 Elim1Store]: treesize reduction 37, result has 32.7 percent of original size [2023-08-24 16:47:01,562 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 12 treesize of output 23 [2023-08-24 16:47:01,662 INFO L322 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2023-08-24 16:47:01,663 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 16 treesize of output 18 [2023-08-24 16:47:01,803 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 29 [2023-08-24 16:47:01,947 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 20 [2023-08-24 16:47:02,064 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-08-24 16:47:02,065 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 16:47:02,385 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse4 (+ c_~q2~0.offset (* c_~q2_front~0 4))) (.cse1 (* c_~q1_back~0 4)) (.cse2 (* c_~q1_front~0 4))) (and (forall ((v_ArrVal_611 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_611))) (or (forall ((~q1~0.offset Int)) (let ((.cse0 (select .cse3 c_~q1~0.base))) (or (not (= (select .cse0 (+ .cse1 ~q1~0.offset)) c_~j~0)) (< (select .cse0 (+ .cse2 ~q1~0.offset)) c_~N~0)))) (< (+ (select (select .cse3 c_~q2~0.base) .cse4) 1) c_~N~0)))) (forall ((v_ArrVal_611 (Array Int Int))) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_611))) (or (< (select (select .cse5 c_~q2~0.base) .cse4) c_~N~0) (forall ((~q1~0.offset Int)) (let ((.cse6 (select .cse5 c_~q1~0.base))) (or (not (= (select .cse6 (+ .cse1 ~q1~0.offset)) c_~j~0)) (< (+ (select .cse6 (+ .cse2 ~q1~0.offset)) 1) c_~N~0))))))))) is different from false [2023-08-24 16:47:02,483 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 16:47:02,484 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 204 treesize of output 372 [2023-08-24 16:47:02,517 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 16:47:02,518 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 143 treesize of output 166 [2023-08-24 16:47:02,547 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 16:47:02,548 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 125 treesize of output 148 [2023-08-24 16:48:02,580 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-24 16:48:02,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [473781340] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 16:48:02,580 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 16:48:02,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11, 10] total 34 [2023-08-24 16:48:02,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574936150] [2023-08-24 16:48:02,581 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 16:48:02,581 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2023-08-24 16:48:02,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 16:48:02,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2023-08-24 16:48:02,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=1077, Unknown=1, NotChecked=66, Total=1260 [2023-08-24 16:48:02,582 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 340 [2023-08-24 16:48:02,583 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 324 places, 522 transitions, 12645 flow. Second operand has 36 states, 36 states have (on average 80.55555555555556) internal successors, (2900), 36 states have internal predecessors, (2900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 16:48:02,583 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 16:48:02,583 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 340 [2023-08-24 16:48:02,584 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 16:48:06,097 INFO L124 PetriNetUnfolderBase]: 1451/2733 cut-off events. [2023-08-24 16:48:06,097 INFO L125 PetriNetUnfolderBase]: For 57852/57852 co-relation queries the response was YES. [2023-08-24 16:48:06,113 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28524 conditions, 2733 events. 1451/2733 cut-off events. For 57852/57852 co-relation queries the response was YES. Maximal size of possible extension queue 262. Compared 17768 event pairs, 52 based on Foata normal form. 2/2735 useless extension candidates. Maximal degree in co-relation 28438. Up to 1185 conditions per place. [2023-08-24 16:48:06,124 INFO L140 encePairwiseOnDemand]: 328/340 looper letters, 187 selfloop transitions, 526 changer transitions 6/719 dead transitions. [2023-08-24 16:48:06,124 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 306 places, 719 transitions, 18193 flow [2023-08-24 16:48:06,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2023-08-24 16:48:06,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2023-08-24 16:48:06,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 3062 transitions. [2023-08-24 16:48:06,128 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.24340222575516693 [2023-08-24 16:48:06,128 INFO L72 ComplementDD]: Start complementDD. Operand 37 states and 3062 transitions. [2023-08-24 16:48:06,128 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 3062 transitions. [2023-08-24 16:48:06,129 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 16:48:06,129 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 37 states and 3062 transitions. [2023-08-24 16:48:06,131 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 38 states, 37 states have (on average 82.75675675675676) internal successors, (3062), 37 states have internal predecessors, (3062), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 16:48:06,136 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 38 states, 38 states have (on average 340.0) internal successors, (12920), 38 states have internal predecessors, (12920), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 16:48:06,136 INFO L81 ComplementDD]: Finished complementDD. Result has 38 states, 38 states have (on average 340.0) internal successors, (12920), 38 states have internal predecessors, (12920), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 16:48:06,137 INFO L175 Difference]: Start difference. First operand has 324 places, 522 transitions, 12645 flow. Second operand 37 states and 3062 transitions. [2023-08-24 16:48:06,137 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 306 places, 719 transitions, 18193 flow [2023-08-24 16:48:06,502 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 282 places, 719 transitions, 17454 flow, removed 139 selfloop flow, removed 24 redundant places. [2023-08-24 16:48:06,514 INFO L231 Difference]: Finished difference. Result has 293 places, 663 transitions, 17517 flow [2023-08-24 16:48:06,515 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=340, PETRI_DIFFERENCE_MINUEND_FLOW=12162, PETRI_DIFFERENCE_MINUEND_PLACES=246, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=522, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=389, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=37, PETRI_FLOW=17517, PETRI_PLACES=293, PETRI_TRANSITIONS=663} [2023-08-24 16:48:06,515 INFO L281 CegarLoopForPetriNet]: 22 programPoint places, 271 predicate places. [2023-08-24 16:48:06,515 INFO L495 AbstractCegarLoop]: Abstraction has has 293 places, 663 transitions, 17517 flow [2023-08-24 16:48:06,515 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 80.55555555555556) internal successors, (2900), 36 states have internal predecessors, (2900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 16:48:06,515 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 16:48:06,515 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 16:48:06,521 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2023-08-24 16:48:06,720 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 16:48:06,721 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-24 16:48:06,721 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 16:48:06,721 INFO L85 PathProgramCache]: Analyzing trace with hash -1811733469, now seen corresponding path program 14 times [2023-08-24 16:48:06,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 16:48:06,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061227230] [2023-08-24 16:48:06,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 16:48:06,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 16:48:06,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 16:48:07,898 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 16:48:07,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 16:48:07,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061227230] [2023-08-24 16:48:07,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1061227230] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 16:48:07,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [112513229] [2023-08-24 16:48:07,898 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-24 16:48:07,899 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 16:48:07,899 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 16:48:07,899 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-24 16:48:07,901 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-08-24 16:48:07,997 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-24 16:48:07,997 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-24 16:48:07,999 INFO L262 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 44 conjunts are in the unsatisfiable core [2023-08-24 16:48:08,000 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 16:48:08,174 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-24 16:48:08,174 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2023-08-24 16:48:08,324 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-08-24 16:48:08,325 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 16:48:08,527 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse2 (* c_~q1_back~0 4)) (.cse4 (+ c_~q2~0.offset (* c_~q2_front~0 4))) (.cse5 (* c_~q1_front~0 4))) (and (forall ((~q1~0.offset Int) (v_ArrVal_658 (Array Int Int)) (~q1~0.base Int)) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_658))) (let ((.cse1 (select .cse3 ~q1~0.base))) (let ((.cse0 (select .cse1 (+ .cse5 ~q1~0.offset)))) (or (< (+ .cse0 1) c_~N~0) (not (= (select .cse1 (+ .cse2 ~q1~0.offset)) c_~j~0)) (<= (select (select .cse3 c_~q2~0.base) .cse4) .cse0)))))) (forall ((~q1~0.offset Int) (v_ArrVal_658 (Array Int Int)) (~q1~0.base Int)) (let ((.cse8 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_658))) (let ((.cse7 (select .cse8 ~q1~0.base))) (let ((.cse6 (select .cse7 (+ .cse5 ~q1~0.offset)))) (or (< (+ .cse6 1) c_~N~0) (not (= (select .cse7 (+ .cse2 ~q1~0.offset)) c_~j~0)) (< .cse6 (+ (select (select .cse8 c_~q2~0.base) .cse4) 1))))))))) is different from false [2023-08-24 16:48:08,624 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 16:48:08,625 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 348 treesize of output 480 [2023-08-24 16:48:08,660 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 16:48:08,661 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 239 treesize of output 244 [2023-08-24 16:48:08,732 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 16:48:08,732 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 203 treesize of output 208 Received shutdown request... [2023-08-24 16:48:45,001 WARN L266 SmtUtils]: Removed 2 from assertion stack [2023-08-24 16:48:45,007 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-08-24 16:48:45,007 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-08-24 16:48:45,008 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2023-08-24 16:48:45,014 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2023-08-24 16:48:45,213 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2023-08-24 16:48:45,214 WARN L619 AbstractCegarLoop]: Verification canceled: while CegarLoopForPetriNet was analyzing trace of length 22 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 32ms.. [2023-08-24 16:48:45,215 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2023-08-24 16:48:45,215 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2023-08-24 16:48:45,215 INFO L445 BasicCegarLoop]: Path program histogram: [14, 2, 2, 1, 1, 1] [2023-08-24 16:48:45,218 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-24 16:48:45,218 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-24 16:48:45,223 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.08 04:48:45 BasicIcfg [2023-08-24 16:48:45,223 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-24 16:48:45,224 INFO L158 Benchmark]: Toolchain (without parser) took 852080.73ms. Allocated memory was 379.6MB in the beginning and 1.6GB in the end (delta: 1.2GB). Free memory was 355.6MB in the beginning and 495.5MB in the end (delta: -139.9MB). Peak memory consumption was 1.1GB. Max. memory is 16.0GB. [2023-08-24 16:48:45,224 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 379.6MB. Free memory is still 356.5MB. There was no memory consumed. Max. memory is 16.0GB. [2023-08-24 16:48:45,224 INFO L158 Benchmark]: CACSL2BoogieTranslator took 230.58ms. Allocated memory is still 379.6MB. Free memory was 355.6MB in the beginning and 343.7MB in the end (delta: 11.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.0GB. [2023-08-24 16:48:45,224 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.62ms. Allocated memory is still 379.6MB. Free memory was 343.7MB in the beginning and 341.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-24 16:48:45,225 INFO L158 Benchmark]: Boogie Preprocessor took 28.05ms. Allocated memory is still 379.6MB. Free memory was 341.6MB in the beginning and 339.9MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-24 16:48:45,228 INFO L158 Benchmark]: RCFGBuilder took 423.21ms. Allocated memory is still 379.6MB. Free memory was 339.9MB in the beginning and 310.5MB in the end (delta: 29.4MB). Peak memory consumption was 29.4MB. Max. memory is 16.0GB. [2023-08-24 16:48:45,228 INFO L158 Benchmark]: TraceAbstraction took 851352.23ms. Allocated memory was 379.6MB in the beginning and 1.6GB in the end (delta: 1.2GB). Free memory was 309.7MB in the beginning and 495.5MB in the end (delta: -185.8MB). Peak memory consumption was 1.0GB. Max. memory is 16.0GB. [2023-08-24 16:48:45,229 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 379.6MB. Free memory is still 356.5MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 230.58ms. Allocated memory is still 379.6MB. Free memory was 355.6MB in the beginning and 343.7MB in the end (delta: 11.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 40.62ms. Allocated memory is still 379.6MB. Free memory was 343.7MB in the beginning and 341.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 28.05ms. Allocated memory is still 379.6MB. Free memory was 341.6MB in the beginning and 339.9MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 423.21ms. Allocated memory is still 379.6MB. Free memory was 339.9MB in the beginning and 310.5MB in the end (delta: 29.4MB). Peak memory consumption was 29.4MB. Max. memory is 16.0GB. * TraceAbstraction took 851352.23ms. Allocated memory was 379.6MB in the beginning and 1.6GB in the end (delta: 1.2GB). Free memory was 309.7MB in the beginning and 495.5MB in the end (delta: -185.8MB). Peak memory consumption was 1.0GB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.4s, 156 PlacesBefore, 22 PlacesAfterwards, 162 TransitionsBefore, 19 TransitionsAfterwards, 500 CoEnabledTransitionPairs, 8 FixpointIterations, 117 TrivialSequentialCompositions, 17 ConcurrentSequentialCompositions, 21 TrivialYvCompositions, 4 ConcurrentYvCompositions, 9 ChoiceCompositions, 168 TotalNumberOfCompositions, 854 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 727, independent: 681, independent conditional: 0, independent unconditional: 681, dependent: 46, dependent conditional: 0, dependent unconditional: 46, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 274, independent: 263, independent conditional: 0, independent unconditional: 263, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 727, independent: 418, independent conditional: 0, independent unconditional: 418, dependent: 35, dependent conditional: 0, dependent unconditional: 35, unknown: 274, unknown conditional: 0, unknown unconditional: 274] , Statistics on independence cache: Total cache size (in pairs): 26, Positive cache size: 23, Positive conditional cache size: 0, Positive unconditional cache size: 23, Negative cache size: 3, Negative conditional cache size: 0, Negative unconditional cache size: 3, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - TimeoutResultAtElement [Line: 102]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while CegarLoopForPetriNet was analyzing trace of length 22 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 32ms.. - TimeoutResultAtElement [Line: 96]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNet was analyzing trace of length 22 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 32ms.. - TimeoutResultAtElement [Line: 97]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNet was analyzing trace of length 22 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 32ms.. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 180 locations, 3 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 851.2s, OverallIterations: 21, TraceHistogramMax: 2, PathProgramHistogramMax: 14, EmptinessCheckTime: 0.0s, AutomataDifference: 460.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.5s, HoareTripleCheckerStatistics: 116 mSolverCounterUnknown, 2515 SdHoareTripleChecker+Valid, 31.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2515 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 29.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 1590 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 762 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 13310 IncrementalHoareTripleChecker+Invalid, 15778 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 762 mSolverCounterUnsat, 0 mSDtfsCounter, 13310 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 116 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 903 GetRequests, 212 SyntacticMatches, 16 SemanticMatches, 675 ConstructedPredicates, 13 IntricatePredicates, 0 DeprecatedPredicates, 9585 ImplicationChecksByTransitivity, 427.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=28721occurred in iteration=18, InterpolantAutomatonStates: 466, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 342.2s InterpolantComputationTime, 574 NumberOfCodeBlocks, 574 NumberOfCodeBlocksAsserted, 44 NumberOfCheckSat, 746 ConstructedInterpolants, 67 QuantifiedInterpolants, 23398 SizeOfPredicates, 272 NumberOfNonLiveVariables, 2696 ConjunctsInSsa, 548 ConjunctsInUnsatCore, 42 InterpolantComputations, 9 PerfectInterpolantSequences, 58/176 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown