/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-more-inc-subseq.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-24 15:34:05,112 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-24 15:34:05,191 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf [2023-08-24 15:34:05,199 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-24 15:34:05,200 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-24 15:34:05,233 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-24 15:34:05,234 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-24 15:34:05,238 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-24 15:34:05,239 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-24 15:34:05,243 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-24 15:34:05,243 INFO L153 SettingsManager]: * Use SBE=true [2023-08-24 15:34:05,243 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-24 15:34:05,244 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-24 15:34:05,245 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-24 15:34:05,245 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-24 15:34:05,245 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-24 15:34:05,245 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-24 15:34:05,245 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-24 15:34:05,246 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-24 15:34:05,246 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-24 15:34:05,246 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-24 15:34:05,247 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-24 15:34:05,247 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-24 15:34:05,248 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-24 15:34:05,248 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-24 15:34:05,248 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-24 15:34:05,248 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-24 15:34:05,248 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-24 15:34:05,249 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-24 15:34:05,249 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-24 15:34:05,250 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-24 15:34:05,250 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-24 15:34:05,250 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-24 15:34:05,250 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-24 15:34:05,250 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-24 15:34:05,251 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Order of the error locations to be checked -> PROGRAM_FIRST [2023-08-24 15:34:05,549 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-24 15:34:05,565 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-24 15:34:05,568 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-24 15:34:05,568 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-24 15:34:05,569 INFO L274 PluginConnector]: CDTParser initialized [2023-08-24 15:34:05,570 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-more-inc-subseq.wvr.c [2023-08-24 15:34:06,850 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-24 15:34:07,027 INFO L384 CDTParser]: Found 1 translation units. [2023-08-24 15:34:07,027 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-inc-subseq.wvr.c [2023-08-24 15:34:07,037 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aaea5974e/da8c37424aa043d5a85bc5bca9a11798/FLAG5aab7fddd [2023-08-24 15:34:07,052 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aaea5974e/da8c37424aa043d5a85bc5bca9a11798 [2023-08-24 15:34:07,055 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-24 15:34:07,056 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-24 15:34:07,059 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-24 15:34:07,059 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-24 15:34:07,062 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-24 15:34:07,064 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.08 03:34:07" (1/1) ... [2023-08-24 15:34:07,065 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6d1ca17 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 03:34:07, skipping insertion in model container [2023-08-24 15:34:07,065 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.08 03:34:07" (1/1) ... [2023-08-24 15:34:07,089 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-24 15:34:07,221 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-more-inc-subseq.wvr.c[2924,2937] [2023-08-24 15:34:07,226 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-24 15:34:07,234 INFO L201 MainTranslator]: Completed pre-run [2023-08-24 15:34:07,253 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-more-inc-subseq.wvr.c[2924,2937] [2023-08-24 15:34:07,256 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-24 15:34:07,264 WARN L669 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-24 15:34:07,264 WARN L669 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-24 15:34:07,270 INFO L206 MainTranslator]: Completed translation [2023-08-24 15:34:07,270 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 03:34:07 WrapperNode [2023-08-24 15:34:07,270 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-24 15:34:07,271 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-24 15:34:07,271 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-24 15:34:07,271 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-24 15:34:07,277 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 03:34:07" (1/1) ... [2023-08-24 15:34:07,296 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 03:34:07" (1/1) ... [2023-08-24 15:34:07,338 INFO L138 Inliner]: procedures = 24, calls = 45, calls flagged for inlining = 11, calls inlined = 13, statements flattened = 198 [2023-08-24 15:34:07,338 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-24 15:34:07,339 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-24 15:34:07,339 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-24 15:34:07,339 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-24 15:34:07,346 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 03:34:07" (1/1) ... [2023-08-24 15:34:07,347 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 03:34:07" (1/1) ... [2023-08-24 15:34:07,349 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 03:34:07" (1/1) ... [2023-08-24 15:34:07,349 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 03:34:07" (1/1) ... [2023-08-24 15:34:07,356 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 03:34:07" (1/1) ... [2023-08-24 15:34:07,368 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 03:34:07" (1/1) ... [2023-08-24 15:34:07,376 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 03:34:07" (1/1) ... [2023-08-24 15:34:07,377 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 03:34:07" (1/1) ... [2023-08-24 15:34:07,379 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-24 15:34:07,383 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-24 15:34:07,384 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-24 15:34:07,384 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-24 15:34:07,385 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 03:34:07" (1/1) ... [2023-08-24 15:34:07,389 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-24 15:34:07,399 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 15:34:07,414 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-24 15:34:07,422 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-24 15:34:07,455 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-24 15:34:07,455 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-08-24 15:34:07,456 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-08-24 15:34:07,456 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-08-24 15:34:07,456 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-08-24 15:34:07,456 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-24 15:34:07,457 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-24 15:34:07,457 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-24 15:34:07,457 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-24 15:34:07,457 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-24 15:34:07,457 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-08-24 15:34:07,457 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-24 15:34:07,457 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-24 15:34:07,457 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-24 15:34:07,458 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-24 15:34:07,460 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-24 15:34:07,581 INFO L236 CfgBuilder]: Building ICFG [2023-08-24 15:34:07,584 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-24 15:34:07,905 INFO L277 CfgBuilder]: Performing block encoding [2023-08-24 15:34:08,001 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-24 15:34:08,001 INFO L302 CfgBuilder]: Removed 4 assume(true) statements. [2023-08-24 15:34:08,003 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.08 03:34:08 BoogieIcfgContainer [2023-08-24 15:34:08,004 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-24 15:34:08,006 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-24 15:34:08,006 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-24 15:34:08,009 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-24 15:34:08,010 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.08 03:34:07" (1/3) ... [2023-08-24 15:34:08,010 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f99ed5f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.08 03:34:08, skipping insertion in model container [2023-08-24 15:34:08,010 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 03:34:07" (2/3) ... [2023-08-24 15:34:08,011 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f99ed5f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.08 03:34:08, skipping insertion in model container [2023-08-24 15:34:08,011 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.08 03:34:08" (3/3) ... [2023-08-24 15:34:08,017 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-inc-subseq.wvr.c [2023-08-24 15:34:08,036 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-24 15:34:08,036 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-08-24 15:34:08,037 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-24 15:34:08,113 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-08-24 15:34:08,143 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 172 places, 180 transitions, 376 flow [2023-08-24 15:34:08,220 INFO L124 PetriNetUnfolderBase]: 15/178 cut-off events. [2023-08-24 15:34:08,220 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-08-24 15:34:08,225 INFO L83 FinitePrefix]: Finished finitePrefix Result has 187 conditions, 178 events. 15/178 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 108 event pairs, 0 based on Foata normal form. 0/162 useless extension candidates. Maximal degree in co-relation 145. Up to 2 conditions per place. [2023-08-24 15:34:08,225 INFO L82 GeneralOperation]: Start removeDead. Operand has 172 places, 180 transitions, 376 flow [2023-08-24 15:34:08,230 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 162 places, 170 transitions, 352 flow [2023-08-24 15:34:08,233 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-24 15:34:08,244 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 162 places, 170 transitions, 352 flow [2023-08-24 15:34:08,247 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 162 places, 170 transitions, 352 flow [2023-08-24 15:34:08,247 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 162 places, 170 transitions, 352 flow [2023-08-24 15:34:08,285 INFO L124 PetriNetUnfolderBase]: 15/170 cut-off events. [2023-08-24 15:34:08,286 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-08-24 15:34:08,287 INFO L83 FinitePrefix]: Finished finitePrefix Result has 179 conditions, 170 events. 15/170 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 107 event pairs, 0 based on Foata normal form. 0/155 useless extension candidates. Maximal degree in co-relation 145. Up to 2 conditions per place. [2023-08-24 15:34:08,288 INFO L119 LiptonReduction]: Number of co-enabled transitions 690 [2023-08-24 15:34:13,878 INFO L134 LiptonReduction]: Checked pairs total: 1213 [2023-08-24 15:34:13,879 INFO L136 LiptonReduction]: Total number of compositions: 176 [2023-08-24 15:34:13,893 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-24 15:34:13,898 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;@31369884, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-24 15:34:13,898 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-08-24 15:34:13,904 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-24 15:34:13,904 INFO L124 PetriNetUnfolderBase]: 5/22 cut-off events. [2023-08-24 15:34:13,904 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-08-24 15:34:13,904 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 15:34:13,905 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 15:34:13,905 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 15:34:13,909 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 15:34:13,910 INFO L85 PathProgramCache]: Analyzing trace with hash -2006983299, now seen corresponding path program 1 times [2023-08-24 15:34:13,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 15:34:13,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903074791] [2023-08-24 15:34:13,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 15:34:13,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 15:34:14,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 15:34:14,354 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 15:34:14,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 15:34:14,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903074791] [2023-08-24 15:34:14,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [903074791] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 15:34:14,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 15:34:14,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-24 15:34:14,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083756155] [2023-08-24 15:34:14,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 15:34:14,364 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-24 15:34:14,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 15:34:14,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-24 15:34:14,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-24 15:34:14,387 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 151 out of 356 [2023-08-24 15:34:14,390 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 23 transitions, 58 flow. Second operand has 4 states, 4 states have (on average 154.5) internal successors, (618), 4 states have internal predecessors, (618), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 15:34:14,390 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 15:34:14,391 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 356 [2023-08-24 15:34:14,391 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 15:34:14,483 INFO L124 PetriNetUnfolderBase]: 157/260 cut-off events. [2023-08-24 15:34:14,484 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2023-08-24 15:34:14,485 INFO L83 FinitePrefix]: Finished finitePrefix Result has 549 conditions, 260 events. 157/260 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 820 event pairs, 39 based on Foata normal form. 0/208 useless extension candidates. Maximal degree in co-relation 490. Up to 169 conditions per place. [2023-08-24 15:34:14,487 INFO L140 encePairwiseOnDemand]: 351/356 looper letters, 31 selfloop transitions, 4 changer transitions 0/35 dead transitions. [2023-08-24 15:34:14,487 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 35 transitions, 155 flow [2023-08-24 15:34:14,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-24 15:34:14,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-24 15:34:14,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 640 transitions. [2023-08-24 15:34:14,502 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.449438202247191 [2023-08-24 15:34:14,503 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 640 transitions. [2023-08-24 15:34:14,503 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 640 transitions. [2023-08-24 15:34:14,505 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 15:34:14,507 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 640 transitions. [2023-08-24 15:34:14,512 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 160.0) internal successors, (640), 4 states have internal predecessors, (640), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 15:34:14,517 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 356.0) internal successors, (1780), 5 states have internal predecessors, (1780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 15:34:14,518 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 356.0) internal successors, (1780), 5 states have internal predecessors, (1780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 15:34:14,520 INFO L175 Difference]: Start difference. First operand has 25 places, 23 transitions, 58 flow. Second operand 4 states and 640 transitions. [2023-08-24 15:34:14,521 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 35 transitions, 155 flow [2023-08-24 15:34:14,523 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 24 places, 35 transitions, 145 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-24 15:34:14,524 INFO L231 Difference]: Finished difference. Result has 25 places, 25 transitions, 71 flow [2023-08-24 15:34:14,526 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=356, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=21, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=71, PETRI_PLACES=25, PETRI_TRANSITIONS=25} [2023-08-24 15:34:14,528 INFO L281 CegarLoopForPetriNet]: 25 programPoint places, 0 predicate places. [2023-08-24 15:34:14,529 INFO L495 AbstractCegarLoop]: Abstraction has has 25 places, 25 transitions, 71 flow [2023-08-24 15:34:14,529 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 154.5) internal successors, (618), 4 states have internal predecessors, (618), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 15:34:14,529 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 15:34:14,529 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 15:34:14,530 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-24 15:34:14,530 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 15:34:14,530 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 15:34:14,531 INFO L85 PathProgramCache]: Analyzing trace with hash 1822843996, now seen corresponding path program 1 times [2023-08-24 15:34:14,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 15:34:14,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169997389] [2023-08-24 15:34:14,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 15:34:14,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 15:34:14,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 15:34:14,716 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 15:34:14,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 15:34:14,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169997389] [2023-08-24 15:34:14,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1169997389] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 15:34:14,717 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 15:34:14,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-24 15:34:14,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198972836] [2023-08-24 15:34:14,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 15:34:14,719 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-24 15:34:14,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 15:34:14,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-24 15:34:14,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-08-24 15:34:14,721 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 356 [2023-08-24 15:34:14,722 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 25 transitions, 71 flow. Second operand has 5 states, 5 states have (on average 130.2) internal successors, (651), 5 states have internal predecessors, (651), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 15:34:14,722 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 15:34:14,723 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 356 [2023-08-24 15:34:14,723 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 15:34:14,825 INFO L124 PetriNetUnfolderBase]: 157/261 cut-off events. [2023-08-24 15:34:14,825 INFO L125 PetriNetUnfolderBase]: For 18/18 co-relation queries the response was YES. [2023-08-24 15:34:14,826 INFO L83 FinitePrefix]: Finished finitePrefix Result has 608 conditions, 261 events. 157/261 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 827 event pairs, 39 based on Foata normal form. 1/241 useless extension candidates. Maximal degree in co-relation 179. Up to 169 conditions per place. [2023-08-24 15:34:14,827 INFO L140 encePairwiseOnDemand]: 350/356 looper letters, 31 selfloop transitions, 5 changer transitions 0/36 dead transitions. [2023-08-24 15:34:14,828 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 36 transitions, 166 flow [2023-08-24 15:34:14,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-24 15:34:14,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-24 15:34:14,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 545 transitions. [2023-08-24 15:34:14,830 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3827247191011236 [2023-08-24 15:34:14,830 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 545 transitions. [2023-08-24 15:34:14,831 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 545 transitions. [2023-08-24 15:34:14,831 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 15:34:14,831 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 545 transitions. [2023-08-24 15:34:14,832 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 136.25) internal successors, (545), 4 states have internal predecessors, (545), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 15:34:14,836 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 356.0) internal successors, (1780), 5 states have internal predecessors, (1780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 15:34:14,836 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 356.0) internal successors, (1780), 5 states have internal predecessors, (1780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 15:34:14,837 INFO L175 Difference]: Start difference. First operand has 25 places, 25 transitions, 71 flow. Second operand 4 states and 545 transitions. [2023-08-24 15:34:14,837 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 36 transitions, 166 flow [2023-08-24 15:34:14,838 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 36 transitions, 161 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-24 15:34:14,838 INFO L231 Difference]: Finished difference. Result has 27 places, 26 transitions, 84 flow [2023-08-24 15:34:14,838 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=356, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=84, PETRI_PLACES=27, PETRI_TRANSITIONS=26} [2023-08-24 15:34:14,839 INFO L281 CegarLoopForPetriNet]: 25 programPoint places, 2 predicate places. [2023-08-24 15:34:14,839 INFO L495 AbstractCegarLoop]: Abstraction has has 27 places, 26 transitions, 84 flow [2023-08-24 15:34:14,840 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 130.2) internal successors, (651), 5 states have internal predecessors, (651), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 15:34:14,840 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 15:34:14,840 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 15:34:14,840 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-24 15:34:14,840 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 15:34:14,841 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 15:34:14,841 INFO L85 PathProgramCache]: Analyzing trace with hash 895958579, now seen corresponding path program 1 times [2023-08-24 15:34:14,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 15:34:14,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789307434] [2023-08-24 15:34:14,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 15:34:14,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 15:34:14,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 15:34:14,956 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-24 15:34:14,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 15:34:14,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789307434] [2023-08-24 15:34:14,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1789307434] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 15:34:14,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 15:34:14,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-24 15:34:14,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997129807] [2023-08-24 15:34:14,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 15:34:14,957 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-24 15:34:14,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 15:34:14,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-24 15:34:14,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-24 15:34:14,959 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 149 out of 356 [2023-08-24 15:34:14,960 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 26 transitions, 84 flow. Second operand has 4 states, 4 states have (on average 153.25) internal successors, (613), 4 states have internal predecessors, (613), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 15:34:14,960 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 15:34:14,960 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 149 of 356 [2023-08-24 15:34:14,960 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 15:34:15,076 INFO L124 PetriNetUnfolderBase]: 217/357 cut-off events. [2023-08-24 15:34:15,076 INFO L125 PetriNetUnfolderBase]: For 63/63 co-relation queries the response was YES. [2023-08-24 15:34:15,077 INFO L83 FinitePrefix]: Finished finitePrefix Result has 834 conditions, 357 events. 217/357 cut-off events. For 63/63 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1284 event pairs, 33 based on Foata normal form. 0/337 useless extension candidates. Maximal degree in co-relation 810. Up to 124 conditions per place. [2023-08-24 15:34:15,079 INFO L140 encePairwiseOnDemand]: 350/356 looper letters, 36 selfloop transitions, 13 changer transitions 0/49 dead transitions. [2023-08-24 15:34:15,079 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 49 transitions, 244 flow [2023-08-24 15:34:15,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-24 15:34:15,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-24 15:34:15,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 791 transitions. [2023-08-24 15:34:15,081 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4443820224719101 [2023-08-24 15:34:15,081 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 791 transitions. [2023-08-24 15:34:15,081 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 791 transitions. [2023-08-24 15:34:15,082 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 15:34:15,082 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 791 transitions. [2023-08-24 15:34:15,084 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 158.2) internal successors, (791), 5 states have internal predecessors, (791), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 15:34:15,087 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 356.0) internal successors, (2136), 6 states have internal predecessors, (2136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 15:34:15,088 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 356.0) internal successors, (2136), 6 states have internal predecessors, (2136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 15:34:15,088 INFO L175 Difference]: Start difference. First operand has 27 places, 26 transitions, 84 flow. Second operand 5 states and 791 transitions. [2023-08-24 15:34:15,088 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 49 transitions, 244 flow [2023-08-24 15:34:15,089 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 49 transitions, 230 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-08-24 15:34:15,090 INFO L231 Difference]: Finished difference. Result has 32 places, 34 transitions, 154 flow [2023-08-24 15:34:15,090 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=356, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=154, PETRI_PLACES=32, PETRI_TRANSITIONS=34} [2023-08-24 15:34:15,091 INFO L281 CegarLoopForPetriNet]: 25 programPoint places, 7 predicate places. [2023-08-24 15:34:15,091 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 34 transitions, 154 flow [2023-08-24 15:34:15,091 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 153.25) internal successors, (613), 4 states have internal predecessors, (613), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 15:34:15,091 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 15:34:15,092 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 15:34:15,092 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-24 15:34:15,092 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 15:34:15,092 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 15:34:15,092 INFO L85 PathProgramCache]: Analyzing trace with hash -62373143, now seen corresponding path program 2 times [2023-08-24 15:34:15,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 15:34:15,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44160480] [2023-08-24 15:34:15,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 15:34:15,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 15:34:15,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 15:34:15,204 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-24 15:34:15,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 15:34:15,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44160480] [2023-08-24 15:34:15,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [44160480] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 15:34:15,205 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 15:34:15,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-24 15:34:15,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342965622] [2023-08-24 15:34:15,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 15:34:15,207 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-24 15:34:15,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 15:34:15,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-24 15:34:15,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-24 15:34:15,209 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 158 out of 356 [2023-08-24 15:34:15,210 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 34 transitions, 154 flow. Second operand has 3 states, 3 states have (on average 163.33333333333334) internal successors, (490), 3 states have internal predecessors, (490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 15:34:15,210 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 15:34:15,210 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 158 of 356 [2023-08-24 15:34:15,210 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 15:34:15,311 INFO L124 PetriNetUnfolderBase]: 283/475 cut-off events. [2023-08-24 15:34:15,312 INFO L125 PetriNetUnfolderBase]: For 513/520 co-relation queries the response was YES. [2023-08-24 15:34:15,313 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1406 conditions, 475 events. 283/475 cut-off events. For 513/520 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 1819 event pairs, 81 based on Foata normal form. 3/466 useless extension candidates. Maximal degree in co-relation 1382. Up to 244 conditions per place. [2023-08-24 15:34:15,316 INFO L140 encePairwiseOnDemand]: 353/356 looper letters, 44 selfloop transitions, 2 changer transitions 2/53 dead transitions. [2023-08-24 15:34:15,316 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 53 transitions, 347 flow [2023-08-24 15:34:15,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-24 15:34:15,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-24 15:34:15,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 508 transitions. [2023-08-24 15:34:15,318 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4756554307116105 [2023-08-24 15:34:15,318 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 508 transitions. [2023-08-24 15:34:15,318 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 508 transitions. [2023-08-24 15:34:15,318 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 15:34:15,318 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 508 transitions. [2023-08-24 15:34:15,320 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 169.33333333333334) internal successors, (508), 3 states have internal predecessors, (508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 15:34:15,322 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 356.0) internal successors, (1424), 4 states have internal predecessors, (1424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 15:34:15,322 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 356.0) internal successors, (1424), 4 states have internal predecessors, (1424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 15:34:15,323 INFO L175 Difference]: Start difference. First operand has 32 places, 34 transitions, 154 flow. Second operand 3 states and 508 transitions. [2023-08-24 15:34:15,323 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 53 transitions, 347 flow [2023-08-24 15:34:15,327 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 53 transitions, 347 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-24 15:34:15,329 INFO L231 Difference]: Finished difference. Result has 35 places, 35 transitions, 166 flow [2023-08-24 15:34:15,329 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=356, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=166, PETRI_PLACES=35, PETRI_TRANSITIONS=35} [2023-08-24 15:34:15,330 INFO L281 CegarLoopForPetriNet]: 25 programPoint places, 10 predicate places. [2023-08-24 15:34:15,330 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 35 transitions, 166 flow [2023-08-24 15:34:15,331 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 163.33333333333334) internal successors, (490), 3 states have internal predecessors, (490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 15:34:15,331 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 15:34:15,331 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 15:34:15,331 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-24 15:34:15,331 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 15:34:15,332 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 15:34:15,332 INFO L85 PathProgramCache]: Analyzing trace with hash 659062640, now seen corresponding path program 1 times [2023-08-24 15:34:15,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 15:34:15,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837773682] [2023-08-24 15:34:15,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 15:34:15,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 15:34:15,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 15:34:15,581 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 15:34:15,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 15:34:15,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [837773682] [2023-08-24 15:34:15,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [837773682] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 15:34:15,582 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 15:34:15,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-24 15:34:15,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520573954] [2023-08-24 15:34:15,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 15:34:15,583 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-24 15:34:15,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 15:34:15,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-24 15:34:15,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-24 15:34:15,585 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 145 out of 356 [2023-08-24 15:34:15,586 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 35 transitions, 166 flow. Second operand has 5 states, 5 states have (on average 148.8) internal successors, (744), 5 states have internal predecessors, (744), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 15:34:15,588 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 15:34:15,588 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 145 of 356 [2023-08-24 15:34:15,593 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 15:34:15,704 INFO L124 PetriNetUnfolderBase]: 307/530 cut-off events. [2023-08-24 15:34:15,704 INFO L125 PetriNetUnfolderBase]: For 459/459 co-relation queries the response was YES. [2023-08-24 15:34:15,705 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1679 conditions, 530 events. 307/530 cut-off events. For 459/459 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 2069 event pairs, 70 based on Foata normal form. 26/556 useless extension candidates. Maximal degree in co-relation 1652. Up to 403 conditions per place. [2023-08-24 15:34:15,708 INFO L140 encePairwiseOnDemand]: 351/356 looper letters, 43 selfloop transitions, 2 changer transitions 15/60 dead transitions. [2023-08-24 15:34:15,708 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 60 transitions, 382 flow [2023-08-24 15:34:15,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-24 15:34:15,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-24 15:34:15,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 773 transitions. [2023-08-24 15:34:15,710 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43426966292134833 [2023-08-24 15:34:15,710 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 773 transitions. [2023-08-24 15:34:15,711 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 773 transitions. [2023-08-24 15:34:15,711 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 15:34:15,711 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 773 transitions. [2023-08-24 15:34:15,713 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 154.6) internal successors, (773), 5 states have internal predecessors, (773), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 15:34:15,716 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 356.0) internal successors, (2136), 6 states have internal predecessors, (2136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 15:34:15,717 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 356.0) internal successors, (2136), 6 states have internal predecessors, (2136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 15:34:15,717 INFO L175 Difference]: Start difference. First operand has 35 places, 35 transitions, 166 flow. Second operand 5 states and 773 transitions. [2023-08-24 15:34:15,717 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 60 transitions, 382 flow [2023-08-24 15:34:15,721 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 60 transitions, 380 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-24 15:34:15,723 INFO L231 Difference]: Finished difference. Result has 41 places, 36 transitions, 184 flow [2023-08-24 15:34:15,723 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=356, PETRI_DIFFERENCE_MINUEND_FLOW=164, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=184, PETRI_PLACES=41, PETRI_TRANSITIONS=36} [2023-08-24 15:34:15,725 INFO L281 CegarLoopForPetriNet]: 25 programPoint places, 16 predicate places. [2023-08-24 15:34:15,725 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 36 transitions, 184 flow [2023-08-24 15:34:15,725 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 148.8) internal successors, (744), 5 states have internal predecessors, (744), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 15:34:15,725 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 15:34:15,726 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 15:34:15,726 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-24 15:34:15,726 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 15:34:15,726 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 15:34:15,726 INFO L85 PathProgramCache]: Analyzing trace with hash 1648851834, now seen corresponding path program 1 times [2023-08-24 15:34:15,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 15:34:15,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581530874] [2023-08-24 15:34:15,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 15:34:15,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 15:34:15,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 15:34:15,849 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 15:34:15,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 15:34:15,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1581530874] [2023-08-24 15:34:15,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1581530874] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 15:34:15,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 15:34:15,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-24 15:34:15,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635085008] [2023-08-24 15:34:15,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 15:34:15,851 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-24 15:34:15,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 15:34:15,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-24 15:34:15,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-24 15:34:15,856 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 135 out of 356 [2023-08-24 15:34:15,856 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 36 transitions, 184 flow. Second operand has 4 states, 4 states have (on average 139.75) internal successors, (559), 4 states have internal predecessors, (559), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 15:34:15,857 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 15:34:15,857 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 356 [2023-08-24 15:34:15,857 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 15:34:15,964 INFO L124 PetriNetUnfolderBase]: 281/502 cut-off events. [2023-08-24 15:34:15,964 INFO L125 PetriNetUnfolderBase]: For 967/983 co-relation queries the response was YES. [2023-08-24 15:34:15,966 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1780 conditions, 502 events. 281/502 cut-off events. For 967/983 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1960 event pairs, 159 based on Foata normal form. 25/517 useless extension candidates. Maximal degree in co-relation 1478. Up to 397 conditions per place. [2023-08-24 15:34:15,969 INFO L140 encePairwiseOnDemand]: 351/356 looper letters, 30 selfloop transitions, 2 changer transitions 15/52 dead transitions. [2023-08-24 15:34:15,969 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 52 transitions, 353 flow [2023-08-24 15:34:15,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-24 15:34:15,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-24 15:34:15,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 708 transitions. [2023-08-24 15:34:15,972 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39775280898876403 [2023-08-24 15:34:15,972 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 708 transitions. [2023-08-24 15:34:15,972 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 708 transitions. [2023-08-24 15:34:15,973 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 15:34:15,973 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 708 transitions. [2023-08-24 15:34:15,974 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 141.6) internal successors, (708), 5 states have internal predecessors, (708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 15:34:15,977 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 356.0) internal successors, (2136), 6 states have internal predecessors, (2136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 15:34:15,979 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 356.0) internal successors, (2136), 6 states have internal predecessors, (2136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 15:34:15,980 INFO L175 Difference]: Start difference. First operand has 41 places, 36 transitions, 184 flow. Second operand 5 states and 708 transitions. [2023-08-24 15:34:15,980 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 52 transitions, 353 flow [2023-08-24 15:34:15,983 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 52 transitions, 345 flow, removed 3 selfloop flow, removed 3 redundant places. [2023-08-24 15:34:15,984 INFO L231 Difference]: Finished difference. Result has 43 places, 37 transitions, 192 flow [2023-08-24 15:34:15,984 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=356, PETRI_DIFFERENCE_MINUEND_FLOW=176, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=192, PETRI_PLACES=43, PETRI_TRANSITIONS=37} [2023-08-24 15:34:15,987 INFO L281 CegarLoopForPetriNet]: 25 programPoint places, 18 predicate places. [2023-08-24 15:34:15,987 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 37 transitions, 192 flow [2023-08-24 15:34:15,987 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 139.75) internal successors, (559), 4 states have internal predecessors, (559), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 15:34:15,987 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 15:34:15,987 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 15:34:15,988 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-24 15:34:15,988 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 15:34:15,988 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 15:34:15,988 INFO L85 PathProgramCache]: Analyzing trace with hash -2084622646, now seen corresponding path program 1 times [2023-08-24 15:34:15,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 15:34:15,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613564152] [2023-08-24 15:34:15,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 15:34:15,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 15:34:16,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 15:34:17,082 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-24 15:34:17,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 15:34:17,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613564152] [2023-08-24 15:34:17,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [613564152] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 15:34:17,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1878636578] [2023-08-24 15:34:17,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 15:34:17,083 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 15:34:17,083 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 15:34:17,089 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-24 15:34:17,114 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-08-24 15:34:17,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 15:34:17,217 INFO L262 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 69 conjunts are in the unsatisfiable core [2023-08-24 15:34:17,234 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 15:34:17,309 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-24 15:34:17,310 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-24 15:34:17,323 INFO L322 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-08-24 15:34:17,324 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 15:34:17,387 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 15:34:17,444 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-24 15:34:17,445 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-24 15:34:17,460 INFO L322 Elim1Store]: treesize reduction 20, result has 39.4 percent of original size [2023-08-24 15:34:17,461 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 15:34:17,505 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 15:34:17,541 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 15:34:17,655 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 15:34:17,961 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 44 treesize of output 10 [2023-08-24 15:34:17,994 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-24 15:34:17,995 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 15:34:19,343 WARN L839 $PredicateComparison]: unable to prove that (or (<= c_~n~0 c_~end~0) (<= (+ c_~end~0 1) c_~start~0) (< c_~start~0 0) (let ((.cse1 (+ (* c_~end~0 4) c_~queue~0.offset))) (and (or (forall ((~A~0.offset Int) (~i~0 Int) (v_ArrVal_146 (Array Int Int)) (v_ArrVal_147 (Array Int Int))) (not (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_146) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_147))) (= (select (select .cse0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~i~0 4) ~A~0.offset)) (select (select .cse0 c_~queue~0.base) .cse1))))) (not (= (mod c_~ok~0 256) 0))) (forall ((~A~0.offset Int) (~i~0 Int) (v_ArrVal_146 (Array Int Int)) (v_ArrVal_147 (Array Int Int))) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_146))) (let ((.cse2 (store .cse5 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_147))) (let ((.cse3 (+ (* ~i~0 4) ~A~0.offset)) (.cse4 (select .cse2 c_~queue~0.base))) (or (not (= (select (select .cse2 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse3) (select .cse4 .cse1))) (< (select (select .cse5 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse3) (+ (select .cse4 (+ (* c_~start~0 4) c_~queue~0.offset)) 1)))))))))) is different from false [2023-08-24 15:34:19,673 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 15:34:19,673 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 123 treesize of output 87 [2023-08-24 15:34:19,693 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 15:34:19,693 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 2532 treesize of output 2444 [2023-08-24 15:34:19,777 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 15:34:19,777 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 1009 treesize of output 809 [2023-08-24 15:34:19,827 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 15:34:19,832 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 968 treesize of output 876 [2023-08-24 15:34:19,890 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 15:34:19,892 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 836 treesize of output 708 [2023-08-24 15:34:22,743 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 15:34:22,743 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 62 treesize of output 51 [2023-08-24 15:34:22,750 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-24 15:34:22,754 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 830 treesize of output 798 [2023-08-24 15:34:22,776 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 15:34:22,777 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 394 treesize of output 351 [2023-08-24 15:34:22,795 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 15:34:22,796 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 334 treesize of output 279 [2023-08-24 15:34:22,808 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 262 treesize of output 214 [2023-08-24 15:34:23,037 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2023-08-24 15:34:23,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1878636578] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 15:34:23,038 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 15:34:23,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 10] total 27 [2023-08-24 15:34:23,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599370638] [2023-08-24 15:34:23,038 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 15:34:23,038 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2023-08-24 15:34:23,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 15:34:23,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-08-24 15:34:23,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=588, Unknown=6, NotChecked=52, Total=812 [2023-08-24 15:34:23,042 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 356 [2023-08-24 15:34:23,044 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 37 transitions, 192 flow. Second operand has 29 states, 29 states have (on average 84.27586206896552) internal successors, (2444), 29 states have internal predecessors, (2444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 15:34:23,044 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 15:34:23,044 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 356 [2023-08-24 15:34:23,045 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 15:34:27,192 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 15:34:38,208 WARN L234 SmtUtils]: Spent 7.21s on a formula simplification. DAG size of input: 61 DAG size of output: 50 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-24 15:34:40,222 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 15:35:00,106 WARN L234 SmtUtils]: Spent 17.40s on a formula simplification. DAG size of input: 105 DAG size of output: 84 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-24 15:35:15,063 WARN L234 SmtUtils]: Spent 14.33s on a formula simplification. DAG size of input: 107 DAG size of output: 86 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-24 15:35:15,104 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (<= c_~n~0 c_~end~0)) (.cse4 (+ (* c_~end~0 4) c_~queue~0.offset)) (.cse20 (select |c_#memory_int| c_~A~0.base)) (.cse15 (+ c_~A~0.offset (* c_~i~0 4))) (.cse12 (< |c_thread1Thread1of1ForFork1_#t~mem1#1| c_~last~0)) (.cse1 (<= (+ c_~end~0 1) c_~start~0)) (.cse10 (< c_~start~0 0)) (.cse2 (not (= (mod c_~ok~0 256) 0))) (.cse8 (+ (* c_~start~0 4) c_~queue~0.offset))) (and (or .cse0 .cse1 (and (or .cse2 (forall ((~A~0.offset Int) (~i~0 Int) (v_ArrVal_146 (Array Int Int)) (v_ArrVal_145 (Array Int Int)) (v_ArrVal_147 (Array Int Int))) (not (let ((.cse3 (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_145) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_146) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_147))) (= (select (select .cse3 c_~queue~0.base) .cse4) (select (select .cse3 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~i~0 4) ~A~0.offset))))))) (forall ((~A~0.offset Int) (~i~0 Int) (v_ArrVal_146 (Array Int Int)) (v_ArrVal_145 (Array Int Int)) (v_ArrVal_147 (Array Int Int))) (let ((.cse5 (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_145) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_146))) (let ((.cse9 (store .cse5 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_147))) (let ((.cse7 (select .cse9 c_~queue~0.base)) (.cse6 (+ (* ~i~0 4) ~A~0.offset))) (or (< (select (select .cse5 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse6) (+ (select .cse7 .cse8) 1)) (not (= (select .cse7 .cse4) (select (select .cse9 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse6))))))))) .cse10) (or .cse0 .cse1 .cse10 (< (+ 1 |c_ULTIMATE.start_create_fresh_int_array_~i~1#1|) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) (let ((.cse11 (forall ((|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_88| Int)) (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_88|) 0))))) (and (or .cse11 (= c_~start~0 c_~end~0)) (or .cse11 .cse2) (not (= (select |c_#valid| |c_ULTIMATE.start_main_~#t2~0#1.base|) 0))))) (or .cse0 .cse12 .cse1 .cse10 (and (forall ((v_ArrVal_147 (Array Int Int))) (let ((.cse14 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_147))) (let ((.cse13 (select .cse14 c_~queue~0.base))) (or (not (= (select .cse13 .cse4) (select (select .cse14 c_~A~0.base) .cse15))) (< c_~v_old~0 (+ (select .cse13 .cse8) 1)))))) (or .cse2 (forall ((v_ArrVal_147 (Array Int Int))) (not (let ((.cse16 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_147))) (= (select (select .cse16 c_~queue~0.base) .cse4) (select (select .cse16 c_~A~0.base) .cse15)))))))) (or (and (forall ((~A~0.offset Int) (~i~0 Int)) (let ((.cse19 (+ (* ~i~0 4) ~A~0.offset))) (or (forall ((v_ArrVal_147 (Array Int Int))) (let ((.cse18 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_147))) (let ((.cse17 (select .cse18 c_~queue~0.base))) (or (< c_~v_old~0 (+ (select .cse17 .cse8) 1)) (not (= (select (select .cse18 c_~A~0.base) .cse19) (select .cse17 .cse4))))))) (< (select .cse20 .cse19) c_~last~0)))) (or .cse2 (forall ((~A~0.offset Int) (~i~0 Int) (v_ArrVal_147 (Array Int Int))) (let ((.cse21 (+ (* ~i~0 4) ~A~0.offset))) (or (< (select .cse20 .cse21) c_~last~0) (not (let ((.cse22 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_147))) (= (select (select .cse22 c_~A~0.base) .cse21) (select (select .cse22 c_~queue~0.base) .cse4))))))))) .cse0 .cse1 .cse10) (let ((.cse23 (select |c_#memory_int| c_~queue~0.base))) (or .cse0 (not (= (select .cse23 .cse4) (select .cse20 .cse15))) .cse12 .cse1 .cse10 (and .cse2 (< c_~v_old~0 (+ (select .cse23 .cse8) 1))))))) is different from false [2023-08-24 15:35:33,537 WARN L234 SmtUtils]: Spent 18.33s on a formula simplification. DAG size of input: 96 DAG size of output: 76 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-24 15:35:35,554 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 15:35:37,655 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 15:35:40,732 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 15:35:48,047 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 15:36:08,683 WARN L234 SmtUtils]: Spent 10.23s on a formula simplification. DAG size of input: 103 DAG size of output: 82 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-24 15:36:10,712 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 15:36:24,628 WARN L234 SmtUtils]: Spent 8.47s on a formula simplification. DAG size of input: 106 DAG size of output: 86 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-24 15:36:26,658 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 15:36:28,701 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 15:36:33,093 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 15:36:35,256 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 15:36:46,156 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse2 (not (= (mod c_~ok~0 256) 0))) (.cse24 (select |c_#memory_int| c_~queue~0.base)) (.cse8 (+ (* c_~start~0 4) c_~queue~0.offset))) (let ((.cse0 (<= c_~n~0 c_~end~0)) (.cse4 (+ (* c_~end~0 4) c_~queue~0.offset)) (.cse21 (select |c_#memory_int| c_~A~0.base)) (.cse15 (+ c_~A~0.offset (* c_~i~0 4))) (.cse12 (< |c_thread1Thread1of1ForFork1_#t~mem1#1| c_~last~0)) (.cse1 (<= (+ c_~end~0 1) c_~start~0)) (.cse10 (< c_~start~0 0)) (.cse17 (and .cse2 (< c_~v_old~0 (+ (select .cse24 .cse8) 1))))) (and (or .cse0 .cse1 (and (or .cse2 (forall ((~A~0.offset Int) (~i~0 Int) (v_ArrVal_146 (Array Int Int)) (v_ArrVal_145 (Array Int Int)) (v_ArrVal_147 (Array Int Int))) (not (let ((.cse3 (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_145) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_146) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_147))) (= (select (select .cse3 c_~queue~0.base) .cse4) (select (select .cse3 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~i~0 4) ~A~0.offset))))))) (forall ((~A~0.offset Int) (~i~0 Int) (v_ArrVal_146 (Array Int Int)) (v_ArrVal_145 (Array Int Int)) (v_ArrVal_147 (Array Int Int))) (let ((.cse5 (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_145) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_146))) (let ((.cse9 (store .cse5 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_147))) (let ((.cse7 (select .cse9 c_~queue~0.base)) (.cse6 (+ (* ~i~0 4) ~A~0.offset))) (or (< (select (select .cse5 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse6) (+ (select .cse7 .cse8) 1)) (not (= (select .cse7 .cse4) (select (select .cse9 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse6))))))))) .cse10) (or .cse0 .cse1 .cse10 (< (+ 1 |c_ULTIMATE.start_create_fresh_int_array_~i~1#1|) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) (let ((.cse11 (forall ((|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_88| Int)) (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_88|) 0))))) (and (or .cse11 (= c_~start~0 c_~end~0)) (or .cse11 .cse2) (not (= (select |c_#valid| |c_ULTIMATE.start_main_~#t2~0#1.base|) 0))))) (or .cse0 .cse12 .cse1 .cse10 (and (forall ((v_ArrVal_147 (Array Int Int))) (let ((.cse14 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_147))) (let ((.cse13 (select .cse14 c_~queue~0.base))) (or (not (= (select .cse13 .cse4) (select (select .cse14 c_~A~0.base) .cse15))) (< c_~v_old~0 (+ (select .cse13 .cse8) 1)))))) (or .cse2 (forall ((v_ArrVal_147 (Array Int Int))) (not (let ((.cse16 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_147))) (= (select (select .cse16 c_~queue~0.base) .cse4) (select (select .cse16 c_~A~0.base) .cse15)))))))) (or (= (mod |c_thread2Thread1of1ForFork0_~cond~0#1| 256) 0) .cse10 .cse17 (<= c_~end~0 c_~start~0) (<= c_~n~0 c_~start~0)) (= c_~ok~0 1) (or (and (forall ((~A~0.offset Int) (~i~0 Int)) (let ((.cse20 (+ (* ~i~0 4) ~A~0.offset))) (or (forall ((v_ArrVal_147 (Array Int Int))) (let ((.cse19 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_147))) (let ((.cse18 (select .cse19 c_~queue~0.base))) (or (< c_~v_old~0 (+ (select .cse18 .cse8) 1)) (not (= (select (select .cse19 c_~A~0.base) .cse20) (select .cse18 .cse4))))))) (< (select .cse21 .cse20) c_~last~0)))) (or .cse2 (forall ((~A~0.offset Int) (~i~0 Int) (v_ArrVal_147 (Array Int Int))) (let ((.cse22 (+ (* ~i~0 4) ~A~0.offset))) (or (< (select .cse21 .cse22) c_~last~0) (not (let ((.cse23 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_147))) (= (select (select .cse23 c_~A~0.base) .cse22) (select (select .cse23 c_~queue~0.base) .cse4))))))))) .cse0 .cse1 .cse10) (or .cse0 (not (= (select .cse24 .cse4) (select .cse21 .cse15))) .cse12 .cse1 .cse10 .cse17)))) is different from false [2023-08-24 15:36:46,223 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse8 (+ (* c_~start~0 4) c_~queue~0.offset)) (.cse2 (not (= (mod c_~ok~0 256) 0))) (.cse4 (+ (* c_~end~0 4) c_~queue~0.offset)) (.cse0 (<= c_~n~0 c_~end~0)) (.cse1 (<= (+ c_~end~0 1) c_~start~0)) (.cse10 (< c_~start~0 0))) (and (or .cse0 .cse1 (and (or .cse2 (forall ((~A~0.offset Int) (~i~0 Int) (v_ArrVal_146 (Array Int Int)) (v_ArrVal_145 (Array Int Int)) (v_ArrVal_147 (Array Int Int))) (not (let ((.cse3 (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_145) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_146) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_147))) (= (select (select .cse3 c_~queue~0.base) .cse4) (select (select .cse3 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~i~0 4) ~A~0.offset))))))) (forall ((~A~0.offset Int) (~i~0 Int) (v_ArrVal_146 (Array Int Int)) (v_ArrVal_145 (Array Int Int)) (v_ArrVal_147 (Array Int Int))) (let ((.cse5 (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_145) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_146))) (let ((.cse9 (store .cse5 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_147))) (let ((.cse7 (select .cse9 c_~queue~0.base)) (.cse6 (+ (* ~i~0 4) ~A~0.offset))) (or (< (select (select .cse5 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse6) (+ (select .cse7 .cse8) 1)) (not (= (select .cse7 .cse4) (select (select .cse9 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse6))))))))) .cse10) (or .cse0 .cse1 .cse10 (< (+ 1 |c_ULTIMATE.start_create_fresh_int_array_~i~1#1|) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) (let ((.cse11 (forall ((|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_88| Int)) (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_88|) 0))))) (and (or .cse11 (= c_~start~0 c_~end~0)) (or .cse11 .cse2) (not (= (select |c_#valid| |c_ULTIMATE.start_main_~#t2~0#1.base|) 0))))) (or (= (mod |c_thread2Thread1of1ForFork0_~cond~0#1| 256) 0) .cse10 (and .cse2 (< c_~v_old~0 (+ (select (select |c_#memory_int| c_~queue~0.base) .cse8) 1))) (<= c_~end~0 c_~start~0) (<= c_~n~0 c_~start~0)) (= c_~ok~0 1) (or (let ((.cse15 (select |c_#memory_int| c_~A~0.base))) (and (forall ((~A~0.offset Int) (~i~0 Int)) (let ((.cse14 (+ (* ~i~0 4) ~A~0.offset))) (or (forall ((v_ArrVal_147 (Array Int Int))) (let ((.cse13 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_147))) (let ((.cse12 (select .cse13 c_~queue~0.base))) (or (< c_~v_old~0 (+ (select .cse12 .cse8) 1)) (not (= (select (select .cse13 c_~A~0.base) .cse14) (select .cse12 .cse4))))))) (< (select .cse15 .cse14) c_~last~0)))) (or .cse2 (forall ((~A~0.offset Int) (~i~0 Int) (v_ArrVal_147 (Array Int Int))) (let ((.cse16 (+ (* ~i~0 4) ~A~0.offset))) (or (< (select .cse15 .cse16) c_~last~0) (not (let ((.cse17 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_147))) (= (select (select .cse17 c_~A~0.base) .cse16) (select (select .cse17 c_~queue~0.base) .cse4)))))))))) .cse0 .cse1 .cse10))) is different from false [2023-08-24 15:37:02,981 WARN L234 SmtUtils]: Spent 10.33s on a formula simplification. DAG size of input: 114 DAG size of output: 99 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-24 15:37:05,260 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 15:37:05,449 INFO L124 PetriNetUnfolderBase]: 1850/3098 cut-off events. [2023-08-24 15:37:05,449 INFO L125 PetriNetUnfolderBase]: For 3186/3186 co-relation queries the response was YES. [2023-08-24 15:37:05,456 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10395 conditions, 3098 events. 1850/3098 cut-off events. For 3186/3186 co-relation queries the response was YES. Maximal size of possible extension queue 153. Compared 16914 event pairs, 198 based on Foata normal form. 30/3128 useless extension candidates. Maximal degree in co-relation 10372. Up to 632 conditions per place. [2023-08-24 15:37:05,469 INFO L140 encePairwiseOnDemand]: 335/356 looper letters, 274 selfloop transitions, 146 changer transitions 76/496 dead transitions. [2023-08-24 15:37:05,470 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 496 transitions, 3430 flow [2023-08-24 15:37:05,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2023-08-24 15:37:05,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2023-08-24 15:37:05,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 4654 transitions. [2023-08-24 15:37:05,486 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.25140449438202245 [2023-08-24 15:37:05,486 INFO L72 ComplementDD]: Start complementDD. Operand 52 states and 4654 transitions. [2023-08-24 15:37:05,486 INFO L73 IsDeterministic]: Start isDeterministic. Operand 52 states and 4654 transitions. [2023-08-24 15:37:05,489 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 15:37:05,489 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 52 states and 4654 transitions. [2023-08-24 15:37:05,499 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 53 states, 52 states have (on average 89.5) internal successors, (4654), 52 states have internal predecessors, (4654), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 15:37:05,525 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 53 states, 53 states have (on average 356.0) internal successors, (18868), 53 states have internal predecessors, (18868), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 15:37:05,531 INFO L81 ComplementDD]: Finished complementDD. Result has 53 states, 53 states have (on average 356.0) internal successors, (18868), 53 states have internal predecessors, (18868), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 15:37:05,531 INFO L175 Difference]: Start difference. First operand has 43 places, 37 transitions, 192 flow. Second operand 52 states and 4654 transitions. [2023-08-24 15:37:05,531 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 496 transitions, 3430 flow [2023-08-24 15:37:05,541 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 496 transitions, 3406 flow, removed 11 selfloop flow, removed 3 redundant places. [2023-08-24 15:37:05,548 INFO L231 Difference]: Finished difference. Result has 121 places, 186 transitions, 1681 flow [2023-08-24 15:37:05,548 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=356, PETRI_DIFFERENCE_MINUEND_FLOW=184, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=4, PETRI_DIFFERENCE_SUBTRAHEND_STATES=52, PETRI_FLOW=1681, PETRI_PLACES=121, PETRI_TRANSITIONS=186} [2023-08-24 15:37:05,549 INFO L281 CegarLoopForPetriNet]: 25 programPoint places, 96 predicate places. [2023-08-24 15:37:05,549 INFO L495 AbstractCegarLoop]: Abstraction has has 121 places, 186 transitions, 1681 flow [2023-08-24 15:37:05,550 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 84.27586206896552) internal successors, (2444), 29 states have internal predecessors, (2444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 15:37:05,550 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 15:37:05,550 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 15:37:05,560 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-08-24 15:37:05,757 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 15:37:05,757 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 15:37:05,758 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 15:37:05,758 INFO L85 PathProgramCache]: Analyzing trace with hash -252506468, now seen corresponding path program 2 times [2023-08-24 15:37:05,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 15:37:05,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072112855] [2023-08-24 15:37:05,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 15:37:05,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 15:37:05,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 15:37:06,794 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-24 15:37:06,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 15:37:06,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072112855] [2023-08-24 15:37:06,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2072112855] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 15:37:06,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [361325751] [2023-08-24 15:37:06,794 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-24 15:37:06,795 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 15:37:06,795 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 15:37:06,797 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-24 15:37:06,800 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-08-24 15:37:06,910 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-24 15:37:06,910 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-24 15:37:06,912 INFO L262 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 55 conjunts are in the unsatisfiable core [2023-08-24 15:37:06,916 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 15:37:06,929 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-24 15:37:06,930 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-24 15:37:06,940 INFO L322 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-08-24 15:37:06,940 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 15:37:06,989 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-08-24 15:37:07,047 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-24 15:37:07,047 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 15:37:07,097 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 15:37:07,140 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-08-24 15:37:07,332 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-24 15:37:07,344 INFO L322 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2023-08-24 15:37:07,344 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 42 [2023-08-24 15:37:07,353 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-08-24 15:37:07,528 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2023-08-24 15:37:07,556 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 15:37:07,556 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 15:37:07,842 WARN L839 $PredicateComparison]: unable to prove that (or (<= c_~n~0 c_~end~0) (< c_~end~0 0) (forall ((~A~0.offset Int) (~i~0 Int) (~A~0.base Int)) (let ((.cse0 (select (select |c_#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (or (< .cse0 c_~last~0) (not (= (select (select |c_#memory_int| c_~queue~0.base) (+ (* c_~end~0 4) c_~queue~0.offset)) .cse0)) (<= c_~N~0 ~i~0)))) (and (not (= (mod c_~ok~0 256) 0)) (forall ((v_ArrVal_193 (Array Int Int))) (< c_~v_old~0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_193) c_~queue~0.base) (+ (* c_~start~0 4) c_~queue~0.offset)) 1))))) is different from false [2023-08-24 15:37:08,184 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 15:37:08,185 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 117 treesize of output 81 [2023-08-24 15:37:08,220 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 15:37:08,221 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 5260 treesize of output 4666 [2023-08-24 15:37:08,330 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 15:37:08,331 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 1140 treesize of output 1060 [2023-08-24 15:37:08,379 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 15:37:08,379 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 1020 treesize of output 820 [2023-08-24 15:37:08,411 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 566 treesize of output 470 [2023-08-24 15:37:15,411 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 1 times theorem prover too weak. 0 trivial. 1 not checked. [2023-08-24 15:37:15,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [361325751] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 15:37:15,412 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 15:37:15,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 10] total 28 [2023-08-24 15:37:15,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801371250] [2023-08-24 15:37:15,412 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 15:37:15,412 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2023-08-24 15:37:15,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 15:37:15,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2023-08-24 15:37:15,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=642, Unknown=5, NotChecked=54, Total=870 [2023-08-24 15:37:15,415 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 356 [2023-08-24 15:37:15,417 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 186 transitions, 1681 flow. Second operand has 30 states, 30 states have (on average 81.2) internal successors, (2436), 30 states have internal predecessors, (2436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 15:37:15,417 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 15:37:15,417 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 356 [2023-08-24 15:37:15,417 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 15:37:15,753 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (<= c_~n~0 c_~end~0)) (.cse6 (< c_~end~0 0)) (.cse5 (not (= (mod c_~ok~0 256) 0))) (.cse4 (+ (* c_~start~0 4) c_~queue~0.offset)) (.cse2 (+ (* c_~end~0 4) c_~queue~0.offset))) (and (or .cse0 (and (forall ((~A~0.offset Int) (v_ArrVal_191 (Array Int Int)) (v_ArrVal_192 (Array Int Int)) (~i~0 Int) (~A~0.base Int)) (let ((.cse1 (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_191) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_192))) (let ((.cse3 (select (select .cse1 ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (or (not (= (select (select .cse1 c_~queue~0.base) .cse2) .cse3)) (forall ((v_ArrVal_193 (Array Int Int))) (< .cse3 (+ 1 (select (select (store .cse1 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_193) c_~queue~0.base) .cse4)))))))) .cse5) .cse6) (= c_~ok~0 1) (or .cse0 .cse6 (and .cse5 (forall ((~A~0.offset Int) (v_ArrVal_192 (Array Int Int)) (~i~0 Int) (~A~0.base Int)) (let ((.cse8 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_192))) (let ((.cse7 (select (select .cse8 ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (or (forall ((v_ArrVal_193 (Array Int Int))) (< .cse7 (+ 1 (select (select (store .cse8 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_193) c_~queue~0.base) .cse4)))) (not (= .cse7 (select (select .cse8 c_~queue~0.base) .cse2))))))))))) is different from false [2023-08-24 15:37:16,202 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse11 (* c_~start~0 4))) (let ((.cse1 (<= c_~n~0 c_~end~0)) (.cse2 (< c_~end~0 0)) (.cse4 (not (= (mod c_~ok~0 256) 0))) (.cse8 (+ .cse11 c_~queue~0.offset)) (.cse6 (+ (* c_~end~0 4) c_~queue~0.offset)) (.cse0 (select |c_#memory_int| c_~queue~0.base))) (and (<= c_~start~0 0) (not (= c_~queue~0.base |c_ULTIMATE.start_main_~#t2~0#1.base|)) (<= 0 c_~start~0) (<= (+ c_~queue~0.base 2) |c_ULTIMATE.start_main_~#t2~0#1.base|) (<= c_~v_old~0 (select .cse0 0)) (or .cse1 .cse2 (< (+ 1 |c_ULTIMATE.start_create_fresh_int_array_~i~1#1|) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) (let ((.cse3 (forall ((|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_90| Int)) (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_90|) 0))))) (and (or .cse3 (and (= c_~start~0 c_~end~0) (not (= |c_ULTIMATE.start_main_~#t2~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)))) (or .cse3 .cse4)))) (or .cse1 (and (forall ((~A~0.offset Int) (v_ArrVal_191 (Array Int Int)) (v_ArrVal_192 (Array Int Int)) (~i~0 Int) (~A~0.base Int)) (let ((.cse5 (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_191) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_192))) (let ((.cse7 (select (select .cse5 ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (or (not (= (select (select .cse5 c_~queue~0.base) .cse6) .cse7)) (forall ((v_ArrVal_193 (Array Int Int))) (< .cse7 (+ 1 (select (select (store .cse5 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_193) c_~queue~0.base) .cse8)))))))) .cse4) .cse2) (< c_~start~0 c_~n~0) (= c_~ok~0 1) (or .cse1 .cse2 (and .cse4 (forall ((~A~0.offset Int) (v_ArrVal_192 (Array Int Int)) (~i~0 Int) (~A~0.base Int)) (let ((.cse10 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_192))) (let ((.cse9 (select (select .cse10 ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (or (forall ((v_ArrVal_193 (Array Int Int))) (< .cse9 (+ 1 (select (select (store .cse10 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_193) c_~queue~0.base) .cse8)))) (not (= .cse9 (select (select .cse10 c_~queue~0.base) .cse6))))))))) (exists ((~A~0.offset Int) (~A~0.base Int)) (let ((.cse12 (select (select |c_#memory_int| ~A~0.base) (+ ~A~0.offset (* c_~i~0 4))))) (and (= (select .cse0 .cse11) .cse12) (<= c_~v_old~0 .cse12)))) (< c_~i~0 c_~N~0) (= c_~queue~0.offset 0) (< 0 c_~N~0) (< c_~start~0 c_~end~0)))) is different from false [2023-08-24 15:37:16,969 WARN L839 $PredicateComparison]: unable to prove that (and (not (= (mod c_~ok~0 256) 0)) (= c_~ok~0 1) (forall ((v_ArrVal_193 (Array Int Int))) (< c_~v_old~0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_193) c_~queue~0.base) (+ (* c_~start~0 4) c_~queue~0.offset)) 1)))) is different from false [2023-08-24 15:37:18,478 INFO L124 PetriNetUnfolderBase]: 3088/5143 cut-off events. [2023-08-24 15:37:18,478 INFO L125 PetriNetUnfolderBase]: For 48564/48564 co-relation queries the response was YES. [2023-08-24 15:37:18,494 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33120 conditions, 5143 events. 3088/5143 cut-off events. For 48564/48564 co-relation queries the response was YES. Maximal size of possible extension queue 263. Compared 31056 event pairs, 470 based on Foata normal form. 3/5146 useless extension candidates. Maximal degree in co-relation 33010. Up to 2862 conditions per place. [2023-08-24 15:37:18,524 INFO L140 encePairwiseOnDemand]: 339/356 looper letters, 377 selfloop transitions, 113 changer transitions 14/504 dead transitions. [2023-08-24 15:37:18,524 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 504 transitions, 6262 flow [2023-08-24 15:37:18,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2023-08-24 15:37:18,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2023-08-24 15:37:18,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 2816 transitions. [2023-08-24 15:37:18,532 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2397003745318352 [2023-08-24 15:37:18,532 INFO L72 ComplementDD]: Start complementDD. Operand 33 states and 2816 transitions. [2023-08-24 15:37:18,532 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 2816 transitions. [2023-08-24 15:37:18,534 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 15:37:18,534 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 33 states and 2816 transitions. [2023-08-24 15:37:18,539 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 34 states, 33 states have (on average 85.33333333333333) internal successors, (2816), 33 states have internal predecessors, (2816), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 15:37:18,551 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 34 states, 34 states have (on average 356.0) internal successors, (12104), 34 states have internal predecessors, (12104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 15:37:18,553 INFO L81 ComplementDD]: Finished complementDD. Result has 34 states, 34 states have (on average 356.0) internal successors, (12104), 34 states have internal predecessors, (12104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 15:37:18,553 INFO L175 Difference]: Start difference. First operand has 121 places, 186 transitions, 1681 flow. Second operand 33 states and 2816 transitions. [2023-08-24 15:37:18,553 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 504 transitions, 6262 flow [2023-08-24 15:37:18,703 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 504 transitions, 5958 flow, removed 138 selfloop flow, removed 10 redundant places. [2023-08-24 15:37:18,712 INFO L231 Difference]: Finished difference. Result has 152 places, 261 transitions, 2579 flow [2023-08-24 15:37:18,712 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=356, PETRI_DIFFERENCE_MINUEND_FLOW=1537, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=186, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=33, PETRI_FLOW=2579, PETRI_PLACES=152, PETRI_TRANSITIONS=261} [2023-08-24 15:37:18,713 INFO L281 CegarLoopForPetriNet]: 25 programPoint places, 127 predicate places. [2023-08-24 15:37:18,713 INFO L495 AbstractCegarLoop]: Abstraction has has 152 places, 261 transitions, 2579 flow [2023-08-24 15:37:18,714 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 81.2) internal successors, (2436), 30 states have internal predecessors, (2436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 15:37:18,714 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 15:37:18,714 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 15:37:18,721 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-08-24 15:37:18,919 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,SelfDestructingSolverStorable7 [2023-08-24 15:37:18,920 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 15:37:18,920 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 15:37:18,920 INFO L85 PathProgramCache]: Analyzing trace with hash 571269300, now seen corresponding path program 3 times [2023-08-24 15:37:18,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 15:37:18,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133045436] [2023-08-24 15:37:18,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 15:37:18,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 15:37:18,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 15:37:19,679 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-24 15:37:19,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 15:37:19,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133045436] [2023-08-24 15:37:19,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1133045436] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 15:37:19,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1448384336] [2023-08-24 15:37:19,679 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-24 15:37:19,680 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 15:37:19,680 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 15:37:19,681 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-24 15:37:19,714 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-08-24 15:37:19,856 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-08-24 15:37:19,857 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-24 15:37:19,858 INFO L262 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 55 conjunts are in the unsatisfiable core [2023-08-24 15:37:19,861 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 15:37:19,873 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-24 15:37:19,874 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-24 15:37:19,882 INFO L322 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-08-24 15:37:19,882 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 15:37:19,917 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-08-24 15:37:19,956 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-24 15:37:19,957 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 15:37:19,993 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 15:37:20,027 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-08-24 15:37:20,224 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-24 15:37:20,232 INFO L322 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2023-08-24 15:37:20,233 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 42 [2023-08-24 15:37:20,240 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-08-24 15:37:20,329 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2023-08-24 15:37:20,349 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 15:37:20,349 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 15:37:20,955 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 15:37:20,955 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 117 treesize of output 81 [2023-08-24 15:37:20,980 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 15:37:20,981 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 1300 treesize of output 1186 [2023-08-24 15:37:21,013 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 15:37:21,014 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 1140 treesize of output 940 [2023-08-24 15:37:21,049 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 15:37:21,049 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 900 treesize of output 820 [2023-08-24 15:37:21,070 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 566 treesize of output 470 [2023-08-24 15:37:30,076 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 15:37:30,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1448384336] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 15:37:30,077 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 15:37:30,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 10, 10] total 27 [2023-08-24 15:37:30,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437593563] [2023-08-24 15:37:30,077 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 15:37:30,080 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2023-08-24 15:37:30,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 15:37:30,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-08-24 15:37:30,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=632, Unknown=12, NotChecked=0, Total=812 [2023-08-24 15:37:30,082 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 356 [2023-08-24 15:37:30,084 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 261 transitions, 2579 flow. Second operand has 29 states, 29 states have (on average 81.27586206896552) internal successors, (2357), 29 states have internal predecessors, (2357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 15:37:30,084 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 15:37:30,084 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 356 [2023-08-24 15:37:30,084 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 15:37:35,428 INFO L124 PetriNetUnfolderBase]: 4420/7392 cut-off events. [2023-08-24 15:37:35,428 INFO L125 PetriNetUnfolderBase]: For 78712/78712 co-relation queries the response was YES. [2023-08-24 15:37:35,454 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51335 conditions, 7392 events. 4420/7392 cut-off events. For 78712/78712 co-relation queries the response was YES. Maximal size of possible extension queue 333. Compared 47386 event pairs, 444 based on Foata normal form. 30/7422 useless extension candidates. Maximal degree in co-relation 51251. Up to 4438 conditions per place. [2023-08-24 15:37:35,501 INFO L140 encePairwiseOnDemand]: 341/356 looper letters, 360 selfloop transitions, 219 changer transitions 51/630 dead transitions. [2023-08-24 15:37:35,502 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 630 transitions, 8651 flow [2023-08-24 15:37:35,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2023-08-24 15:37:35,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2023-08-24 15:37:35,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 3310 transitions. [2023-08-24 15:37:35,508 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.24467770549970433 [2023-08-24 15:37:35,508 INFO L72 ComplementDD]: Start complementDD. Operand 38 states and 3310 transitions. [2023-08-24 15:37:35,508 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 3310 transitions. [2023-08-24 15:37:35,509 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 15:37:35,509 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 38 states and 3310 transitions. [2023-08-24 15:37:35,513 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 39 states, 38 states have (on average 87.10526315789474) internal successors, (3310), 38 states have internal predecessors, (3310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 15:37:35,645 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 39 states, 39 states have (on average 356.0) internal successors, (13884), 39 states have internal predecessors, (13884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 15:37:35,648 INFO L81 ComplementDD]: Finished complementDD. Result has 39 states, 39 states have (on average 356.0) internal successors, (13884), 39 states have internal predecessors, (13884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 15:37:35,648 INFO L175 Difference]: Start difference. First operand has 152 places, 261 transitions, 2579 flow. Second operand 38 states and 3310 transitions. [2023-08-24 15:37:35,648 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 188 places, 630 transitions, 8651 flow [2023-08-24 15:37:36,006 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 178 places, 630 transitions, 8487 flow, removed 49 selfloop flow, removed 10 redundant places. [2023-08-24 15:37:36,014 INFO L231 Difference]: Finished difference. Result has 197 places, 334 transitions, 4126 flow [2023-08-24 15:37:36,014 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=356, PETRI_DIFFERENCE_MINUEND_FLOW=2416, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=256, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=144, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=38, PETRI_FLOW=4126, PETRI_PLACES=197, PETRI_TRANSITIONS=334} [2023-08-24 15:37:36,015 INFO L281 CegarLoopForPetriNet]: 25 programPoint places, 172 predicate places. [2023-08-24 15:37:36,015 INFO L495 AbstractCegarLoop]: Abstraction has has 197 places, 334 transitions, 4126 flow [2023-08-24 15:37:36,016 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 81.27586206896552) internal successors, (2357), 29 states have internal predecessors, (2357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 15:37:36,016 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 15:37:36,016 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 15:37:36,024 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-08-24 15:37:36,224 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 15:37:36,224 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 15:37:36,225 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 15:37:36,225 INFO L85 PathProgramCache]: Analyzing trace with hash 1761387616, now seen corresponding path program 4 times [2023-08-24 15:37:36,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 15:37:36,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864188147] [2023-08-24 15:37:36,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 15:37:36,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 15:37:36,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 15:37:37,622 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 15:37:37,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 15:37:37,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864188147] [2023-08-24 15:37:37,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [864188147] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 15:37:37,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2053373574] [2023-08-24 15:37:37,623 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-08-24 15:37:37,623 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 15:37:37,623 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 15:37:37,624 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-24 15:37:37,625 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-08-24 15:37:37,715 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-08-24 15:37:37,715 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-24 15:37:37,717 INFO L262 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 30 conjunts are in the unsatisfiable core [2023-08-24 15:37:37,718 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 15:37:37,965 INFO L322 Elim1Store]: treesize reduction 19, result has 5.0 percent of original size [2023-08-24 15:37:37,967 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 42 treesize of output 10 [2023-08-24 15:37:37,988 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-24 15:37:37,988 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 15:37:40,276 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 15:37:40,277 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 74 treesize of output 121 [2023-08-24 15:37:40,596 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-08-24 15:37:40,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2053373574] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 15:37:40,596 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 15:37:40,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7, 6] total 24 [2023-08-24 15:37:40,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888251627] [2023-08-24 15:37:40,596 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 15:37:40,597 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-08-24 15:37:40,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 15:37:40,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-08-24 15:37:40,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=516, Unknown=0, NotChecked=0, Total=650 [2023-08-24 15:37:40,599 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 356 [2023-08-24 15:37:40,601 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 197 places, 334 transitions, 4126 flow. Second operand has 26 states, 26 states have (on average 87.61538461538461) internal successors, (2278), 26 states have internal predecessors, (2278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 15:37:40,601 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 15:37:40,601 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 356 [2023-08-24 15:37:40,601 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 15:37:43,507 INFO L124 PetriNetUnfolderBase]: 5364/8920 cut-off events. [2023-08-24 15:37:43,507 INFO L125 PetriNetUnfolderBase]: For 147153/147153 co-relation queries the response was YES. [2023-08-24 15:37:43,549 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70200 conditions, 8920 events. 5364/8920 cut-off events. For 147153/147153 co-relation queries the response was YES. Maximal size of possible extension queue 467. Compared 59632 event pairs, 410 based on Foata normal form. 2/8922 useless extension candidates. Maximal degree in co-relation 70051. Up to 5342 conditions per place. [2023-08-24 15:37:43,610 INFO L140 encePairwiseOnDemand]: 341/356 looper letters, 363 selfloop transitions, 186 changer transitions 12/561 dead transitions. [2023-08-24 15:37:43,610 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 215 places, 561 transitions, 8619 flow [2023-08-24 15:37:43,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-08-24 15:37:43,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2023-08-24 15:37:43,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 2103 transitions. [2023-08-24 15:37:43,708 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2568392769907181 [2023-08-24 15:37:43,708 INFO L72 ComplementDD]: Start complementDD. Operand 23 states and 2103 transitions. [2023-08-24 15:37:43,708 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 2103 transitions. [2023-08-24 15:37:43,709 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 15:37:43,709 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 23 states and 2103 transitions. [2023-08-24 15:37:43,711 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 24 states, 23 states have (on average 91.43478260869566) internal successors, (2103), 23 states have internal predecessors, (2103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 15:37:43,722 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 24 states, 24 states have (on average 356.0) internal successors, (8544), 24 states have internal predecessors, (8544), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 15:37:43,723 INFO L81 ComplementDD]: Finished complementDD. Result has 24 states, 24 states have (on average 356.0) internal successors, (8544), 24 states have internal predecessors, (8544), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 15:37:43,723 INFO L175 Difference]: Start difference. First operand has 197 places, 334 transitions, 4126 flow. Second operand 23 states and 2103 transitions. [2023-08-24 15:37:43,723 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 215 places, 561 transitions, 8619 flow [2023-08-24 15:37:44,515 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 198 places, 561 transitions, 8275 flow, removed 131 selfloop flow, removed 17 redundant places. [2023-08-24 15:37:44,522 INFO L231 Difference]: Finished difference. Result has 210 places, 423 transitions, 5714 flow [2023-08-24 15:37:44,523 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=356, PETRI_DIFFERENCE_MINUEND_FLOW=3844, PETRI_DIFFERENCE_MINUEND_PLACES=176, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=334, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=104, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=204, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=5714, PETRI_PLACES=210, PETRI_TRANSITIONS=423} [2023-08-24 15:37:44,523 INFO L281 CegarLoopForPetriNet]: 25 programPoint places, 185 predicate places. [2023-08-24 15:37:44,523 INFO L495 AbstractCegarLoop]: Abstraction has has 210 places, 423 transitions, 5714 flow [2023-08-24 15:37:44,524 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 87.61538461538461) internal successors, (2278), 26 states have internal predecessors, (2278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 15:37:44,524 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 15:37:44,524 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 15:37:44,529 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-08-24 15:37:44,725 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 15:37:44,725 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 15:37:44,725 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 15:37:44,725 INFO L85 PathProgramCache]: Analyzing trace with hash 518146985, now seen corresponding path program 5 times [2023-08-24 15:37:44,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 15:37:44,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371685222] [2023-08-24 15:37:44,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 15:37:44,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 15:37:44,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 15:37:44,833 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-24 15:37:44,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 15:37:44,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371685222] [2023-08-24 15:37:44,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1371685222] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 15:37:44,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [726625743] [2023-08-24 15:37:44,834 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-08-24 15:37:44,834 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 15:37:44,834 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 15:37:44,837 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-24 15:37:44,862 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-08-24 15:37:44,942 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2023-08-24 15:37:44,942 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-24 15:37:44,944 INFO L262 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 8 conjunts are in the unsatisfiable core [2023-08-24 15:37:44,945 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 15:37:44,962 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-24 15:37:44,962 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-24 15:37:44,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [726625743] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 15:37:44,963 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-24 15:37:44,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 4 [2023-08-24 15:37:44,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193034176] [2023-08-24 15:37:44,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 15:37:44,965 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-24 15:37:44,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 15:37:44,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-24 15:37:44,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-08-24 15:37:44,967 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 156 out of 356 [2023-08-24 15:37:44,967 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 210 places, 423 transitions, 5714 flow. Second operand has 4 states, 4 states have (on average 162.0) internal successors, (648), 4 states have internal predecessors, (648), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 15:37:44,967 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 15:37:44,967 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 156 of 356 [2023-08-24 15:37:44,967 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 15:37:47,315 INFO L124 PetriNetUnfolderBase]: 6516/11045 cut-off events. [2023-08-24 15:37:47,315 INFO L125 PetriNetUnfolderBase]: For 217236/217236 co-relation queries the response was YES. [2023-08-24 15:37:47,366 INFO L83 FinitePrefix]: Finished finitePrefix Result has 92855 conditions, 11045 events. 6516/11045 cut-off events. For 217236/217236 co-relation queries the response was YES. Maximal size of possible extension queue 417. Compared 75567 event pairs, 941 based on Foata normal form. 442/11487 useless extension candidates. Maximal degree in co-relation 92753. Up to 7091 conditions per place. [2023-08-24 15:37:47,418 INFO L140 encePairwiseOnDemand]: 353/356 looper letters, 301 selfloop transitions, 105 changer transitions 3/409 dead transitions. [2023-08-24 15:37:47,418 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 198 places, 409 transitions, 6515 flow [2023-08-24 15:37:47,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-24 15:37:47,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-24 15:37:47,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 681 transitions. [2023-08-24 15:37:47,420 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4782303370786517 [2023-08-24 15:37:47,420 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 681 transitions. [2023-08-24 15:37:47,420 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 681 transitions. [2023-08-24 15:37:47,421 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 15:37:47,421 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 681 transitions. [2023-08-24 15:37:47,425 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 170.25) internal successors, (681), 4 states have internal predecessors, (681), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 15:37:47,426 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 356.0) internal successors, (1780), 5 states have internal predecessors, (1780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 15:37:47,426 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 356.0) internal successors, (1780), 5 states have internal predecessors, (1780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 15:37:47,426 INFO L175 Difference]: Start difference. First operand has 210 places, 423 transitions, 5714 flow. Second operand 4 states and 681 transitions. [2023-08-24 15:37:47,426 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 198 places, 409 transitions, 6515 flow [2023-08-24 15:37:48,532 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 173 places, 409 transitions, 6049 flow, removed 189 selfloop flow, removed 25 redundant places. [2023-08-24 15:37:48,538 INFO L231 Difference]: Finished difference. Result has 175 places, 353 transitions, 4989 flow [2023-08-24 15:37:48,538 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=356, PETRI_DIFFERENCE_MINUEND_FLOW=4095, PETRI_DIFFERENCE_MINUEND_PLACES=170, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=318, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=70, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=216, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=4989, PETRI_PLACES=175, PETRI_TRANSITIONS=353} [2023-08-24 15:37:48,539 INFO L281 CegarLoopForPetriNet]: 25 programPoint places, 150 predicate places. [2023-08-24 15:37:48,539 INFO L495 AbstractCegarLoop]: Abstraction has has 175 places, 353 transitions, 4989 flow [2023-08-24 15:37:48,539 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 162.0) internal successors, (648), 4 states have internal predecessors, (648), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 15:37:48,539 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 15:37:48,539 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 15:37:48,544 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-08-24 15:37:48,740 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2023-08-24 15:37:48,740 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 15:37:48,741 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 15:37:48,741 INFO L85 PathProgramCache]: Analyzing trace with hash 621183565, now seen corresponding path program 6 times [2023-08-24 15:37:48,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 15:37:48,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934752306] [2023-08-24 15:37:48,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 15:37:48,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 15:37:48,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 15:37:48,875 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 15:37:48,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 15:37:48,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934752306] [2023-08-24 15:37:48,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [934752306] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 15:37:48,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1485223631] [2023-08-24 15:37:48,876 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-08-24 15:37:48,876 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 15:37:48,876 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 15:37:48,877 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-24 15:37:48,894 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-08-24 15:37:48,990 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2023-08-24 15:37:48,990 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-24 15:37:48,992 INFO L262 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 8 conjunts are in the unsatisfiable core [2023-08-24 15:37:48,997 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 15:37:49,083 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-08-24 15:37:49,083 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 15:37:49,154 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-08-24 15:37:49,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1485223631] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 15:37:49,155 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 15:37:49,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 14 [2023-08-24 15:37:49,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321817297] [2023-08-24 15:37:49,155 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 15:37:49,156 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-08-24 15:37:49,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 15:37:49,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-08-24 15:37:49,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2023-08-24 15:37:49,160 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 356 [2023-08-24 15:37:49,161 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 175 places, 353 transitions, 4989 flow. Second operand has 15 states, 15 states have (on average 129.93333333333334) internal successors, (1949), 15 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 15:37:49,162 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 15:37:49,162 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 356 [2023-08-24 15:37:49,162 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 15:37:51,688 INFO L124 PetriNetUnfolderBase]: 8235/13974 cut-off events. [2023-08-24 15:37:51,688 INFO L125 PetriNetUnfolderBase]: For 200933/200933 co-relation queries the response was YES. [2023-08-24 15:37:51,749 INFO L83 FinitePrefix]: Finished finitePrefix Result has 110049 conditions, 13974 events. 8235/13974 cut-off events. For 200933/200933 co-relation queries the response was YES. Maximal size of possible extension queue 580. Compared 100087 event pairs, 1313 based on Foata normal form. 169/14143 useless extension candidates. Maximal degree in co-relation 108378. Up to 8747 conditions per place. [2023-08-24 15:37:51,802 INFO L140 encePairwiseOnDemand]: 348/356 looper letters, 591 selfloop transitions, 175 changer transitions 0/766 dead transitions. [2023-08-24 15:37:51,802 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 766 transitions, 12659 flow [2023-08-24 15:37:51,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-08-24 15:37:51,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-08-24 15:37:51,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1339 transitions. [2023-08-24 15:37:51,805 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37612359550561797 [2023-08-24 15:37:51,805 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1339 transitions. [2023-08-24 15:37:51,805 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1339 transitions. [2023-08-24 15:37:51,806 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 15:37:51,806 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1339 transitions. [2023-08-24 15:37:51,807 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 133.9) internal successors, (1339), 10 states have internal predecessors, (1339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 15:37:51,812 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 356.0) internal successors, (3916), 11 states have internal predecessors, (3916), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 15:37:51,812 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 356.0) internal successors, (3916), 11 states have internal predecessors, (3916), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 15:37:51,812 INFO L175 Difference]: Start difference. First operand has 175 places, 353 transitions, 4989 flow. Second operand 10 states and 1339 transitions. [2023-08-24 15:37:51,812 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 184 places, 766 transitions, 12659 flow [2023-08-24 15:37:53,186 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 182 places, 766 transitions, 12623 flow, removed 18 selfloop flow, removed 2 redundant places. [2023-08-24 15:37:53,195 INFO L231 Difference]: Finished difference. Result has 185 places, 437 transitions, 6813 flow [2023-08-24 15:37:53,196 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=356, PETRI_DIFFERENCE_MINUEND_FLOW=4973, PETRI_DIFFERENCE_MINUEND_PLACES=173, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=353, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=91, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=242, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=6813, PETRI_PLACES=185, PETRI_TRANSITIONS=437} [2023-08-24 15:37:53,196 INFO L281 CegarLoopForPetriNet]: 25 programPoint places, 160 predicate places. [2023-08-24 15:37:53,197 INFO L495 AbstractCegarLoop]: Abstraction has has 185 places, 437 transitions, 6813 flow [2023-08-24 15:37:53,197 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 129.93333333333334) internal successors, (1949), 15 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 15:37:53,197 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 15:37:53,197 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 15:37:53,207 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-08-24 15:37:53,403 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 15:37:53,403 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 15:37:53,404 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 15:37:53,404 INFO L85 PathProgramCache]: Analyzing trace with hash -527018048, now seen corresponding path program 7 times [2023-08-24 15:37:53,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 15:37:53,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357877272] [2023-08-24 15:37:53,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 15:37:53,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 15:37:53,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 15:37:55,425 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 15:37:55,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 15:37:55,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357877272] [2023-08-24 15:37:55,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1357877272] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 15:37:55,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1060837048] [2023-08-24 15:37:55,425 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-08-24 15:37:55,426 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 15:37:55,426 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 15:37:55,429 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-24 15:37:55,437 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-08-24 15:37:55,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 15:37:55,553 INFO L262 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 38 conjunts are in the unsatisfiable core [2023-08-24 15:37:55,556 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 15:37:57,889 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-24 15:37:57,898 INFO L322 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2023-08-24 15:37:57,898 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 44 [2023-08-24 15:37:57,904 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2023-08-24 15:37:57,973 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2023-08-24 15:37:57,998 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-24 15:37:57,999 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 15:37:58,251 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 15:37:58,251 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 94 treesize of output 135 [2023-08-24 15:37:58,257 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 36 [2023-08-24 15:37:58,592 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-08-24 15:37:58,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1060837048] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 15:37:58,593 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 15:37:58,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 8] total 32 [2023-08-24 15:37:58,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543383637] [2023-08-24 15:37:58,593 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 15:37:58,594 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2023-08-24 15:37:58,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 15:37:58,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2023-08-24 15:37:58,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=931, Unknown=1, NotChecked=0, Total=1122 [2023-08-24 15:37:58,597 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 356 [2023-08-24 15:37:58,598 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 185 places, 437 transitions, 6813 flow. Second operand has 34 states, 34 states have (on average 83.11764705882354) internal successors, (2826), 34 states have internal predecessors, (2826), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 15:37:58,598 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 15:37:58,598 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 356 [2023-08-24 15:37:58,599 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 15:38:01,979 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] [2023-08-24 15:38:02,350 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (+ (* c_~start~0 4) c_~queue~0.offset))) (and (= |c_thread2Thread1of1ForFork0_~cond~0#1| 1) (not (= (mod c_~ok~0 256) 0)) (<= c_~v_old~0 (select (select |c_#memory_int| c_~queue~0.base) .cse0)) (= c_~ok~0 1) (< c_~i~0 c_~N~0) (forall ((v_ArrVal_416 (Array Int Int))) (< c_~v_old~0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_416) c_~queue~0.base) .cse0) 1))))) is different from false [2023-08-24 15:38:06,867 INFO L124 PetriNetUnfolderBase]: 14265/24073 cut-off events. [2023-08-24 15:38:06,867 INFO L125 PetriNetUnfolderBase]: For 391213/391213 co-relation queries the response was YES. [2023-08-24 15:38:07,078 INFO L83 FinitePrefix]: Finished finitePrefix Result has 193492 conditions, 24073 events. 14265/24073 cut-off events. For 391213/391213 co-relation queries the response was YES. Maximal size of possible extension queue 1079. Compared 188575 event pairs, 1763 based on Foata normal form. 10/24083 useless extension candidates. Maximal degree in co-relation 188103. Up to 15108 conditions per place. [2023-08-24 15:38:07,196 INFO L140 encePairwiseOnDemand]: 339/356 looper letters, 508 selfloop transitions, 479 changer transitions 39/1026 dead transitions. [2023-08-24 15:38:07,196 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 219 places, 1026 transitions, 18703 flow [2023-08-24 15:38:07,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2023-08-24 15:38:07,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2023-08-24 15:38:07,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 3052 transitions. [2023-08-24 15:38:07,200 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2449438202247191 [2023-08-24 15:38:07,201 INFO L72 ComplementDD]: Start complementDD. Operand 35 states and 3052 transitions. [2023-08-24 15:38:07,201 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 3052 transitions. [2023-08-24 15:38:07,202 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 15:38:07,202 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 35 states and 3052 transitions. [2023-08-24 15:38:07,205 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 36 states, 35 states have (on average 87.2) internal successors, (3052), 35 states have internal predecessors, (3052), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 15:38:07,214 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 36 states, 36 states have (on average 356.0) internal successors, (12816), 36 states have internal predecessors, (12816), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 15:38:07,215 INFO L81 ComplementDD]: Finished complementDD. Result has 36 states, 36 states have (on average 356.0) internal successors, (12816), 36 states have internal predecessors, (12816), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 15:38:07,215 INFO L175 Difference]: Start difference. First operand has 185 places, 437 transitions, 6813 flow. Second operand 35 states and 3052 transitions. [2023-08-24 15:38:07,215 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 219 places, 1026 transitions, 18703 flow [2023-08-24 15:38:10,381 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 216 places, 1026 transitions, 18196 flow, removed 201 selfloop flow, removed 3 redundant places. [2023-08-24 15:38:10,393 INFO L231 Difference]: Finished difference. Result has 232 places, 739 transitions, 13647 flow [2023-08-24 15:38:10,394 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=356, PETRI_DIFFERENCE_MINUEND_FLOW=6597, PETRI_DIFFERENCE_MINUEND_PLACES=182, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=437, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=229, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=177, PETRI_DIFFERENCE_SUBTRAHEND_STATES=35, PETRI_FLOW=13647, PETRI_PLACES=232, PETRI_TRANSITIONS=739} [2023-08-24 15:38:10,394 INFO L281 CegarLoopForPetriNet]: 25 programPoint places, 207 predicate places. [2023-08-24 15:38:10,394 INFO L495 AbstractCegarLoop]: Abstraction has has 232 places, 739 transitions, 13647 flow [2023-08-24 15:38:10,395 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 83.11764705882354) internal successors, (2826), 34 states have internal predecessors, (2826), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 15:38:10,395 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 15:38:10,396 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 15:38:10,401 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 15:38:10,600 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 15:38:10,601 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 15:38:10,601 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 15:38:10,601 INFO L85 PathProgramCache]: Analyzing trace with hash 1934317398, now seen corresponding path program 8 times [2023-08-24 15:38:10,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 15:38:10,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860016377] [2023-08-24 15:38:10,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 15:38:10,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 15:38:10,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 15:38:11,924 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-24 15:38:11,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 15:38:11,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860016377] [2023-08-24 15:38:11,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [860016377] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 15:38:11,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2093090927] [2023-08-24 15:38:11,925 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-24 15:38:11,925 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 15:38:11,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 15:38:11,926 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 15:38:11,927 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 15:38:12,087 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-24 15:38:12,087 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-24 15:38:12,089 INFO L262 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 58 conjunts are in the unsatisfiable core [2023-08-24 15:38:12,091 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 15:38:12,268 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-08-24 15:38:12,322 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-24 15:38:12,323 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-24 15:38:12,384 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-24 15:38:12,384 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-24 15:38:12,564 INFO L322 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2023-08-24 15:38:12,565 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 34 treesize of output 10 [2023-08-24 15:38:12,587 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-24 15:38:12,588 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 15:38:17,017 WARN L839 $PredicateComparison]: unable to prove that (or (let ((.cse1 (* c_~end~0 4)) (.cse3 (+ c_~A~0.offset (* c_~i~0 4)))) (and (forall ((v_ArrVal_470 (Array Int Int)) (~queue~0.base Int) (~queue~0.offset Int)) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_470))) (let ((.cse0 (select .cse2 ~queue~0.base))) (or (not (= (select .cse0 (+ .cse1 ~queue~0.offset)) (select (select .cse2 c_~A~0.base) .cse3))) (< c_~v_old~0 (+ (select .cse0 (+ (* c_~start~0 4) ~queue~0.offset)) 1)))))) (or (forall ((v_ArrVal_470 (Array Int Int)) (~queue~0.base Int) (~queue~0.offset Int)) (not (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_470))) (= (select (select .cse4 ~queue~0.base) (+ .cse1 ~queue~0.offset)) (select (select .cse4 c_~A~0.base) .cse3))))) (not (= (mod c_~ok~0 256) 0))))) (and (<= c_~N~0 c_~i~0) (<= c_~end~0 c_~start~0))) is different from false [2023-08-24 15:38:18,547 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse1 (+ (* c_~i~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse2 (* c_~end~0 4))) (and (or (not (= (mod c_~ok~0 256) 0)) (forall ((v_ArrVal_469 (Array Int Int)) (v_ArrVal_470 (Array Int Int)) (~queue~0.base Int) (~queue~0.offset Int)) (not (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_469) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_470))) (= (select (select .cse0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse1) (select (select .cse0 ~queue~0.base) (+ .cse2 ~queue~0.offset))))))) (forall ((v_ArrVal_469 (Array Int Int)) (v_ArrVal_470 (Array Int Int)) (~queue~0.base Int) (~queue~0.offset Int)) (let ((.cse4 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_469) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_470))) (let ((.cse3 (select .cse4 ~queue~0.base))) (or (< (select (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (+ (select .cse3 (+ (* c_~start~0 4) ~queue~0.offset)) 1)) (not (= (select (select .cse4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse1) (select .cse3 (+ .cse2 ~queue~0.offset)))))))))) is different from false [2023-08-24 15:38:18,560 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 15:38:18,560 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 99 treesize of output 74 [2023-08-24 15:38:18,572 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 15:38:18,572 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 1101 treesize of output 1071 [2023-08-24 15:38:18,622 INFO L322 Elim1Store]: treesize reduction 24, result has 65.2 percent of original size [2023-08-24 15:38:18,623 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 667 treesize of output 672 [2023-08-24 15:38:18,660 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 15:38:18,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 569 treesize of output 477 [2023-08-24 15:38:18,705 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 15:38:18,706 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 462 treesize of output 436 [2023-08-24 15:38:23,723 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 7 [2023-08-24 15:38:23,765 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 15:38:23,766 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 30 treesize of output 26 [2023-08-24 15:38:23,804 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 15:38:23,804 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 41 treesize of output 31 [2023-08-24 15:38:23,857 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 15:38:23,857 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 24 treesize of output 20 [2023-08-24 15:38:23,889 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 15:38:23,889 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 25 [2023-08-24 15:38:23,934 INFO L322 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-08-24 15:38:23,934 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 28 treesize of output 1 [2023-08-24 15:38:23,956 INFO L322 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-08-24 15:38:23,956 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 22 treesize of output 1 [2023-08-24 15:38:23,974 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 5 [2023-08-24 15:38:23,992 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 7 [2023-08-24 15:38:24,546 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 15:38:24,547 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 147 treesize of output 417 [2023-08-24 15:38:24,553 INFO L209 tifierPushTermWalker]: Run 10 iterations without descend maybe there is a nontermination bug. [2023-08-24 15:38:25,885 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 15:38:25,885 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 41 [2023-08-24 15:38:25,888 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-24 15:38:25,889 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-24 15:38:25,894 INFO L322 Elim1Store]: treesize reduction 14, result has 6.7 percent of original size [2023-08-24 15:38:25,895 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 88 treesize of output 64 [2023-08-24 15:38:26,016 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 1 not checked. [2023-08-24 15:38:26,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2093090927] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 15:38:26,017 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 15:38:26,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 9] total 31 [2023-08-24 15:38:26,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621594586] [2023-08-24 15:38:26,017 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 15:38:26,017 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2023-08-24 15:38:26,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 15:38:26,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2023-08-24 15:38:26,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=775, Unknown=3, NotChecked=118, Total=1056 [2023-08-24 15:38:26,020 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 356 [2023-08-24 15:38:26,022 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 232 places, 739 transitions, 13647 flow. Second operand has 33 states, 33 states have (on average 83.18181818181819) internal successors, (2745), 33 states have internal predecessors, (2745), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 15:38:26,022 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 15:38:26,022 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 356 [2023-08-24 15:38:26,022 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 15:38:31,029 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.84s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 15:38:34,883 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.33s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 15:38:36,145 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 15:38:38,150 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 15:38:39,784 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.63s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 15:38:41,235 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.45s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 15:38:43,258 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 15:38:45,504 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.47s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 15:38:58,141 WARN L234 SmtUtils]: Spent 8.06s on a formula simplification. DAG size of input: 44 DAG size of output: 41 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-24 15:39:08,850 WARN L234 SmtUtils]: Spent 9.44s on a formula simplification. DAG size of input: 64 DAG size of output: 61 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-24 15:39:10,537 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse6 (not (= (mod c_~ok~0 256) 0))) (.cse4 (* c_~start~0 4))) (and (or (let ((.cse1 (* c_~end~0 4)) (.cse3 (+ c_~A~0.offset (* c_~i~0 4)))) (and (forall ((v_ArrVal_470 (Array Int Int)) (~queue~0.base Int) (~queue~0.offset Int)) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_470))) (let ((.cse0 (select .cse2 ~queue~0.base))) (or (not (= (select .cse0 (+ .cse1 ~queue~0.offset)) (select (select .cse2 c_~A~0.base) .cse3))) (< c_~v_old~0 (+ (select .cse0 (+ .cse4 ~queue~0.offset)) 1)))))) (or (forall ((v_ArrVal_470 (Array Int Int)) (~queue~0.base Int) (~queue~0.offset Int)) (not (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_470))) (= (select (select .cse5 ~queue~0.base) (+ .cse1 ~queue~0.offset)) (select (select .cse5 c_~A~0.base) .cse3))))) .cse6))) (<= c_~N~0 c_~i~0)) (or (= (mod |c_thread2Thread1of1ForFork0_~cond~0#1| 256) 0) (and .cse6 (< c_~v_old~0 (+ (select (select |c_#memory_int| c_~queue~0.base) (+ .cse4 c_~queue~0.offset)) 1)))))) is different from false [2023-08-24 15:39:12,228 INFO L124 PetriNetUnfolderBase]: 15126/25948 cut-off events. [2023-08-24 15:39:12,228 INFO L125 PetriNetUnfolderBase]: For 525001/525001 co-relation queries the response was YES. [2023-08-24 15:39:12,446 INFO L83 FinitePrefix]: Finished finitePrefix Result has 226654 conditions, 25948 events. 15126/25948 cut-off events. For 525001/525001 co-relation queries the response was YES. Maximal size of possible extension queue 1194. Compared 209767 event pairs, 1178 based on Foata normal form. 10/25958 useless extension candidates. Maximal degree in co-relation 226512. Up to 16474 conditions per place. [2023-08-24 15:39:12,555 INFO L140 encePairwiseOnDemand]: 338/356 looper letters, 508 selfloop transitions, 569 changer transitions 146/1223 dead transitions. [2023-08-24 15:39:12,556 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 263 places, 1223 transitions, 24607 flow [2023-08-24 15:39:12,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2023-08-24 15:39:12,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2023-08-24 15:39:12,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 2936 transitions. [2023-08-24 15:39:12,560 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.24256444150693984 [2023-08-24 15:39:12,560 INFO L72 ComplementDD]: Start complementDD. Operand 34 states and 2936 transitions. [2023-08-24 15:39:12,560 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 2936 transitions. [2023-08-24 15:39:12,561 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 15:39:12,561 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 34 states and 2936 transitions. [2023-08-24 15:39:12,565 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 35 states, 34 states have (on average 86.3529411764706) internal successors, (2936), 34 states have internal predecessors, (2936), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 15:39:12,573 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 35 states, 35 states have (on average 356.0) internal successors, (12460), 35 states have internal predecessors, (12460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 15:39:12,574 INFO L81 ComplementDD]: Finished complementDD. Result has 35 states, 35 states have (on average 356.0) internal successors, (12460), 35 states have internal predecessors, (12460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 15:39:12,574 INFO L175 Difference]: Start difference. First operand has 232 places, 739 transitions, 13647 flow. Second operand 34 states and 2936 transitions. [2023-08-24 15:39:12,574 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 263 places, 1223 transitions, 24607 flow [2023-08-24 15:39:16,184 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 254 places, 1223 transitions, 24094 flow, removed 238 selfloop flow, removed 9 redundant places. [2023-08-24 15:39:16,200 INFO L231 Difference]: Finished difference. Result has 268 places, 931 transitions, 18014 flow [2023-08-24 15:39:16,200 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=356, PETRI_DIFFERENCE_MINUEND_FLOW=13243, PETRI_DIFFERENCE_MINUEND_PLACES=221, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=739, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=381, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=309, PETRI_DIFFERENCE_SUBTRAHEND_STATES=34, PETRI_FLOW=18014, PETRI_PLACES=268, PETRI_TRANSITIONS=931} [2023-08-24 15:39:16,201 INFO L281 CegarLoopForPetriNet]: 25 programPoint places, 243 predicate places. [2023-08-24 15:39:16,201 INFO L495 AbstractCegarLoop]: Abstraction has has 268 places, 931 transitions, 18014 flow [2023-08-24 15:39:16,202 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 83.18181818181819) internal successors, (2745), 33 states have internal predecessors, (2745), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 15:39:16,202 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 15:39:16,202 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 15:39:16,207 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 15:39:16,402 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,SelfDestructingSolverStorable13 [2023-08-24 15:39:16,402 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 15:39:16,403 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 15:39:16,403 INFO L85 PathProgramCache]: Analyzing trace with hash 1417205376, now seen corresponding path program 1 times [2023-08-24 15:39:16,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 15:39:16,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530203348] [2023-08-24 15:39:16,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 15:39:16,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 15:39:16,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 15:39:17,641 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-24 15:39:17,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 15:39:17,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530203348] [2023-08-24 15:39:17,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [530203348] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 15:39:17,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [47475149] [2023-08-24 15:39:17,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 15:39:17,642 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 15:39:17,642 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 15:39:17,645 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 15:39:17,672 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 15:39:17,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 15:39:17,767 INFO L262 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 34 conjunts are in the unsatisfiable core [2023-08-24 15:39:17,769 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 15:39:18,122 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-24 15:39:18,134 INFO L322 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2023-08-24 15:39:18,134 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 44 [2023-08-24 15:39:18,141 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2023-08-24 15:39:18,261 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2023-08-24 15:39:18,287 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-08-24 15:39:18,287 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 15:39:18,462 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_517 (Array Int Int))) (< c_~v_old~0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_517) c_~queue~0.base) (+ (* c_~start~0 4) c_~queue~0.offset)) 1))) (not (= (mod c_~ok~0 256) 0))) is different from false [2023-08-24 15:39:18,586 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 15:39:18,587 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 94 treesize of output 135 [2023-08-24 15:39:18,595 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 36 [2023-08-24 15:39:18,828 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-08-24 15:39:18,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [47475149] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 15:39:18,829 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 15:39:18,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 8] total 28 [2023-08-24 15:39:18,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368217303] [2023-08-24 15:39:18,829 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 15:39:18,829 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2023-08-24 15:39:18,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 15:39:18,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2023-08-24 15:39:18,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=659, Unknown=1, NotChecked=54, Total=870 [2023-08-24 15:39:18,831 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 356 [2023-08-24 15:39:18,832 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 268 places, 931 transitions, 18014 flow. Second operand has 30 states, 30 states have (on average 87.5) internal successors, (2625), 30 states have internal predecessors, (2625), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 15:39:18,832 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 15:39:18,833 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 356 [2023-08-24 15:39:18,833 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 15:39:21,372 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] [2023-08-24 15:39:23,517 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-24 15:39:31,312 INFO L124 PetriNetUnfolderBase]: 15752/27282 cut-off events. [2023-08-24 15:39:31,312 INFO L125 PetriNetUnfolderBase]: For 644744/644744 co-relation queries the response was YES. [2023-08-24 15:39:31,565 INFO L83 FinitePrefix]: Finished finitePrefix Result has 257476 conditions, 27282 events. 15752/27282 cut-off events. For 644744/644744 co-relation queries the response was YES. Maximal size of possible extension queue 1213. Compared 224816 event pairs, 2664 based on Foata normal form. 15/27297 useless extension candidates. Maximal degree in co-relation 257322. Up to 17528 conditions per place. [2023-08-24 15:39:31,725 INFO L140 encePairwiseOnDemand]: 342/356 looper letters, 461 selfloop transitions, 920 changer transitions 28/1409 dead transitions. [2023-08-24 15:39:31,725 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 290 places, 1409 transitions, 30805 flow [2023-08-24 15:39:31,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-08-24 15:39:31,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2023-08-24 15:39:31,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 2466 transitions. [2023-08-24 15:39:31,736 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2565543071161049 [2023-08-24 15:39:31,736 INFO L72 ComplementDD]: Start complementDD. Operand 27 states and 2466 transitions. [2023-08-24 15:39:31,736 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 2466 transitions. [2023-08-24 15:39:31,738 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 15:39:31,738 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 27 states and 2466 transitions. [2023-08-24 15:39:31,744 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 28 states, 27 states have (on average 91.33333333333333) internal successors, (2466), 27 states have internal predecessors, (2466), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 15:39:31,755 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 28 states, 28 states have (on average 356.0) internal successors, (9968), 28 states have internal predecessors, (9968), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 15:39:31,756 INFO L81 ComplementDD]: Finished complementDD. Result has 28 states, 28 states have (on average 356.0) internal successors, (9968), 28 states have internal predecessors, (9968), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 15:39:31,756 INFO L175 Difference]: Start difference. First operand has 268 places, 931 transitions, 18014 flow. Second operand 27 states and 2466 transitions. [2023-08-24 15:39:31,756 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 290 places, 1409 transitions, 30805 flow [2023-08-24 15:39:36,530 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 282 places, 1409 transitions, 30169 flow, removed 306 selfloop flow, removed 8 redundant places. [2023-08-24 15:39:36,551 INFO L231 Difference]: Finished difference. Result has 290 places, 1249 transitions, 28260 flow [2023-08-24 15:39:36,552 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=356, PETRI_DIFFERENCE_MINUEND_FLOW=17676, PETRI_DIFFERENCE_MINUEND_PLACES=256, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=931, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=611, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=279, PETRI_DIFFERENCE_SUBTRAHEND_STATES=27, PETRI_FLOW=28260, PETRI_PLACES=290, PETRI_TRANSITIONS=1249} [2023-08-24 15:39:36,553 INFO L281 CegarLoopForPetriNet]: 25 programPoint places, 265 predicate places. [2023-08-24 15:39:36,553 INFO L495 AbstractCegarLoop]: Abstraction has has 290 places, 1249 transitions, 28260 flow [2023-08-24 15:39:36,553 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 87.5) internal successors, (2625), 30 states have internal predecessors, (2625), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 15:39:36,553 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 15:39:36,553 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 15:39:36,559 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 15:39:36,755 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,SelfDestructingSolverStorable14 [2023-08-24 15:39:36,755 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 15:39:36,755 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 15:39:36,755 INFO L85 PathProgramCache]: Analyzing trace with hash 1327103216, now seen corresponding path program 9 times [2023-08-24 15:39:36,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 15:39:36,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284486340] [2023-08-24 15:39:36,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 15:39:36,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 15:39:36,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 15:39:36,878 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-24 15:39:36,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 15:39:36,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284486340] [2023-08-24 15:39:36,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1284486340] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 15:39:36,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1257097823] [2023-08-24 15:39:36,879 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-24 15:39:36,879 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 15:39:36,879 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 15:39:36,881 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 15:39:36,905 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 15:39:37,031 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-08-24 15:39:37,031 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-24 15:39:37,033 INFO L262 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 8 conjunts are in the unsatisfiable core [2023-08-24 15:39:37,034 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 15:39:37,121 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-24 15:39:37,121 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 15:39:37,207 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-24 15:39:37,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1257097823] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 15:39:37,207 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 15:39:37,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 13 [2023-08-24 15:39:37,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736027169] [2023-08-24 15:39:37,207 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 15:39:37,208 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-08-24 15:39:37,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 15:39:37,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-08-24 15:39:37,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2023-08-24 15:39:37,209 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 356 [2023-08-24 15:39:37,210 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 290 places, 1249 transitions, 28260 flow. Second operand has 14 states, 14 states have (on average 126.07142857142857) internal successors, (1765), 14 states have internal predecessors, (1765), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 15:39:37,210 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 15:39:37,211 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 356 [2023-08-24 15:39:37,211 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 15:39:42,522 INFO L124 PetriNetUnfolderBase]: 8194/14870 cut-off events. [2023-08-24 15:39:42,523 INFO L125 PetriNetUnfolderBase]: For 421443/421443 co-relation queries the response was YES. [2023-08-24 15:39:42,626 INFO L83 FinitePrefix]: Finished finitePrefix Result has 148088 conditions, 14870 events. 8194/14870 cut-off events. For 421443/421443 co-relation queries the response was YES. Maximal size of possible extension queue 763. Compared 118141 event pairs, 1454 based on Foata normal form. 656/15526 useless extension candidates. Maximal degree in co-relation 147923. Up to 9331 conditions per place. [2023-08-24 15:39:42,677 INFO L140 encePairwiseOnDemand]: 346/356 looper letters, 513 selfloop transitions, 52 changer transitions 651/1216 dead transitions. [2023-08-24 15:39:42,677 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 302 places, 1216 transitions, 29243 flow [2023-08-24 15:39:42,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-08-24 15:39:42,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2023-08-24 15:39:42,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 2450 transitions. [2023-08-24 15:39:42,679 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3622117090479007 [2023-08-24 15:39:42,679 INFO L72 ComplementDD]: Start complementDD. Operand 19 states and 2450 transitions. [2023-08-24 15:39:42,679 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 2450 transitions. [2023-08-24 15:39:42,680 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 15:39:42,680 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 19 states and 2450 transitions. [2023-08-24 15:39:42,682 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 20 states, 19 states have (on average 128.94736842105263) internal successors, (2450), 19 states have internal predecessors, (2450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 15:39:42,686 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 20 states, 20 states have (on average 356.0) internal successors, (7120), 20 states have internal predecessors, (7120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 15:39:42,686 INFO L81 ComplementDD]: Finished complementDD. Result has 20 states, 20 states have (on average 356.0) internal successors, (7120), 20 states have internal predecessors, (7120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 15:39:42,686 INFO L175 Difference]: Start difference. First operand has 290 places, 1249 transitions, 28260 flow. Second operand 19 states and 2450 transitions. [2023-08-24 15:39:42,686 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 302 places, 1216 transitions, 29243 flow [2023-08-24 15:39:46,020 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 286 places, 1216 transitions, 27257 flow, removed 448 selfloop flow, removed 16 redundant places. [2023-08-24 15:39:46,035 INFO L231 Difference]: Finished difference. Result has 288 places, 537 transitions, 11395 flow [2023-08-24 15:39:46,036 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=356, PETRI_DIFFERENCE_MINUEND_FLOW=19551, PETRI_DIFFERENCE_MINUEND_PLACES=268, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=929, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=877, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=11395, PETRI_PLACES=288, PETRI_TRANSITIONS=537} [2023-08-24 15:39:46,036 INFO L281 CegarLoopForPetriNet]: 25 programPoint places, 263 predicate places. [2023-08-24 15:39:46,036 INFO L495 AbstractCegarLoop]: Abstraction has has 288 places, 537 transitions, 11395 flow [2023-08-24 15:39:46,037 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 126.07142857142857) internal successors, (1765), 14 states have internal predecessors, (1765), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 15:39:46,037 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 15:39:46,037 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 15:39:46,042 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 15:39:46,237 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2023-08-24 15:39:46,238 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 15:39:46,238 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 15:39:46,238 INFO L85 PathProgramCache]: Analyzing trace with hash 1313984529, now seen corresponding path program 10 times [2023-08-24 15:39:46,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 15:39:46,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363490599] [2023-08-24 15:39:46,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 15:39:46,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 15:39:46,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 15:39:47,446 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-24 15:39:47,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 15:39:47,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363490599] [2023-08-24 15:39:47,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1363490599] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 15:39:47,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1913268136] [2023-08-24 15:39:47,446 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-08-24 15:39:47,446 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 15:39:47,447 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 15:39:47,447 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 15:39:47,449 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 15:39:47,560 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-08-24 15:39:47,560 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-24 15:39:47,562 INFO L262 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 58 conjunts are in the unsatisfiable core [2023-08-24 15:39:47,565 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 15:39:48,740 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-24 15:39:48,741 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-24 15:39:48,742 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-24 15:39:48,783 INFO L322 Elim1Store]: treesize reduction 110, result has 31.7 percent of original size [2023-08-24 15:39:48,784 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 74 treesize of output 66 [2023-08-24 15:39:48,820 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-24 15:39:48,820 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 15:39:51,315 INFO L322 Elim1Store]: treesize reduction 158, result has 85.4 percent of original size [2023-08-24 15:39:51,316 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 13 select indices, 13 select index equivalence classes, 0 disjoint index pairs (out of 78 index pairs), introduced 13 new quantified variables, introduced 78 case distinctions, treesize of input 265 treesize of output 1013 [2023-08-24 15:42:02,727 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 15:42:03,867 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 15:42:16,999 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 15:42:23,734 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 15:42:28,062 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 15:42:34,187 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 15:42:36,409 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 15:42:38,559 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 15:42:40,411 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 15:42:44,918 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 15:42:48,233 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 15:42:58,157 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 15:43:01,945 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 15:43:05,940 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 15:43:09,597 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 15:43:12,405 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 15:43:14,018 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 15:43:17,839 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 15:43:20,721 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 15:43:38,040 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 15:43:42,483 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 15:44:02,116 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 15:44:05,033 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 15:44:18,595 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 15:44:26,535 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 15:44:33,150 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 15:44:43,915 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 15:47:36,307 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 15:47:37,683 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. Received shutdown request... [2023-08-24 15:47:49,164 WARN L266 SmtUtils]: Removed 2 from assertion stack [2023-08-24 15:47:49,166 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2023-08-24 15:47:49,171 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 15:47:49,202 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 15:47:49,202 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-08-24 15:47:49,371 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2023-08-24 15:47:49,372 WARN L619 AbstractCegarLoop]: Verification canceled: while CegarLoopForPetriNet was analyzing trace of length 31 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 10 for 47ms.. [2023-08-24 15:47:49,373 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2023-08-24 15:47:49,373 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2023-08-24 15:47:49,373 INFO L445 BasicCegarLoop]: Path program histogram: [10, 2, 1, 1, 1, 1, 1] [2023-08-24 15:47:49,376 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-24 15:47:49,376 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-24 15:47:49,378 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.08 03:47:49 BasicIcfg [2023-08-24 15:47:49,378 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-24 15:47:49,379 INFO L158 Benchmark]: Toolchain (without parser) took 822322.82ms. Allocated memory was 429.9MB in the beginning and 7.3GB in the end (delta: 6.9GB). Free memory was 385.0MB in the beginning and 2.9GB in the end (delta: -2.5GB). Peak memory consumption was 5.9GB. Max. memory is 16.0GB. [2023-08-24 15:47:49,379 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 429.9MB. Free memory was 407.1MB in the beginning and 407.0MB in the end (delta: 93.4kB). There was no memory consumed. Max. memory is 16.0GB. [2023-08-24 15:47:49,379 INFO L158 Benchmark]: CACSL2BoogieTranslator took 211.73ms. Allocated memory is still 429.9MB. Free memory was 385.0MB in the beginning and 373.3MB in the end (delta: 11.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.0GB. [2023-08-24 15:47:49,379 INFO L158 Benchmark]: Boogie Procedure Inliner took 66.92ms. Allocated memory is still 429.9MB. Free memory was 372.2MB in the beginning and 371.1MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-24 15:47:49,379 INFO L158 Benchmark]: Boogie Preprocessor took 40.98ms. Allocated memory is still 429.9MB. Free memory was 371.1MB in the beginning and 369.1MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-24 15:47:49,379 INFO L158 Benchmark]: RCFGBuilder took 620.24ms. Allocated memory is still 429.9MB. Free memory was 369.1MB in the beginning and 341.8MB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 16.0GB. [2023-08-24 15:47:49,380 INFO L158 Benchmark]: TraceAbstraction took 821372.51ms. Allocated memory was 429.9MB in the beginning and 7.3GB in the end (delta: 6.9GB). Free memory was 340.8MB in the beginning and 2.9GB in the end (delta: -2.5GB). Peak memory consumption was 5.8GB. Max. memory is 16.0GB. [2023-08-24 15:47:49,381 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.14ms. Allocated memory is still 429.9MB. Free memory was 407.1MB in the beginning and 407.0MB in the end (delta: 93.4kB). There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 211.73ms. Allocated memory is still 429.9MB. Free memory was 385.0MB in the beginning and 373.3MB in the end (delta: 11.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 66.92ms. Allocated memory is still 429.9MB. Free memory was 372.2MB in the beginning and 371.1MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 40.98ms. Allocated memory is still 429.9MB. Free memory was 371.1MB in the beginning and 369.1MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 620.24ms. Allocated memory is still 429.9MB. Free memory was 369.1MB in the beginning and 341.8MB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 16.0GB. * TraceAbstraction took 821372.51ms. Allocated memory was 429.9MB in the beginning and 7.3GB in the end (delta: 6.9GB). Free memory was 340.8MB in the beginning and 2.9GB in the end (delta: -2.5GB). Peak memory consumption was 5.8GB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.6s, 162 PlacesBefore, 25 PlacesAfterwards, 170 TransitionsBefore, 23 TransitionsAfterwards, 690 CoEnabledTransitionPairs, 7 FixpointIterations, 118 TrivialSequentialCompositions, 18 ConcurrentSequentialCompositions, 25 TrivialYvCompositions, 5 ConcurrentYvCompositions, 10 ChoiceCompositions, 176 TotalNumberOfCompositions, 1213 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1002, independent: 935, independent conditional: 0, independent unconditional: 935, dependent: 67, dependent conditional: 0, dependent unconditional: 67, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 390, independent: 379, independent conditional: 0, independent unconditional: 379, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1002, independent: 556, independent conditional: 0, independent unconditional: 556, dependent: 56, dependent conditional: 0, dependent unconditional: 56, unknown: 390, unknown conditional: 0, unknown unconditional: 390] , Statistics on independence cache: Total cache size (in pairs): 47, Positive cache size: 40, Positive conditional cache size: 0, Positive unconditional cache size: 40, Negative cache size: 7, Negative conditional cache size: 0, Negative unconditional cache size: 7, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - TimeoutResultAtElement [Line: 107]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while CegarLoopForPetriNet was analyzing trace of length 31 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 10 for 47ms.. - TimeoutResultAtElement [Line: 101]: 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 31 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 10 for 47ms.. - TimeoutResultAtElement [Line: 102]: 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 31 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 10 for 47ms.. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 190 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: 821.2s, OverallIterations: 17, TraceHistogramMax: 4, PathProgramHistogramMax: 10, EmptinessCheckTime: 0.0s, AutomataDifference: 272.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.8s, HoareTripleCheckerStatistics: 358 mSolverCounterUnknown, 2154 SdHoareTripleChecker+Valid, 54.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2154 mSDsluCounter, 21 SdHoareTripleChecker+Invalid, 53.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 2225 IncrementalHoareTripleChecker+Unchecked, 12 mSDsCounter, 247 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 7814 IncrementalHoareTripleChecker+Invalid, 10644 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 247 mSolverCounterUnsat, 9 mSDtfsCounter, 7814 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 358 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 747 GetRequests, 308 SyntacticMatches, 8 SemanticMatches, 431 ConstructedPredicates, 13 IntricatePredicates, 0 DeprecatedPredicates, 5219 ImplicationChecksByTransitivity, 182.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=28260occurred in iteration=15, InterpolantAutomatonStates: 301, 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.2s SatisfiabilityAnalysisTime, 55.4s InterpolantComputationTime, 586 NumberOfCodeBlocks, 586 NumberOfCodeBlocksAsserted, 35 NumberOfCheckSat, 768 ConstructedInterpolants, 70 QuantifiedInterpolants, 13522 SizeOfPredicates, 180 NumberOfNonLiveVariables, 2643 ConjunctsInSsa, 363 ConjunctsInUnsatCore, 35 InterpolantComputations, 7 PerfectInterpolantSequences, 121/250 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