/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 -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread/queue_ok_longest.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-23 22:28:20,221 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-23 22:28:20,278 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-23 22:28:20,281 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-23 22:28:20,281 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-23 22:28:20,309 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-23 22:28:20,310 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-23 22:28:20,310 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-23 22:28:20,310 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-23 22:28:20,313 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-23 22:28:20,313 INFO L153 SettingsManager]: * Use SBE=true [2023-08-23 22:28:20,314 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-23 22:28:20,314 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-23 22:28:20,315 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-23 22:28:20,315 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-23 22:28:20,315 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-23 22:28:20,315 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-23 22:28:20,315 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-23 22:28:20,316 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-23 22:28:20,316 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-23 22:28:20,316 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-23 22:28:20,317 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-23 22:28:20,317 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-23 22:28:20,317 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-23 22:28:20,317 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-23 22:28:20,317 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-23 22:28:20,318 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-23 22:28:20,318 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-23 22:28:20,318 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-23 22:28:20,318 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-23 22:28:20,319 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-23 22:28:20,319 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-23 22:28:20,319 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-23 22:28:20,319 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-23 22:28:20,319 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-23 22:28:20,319 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 [2023-08-23 22:28:20,534 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-23 22:28:20,549 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-23 22:28:20,550 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-23 22:28:20,551 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-23 22:28:20,551 INFO L274 PluginConnector]: CDTParser initialized [2023-08-23 22:28:20,552 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/queue_ok_longest.i [2023-08-23 22:28:21,594 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-23 22:28:21,820 INFO L384 CDTParser]: Found 1 translation units. [2023-08-23 22:28:21,820 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_ok_longest.i [2023-08-23 22:28:21,835 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4c0c52534/a14b9d0712ed4541a94ad6c165073c99/FLAG82e8e49cd [2023-08-23 22:28:21,846 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4c0c52534/a14b9d0712ed4541a94ad6c165073c99 [2023-08-23 22:28:21,849 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-23 22:28:21,851 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-23 22:28:21,852 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-23 22:28:21,853 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-23 22:28:21,854 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-23 22:28:21,855 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.08 10:28:21" (1/1) ... [2023-08-23 22:28:21,856 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c2e3080 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.08 10:28:21, skipping insertion in model container [2023-08-23 22:28:21,856 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.08 10:28:21" (1/1) ... [2023-08-23 22:28:21,901 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-23 22:28:22,226 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_ok_longest.i[43280,43293] [2023-08-23 22:28:22,229 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_ok_longest.i[43553,43566] [2023-08-23 22:28:22,236 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-23 22:28:22,245 INFO L201 MainTranslator]: Completed pre-run [2023-08-23 22:28:22,265 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [258] [2023-08-23 22:28:22,266 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [258] [2023-08-23 22:28:22,277 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: unsigned short [750] [2023-08-23 22:28:22,284 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_ok_longest.i[43280,43293] [2023-08-23 22:28:22,286 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_ok_longest.i[43553,43566] [2023-08-23 22:28:22,287 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-23 22:28:22,334 INFO L206 MainTranslator]: Completed translation [2023-08-23 22:28:22,334 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.08 10:28:22 WrapperNode [2023-08-23 22:28:22,335 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-23 22:28:22,335 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-23 22:28:22,335 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-23 22:28:22,335 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-23 22:28:22,339 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.08 10:28:22" (1/1) ... [2023-08-23 22:28:22,351 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.08 10:28:22" (1/1) ... [2023-08-23 22:28:22,377 INFO L138 Inliner]: procedures = 274, calls = 57, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 203 [2023-08-23 22:28:22,377 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-23 22:28:22,378 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-23 22:28:22,378 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-23 22:28:22,378 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-23 22:28:22,387 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.08 10:28:22" (1/1) ... [2023-08-23 22:28:22,387 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.08 10:28:22" (1/1) ... [2023-08-23 22:28:22,390 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.08 10:28:22" (1/1) ... [2023-08-23 22:28:22,390 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.08 10:28:22" (1/1) ... [2023-08-23 22:28:22,396 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.08 10:28:22" (1/1) ... [2023-08-23 22:28:22,398 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.08 10:28:22" (1/1) ... [2023-08-23 22:28:22,399 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.08 10:28:22" (1/1) ... [2023-08-23 22:28:22,416 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.08 10:28:22" (1/1) ... [2023-08-23 22:28:22,419 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-23 22:28:22,420 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-23 22:28:22,420 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-23 22:28:22,420 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-23 22:28:22,420 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.08 10:28:22" (1/1) ... [2023-08-23 22:28:22,424 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-23 22:28:22,443 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-23 22:28:22,454 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-23 22:28:22,456 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-23 22:28:22,480 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2023-08-23 22:28:22,481 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2023-08-23 22:28:22,481 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2023-08-23 22:28:22,481 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2023-08-23 22:28:22,482 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-23 22:28:22,482 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-23 22:28:22,482 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-23 22:28:22,482 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-23 22:28:22,482 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-08-23 22:28:22,482 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-23 22:28:22,483 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-23 22:28:22,483 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-23 22:28:22,483 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-23 22:28:22,484 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-23 22:28:22,582 INFO L236 CfgBuilder]: Building ICFG [2023-08-23 22:28:22,584 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-23 22:28:22,902 INFO L277 CfgBuilder]: Performing block encoding [2023-08-23 22:28:22,908 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-23 22:28:22,908 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2023-08-23 22:28:22,910 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.08 10:28:22 BoogieIcfgContainer [2023-08-23 22:28:22,910 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-23 22:28:22,911 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-23 22:28:22,911 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-23 22:28:22,916 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-23 22:28:22,916 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.08 10:28:21" (1/3) ... [2023-08-23 22:28:22,916 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@399aa0c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.08 10:28:22, skipping insertion in model container [2023-08-23 22:28:22,916 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.08 10:28:22" (2/3) ... [2023-08-23 22:28:22,916 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@399aa0c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.08 10:28:22, skipping insertion in model container [2023-08-23 22:28:22,917 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.08 10:28:22" (3/3) ... [2023-08-23 22:28:22,917 INFO L112 eAbstractionObserver]: Analyzing ICFG queue_ok_longest.i [2023-08-23 22:28:22,929 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-23 22:28:22,929 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-08-23 22:28:22,929 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-23 22:28:23,014 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-08-23 22:28:23,046 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 210 places, 216 transitions, 448 flow [2023-08-23 22:28:23,124 INFO L124 PetriNetUnfolderBase]: 13/214 cut-off events. [2023-08-23 22:28:23,124 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-08-23 22:28:23,130 INFO L83 FinitePrefix]: Finished finitePrefix Result has 223 conditions, 214 events. 13/214 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 359 event pairs, 0 based on Foata normal form. 0/199 useless extension candidates. Maximal degree in co-relation 141. Up to 3 conditions per place. [2023-08-23 22:28:23,130 INFO L82 GeneralOperation]: Start removeDead. Operand has 210 places, 216 transitions, 448 flow [2023-08-23 22:28:23,138 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 199 places, 205 transitions, 419 flow [2023-08-23 22:28:23,141 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-23 22:28:23,150 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 199 places, 205 transitions, 419 flow [2023-08-23 22:28:23,152 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 199 places, 205 transitions, 419 flow [2023-08-23 22:28:23,153 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 199 places, 205 transitions, 419 flow [2023-08-23 22:28:23,195 INFO L124 PetriNetUnfolderBase]: 13/205 cut-off events. [2023-08-23 22:28:23,195 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-08-23 22:28:23,197 INFO L83 FinitePrefix]: Finished finitePrefix Result has 213 conditions, 205 events. 13/205 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 293 event pairs, 0 based on Foata normal form. 0/190 useless extension candidates. Maximal degree in co-relation 141. Up to 3 conditions per place. [2023-08-23 22:28:23,200 INFO L119 LiptonReduction]: Number of co-enabled transitions 9984 [2023-08-23 22:28:29,290 INFO L134 LiptonReduction]: Checked pairs total: 19772 [2023-08-23 22:28:29,291 INFO L136 LiptonReduction]: Total number of compositions: 186 [2023-08-23 22:28:29,318 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-23 22:28:29,323 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;@1875a972, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-23 22:28:29,324 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2023-08-23 22:28:29,325 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-23 22:28:29,325 INFO L124 PetriNetUnfolderBase]: 0/0 cut-off events. [2023-08-23 22:28:29,325 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-23 22:28:29,325 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-23 22:28:29,325 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-23 22:28:29,326 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-23 22:28:29,328 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-23 22:28:29,328 INFO L85 PathProgramCache]: Analyzing trace with hash 839, now seen corresponding path program 1 times [2023-08-23 22:28:29,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-23 22:28:29,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342075139] [2023-08-23 22:28:29,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-23 22:28:29,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-23 22:28:29,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-23 22:28:29,426 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-23 22:28:29,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-23 22:28:29,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342075139] [2023-08-23 22:28:29,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [342075139] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-23 22:28:29,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-23 22:28:29,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-23 22:28:29,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687496285] [2023-08-23 22:28:29,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-23 22:28:29,434 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-23 22:28:29,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-23 22:28:29,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-23 22:28:29,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-23 22:28:29,456 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 205 out of 402 [2023-08-23 22:28:29,460 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 47 transitions, 103 flow. Second operand has 2 states, 2 states have (on average 205.5) internal successors, (411), 2 states have internal predecessors, (411), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:28:29,460 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-23 22:28:29,460 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 205 of 402 [2023-08-23 22:28:29,461 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-23 22:28:29,642 INFO L124 PetriNetUnfolderBase]: 829/1341 cut-off events. [2023-08-23 22:28:29,642 INFO L125 PetriNetUnfolderBase]: For 52/52 co-relation queries the response was YES. [2023-08-23 22:28:29,646 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2685 conditions, 1341 events. 829/1341 cut-off events. For 52/52 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 5736 event pairs, 621 based on Foata normal form. 0/1143 useless extension candidates. Maximal degree in co-relation 2519. Up to 1297 conditions per place. [2023-08-23 22:28:29,652 INFO L140 encePairwiseOnDemand]: 401/402 looper letters, 38 selfloop transitions, 0 changer transitions 1/46 dead transitions. [2023-08-23 22:28:29,653 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 46 transitions, 179 flow [2023-08-23 22:28:29,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-23 22:28:29,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-23 22:28:29,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 450 transitions. [2023-08-23 22:28:29,668 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5597014925373134 [2023-08-23 22:28:29,669 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 450 transitions. [2023-08-23 22:28:29,669 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 450 transitions. [2023-08-23 22:28:29,672 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-23 22:28:29,673 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 450 transitions. [2023-08-23 22:28:29,676 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 225.0) internal successors, (450), 2 states have internal predecessors, (450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:28:29,679 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 402.0) internal successors, (1206), 3 states have internal predecessors, (1206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:28:29,680 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 402.0) internal successors, (1206), 3 states have internal predecessors, (1206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:28:29,681 INFO L175 Difference]: Start difference. First operand has 47 places, 47 transitions, 103 flow. Second operand 2 states and 450 transitions. [2023-08-23 22:28:29,682 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 46 transitions, 179 flow [2023-08-23 22:28:29,683 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 46 transitions, 174 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-23 22:28:29,685 INFO L231 Difference]: Finished difference. Result has 44 places, 45 transitions, 94 flow [2023-08-23 22:28:29,687 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=402, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=94, PETRI_PLACES=44, PETRI_TRANSITIONS=45} [2023-08-23 22:28:29,689 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, -3 predicate places. [2023-08-23 22:28:29,689 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 45 transitions, 94 flow [2023-08-23 22:28:29,689 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 205.5) internal successors, (411), 2 states have internal predecessors, (411), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:28:29,690 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-23 22:28:29,690 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-23 22:28:29,690 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-23 22:28:29,690 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-23 22:28:29,696 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-23 22:28:29,696 INFO L85 PathProgramCache]: Analyzing trace with hash 1319934340, now seen corresponding path program 1 times [2023-08-23 22:28:29,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-23 22:28:29,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129102575] [2023-08-23 22:28:29,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-23 22:28:29,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-23 22:28:29,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-23 22:28:29,912 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-23 22:28:29,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-23 22:28:29,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129102575] [2023-08-23 22:28:29,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [129102575] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-23 22:28:29,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-23 22:28:29,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-23 22:28:29,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025124049] [2023-08-23 22:28:29,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-23 22:28:29,914 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-23 22:28:29,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-23 22:28:29,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-23 22:28:29,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-23 22:28:29,915 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 199 out of 402 [2023-08-23 22:28:29,916 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 45 transitions, 94 flow. Second operand has 3 states, 3 states have (on average 204.0) internal successors, (612), 3 states have internal predecessors, (612), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:28:29,916 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-23 22:28:29,916 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 199 of 402 [2023-08-23 22:28:29,916 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-23 22:28:29,985 INFO L124 PetriNetUnfolderBase]: 248/490 cut-off events. [2023-08-23 22:28:29,985 INFO L125 PetriNetUnfolderBase]: For 13/13 co-relation queries the response was YES. [2023-08-23 22:28:29,985 INFO L83 FinitePrefix]: Finished finitePrefix Result has 983 conditions, 490 events. 248/490 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 2048 event pairs, 164 based on Foata normal form. 0/440 useless extension candidates. Maximal degree in co-relation 980. Up to 253 conditions per place. [2023-08-23 22:28:29,986 INFO L140 encePairwiseOnDemand]: 398/402 looper letters, 40 selfloop transitions, 2 changer transitions 8/53 dead transitions. [2023-08-23 22:28:29,987 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 53 transitions, 209 flow [2023-08-23 22:28:29,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-23 22:28:29,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-23 22:28:29,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 646 transitions. [2023-08-23 22:28:29,989 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5356550580431177 [2023-08-23 22:28:29,989 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 646 transitions. [2023-08-23 22:28:29,989 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 646 transitions. [2023-08-23 22:28:29,989 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-23 22:28:29,989 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 646 transitions. [2023-08-23 22:28:29,990 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 215.33333333333334) internal successors, (646), 3 states have internal predecessors, (646), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:28:29,993 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 402.0) internal successors, (1608), 4 states have internal predecessors, (1608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:28:29,993 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 402.0) internal successors, (1608), 4 states have internal predecessors, (1608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:28:29,993 INFO L175 Difference]: Start difference. First operand has 44 places, 45 transitions, 94 flow. Second operand 3 states and 646 transitions. [2023-08-23 22:28:29,993 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 53 transitions, 209 flow [2023-08-23 22:28:29,994 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 53 transitions, 209 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-23 22:28:29,995 INFO L231 Difference]: Finished difference. Result has 46 places, 41 transitions, 94 flow [2023-08-23 22:28:29,995 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=402, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=94, PETRI_PLACES=46, PETRI_TRANSITIONS=41} [2023-08-23 22:28:29,995 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, -1 predicate places. [2023-08-23 22:28:29,995 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 41 transitions, 94 flow [2023-08-23 22:28:29,996 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 204.0) internal successors, (612), 3 states have internal predecessors, (612), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:28:29,996 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-23 22:28:29,996 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-23 22:28:29,996 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-23 22:28:29,996 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-23 22:28:29,997 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-23 22:28:29,997 INFO L85 PathProgramCache]: Analyzing trace with hash -312369892, now seen corresponding path program 1 times [2023-08-23 22:28:29,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-23 22:28:29,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724558855] [2023-08-23 22:28:29,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-23 22:28:29,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-23 22:28:30,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-23 22:28:30,047 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-23 22:28:30,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-23 22:28:30,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724558855] [2023-08-23 22:28:30,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1724558855] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-23 22:28:30,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-23 22:28:30,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-23 22:28:30,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442550644] [2023-08-23 22:28:30,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-23 22:28:30,048 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-23 22:28:30,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-23 22:28:30,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-23 22:28:30,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-23 22:28:30,049 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 198 out of 402 [2023-08-23 22:28:30,050 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 41 transitions, 94 flow. Second operand has 3 states, 3 states have (on average 204.0) internal successors, (612), 3 states have internal predecessors, (612), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:28:30,050 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-23 22:28:30,050 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 198 of 402 [2023-08-23 22:28:30,050 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-23 22:28:30,123 INFO L124 PetriNetUnfolderBase]: 245/490 cut-off events. [2023-08-23 22:28:30,123 INFO L125 PetriNetUnfolderBase]: For 18/18 co-relation queries the response was YES. [2023-08-23 22:28:30,123 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1025 conditions, 490 events. 245/490 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 1755 event pairs, 155 based on Foata normal form. 0/452 useless extension candidates. Maximal degree in co-relation 1020. Up to 357 conditions per place. [2023-08-23 22:28:30,125 INFO L140 encePairwiseOnDemand]: 398/402 looper letters, 48 selfloop transitions, 3 changer transitions 0/55 dead transitions. [2023-08-23 22:28:30,125 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 55 transitions, 226 flow [2023-08-23 22:28:30,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-23 22:28:30,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-23 22:28:30,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 646 transitions. [2023-08-23 22:28:30,126 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5356550580431177 [2023-08-23 22:28:30,126 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 646 transitions. [2023-08-23 22:28:30,127 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 646 transitions. [2023-08-23 22:28:30,127 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-23 22:28:30,127 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 646 transitions. [2023-08-23 22:28:30,128 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 215.33333333333334) internal successors, (646), 3 states have internal predecessors, (646), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:28:30,130 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 402.0) internal successors, (1608), 4 states have internal predecessors, (1608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:28:30,130 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 402.0) internal successors, (1608), 4 states have internal predecessors, (1608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:28:30,130 INFO L175 Difference]: Start difference. First operand has 46 places, 41 transitions, 94 flow. Second operand 3 states and 646 transitions. [2023-08-23 22:28:30,131 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 55 transitions, 226 flow [2023-08-23 22:28:30,131 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 55 transitions, 222 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-23 22:28:30,132 INFO L231 Difference]: Finished difference. Result has 44 places, 43 transitions, 109 flow [2023-08-23 22:28:30,132 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=402, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=109, PETRI_PLACES=44, PETRI_TRANSITIONS=43} [2023-08-23 22:28:30,132 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, -3 predicate places. [2023-08-23 22:28:30,132 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 43 transitions, 109 flow [2023-08-23 22:28:30,133 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 204.0) internal successors, (612), 3 states have internal predecessors, (612), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:28:30,133 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-23 22:28:30,133 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-23 22:28:30,133 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-23 22:28:30,133 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-23 22:28:30,134 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-23 22:28:30,134 INFO L85 PathProgramCache]: Analyzing trace with hash -824947493, now seen corresponding path program 1 times [2023-08-23 22:28:30,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-23 22:28:30,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639420423] [2023-08-23 22:28:30,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-23 22:28:30,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-23 22:28:30,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-23 22:28:30,302 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-23 22:28:30,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-23 22:28:30,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639420423] [2023-08-23 22:28:30,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [639420423] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-23 22:28:30,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-23 22:28:30,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-23 22:28:30,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139144540] [2023-08-23 22:28:30,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-23 22:28:30,304 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-23 22:28:30,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-23 22:28:30,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-23 22:28:30,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-23 22:28:30,306 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 194 out of 402 [2023-08-23 22:28:30,307 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 43 transitions, 109 flow. Second operand has 3 states, 3 states have (on average 202.0) internal successors, (606), 3 states have internal predecessors, (606), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:28:30,307 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-23 22:28:30,307 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 194 of 402 [2023-08-23 22:28:30,307 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-23 22:28:30,370 INFO L124 PetriNetUnfolderBase]: 187/394 cut-off events. [2023-08-23 22:28:30,371 INFO L125 PetriNetUnfolderBase]: For 18/18 co-relation queries the response was YES. [2023-08-23 22:28:30,371 INFO L83 FinitePrefix]: Finished finitePrefix Result has 871 conditions, 394 events. 187/394 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 1256 event pairs, 12 based on Foata normal form. 42/410 useless extension candidates. Maximal degree in co-relation 865. Up to 341 conditions per place. [2023-08-23 22:28:30,372 INFO L140 encePairwiseOnDemand]: 399/402 looper letters, 43 selfloop transitions, 3 changer transitions 0/49 dead transitions. [2023-08-23 22:28:30,372 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 49 transitions, 216 flow [2023-08-23 22:28:30,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-23 22:28:30,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-23 22:28:30,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 628 transitions. [2023-08-23 22:28:30,374 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5207296849087893 [2023-08-23 22:28:30,374 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 628 transitions. [2023-08-23 22:28:30,374 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 628 transitions. [2023-08-23 22:28:30,374 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-23 22:28:30,374 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 628 transitions. [2023-08-23 22:28:30,375 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 209.33333333333334) internal successors, (628), 3 states have internal predecessors, (628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:28:30,377 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 402.0) internal successors, (1608), 4 states have internal predecessors, (1608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:28:30,378 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 402.0) internal successors, (1608), 4 states have internal predecessors, (1608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:28:30,378 INFO L175 Difference]: Start difference. First operand has 44 places, 43 transitions, 109 flow. Second operand 3 states and 628 transitions. [2023-08-23 22:28:30,378 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 49 transitions, 216 flow [2023-08-23 22:28:30,379 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 49 transitions, 213 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-23 22:28:30,380 INFO L231 Difference]: Finished difference. Result has 45 places, 43 transitions, 112 flow [2023-08-23 22:28:30,380 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=402, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=112, PETRI_PLACES=45, PETRI_TRANSITIONS=43} [2023-08-23 22:28:30,381 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, -2 predicate places. [2023-08-23 22:28:30,381 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 43 transitions, 112 flow [2023-08-23 22:28:30,382 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 202.0) internal successors, (606), 3 states have internal predecessors, (606), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:28:30,382 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-23 22:28:30,382 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-23 22:28:30,382 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-23 22:28:30,382 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-23 22:28:30,382 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-23 22:28:30,382 INFO L85 PathProgramCache]: Analyzing trace with hash 818194887, now seen corresponding path program 1 times [2023-08-23 22:28:30,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-23 22:28:30,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776091169] [2023-08-23 22:28:30,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-23 22:28:30,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-23 22:28:30,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-23 22:28:30,461 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-23 22:28:30,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-23 22:28:30,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776091169] [2023-08-23 22:28:30,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [776091169] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-23 22:28:30,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [150526761] [2023-08-23 22:28:30,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-23 22:28:30,462 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-23 22:28:30,462 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-23 22:28:30,470 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-23 22:28:30,503 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-23 22:28:30,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-23 22:28:30,577 INFO L262 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-23 22:28:30,580 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-23 22:28:30,641 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-23 22:28:30,642 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-23 22:28:30,667 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-23 22:28:30,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [150526761] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-23 22:28:30,667 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-23 22:28:30,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2023-08-23 22:28:30,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025832525] [2023-08-23 22:28:30,668 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-23 22:28:30,668 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-23 22:28:30,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-23 22:28:30,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-23 22:28:30,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-08-23 22:28:30,670 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 198 out of 402 [2023-08-23 22:28:30,672 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 43 transitions, 112 flow. Second operand has 7 states, 7 states have (on average 203.57142857142858) internal successors, (1425), 7 states have internal predecessors, (1425), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:28:30,672 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-23 22:28:30,672 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 198 of 402 [2023-08-23 22:28:30,672 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-23 22:28:30,812 INFO L124 PetriNetUnfolderBase]: 246/531 cut-off events. [2023-08-23 22:28:30,813 INFO L125 PetriNetUnfolderBase]: For 36/38 co-relation queries the response was YES. [2023-08-23 22:28:30,813 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1200 conditions, 531 events. 246/531 cut-off events. For 36/38 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1513 event pairs, 100 based on Foata normal form. 12/507 useless extension candidates. Maximal degree in co-relation 1194. Up to 238 conditions per place. [2023-08-23 22:28:30,815 INFO L140 encePairwiseOnDemand]: 397/402 looper letters, 70 selfloop transitions, 10 changer transitions 1/84 dead transitions. [2023-08-23 22:28:30,815 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 84 transitions, 370 flow [2023-08-23 22:28:30,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-23 22:28:30,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-23 22:28:30,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1271 transitions. [2023-08-23 22:28:30,818 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5269485903814262 [2023-08-23 22:28:30,818 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1271 transitions. [2023-08-23 22:28:30,818 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1271 transitions. [2023-08-23 22:28:30,819 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-23 22:28:30,819 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1271 transitions. [2023-08-23 22:28:30,821 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 211.83333333333334) internal successors, (1271), 6 states have internal predecessors, (1271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:28:30,824 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 402.0) internal successors, (2814), 7 states have internal predecessors, (2814), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:28:30,825 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 402.0) internal successors, (2814), 7 states have internal predecessors, (2814), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:28:30,825 INFO L175 Difference]: Start difference. First operand has 45 places, 43 transitions, 112 flow. Second operand 6 states and 1271 transitions. [2023-08-23 22:28:30,825 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 84 transitions, 370 flow [2023-08-23 22:28:30,827 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 84 transitions, 367 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-23 22:28:30,828 INFO L231 Difference]: Finished difference. Result has 53 places, 47 transitions, 170 flow [2023-08-23 22:28:30,828 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=402, PETRI_DIFFERENCE_MINUEND_FLOW=109, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=170, PETRI_PLACES=53, PETRI_TRANSITIONS=47} [2023-08-23 22:28:30,829 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, 6 predicate places. [2023-08-23 22:28:30,830 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 47 transitions, 170 flow [2023-08-23 22:28:30,830 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 203.57142857142858) internal successors, (1425), 7 states have internal predecessors, (1425), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:28:30,831 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-23 22:28:30,831 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-23 22:28:30,852 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-08-23 22:28:31,035 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-23 22:28:31,038 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-23 22:28:31,039 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-23 22:28:31,039 INFO L85 PathProgramCache]: Analyzing trace with hash -1030938622, now seen corresponding path program 2 times [2023-08-23 22:28:31,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-23 22:28:31,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635453194] [2023-08-23 22:28:31,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-23 22:28:31,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-23 22:28:31,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-23 22:28:31,191 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-23 22:28:31,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-23 22:28:31,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1635453194] [2023-08-23 22:28:31,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1635453194] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-23 22:28:31,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1981566617] [2023-08-23 22:28:31,191 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-23 22:28:31,192 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-23 22:28:31,192 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-23 22:28:31,197 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-23 22:28:31,199 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-23 22:28:31,374 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-23 22:28:31,375 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-23 22:28:31,377 INFO L262 TraceCheckSpWp]: Trace formula consists of 435 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-23 22:28:31,379 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-23 22:28:31,431 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-23 22:28:31,432 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-23 22:28:31,518 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-23 22:28:31,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1981566617] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-23 22:28:31,518 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-23 22:28:31,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2023-08-23 22:28:31,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000784745] [2023-08-23 22:28:31,519 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-23 22:28:31,519 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-08-23 22:28:31,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-23 22:28:31,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-08-23 22:28:31,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2023-08-23 22:28:31,521 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 198 out of 402 [2023-08-23 22:28:31,523 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 47 transitions, 170 flow. Second operand has 13 states, 13 states have (on average 203.84615384615384) internal successors, (2650), 13 states have internal predecessors, (2650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:28:31,523 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-23 22:28:31,523 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 198 of 402 [2023-08-23 22:28:31,523 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-23 22:28:31,762 INFO L124 PetriNetUnfolderBase]: 423/934 cut-off events. [2023-08-23 22:28:31,762 INFO L125 PetriNetUnfolderBase]: For 328/328 co-relation queries the response was YES. [2023-08-23 22:28:31,764 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2367 conditions, 934 events. 423/934 cut-off events. For 328/328 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2534 event pairs, 91 based on Foata normal form. 24/900 useless extension candidates. Maximal degree in co-relation 2357. Up to 217 conditions per place. [2023-08-23 22:28:31,766 INFO L140 encePairwiseOnDemand]: 397/402 looper letters, 136 selfloop transitions, 22 changer transitions 0/161 dead transitions. [2023-08-23 22:28:31,766 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 161 transitions, 836 flow [2023-08-23 22:28:31,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-08-23 22:28:31,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-08-23 22:28:31,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 2540 transitions. [2023-08-23 22:28:31,771 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5265339966832504 [2023-08-23 22:28:31,771 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 2540 transitions. [2023-08-23 22:28:31,771 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 2540 transitions. [2023-08-23 22:28:31,772 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-23 22:28:31,772 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 2540 transitions. [2023-08-23 22:28:31,775 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 211.66666666666666) internal successors, (2540), 12 states have internal predecessors, (2540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:28:31,780 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 402.0) internal successors, (5226), 13 states have internal predecessors, (5226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:28:31,781 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 402.0) internal successors, (5226), 13 states have internal predecessors, (5226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:28:31,781 INFO L175 Difference]: Start difference. First operand has 53 places, 47 transitions, 170 flow. Second operand 12 states and 2540 transitions. [2023-08-23 22:28:31,781 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 161 transitions, 836 flow [2023-08-23 22:28:31,783 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 161 transitions, 797 flow, removed 18 selfloop flow, removed 1 redundant places. [2023-08-23 22:28:31,785 INFO L231 Difference]: Finished difference. Result has 70 places, 60 transitions, 320 flow [2023-08-23 22:28:31,785 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=402, PETRI_DIFFERENCE_MINUEND_FLOW=155, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=320, PETRI_PLACES=70, PETRI_TRANSITIONS=60} [2023-08-23 22:28:31,785 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, 23 predicate places. [2023-08-23 22:28:31,785 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 60 transitions, 320 flow [2023-08-23 22:28:31,786 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 203.84615384615384) internal successors, (2650), 13 states have internal predecessors, (2650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:28:31,786 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-23 22:28:31,787 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-23 22:28:31,806 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-08-23 22:28:31,991 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,SelfDestructingSolverStorable5 [2023-08-23 22:28:31,991 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-23 22:28:31,992 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-23 22:28:31,992 INFO L85 PathProgramCache]: Analyzing trace with hash -122187422, now seen corresponding path program 3 times [2023-08-23 22:28:31,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-23 22:28:31,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224320707] [2023-08-23 22:28:31,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-23 22:28:31,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-23 22:28:32,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-23 22:28:32,332 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-23 22:28:32,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-23 22:28:32,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [224320707] [2023-08-23 22:28:32,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [224320707] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-23 22:28:32,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2045791623] [2023-08-23 22:28:32,332 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-23 22:28:32,333 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-23 22:28:32,333 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-23 22:28:32,349 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-23 22:28:32,423 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-23 22:28:32,899 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2023-08-23 22:28:32,899 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-23 22:28:32,902 INFO L262 TraceCheckSpWp]: Trace formula consists of 388 conjuncts, 47 conjunts are in the unsatisfiable core [2023-08-23 22:28:32,906 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-23 22:28:33,226 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-23 22:28:33,261 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-23 22:28:33,262 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-23 22:28:33,342 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-23 22:28:33,343 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2023-08-23 22:28:33,376 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 19 treesize of output 18 [2023-08-23 22:28:33,382 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 76 proven. 45 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2023-08-23 22:28:33,382 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-23 22:28:33,471 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_38| Int) (v_ArrVal_576 (Array Int Int)) (v_ArrVal_578 Int)) (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_576) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (or (< (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_38|) |c_~#queue~0.offset|) v_ArrVal_578) .cse1) 800) (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_38|)))) is different from false [2023-08-23 22:28:33,491 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-23 22:28:33,492 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 52 treesize of output 42 [2023-08-23 22:28:33,500 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-23 22:28:33,503 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 75 treesize of output 77 [2023-08-23 22:28:33,509 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 36 treesize of output 28 [2023-08-23 22:28:33,527 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 8 treesize of output 4 [2023-08-23 22:28:33,546 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-23 22:28:33,546 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 50 treesize of output 46 [2023-08-23 22:28:33,665 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 68 proven. 45 refuted. 0 times theorem prover too weak. 204 trivial. 8 not checked. [2023-08-23 22:28:33,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2045791623] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-23 22:28:33,665 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-23 22:28:33,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 7, 7] total 25 [2023-08-23 22:28:33,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498300139] [2023-08-23 22:28:33,665 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-23 22:28:33,666 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-08-23 22:28:33,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-23 22:28:33,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-08-23 22:28:33,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=434, Unknown=1, NotChecked=44, Total=600 [2023-08-23 22:28:33,668 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 151 out of 402 [2023-08-23 22:28:33,671 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 60 transitions, 320 flow. Second operand has 25 states, 25 states have (on average 156.6) internal successors, (3915), 25 states have internal predecessors, (3915), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:28:33,671 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-23 22:28:33,671 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 402 [2023-08-23 22:28:33,671 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-23 22:28:35,060 INFO L124 PetriNetUnfolderBase]: 821/1800 cut-off events. [2023-08-23 22:28:35,060 INFO L125 PetriNetUnfolderBase]: For 1316/1316 co-relation queries the response was YES. [2023-08-23 22:28:35,063 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4861 conditions, 1800 events. 821/1800 cut-off events. For 1316/1316 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 6406 event pairs, 57 based on Foata normal form. 8/1737 useless extension candidates. Maximal degree in co-relation 4844. Up to 285 conditions per place. [2023-08-23 22:28:35,069 INFO L140 encePairwiseOnDemand]: 390/402 looper letters, 267 selfloop transitions, 110 changer transitions 1/380 dead transitions. [2023-08-23 22:28:35,069 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 380 transitions, 2040 flow [2023-08-23 22:28:35,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2023-08-23 22:28:35,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2023-08-23 22:28:35,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 6885 transitions. [2023-08-23 22:28:35,081 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3982992016660882 [2023-08-23 22:28:35,081 INFO L72 ComplementDD]: Start complementDD. Operand 43 states and 6885 transitions. [2023-08-23 22:28:35,081 INFO L73 IsDeterministic]: Start isDeterministic. Operand 43 states and 6885 transitions. [2023-08-23 22:28:35,084 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-23 22:28:35,084 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 43 states and 6885 transitions. [2023-08-23 22:28:35,093 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 44 states, 43 states have (on average 160.11627906976744) internal successors, (6885), 43 states have internal predecessors, (6885), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:28:35,108 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 44 states, 44 states have (on average 402.0) internal successors, (17688), 44 states have internal predecessors, (17688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:28:35,110 INFO L81 ComplementDD]: Finished complementDD. Result has 44 states, 44 states have (on average 402.0) internal successors, (17688), 44 states have internal predecessors, (17688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:28:35,111 INFO L175 Difference]: Start difference. First operand has 70 places, 60 transitions, 320 flow. Second operand 43 states and 6885 transitions. [2023-08-23 22:28:35,111 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 380 transitions, 2040 flow [2023-08-23 22:28:35,116 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 380 transitions, 2025 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-23 22:28:35,119 INFO L231 Difference]: Finished difference. Result has 134 places, 163 transitions, 1172 flow [2023-08-23 22:28:35,119 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=402, PETRI_DIFFERENCE_MINUEND_FLOW=309, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=43, PETRI_FLOW=1172, PETRI_PLACES=134, PETRI_TRANSITIONS=163} [2023-08-23 22:28:35,119 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, 87 predicate places. [2023-08-23 22:28:35,119 INFO L495 AbstractCegarLoop]: Abstraction has has 134 places, 163 transitions, 1172 flow [2023-08-23 22:28:35,121 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 156.6) internal successors, (3915), 25 states have internal predecessors, (3915), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:28:35,121 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-23 22:28:35,121 INFO L208 CegarLoopForPetriNet]: trace histogram [11, 11, 11, 11, 6, 6, 6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-23 22:28:35,128 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-08-23 22:28:35,325 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-23 22:28:35,326 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-23 22:28:35,326 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-23 22:28:35,326 INFO L85 PathProgramCache]: Analyzing trace with hash -161773555, now seen corresponding path program 1 times [2023-08-23 22:28:35,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-23 22:28:35,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394353905] [2023-08-23 22:28:35,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-23 22:28:35,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-23 22:28:35,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-23 22:28:35,634 INFO L134 CoverageAnalysis]: Checked inductivity of 346 backedges. 0 proven. 346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-23 22:28:35,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-23 22:28:35,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394353905] [2023-08-23 22:28:35,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [394353905] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-23 22:28:35,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2018833199] [2023-08-23 22:28:35,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-23 22:28:35,635 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-23 22:28:35,635 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-23 22:28:35,637 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-23 22:28:35,639 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-23 22:28:35,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-23 22:28:35,813 INFO L262 TraceCheckSpWp]: Trace formula consists of 769 conjuncts, 13 conjunts are in the unsatisfiable core [2023-08-23 22:28:35,816 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-23 22:28:35,899 INFO L134 CoverageAnalysis]: Checked inductivity of 346 backedges. 0 proven. 346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-23 22:28:35,899 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-23 22:28:36,129 INFO L134 CoverageAnalysis]: Checked inductivity of 346 backedges. 0 proven. 346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-23 22:28:36,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2018833199] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-23 22:28:36,130 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-23 22:28:36,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 27 [2023-08-23 22:28:36,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606786241] [2023-08-23 22:28:36,130 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-23 22:28:36,130 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2023-08-23 22:28:36,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-23 22:28:36,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2023-08-23 22:28:36,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2023-08-23 22:28:36,133 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 198 out of 402 [2023-08-23 22:28:36,137 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 163 transitions, 1172 flow. Second operand has 27 states, 27 states have (on average 204.25925925925927) internal successors, (5515), 27 states have internal predecessors, (5515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:28:36,137 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-23 22:28:36,137 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 198 of 402 [2023-08-23 22:28:36,137 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-23 22:28:36,980 INFO L124 PetriNetUnfolderBase]: 1371/3210 cut-off events. [2023-08-23 22:28:36,980 INFO L125 PetriNetUnfolderBase]: For 28289/28289 co-relation queries the response was YES. [2023-08-23 22:28:36,989 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14004 conditions, 3210 events. 1371/3210 cut-off events. For 28289/28289 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 11580 event pairs, 136 based on Foata normal form. 104/3290 useless extension candidates. Maximal degree in co-relation 13961. Up to 452 conditions per place. [2023-08-23 22:28:37,002 INFO L140 encePairwiseOnDemand]: 397/402 looper letters, 413 selfloop transitions, 75 changer transitions 0/491 dead transitions. [2023-08-23 22:28:37,002 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 491 transitions, 5503 flow [2023-08-23 22:28:37,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-08-23 22:28:37,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2023-08-23 22:28:37,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 5501 transitions. [2023-08-23 22:28:37,010 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5263107539226942 [2023-08-23 22:28:37,010 INFO L72 ComplementDD]: Start complementDD. Operand 26 states and 5501 transitions. [2023-08-23 22:28:37,010 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 5501 transitions. [2023-08-23 22:28:37,012 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-23 22:28:37,013 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 26 states and 5501 transitions. [2023-08-23 22:28:37,020 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 27 states, 26 states have (on average 211.57692307692307) internal successors, (5501), 26 states have internal predecessors, (5501), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:28:37,028 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 27 states, 27 states have (on average 402.0) internal successors, (10854), 27 states have internal predecessors, (10854), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:28:37,029 INFO L81 ComplementDD]: Finished complementDD. Result has 27 states, 27 states have (on average 402.0) internal successors, (10854), 27 states have internal predecessors, (10854), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:28:37,029 INFO L175 Difference]: Start difference. First operand has 134 places, 163 transitions, 1172 flow. Second operand 26 states and 5501 transitions. [2023-08-23 22:28:37,029 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 159 places, 491 transitions, 5503 flow [2023-08-23 22:28:37,060 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 491 transitions, 5316 flow, removed 14 selfloop flow, removed 11 redundant places. [2023-08-23 22:28:37,067 INFO L231 Difference]: Finished difference. Result has 162 places, 201 transitions, 1742 flow [2023-08-23 22:28:37,068 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=402, PETRI_DIFFERENCE_MINUEND_FLOW=1053, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=163, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=26, PETRI_FLOW=1742, PETRI_PLACES=162, PETRI_TRANSITIONS=201} [2023-08-23 22:28:37,068 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, 115 predicate places. [2023-08-23 22:28:37,069 INFO L495 AbstractCegarLoop]: Abstraction has has 162 places, 201 transitions, 1742 flow [2023-08-23 22:28:37,070 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 204.25925925925927) internal successors, (5515), 27 states have internal predecessors, (5515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:28:37,070 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-23 22:28:37,070 INFO L208 CegarLoopForPetriNet]: trace histogram [24, 24, 24, 24, 12, 12, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-23 22:28:37,077 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-23 22:28:37,275 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-23 22:28:37,275 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-23 22:28:37,276 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-23 22:28:37,276 INFO L85 PathProgramCache]: Analyzing trace with hash -346057744, now seen corresponding path program 2 times [2023-08-23 22:28:37,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-23 22:28:37,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400387064] [2023-08-23 22:28:37,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-23 22:28:37,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-23 22:28:37,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-23 22:28:38,149 INFO L134 CoverageAnalysis]: Checked inductivity of 1734 backedges. 0 proven. 1734 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-23 22:28:38,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-23 22:28:38,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400387064] [2023-08-23 22:28:38,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [400387064] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-23 22:28:38,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1857283713] [2023-08-23 22:28:38,150 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-23 22:28:38,150 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-23 22:28:38,150 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-23 22:28:38,153 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-23 22:28:38,179 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-23 22:28:38,549 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-23 22:28:38,549 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-23 22:28:38,555 INFO L262 TraceCheckSpWp]: Trace formula consists of 1387 conjuncts, 26 conjunts are in the unsatisfiable core [2023-08-23 22:28:38,559 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-23 22:28:38,754 INFO L134 CoverageAnalysis]: Checked inductivity of 1734 backedges. 0 proven. 1734 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-23 22:28:38,755 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-23 22:28:39,518 INFO L134 CoverageAnalysis]: Checked inductivity of 1734 backedges. 0 proven. 1734 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-23 22:28:39,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1857283713] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-23 22:28:39,518 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-23 22:28:39,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 53 [2023-08-23 22:28:39,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448658934] [2023-08-23 22:28:39,518 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-23 22:28:39,523 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2023-08-23 22:28:39,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-23 22:28:39,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2023-08-23 22:28:39,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2023-08-23 22:28:39,531 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 198 out of 402 [2023-08-23 22:28:39,537 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 201 transitions, 1742 flow. Second operand has 53 states, 53 states have (on average 204.41509433962264) internal successors, (10834), 53 states have internal predecessors, (10834), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:28:39,537 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-23 22:28:39,537 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 198 of 402 [2023-08-23 22:28:39,537 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-23 22:28:41,605 INFO L124 PetriNetUnfolderBase]: 2697/6382 cut-off events. [2023-08-23 22:28:41,605 INFO L125 PetriNetUnfolderBase]: For 100006/100006 co-relation queries the response was YES. [2023-08-23 22:28:41,627 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29607 conditions, 6382 events. 2697/6382 cut-off events. For 100006/100006 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 23247 event pairs, 136 based on Foata normal form. 208/6566 useless extension candidates. Maximal degree in co-relation 29551. Up to 1128 conditions per place. [2023-08-23 22:28:41,646 INFO L140 encePairwiseOnDemand]: 397/402 looper letters, 829 selfloop transitions, 153 changer transitions 0/985 dead transitions. [2023-08-23 22:28:41,647 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 213 places, 985 transitions, 11795 flow [2023-08-23 22:28:41,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2023-08-23 22:28:41,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2023-08-23 22:28:41,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 11000 transitions. [2023-08-23 22:28:41,656 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5262150784538844 [2023-08-23 22:28:41,656 INFO L72 ComplementDD]: Start complementDD. Operand 52 states and 11000 transitions. [2023-08-23 22:28:41,656 INFO L73 IsDeterministic]: Start isDeterministic. Operand 52 states and 11000 transitions. [2023-08-23 22:28:41,658 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-23 22:28:41,658 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 52 states and 11000 transitions. [2023-08-23 22:28:41,667 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 53 states, 52 states have (on average 211.53846153846155) internal successors, (11000), 52 states have internal predecessors, (11000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:28:41,680 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 53 states, 53 states have (on average 402.0) internal successors, (21306), 53 states have internal predecessors, (21306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:28:41,682 INFO L81 ComplementDD]: Finished complementDD. Result has 53 states, 53 states have (on average 402.0) internal successors, (21306), 53 states have internal predecessors, (21306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:28:41,682 INFO L175 Difference]: Start difference. First operand has 162 places, 201 transitions, 1742 flow. Second operand 52 states and 11000 transitions. [2023-08-23 22:28:41,682 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 213 places, 985 transitions, 11795 flow [2023-08-23 22:28:41,779 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 202 places, 985 transitions, 11732 flow, removed 0 selfloop flow, removed 11 redundant places. [2023-08-23 22:28:41,786 INFO L231 Difference]: Finished difference. Result has 229 places, 281 transitions, 3410 flow [2023-08-23 22:28:41,786 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=402, PETRI_DIFFERENCE_MINUEND_FLOW=1679, PETRI_DIFFERENCE_MINUEND_PLACES=151, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=201, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=73, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=52, PETRI_FLOW=3410, PETRI_PLACES=229, PETRI_TRANSITIONS=281} [2023-08-23 22:28:41,786 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, 182 predicate places. [2023-08-23 22:28:41,786 INFO L495 AbstractCegarLoop]: Abstraction has has 229 places, 281 transitions, 3410 flow [2023-08-23 22:28:41,789 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 53 states have (on average 204.41509433962264) internal successors, (10834), 53 states have internal predecessors, (10834), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:28:41,789 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-23 22:28:41,789 INFO L208 CegarLoopForPetriNet]: trace histogram [50, 50, 50, 50, 25, 25, 25, 25, 25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-23 22:28:41,811 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-08-23 22:28:41,994 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-23 22:28:41,995 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-23 22:28:41,995 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-23 22:28:41,995 INFO L85 PathProgramCache]: Analyzing trace with hash 890330880, now seen corresponding path program 3 times [2023-08-23 22:28:41,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-23 22:28:41,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023352081] [2023-08-23 22:28:41,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-23 22:28:41,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-23 22:28:42,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-23 22:28:44,792 INFO L134 CoverageAnalysis]: Checked inductivity of 7675 backedges. 0 proven. 7675 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-23 22:28:44,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-23 22:28:44,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023352081] [2023-08-23 22:28:44,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2023352081] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-23 22:28:44,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [724954622] [2023-08-23 22:28:44,792 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-23 22:28:44,792 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-23 22:28:44,793 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-23 22:28:44,793 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-23 22:28:44,795 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-23 22:28:46,219 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2023-08-23 22:28:46,220 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-23 22:28:46,225 INFO L262 TraceCheckSpWp]: Trace formula consists of 437 conjuncts, 59 conjunts are in the unsatisfiable core [2023-08-23 22:28:46,231 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-23 22:28:47,107 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 13 treesize of output 9 [2023-08-23 22:28:47,144 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-23 22:28:47,144 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-08-23 22:28:47,195 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-23 22:28:47,202 INFO L322 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2023-08-23 22:28:47,203 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 27 [2023-08-23 22:28:47,254 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 23 treesize of output 22 [2023-08-23 22:28:47,318 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 18 [2023-08-23 22:28:47,352 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-23 22:28:47,352 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-08-23 22:28:47,421 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-23 22:28:47,427 INFO L322 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2023-08-23 22:28:47,428 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 27 [2023-08-23 22:28:47,467 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 23 treesize of output 22 [2023-08-23 22:28:47,474 INFO L134 CoverageAnalysis]: Checked inductivity of 7675 backedges. 644 proven. 245 refuted. 0 times theorem prover too weak. 6786 trivial. 0 not checked. [2023-08-23 22:28:47,474 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-23 22:28:47,664 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2175 Int) (v_ArrVal_2171 Int) (v_ArrVal_2173 (Array Int Int))) (or (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1) v_ArrVal_2171) (not (= (let ((.cse1 (+ |c_~#queue~0.offset| 3204))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2171)) |c_~#stored_elements~0.base| v_ArrVal_2173) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) v_ArrVal_2175)) .cse1)) 800)))) is different from false [2023-08-23 22:28:47,679 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2175 Int) (v_ArrVal_2171 Int) (v_ArrVal_2173 (Array Int Int))) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse1 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_2171) (not (= (let ((.cse3 (+ |c_~#queue~0.offset| 3204))) (select (let ((.cse2 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse0 .cse1 v_ArrVal_2171)) |c_~#stored_elements~0.base| v_ArrVal_2173) |c_~#queue~0.base|))) (store .cse2 (+ |c_~#queue~0.offset| (* (select .cse2 .cse3) 4)) v_ArrVal_2175)) .cse3)) 800))))) is different from false [2023-08-23 22:28:47,694 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2175 Int) (v_ArrVal_2169 Int) (v_ArrVal_2171 Int) (v_ArrVal_2173 (Array Int Int))) (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (or (not (= (let ((.cse1 (+ |c_~#queue~0.offset| 3204))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse2 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2169) .cse3 v_ArrVal_2171)) |c_~#stored_elements~0.base| v_ArrVal_2173) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2175)) .cse1)) 800)) (< (+ (select .cse2 .cse3) 1) v_ArrVal_2171)))) is different from false [2023-08-23 22:28:47,724 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2175 Int) (v_ArrVal_2167 Int) (v_ArrVal_2169 Int) (v_ArrVal_2171 Int) (v_ArrVal_2173 (Array Int Int))) (let ((.cse0 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2167)) (.cse1 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_2171) (not (= 800 (let ((.cse3 (+ |c_~#queue~0.offset| 3204))) (select (let ((.cse2 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse0 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2169) .cse1 v_ArrVal_2171)) |c_~#stored_elements~0.base| v_ArrVal_2173) |c_~#queue~0.base|))) (store .cse2 (+ (* (select .cse2 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_2175)) .cse3))))))) is different from false [2023-08-23 22:28:51,964 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-23 22:28:51,964 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 179 treesize of output 129 [2023-08-23 22:28:51,972 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-23 22:28:51,973 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 212 treesize of output 212 [2023-08-23 22:28:51,979 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 72 treesize of output 60 [2023-08-23 22:28:51,986 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 40 treesize of output 32 [2023-08-23 22:28:52,003 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 7 treesize of output 3 [2023-08-23 22:28:52,019 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-23 22:28:52,019 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 75 treesize of output 71 [2023-08-23 22:28:54,520 INFO L134 CoverageAnalysis]: Checked inductivity of 7675 backedges. 356 proven. 241 refuted. 48 times theorem prover too weak. 6786 trivial. 244 not checked. [2023-08-23 22:28:54,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [724954622] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-23 22:28:54,520 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-23 22:28:54,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 11, 13] total 75 [2023-08-23 22:28:54,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111626898] [2023-08-23 22:28:54,521 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-23 22:28:54,521 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 75 states [2023-08-23 22:28:54,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-23 22:28:54,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2023-08-23 22:28:54,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1497, Invalid=3475, Unknown=14, NotChecked=564, Total=5550 [2023-08-23 22:28:54,527 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 149 out of 402 [2023-08-23 22:28:54,532 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 229 places, 281 transitions, 3410 flow. Second operand has 75 states, 75 states have (on average 155.26666666666668) internal successors, (11645), 75 states have internal predecessors, (11645), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:28:54,532 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-23 22:28:54,532 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 149 of 402 [2023-08-23 22:28:54,532 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-23 22:30:08,324 INFO L124 PetriNetUnfolderBase]: 5789/13244 cut-off events. [2023-08-23 22:30:08,324 INFO L125 PetriNetUnfolderBase]: For 195510/195510 co-relation queries the response was YES. [2023-08-23 22:30:08,399 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67354 conditions, 13244 events. 5789/13244 cut-off events. For 195510/195510 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 61762 event pairs, 213 based on Foata normal form. 408/13616 useless extension candidates. Maximal degree in co-relation 67271. Up to 2163 conditions per place. [2023-08-23 22:30:08,442 INFO L140 encePairwiseOnDemand]: 386/402 looper letters, 1958 selfloop transitions, 1567 changer transitions 1/3528 dead transitions. [2023-08-23 22:30:08,442 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 749 places, 3528 transitions, 35161 flow [2023-08-23 22:30:08,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 521 states. [2023-08-23 22:30:08,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 521 states. [2023-08-23 22:30:08,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 521 states to 521 states and 81260 transitions. [2023-08-23 22:30:08,498 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3879833080279982 [2023-08-23 22:30:08,499 INFO L72 ComplementDD]: Start complementDD. Operand 521 states and 81260 transitions. [2023-08-23 22:30:08,499 INFO L73 IsDeterministic]: Start isDeterministic. Operand 521 states and 81260 transitions. [2023-08-23 22:30:08,514 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-23 22:30:08,514 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 521 states and 81260 transitions. [2023-08-23 22:30:08,763 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 522 states, 521 states have (on average 155.96928982725527) internal successors, (81260), 521 states have internal predecessors, (81260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:30:08,896 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 522 states, 522 states have (on average 402.0) internal successors, (209844), 522 states have internal predecessors, (209844), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:30:08,925 INFO L81 ComplementDD]: Finished complementDD. Result has 522 states, 522 states have (on average 402.0) internal successors, (209844), 522 states have internal predecessors, (209844), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:30:08,925 INFO L175 Difference]: Start difference. First operand has 229 places, 281 transitions, 3410 flow. Second operand 521 states and 81260 transitions. [2023-08-23 22:30:08,925 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 749 places, 3528 transitions, 35161 flow [2023-08-23 22:30:09,407 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 726 places, 3528 transitions, 34942 flow, removed 0 selfloop flow, removed 23 redundant places. [2023-08-23 22:30:09,434 INFO L231 Difference]: Finished difference. Result has 982 places, 1808 transitions, 28624 flow [2023-08-23 22:30:09,435 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=402, PETRI_DIFFERENCE_MINUEND_FLOW=3242, PETRI_DIFFERENCE_MINUEND_PLACES=206, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=275, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=243, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=521, PETRI_FLOW=28624, PETRI_PLACES=982, PETRI_TRANSITIONS=1808} [2023-08-23 22:30:09,435 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, 935 predicate places. [2023-08-23 22:30:09,436 INFO L495 AbstractCegarLoop]: Abstraction has has 982 places, 1808 transitions, 28624 flow [2023-08-23 22:30:09,437 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 75 states, 75 states have (on average 155.26666666666668) internal successors, (11645), 75 states have internal predecessors, (11645), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:30:09,437 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-23 22:30:09,437 INFO L208 CegarLoopForPetriNet]: trace histogram [51, 51, 51, 51, 38, 38, 38, 38, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-23 22:30:09,447 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-23 22:30:09,643 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-23 22:30:09,644 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-23 22:30:09,644 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-23 22:30:09,644 INFO L85 PathProgramCache]: Analyzing trace with hash -1940408699, now seen corresponding path program 4 times [2023-08-23 22:30:09,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-23 22:30:09,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749617493] [2023-08-23 22:30:09,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-23 22:30:09,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-23 22:30:09,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-23 22:30:12,391 INFO L134 CoverageAnalysis]: Checked inductivity of 8691 backedges. 0 proven. 8691 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-23 22:30:12,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-23 22:30:12,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749617493] [2023-08-23 22:30:12,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1749617493] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-23 22:30:12,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2126825834] [2023-08-23 22:30:12,392 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-08-23 22:30:12,392 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-23 22:30:12,392 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-23 22:30:12,393 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-23 22:30:12,395 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-23 22:31:59,717 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-08-23 22:31:59,717 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-23 22:31:59,743 INFO L262 TraceCheckSpWp]: Trace formula consists of 2682 conjuncts, 53 conjunts are in the unsatisfiable core [2023-08-23 22:31:59,749 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-23 22:32:00,136 INFO L134 CoverageAnalysis]: Checked inductivity of 8691 backedges. 0 proven. 8691 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-23 22:32:00,137 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-23 22:32:03,082 INFO L134 CoverageAnalysis]: Checked inductivity of 8691 backedges. 0 proven. 8691 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-23 22:32:03,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2126825834] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-23 22:32:03,082 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-23 22:32:03,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54, 54] total 107 [2023-08-23 22:32:03,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464887311] [2023-08-23 22:32:03,083 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-23 22:32:03,083 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 107 states [2023-08-23 22:32:03,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-23 22:32:03,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2023-08-23 22:32:03,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5671, Invalid=5671, Unknown=0, NotChecked=0, Total=11342 [2023-08-23 22:32:03,094 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 198 out of 402 [2023-08-23 22:32:03,102 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 982 places, 1808 transitions, 28624 flow. Second operand has 107 states, 107 states have (on average 204.69158878504672) internal successors, (21902), 107 states have internal predecessors, (21902), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:32:03,102 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-23 22:32:03,102 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 198 of 402 [2023-08-23 22:32:03,102 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-23 22:32:45,055 INFO L124 PetriNetUnfolderBase]: 10300/25207 cut-off events. [2023-08-23 22:32:45,055 INFO L125 PetriNetUnfolderBase]: For 19689145/19689145 co-relation queries the response was YES. [2023-08-23 22:32:45,651 INFO L83 FinitePrefix]: Finished finitePrefix Result has 700705 conditions, 25207 events. 10300/25207 cut-off events. For 19689145/19689145 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 121941 event pairs, 393 based on Foata normal form. 848/26019 useless extension candidates. Maximal degree in co-relation 700365. Up to 6939 conditions per place. [2023-08-23 22:32:45,942 INFO L140 encePairwiseOnDemand]: 397/402 looper letters, 3731 selfloop transitions, 522 changer transitions 0/4256 dead transitions. [2023-08-23 22:32:45,943 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1087 places, 4256 transitions, 144092 flow [2023-08-23 22:32:45,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2023-08-23 22:32:45,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2023-08-23 22:32:45,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 22421 transitions. [2023-08-23 22:32:45,955 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5261663381207171 [2023-08-23 22:32:45,955 INFO L72 ComplementDD]: Start complementDD. Operand 106 states and 22421 transitions. [2023-08-23 22:32:45,955 INFO L73 IsDeterministic]: Start isDeterministic. Operand 106 states and 22421 transitions. [2023-08-23 22:32:45,959 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-23 22:32:45,959 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 106 states and 22421 transitions. [2023-08-23 22:32:45,971 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 107 states, 106 states have (on average 211.5188679245283) internal successors, (22421), 106 states have internal predecessors, (22421), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:32:45,991 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 107 states, 107 states have (on average 402.0) internal successors, (43014), 107 states have internal predecessors, (43014), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:32:45,994 INFO L81 ComplementDD]: Finished complementDD. Result has 107 states, 107 states have (on average 402.0) internal successors, (43014), 107 states have internal predecessors, (43014), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:32:45,994 INFO L175 Difference]: Start difference. First operand has 982 places, 1808 transitions, 28624 flow. Second operand 106 states and 22421 transitions. [2023-08-23 22:32:45,994 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1087 places, 4256 transitions, 144092 flow [2023-08-23 22:33:05,610 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 996 places, 4256 transitions, 119310 flow, removed 10235 selfloop flow, removed 91 redundant places. [2023-08-23 22:33:05,653 INFO L231 Difference]: Finished difference. Result has 1050 places, 2072 transitions, 22080 flow [2023-08-23 22:33:05,654 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=402, PETRI_DIFFERENCE_MINUEND_FLOW=16141, PETRI_DIFFERENCE_MINUEND_PLACES=891, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1808, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=258, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1546, PETRI_DIFFERENCE_SUBTRAHEND_STATES=106, PETRI_FLOW=22080, PETRI_PLACES=1050, PETRI_TRANSITIONS=2072} [2023-08-23 22:33:05,655 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, 1003 predicate places. [2023-08-23 22:33:05,655 INFO L495 AbstractCegarLoop]: Abstraction has has 1050 places, 2072 transitions, 22080 flow [2023-08-23 22:33:05,657 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 107 states, 107 states have (on average 204.69158878504672) internal successors, (21902), 107 states have internal predecessors, (21902), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:33:05,657 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-23 22:33:05,657 INFO L208 CegarLoopForPetriNet]: trace histogram [104, 104, 104, 104, 77, 77, 77, 77, 27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-23 22:33:05,675 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2023-08-23 22:33:05,875 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-23 22:33:05,875 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-23 22:33:05,876 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-23 22:33:05,876 INFO L85 PathProgramCache]: Analyzing trace with hash -1009204112, now seen corresponding path program 5 times [2023-08-23 22:33:05,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-23 22:33:05,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126122467] [2023-08-23 22:33:05,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-23 22:33:05,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-23 22:33:06,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-23 22:33:15,996 INFO L134 CoverageAnalysis]: Checked inductivity of 36364 backedges. 0 proven. 36364 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-23 22:33:15,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-23 22:33:15,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126122467] [2023-08-23 22:33:15,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2126122467] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-23 22:33:15,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1994660216] [2023-08-23 22:33:15,997 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-08-23 22:33:15,997 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-23 22:33:15,997 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-23 22:33:15,998 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-23 22:33:16,000 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-23 22:33:18,369 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2023-08-23 22:33:18,370 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-23 22:33:18,381 INFO L262 TraceCheckSpWp]: Trace formula consists of 479 conjuncts, 197 conjunts are in the unsatisfiable core [2023-08-23 22:33:18,396 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-23 22:33:18,463 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 13 treesize of output 9 [2023-08-23 22:33:18,555 INFO L322 Elim1Store]: treesize reduction 25, result has 47.9 percent of original size [2023-08-23 22:33:18,555 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 38 [2023-08-23 22:33:18,784 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-23 22:33:18,794 INFO L322 Elim1Store]: treesize reduction 21, result has 47.5 percent of original size [2023-08-23 22:33:18,794 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 59 treesize of output 62 [2023-08-23 22:33:18,914 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-23 22:33:18,915 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 48 treesize of output 47 [2023-08-23 22:33:19,041 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 43 [2023-08-23 22:33:19,134 INFO L322 Elim1Store]: treesize reduction 25, result has 47.9 percent of original size [2023-08-23 22:33:19,134 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 63 [2023-08-23 22:33:19,314 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-23 22:33:19,323 INFO L322 Elim1Store]: treesize reduction 21, result has 47.5 percent of original size [2023-08-23 22:33:19,323 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 59 treesize of output 62 [2023-08-23 22:33:19,432 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-23 22:33:19,433 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 48 treesize of output 47 [2023-08-23 22:33:19,638 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 47 [2023-08-23 22:33:19,726 INFO L322 Elim1Store]: treesize reduction 25, result has 47.9 percent of original size [2023-08-23 22:33:19,726 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 63 [2023-08-23 22:33:19,850 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-23 22:33:19,859 INFO L322 Elim1Store]: treesize reduction 21, result has 47.5 percent of original size [2023-08-23 22:33:19,859 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 59 treesize of output 62 [2023-08-23 22:33:19,969 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-23 22:33:19,969 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 48 treesize of output 47 [2023-08-23 22:33:20,171 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 47 [2023-08-23 22:33:20,260 INFO L322 Elim1Store]: treesize reduction 25, result has 47.9 percent of original size [2023-08-23 22:33:20,260 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 63 [2023-08-23 22:33:20,448 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-23 22:33:20,463 INFO L322 Elim1Store]: treesize reduction 21, result has 47.5 percent of original size [2023-08-23 22:33:20,463 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 59 treesize of output 62 [2023-08-23 22:33:20,583 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-23 22:33:20,584 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 48 treesize of output 47 [2023-08-23 22:33:20,690 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 13 [2023-08-23 22:33:20,760 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-23 22:33:20,760 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 25 treesize of output 24 [2023-08-23 22:33:20,935 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-23 22:33:20,942 INFO L322 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2023-08-23 22:33:20,942 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 27 [2023-08-23 22:33:21,044 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-23 22:33:21,045 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 23 treesize of output 22 [2023-08-23 22:33:21,167 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 13 [2023-08-23 22:33:21,244 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-23 22:33:21,245 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 25 treesize of output 24 [2023-08-23 22:33:21,423 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-23 22:33:21,430 INFO L322 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2023-08-23 22:33:21,430 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 27 [2023-08-23 22:33:21,536 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-23 22:33:21,537 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 23 treesize of output 22 [2023-08-23 22:33:21,668 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 13 [2023-08-23 22:33:21,747 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-23 22:33:21,748 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 25 treesize of output 24 [2023-08-23 22:33:21,935 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-23 22:33:21,942 INFO L322 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2023-08-23 22:33:21,943 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 27 [2023-08-23 22:33:22,047 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-23 22:33:22,047 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 23 treesize of output 22 [2023-08-23 22:33:22,151 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 18 [2023-08-23 22:33:22,227 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-23 22:33:22,228 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 30 treesize of output 29 [2023-08-23 22:33:22,378 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-23 22:33:22,385 INFO L322 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2023-08-23 22:33:22,386 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 27 [2023-08-23 22:33:22,461 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-23 22:33:22,462 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 23 treesize of output 22 [2023-08-23 22:33:22,489 INFO L134 CoverageAnalysis]: Checked inductivity of 36364 backedges. 12060 proven. 93 refuted. 0 times theorem prover too weak. 24211 trivial. 0 not checked. [2023-08-23 22:33:22,489 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-23 22:40:06,007 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4859 Int) (v_ArrVal_4849 Int) (v_ArrVal_4866 Int) (v_ArrVal_4845 Int) (v_ArrVal_4856 Int) (v_ArrVal_4842 Int) (v_ArrVal_4853 Int) (v_ArrVal_4864 Int) (v_ArrVal_4854 Int) (v_ArrVal_4851 Int) (v_ArrVal_4863 Int) (v_ArrVal_4861 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_500| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_504| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_502| Int) (|v_t1Thread1of1ForFork0_~i~0#1_396| Int) (|v_t1Thread1of1ForFork0_~i~0#1_395| Int)) (let ((.cse11 (let ((.cse12 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse13 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_4842)) (.cse14 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store (store .cse13 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_4845) .cse14 (+ (select .cse13 .cse14) 1)))))) (store .cse12 |c_~#stored_elements~0.base| (store (select .cse12 |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| (* |c_t1Thread1of1ForFork0_~i~0#1| 4)) v_ArrVal_4849))))) (let ((.cse4 (select .cse11 |c_~#queue~0.base|))) (let ((.cse9 (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_504| 4) |c_~#queue~0.offset|) v_ArrVal_4851)) (.cse8 (+ 3208 |c_~#queue~0.offset|)) (.cse2 (+ |c_~#queue~0.offset| 3204))) (let ((.cse7 (let ((.cse10 (store .cse11 |c_~#queue~0.base| (store (store .cse9 .cse8 v_ArrVal_4853) .cse2 v_ArrVal_4854)))) (store .cse10 |c_~#stored_elements~0.base| (store (select .cse10 |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_396| 4) |c_~#stored_elements~0.offset|) v_ArrVal_4856))))) (let ((.cse5 (select .cse7 |c_~#queue~0.base|))) (let ((.cse3 (store .cse5 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_502| 4)) v_ArrVal_4859))) (let ((.cse0 (select .cse9 .cse2)) (.cse1 (select (let ((.cse6 (store .cse7 |c_~#queue~0.base| (store (store .cse3 .cse8 v_ArrVal_4861) .cse2 v_ArrVal_4863)))) (store .cse6 |c_~#stored_elements~0.base| (store (select .cse6 |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_395| 4) |c_~#stored_elements~0.offset|) v_ArrVal_4864))) |c_~#queue~0.base|))) (or (= 800 .cse0) (not (= (select (store .cse1 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_500| 4) |c_~#queue~0.offset|) v_ArrVal_4866) .cse2) 800)) (< (+ (select .cse3 .cse2) 1) v_ArrVal_4863) (< (select .cse4 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_504|) (< (+ .cse0 1) v_ArrVal_4854) (< |v_t1Thread1of1ForFork0_~i~0#1_396| (+ |c_t1Thread1of1ForFork0_~i~0#1| 1)) (< (select .cse1 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_500|) (< |v_t1Thread1of1ForFork0_~i~0#1_395| (+ |v_t1Thread1of1ForFork0_~i~0#1_396| 1)) (< (select .cse5 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_502|)))))))))) is different from false [2023-08-23 22:41:48,855 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4859 Int) (v_ArrVal_4849 Int) (v_ArrVal_4866 Int) (v_ArrVal_4845 Int) (v_ArrVal_4856 Int) (v_ArrVal_4842 Int) (v_ArrVal_4853 Int) (v_ArrVal_4864 Int) (v_ArrVal_4854 Int) (v_ArrVal_4840 Int) (v_ArrVal_4851 Int) (v_ArrVal_4863 Int) (v_ArrVal_4861 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_500| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_504| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_502| Int) (|v_t1Thread1of1ForFork0_~i~0#1_397| Int) (|v_t1Thread1of1ForFork0_~i~0#1_396| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_506| Int) (|v_t1Thread1of1ForFork0_~i~0#1_395| Int)) (let ((.cse14 (store |c_#memory_int| |c_~#stored_elements~0.base| (store (select |c_#memory_int| |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| (* |c_t1Thread1of1ForFork0_~i~0#1| 4)) v_ArrVal_4840)))) (let ((.cse10 (+ 3208 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 3204)) (.cse0 (select .cse14 |c_~#queue~0.base|))) (let ((.cse12 (let ((.cse13 (store .cse14 |c_~#queue~0.base| (let ((.cse15 (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_506| 4) |c_~#queue~0.offset|) v_ArrVal_4842))) (store (store .cse15 .cse10 v_ArrVal_4845) .cse1 (+ 1 (select .cse15 .cse1))))))) (store .cse13 |c_~#stored_elements~0.base| (store (select .cse13 |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| (* |v_t1Thread1of1ForFork0_~i~0#1_397| 4)) v_ArrVal_4849))))) (let ((.cse5 (select .cse12 |c_~#queue~0.base|))) (let ((.cse7 (store .cse5 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_504| 4) |c_~#queue~0.offset|) v_ArrVal_4851))) (let ((.cse9 (let ((.cse11 (store .cse12 |c_~#queue~0.base| (store (store .cse7 .cse10 v_ArrVal_4853) .cse1 v_ArrVal_4854)))) (store .cse11 |c_~#stored_elements~0.base| (store (select .cse11 |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_396| 4) |c_~#stored_elements~0.offset|) v_ArrVal_4856))))) (let ((.cse2 (select .cse9 |c_~#queue~0.base|))) (let ((.cse6 (store .cse2 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_502| 4)) v_ArrVal_4859))) (let ((.cse3 (select (let ((.cse8 (store .cse9 |c_~#queue~0.base| (store (store .cse6 .cse10 v_ArrVal_4861) .cse1 v_ArrVal_4863)))) (store .cse8 |c_~#stored_elements~0.base| (store (select .cse8 |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_395| 4) |c_~#stored_elements~0.offset|) v_ArrVal_4864))) |c_~#queue~0.base|)) (.cse4 (select .cse7 .cse1))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_506|) (< (select .cse2 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_502|) (not (= (select (store .cse3 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_500| 4) |c_~#queue~0.offset|) v_ArrVal_4866) .cse1) 800)) (= 800 .cse4) (< |v_t1Thread1of1ForFork0_~i~0#1_396| (+ |v_t1Thread1of1ForFork0_~i~0#1_397| 1)) (< |v_t1Thread1of1ForFork0_~i~0#1_397| (+ |c_t1Thread1of1ForFork0_~i~0#1| 1)) (< (select .cse3 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_500|) (< (select .cse5 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_504|) (< (+ .cse4 1) v_ArrVal_4854) (< (+ (select .cse6 .cse1) 1) v_ArrVal_4863) (< |v_t1Thread1of1ForFork0_~i~0#1_395| (+ |v_t1Thread1of1ForFork0_~i~0#1_396| 1))))))))))))) is different from false Received shutdown request... [2023-08-23 22:42:39,637 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-08-23 22:42:39,655 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-23 22:42:39,889 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2023-08-23 22:42:39,899 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-23 22:42:40,089 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,SelfDestructingSolverStorable11 [2023-08-23 22:42:40,089 WARN L619 AbstractCegarLoop]: Verification canceled: while CegarLoopForPetriNet was analyzing trace of length 826 with TraceHistMax 104,while TraceCheckSpWp was constructing backward predicates,while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 169 known predicates. [2023-08-23 22:42:40,091 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2023-08-23 22:42:40,091 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2023-08-23 22:42:40,091 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2023-08-23 22:42:40,091 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2023-08-23 22:42:40,091 INFO L445 BasicCegarLoop]: Path program histogram: [5, 3, 1, 1, 1, 1] [2023-08-23 22:42:40,094 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-23 22:42:40,094 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-23 22:42:40,095 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.08 10:42:40 BasicIcfg [2023-08-23 22:42:40,096 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-23 22:42:40,096 INFO L158 Benchmark]: Toolchain (without parser) took 858245.27ms. Allocated memory was 434.1MB in the beginning and 6.0GB in the end (delta: 5.5GB). Free memory was 408.0MB in the beginning and 4.0GB in the end (delta: -3.6GB). Peak memory consumption was 2.0GB. Max. memory is 16.0GB. [2023-08-23 22:42:40,096 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 434.1MB. Free memory is still 410.8MB. There was no memory consumed. Max. memory is 16.0GB. [2023-08-23 22:42:40,096 INFO L158 Benchmark]: CACSL2BoogieTranslator took 482.30ms. Allocated memory is still 434.1MB. Free memory was 407.5MB in the beginning and 377.7MB in the end (delta: 29.8MB). Peak memory consumption was 29.4MB. Max. memory is 16.0GB. [2023-08-23 22:42:40,096 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.18ms. Allocated memory is still 434.1MB. Free memory was 377.7MB in the beginning and 374.9MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-23 22:42:40,096 INFO L158 Benchmark]: Boogie Preprocessor took 41.48ms. Allocated memory is still 434.1MB. Free memory was 374.9MB in the beginning and 372.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-23 22:42:40,096 INFO L158 Benchmark]: RCFGBuilder took 490.01ms. Allocated memory is still 434.1MB. Free memory was 372.8MB in the beginning and 408.9MB in the end (delta: -36.1MB). Peak memory consumption was 27.3MB. Max. memory is 16.0GB. [2023-08-23 22:42:40,097 INFO L158 Benchmark]: TraceAbstraction took 857184.57ms. Allocated memory was 434.1MB in the beginning and 6.0GB in the end (delta: 5.5GB). Free memory was 408.0MB in the beginning and 4.0GB in the end (delta: -3.6GB). Peak memory consumption was 1.9GB. Max. memory is 16.0GB. [2023-08-23 22:42:40,097 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.09ms. Allocated memory is still 434.1MB. Free memory is still 410.8MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 482.30ms. Allocated memory is still 434.1MB. Free memory was 407.5MB in the beginning and 377.7MB in the end (delta: 29.8MB). Peak memory consumption was 29.4MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 42.18ms. Allocated memory is still 434.1MB. Free memory was 377.7MB in the beginning and 374.9MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 41.48ms. Allocated memory is still 434.1MB. Free memory was 374.9MB in the beginning and 372.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 490.01ms. Allocated memory is still 434.1MB. Free memory was 372.8MB in the beginning and 408.9MB in the end (delta: -36.1MB). Peak memory consumption was 27.3MB. Max. memory is 16.0GB. * TraceAbstraction took 857184.57ms. Allocated memory was 434.1MB in the beginning and 6.0GB in the end (delta: 5.5GB). Free memory was 408.0MB in the beginning and 4.0GB in the end (delta: -3.6GB). Peak memory consumption was 1.9GB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 258]: Unsoundness Warning unspecified type, defaulting to int C: short [258] - GenericResultAtLocation [Line: 258]: Unsoundness Warning unspecified type, defaulting to int C: short [258] - GenericResultAtLocation [Line: 750]: Unsoundness Warning unspecified type, defaulting to int C: unsigned short [750] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6.1s, 199 PlacesBefore, 47 PlacesAfterwards, 205 TransitionsBefore, 47 TransitionsAfterwards, 9984 CoEnabledTransitionPairs, 7 FixpointIterations, 58 TrivialSequentialCompositions, 99 ConcurrentSequentialCompositions, 7 TrivialYvCompositions, 16 ConcurrentYvCompositions, 6 ChoiceCompositions, 186 TotalNumberOfCompositions, 19772 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 9519, independent: 9080, independent conditional: 0, independent unconditional: 9080, dependent: 439, dependent conditional: 0, dependent unconditional: 439, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 5401, independent: 5319, independent conditional: 0, independent unconditional: 5319, dependent: 82, dependent conditional: 0, dependent unconditional: 82, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 9519, independent: 3761, independent conditional: 0, independent unconditional: 3761, dependent: 357, dependent conditional: 0, dependent unconditional: 357, unknown: 5401, unknown conditional: 0, unknown unconditional: 5401] , Statistics on independence cache: Total cache size (in pairs): 268, Positive cache size: 233, Positive conditional cache size: 0, Positive unconditional cache size: 233, Negative cache size: 35, Negative conditional cache size: 0, Negative unconditional cache size: 35, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - TimeoutResultAtElement [Line: 1033]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while CegarLoopForPetriNet was analyzing trace of length 826 with TraceHistMax 104,while TraceCheckSpWp was constructing backward predicates,while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 169 known predicates. - TimeoutResultAtElement [Line: 1049]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while CegarLoopForPetriNet was analyzing trace of length 826 with TraceHistMax 104,while TraceCheckSpWp was constructing backward predicates,while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 169 known predicates. - TimeoutResultAtElement [Line: 1052]: 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 826 with TraceHistMax 104,while TraceCheckSpWp was constructing backward predicates,while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 169 known predicates. - TimeoutResultAtElement [Line: 1053]: 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 826 with TraceHistMax 104,while TraceCheckSpWp was constructing backward predicates,while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 169 known predicates. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 327 locations, 5 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: 857.0s, OverallIterations: 12, TraceHistogramMax: 104, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 143.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 6.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 10231 SdHoareTripleChecker+Valid, 5.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 10231 mSDsluCounter, 1 SdHoareTripleChecker+Invalid, 4.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 13852 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 1613 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5671 IncrementalHoareTripleChecker+Invalid, 21136 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1613 mSolverCounterUnsat, 1 mSDtfsCounter, 5671 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 4214 GetRequests, 2943 SyntacticMatches, 422 SemanticMatches, 849 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 293944 ImplicationChecksByTransitivity, 75.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=28624occurred in iteration=10, InterpolantAutomatonStates: 777, 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.5s SsaConstructionTime, 109.3s SatisfiabilityAnalysisTime, 21.1s InterpolantComputationTime, 2615 NumberOfCodeBlocks, 2221 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 3867 ConstructedInterpolants, 14 QuantifiedInterpolants, 14444 SizeOfPredicates, 23 NumberOfNonLiveVariables, 6392 ConjunctsInSsa, 207 ConjunctsInUnsatCore, 25 InterpolantComputations, 4 PerfectInterpolantSequences, 15125/56455 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