/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/weaver/popl20-three-array-max.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-24 03:45:01,130 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-24 03:45:01,213 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf [2023-08-24 03:45:01,217 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-24 03:45:01,218 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-24 03:45:01,250 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-24 03:45:01,250 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-24 03:45:01,255 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-24 03:45:01,255 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-24 03:45:01,255 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-24 03:45:01,256 INFO L153 SettingsManager]: * Use SBE=true [2023-08-24 03:45:01,256 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-24 03:45:01,256 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-24 03:45:01,257 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-24 03:45:01,257 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-24 03:45:01,257 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-24 03:45:01,260 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-24 03:45:01,260 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-24 03:45:01,260 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-24 03:45:01,260 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-24 03:45:01,261 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-24 03:45:01,262 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-24 03:45:01,262 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-24 03:45:01,263 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-24 03:45:01,263 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-24 03:45:01,263 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-24 03:45:01,263 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-24 03:45:01,264 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-24 03:45:01,264 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-24 03:45:01,264 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-24 03:45:01,265 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-24 03:45:01,265 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-24 03:45:01,265 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-24 03:45:01,265 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-24 03:45:01,266 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-24 03:45:01,266 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-24 03:45:01,546 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-24 03:45:01,566 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-24 03:45:01,568 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-24 03:45:01,569 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-24 03:45:01,569 INFO L274 PluginConnector]: CDTParser initialized [2023-08-24 03:45:01,570 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-three-array-max.wvr.c [2023-08-24 03:45:02,705 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-24 03:45:02,925 INFO L384 CDTParser]: Found 1 translation units. [2023-08-24 03:45:02,926 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-three-array-max.wvr.c [2023-08-24 03:45:02,935 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b531ff9ae/28ac0d72d3f84d018e25f08919ec60f7/FLAGdecf8fff2 [2023-08-24 03:45:02,949 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b531ff9ae/28ac0d72d3f84d018e25f08919ec60f7 [2023-08-24 03:45:02,954 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-24 03:45:02,955 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-24 03:45:02,958 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-24 03:45:02,958 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-24 03:45:02,960 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-24 03:45:02,962 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.08 03:45:02" (1/1) ... [2023-08-24 03:45:02,963 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7def2842 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 03:45:02, skipping insertion in model container [2023-08-24 03:45:02,963 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.08 03:45:02" (1/1) ... [2023-08-24 03:45:02,987 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-24 03:45:03,168 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-three-array-max.wvr.c[2823,2836] [2023-08-24 03:45:03,182 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-24 03:45:03,191 INFO L201 MainTranslator]: Completed pre-run [2023-08-24 03:45:03,228 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-three-array-max.wvr.c[2823,2836] [2023-08-24 03:45:03,231 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-24 03:45:03,240 WARN L669 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-24 03:45:03,240 WARN L669 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-24 03:45:03,246 INFO L206 MainTranslator]: Completed translation [2023-08-24 03:45:03,246 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 03:45:03 WrapperNode [2023-08-24 03:45:03,246 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-24 03:45:03,247 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-24 03:45:03,247 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-24 03:45:03,247 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-24 03:45:03,253 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 03:45:03" (1/1) ... [2023-08-24 03:45:03,271 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 03:45:03" (1/1) ... [2023-08-24 03:45:03,307 INFO L138 Inliner]: procedures = 26, calls = 57, calls flagged for inlining = 14, calls inlined = 22, statements flattened = 240 [2023-08-24 03:45:03,308 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-24 03:45:03,309 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-24 03:45:03,309 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-24 03:45:03,309 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-24 03:45:03,316 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 03:45:03" (1/1) ... [2023-08-24 03:45:03,316 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 03:45:03" (1/1) ... [2023-08-24 03:45:03,328 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 03:45:03" (1/1) ... [2023-08-24 03:45:03,329 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 03:45:03" (1/1) ... [2023-08-24 03:45:03,335 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 03:45:03" (1/1) ... [2023-08-24 03:45:03,339 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 03:45:03" (1/1) ... [2023-08-24 03:45:03,341 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 03:45:03" (1/1) ... [2023-08-24 03:45:03,342 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 03:45:03" (1/1) ... [2023-08-24 03:45:03,345 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-24 03:45:03,346 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-24 03:45:03,346 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-24 03:45:03,346 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-24 03:45:03,346 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 03:45:03" (1/1) ... [2023-08-24 03:45:03,351 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-24 03:45:03,362 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 03:45:03,374 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-24 03:45:03,401 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-24 03:45:03,411 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-24 03:45:03,411 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-24 03:45:03,412 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-24 03:45:03,412 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-24 03:45:03,412 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-08-24 03:45:03,412 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-08-24 03:45:03,412 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-08-24 03:45:03,412 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-08-24 03:45:03,412 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-08-24 03:45:03,412 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-08-24 03:45:03,413 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-24 03:45:03,413 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-24 03:45:03,413 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-24 03:45:03,413 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-08-24 03:45:03,413 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-24 03:45:03,413 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-24 03:45:03,413 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-24 03:45:03,415 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-24 03:45:03,506 INFO L236 CfgBuilder]: Building ICFG [2023-08-24 03:45:03,508 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-24 03:45:03,943 INFO L277 CfgBuilder]: Performing block encoding [2023-08-24 03:45:04,024 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-24 03:45:04,025 INFO L302 CfgBuilder]: Removed 6 assume(true) statements. [2023-08-24 03:45:04,027 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.08 03:45:04 BoogieIcfgContainer [2023-08-24 03:45:04,028 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-24 03:45:04,031 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-24 03:45:04,031 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-24 03:45:04,033 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-24 03:45:04,033 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.08 03:45:02" (1/3) ... [2023-08-24 03:45:04,034 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12674f9b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.08 03:45:04, skipping insertion in model container [2023-08-24 03:45:04,034 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 03:45:03" (2/3) ... [2023-08-24 03:45:04,035 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12674f9b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.08 03:45:04, skipping insertion in model container [2023-08-24 03:45:04,035 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.08 03:45:04" (3/3) ... [2023-08-24 03:45:04,036 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-three-array-max.wvr.c [2023-08-24 03:45:04,051 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-24 03:45:04,051 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-08-24 03:45:04,052 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-24 03:45:04,192 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2023-08-24 03:45:04,234 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 273 places, 290 transitions, 604 flow [2023-08-24 03:45:04,371 INFO L124 PetriNetUnfolderBase]: 27/287 cut-off events. [2023-08-24 03:45:04,372 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-08-24 03:45:04,378 INFO L83 FinitePrefix]: Finished finitePrefix Result has 300 conditions, 287 events. 27/287 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 234 event pairs, 0 based on Foata normal form. 0/259 useless extension candidates. Maximal degree in co-relation 227. Up to 2 conditions per place. [2023-08-24 03:45:04,378 INFO L82 GeneralOperation]: Start removeDead. Operand has 273 places, 290 transitions, 604 flow [2023-08-24 03:45:04,386 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 260 places, 277 transitions, 572 flow [2023-08-24 03:45:04,390 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-24 03:45:04,401 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 260 places, 277 transitions, 572 flow [2023-08-24 03:45:04,405 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 260 places, 277 transitions, 572 flow [2023-08-24 03:45:04,406 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 260 places, 277 transitions, 572 flow [2023-08-24 03:45:04,459 INFO L124 PetriNetUnfolderBase]: 27/277 cut-off events. [2023-08-24 03:45:04,460 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-08-24 03:45:04,461 INFO L83 FinitePrefix]: Finished finitePrefix Result has 290 conditions, 277 events. 27/277 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 229 event pairs, 0 based on Foata normal form. 0/250 useless extension candidates. Maximal degree in co-relation 227. Up to 2 conditions per place. [2023-08-24 03:45:04,465 INFO L119 LiptonReduction]: Number of co-enabled transitions 2904 [2023-08-24 03:45:13,198 INFO L134 LiptonReduction]: Checked pairs total: 4130 [2023-08-24 03:45:13,199 INFO L136 LiptonReduction]: Total number of compositions: 310 [2023-08-24 03:45:13,210 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-24 03:45:13,215 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;@404ad8b5, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-24 03:45:13,215 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2023-08-24 03:45:13,224 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-24 03:45:13,224 INFO L124 PetriNetUnfolderBase]: 8/34 cut-off events. [2023-08-24 03:45:13,224 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-08-24 03:45:13,224 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 03:45:13,225 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 03:45:13,225 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 1 more)] === [2023-08-24 03:45:13,229 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 03:45:13,229 INFO L85 PathProgramCache]: Analyzing trace with hash -963094014, now seen corresponding path program 1 times [2023-08-24 03:45:13,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 03:45:13,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207390694] [2023-08-24 03:45:13,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 03:45:13,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 03:45:13,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 03:45:13,712 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 03:45:13,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 03:45:13,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207390694] [2023-08-24 03:45:13,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [207390694] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 03:45:13,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 03:45:13,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-24 03:45:13,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124345762] [2023-08-24 03:45:13,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 03:45:13,721 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-24 03:45:13,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 03:45:13,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-24 03:45:13,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-24 03:45:13,750 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 215 out of 600 [2023-08-24 03:45:13,756 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 35 transitions, 88 flow. Second operand has 3 states, 3 states have (on average 221.33333333333334) internal successors, (664), 3 states have internal predecessors, (664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 03:45:13,756 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 03:45:13,756 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 215 of 600 [2023-08-24 03:45:13,757 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 03:45:13,956 INFO L124 PetriNetUnfolderBase]: 787/1050 cut-off events. [2023-08-24 03:45:13,957 INFO L125 PetriNetUnfolderBase]: For 39/39 co-relation queries the response was YES. [2023-08-24 03:45:13,960 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2157 conditions, 1050 events. 787/1050 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 3696 event pairs, 357 based on Foata normal form. 0/603 useless extension candidates. Maximal degree in co-relation 1871. Up to 1027 conditions per place. [2023-08-24 03:45:13,965 INFO L140 encePairwiseOnDemand]: 597/600 looper letters, 31 selfloop transitions, 2 changer transitions 0/36 dead transitions. [2023-08-24 03:45:13,965 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 36 transitions, 156 flow [2023-08-24 03:45:13,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-24 03:45:13,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-24 03:45:13,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 679 transitions. [2023-08-24 03:45:13,985 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37722222222222224 [2023-08-24 03:45:13,986 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 679 transitions. [2023-08-24 03:45:13,986 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 679 transitions. [2023-08-24 03:45:13,990 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 03:45:13,992 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 679 transitions. [2023-08-24 03:45:13,996 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 226.33333333333334) internal successors, (679), 3 states have internal predecessors, (679), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 03:45:14,003 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 600.0) internal successors, (2400), 4 states have internal predecessors, (2400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 03:45:14,005 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 600.0) internal successors, (2400), 4 states have internal predecessors, (2400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 03:45:14,006 INFO L175 Difference]: Start difference. First operand has 37 places, 35 transitions, 88 flow. Second operand 3 states and 679 transitions. [2023-08-24 03:45:14,007 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 36 transitions, 156 flow [2023-08-24 03:45:14,012 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 36 transitions, 144 flow, removed 0 selfloop flow, removed 6 redundant places. [2023-08-24 03:45:14,014 INFO L231 Difference]: Finished difference. Result has 34 places, 36 transitions, 88 flow [2023-08-24 03:45:14,015 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=600, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=88, PETRI_PLACES=34, PETRI_TRANSITIONS=36} [2023-08-24 03:45:14,018 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, -3 predicate places. [2023-08-24 03:45:14,019 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 36 transitions, 88 flow [2023-08-24 03:45:14,019 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 221.33333333333334) internal successors, (664), 3 states have internal predecessors, (664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 03:45:14,019 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 03:45:14,020 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] [2023-08-24 03:45:14,020 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-24 03:45:14,020 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-24 03:45:14,028 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 03:45:14,028 INFO L85 PathProgramCache]: Analyzing trace with hash -1128208641, now seen corresponding path program 1 times [2023-08-24 03:45:14,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 03:45:14,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820263197] [2023-08-24 03:45:14,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 03:45:14,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 03:45:14,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 03:45:14,281 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-24 03:45:14,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 03:45:14,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820263197] [2023-08-24 03:45:14,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1820263197] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 03:45:14,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2081388144] [2023-08-24 03:45:14,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 03:45:14,283 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 03:45:14,283 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 03:45:14,289 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-24 03:45:14,297 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-08-24 03:45:14,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 03:45:14,420 INFO L262 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-24 03:45:14,425 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 03:45:14,503 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-24 03:45:14,503 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-24 03:45:14,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2081388144] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 03:45:14,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-24 03:45:14,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2023-08-24 03:45:14,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966984051] [2023-08-24 03:45:14,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 03:45:14,505 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-24 03:45:14,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 03:45:14,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-24 03:45:14,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-08-24 03:45:14,507 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 215 out of 600 [2023-08-24 03:45:14,508 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 36 transitions, 88 flow. Second operand has 4 states, 4 states have (on average 220.0) internal successors, (880), 4 states have internal predecessors, (880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 03:45:14,508 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 03:45:14,508 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 215 of 600 [2023-08-24 03:45:14,509 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 03:45:14,661 INFO L124 PetriNetUnfolderBase]: 787/1052 cut-off events. [2023-08-24 03:45:14,662 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-08-24 03:45:14,663 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2119 conditions, 1052 events. 787/1052 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 3704 event pairs, 357 based on Foata normal form. 0/605 useless extension candidates. Maximal degree in co-relation 2108. Up to 1026 conditions per place. [2023-08-24 03:45:14,668 INFO L140 encePairwiseOnDemand]: 593/600 looper letters, 29 selfloop transitions, 6 changer transitions 0/38 dead transitions. [2023-08-24 03:45:14,668 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 38 transitions, 162 flow [2023-08-24 03:45:14,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-24 03:45:14,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-24 03:45:14,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 897 transitions. [2023-08-24 03:45:14,671 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37375 [2023-08-24 03:45:14,671 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 897 transitions. [2023-08-24 03:45:14,671 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 897 transitions. [2023-08-24 03:45:14,672 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 03:45:14,672 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 897 transitions. [2023-08-24 03:45:14,674 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 224.25) internal successors, (897), 4 states have internal predecessors, (897), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 03:45:14,677 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 600.0) internal successors, (3000), 5 states have internal predecessors, (3000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 03:45:14,679 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 600.0) internal successors, (3000), 5 states have internal predecessors, (3000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 03:45:14,679 INFO L175 Difference]: Start difference. First operand has 34 places, 36 transitions, 88 flow. Second operand 4 states and 897 transitions. [2023-08-24 03:45:14,679 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 38 transitions, 162 flow [2023-08-24 03:45:14,680 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 38 transitions, 158 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-08-24 03:45:14,681 INFO L231 Difference]: Finished difference. Result has 37 places, 38 transitions, 112 flow [2023-08-24 03:45:14,681 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=600, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=112, PETRI_PLACES=37, PETRI_TRANSITIONS=38} [2023-08-24 03:45:14,681 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 0 predicate places. [2023-08-24 03:45:14,682 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 38 transitions, 112 flow [2023-08-24 03:45:14,682 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 220.0) internal successors, (880), 4 states have internal predecessors, (880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 03:45:14,682 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 03:45:14,682 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] [2023-08-24 03:45:14,692 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-08-24 03:45:14,888 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 03:45:14,889 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-24 03:45:14,889 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 03:45:14,889 INFO L85 PathProgramCache]: Analyzing trace with hash 802689150, now seen corresponding path program 1 times [2023-08-24 03:45:14,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 03:45:14,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951752731] [2023-08-24 03:45:14,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 03:45:14,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 03:45:14,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 03:45:15,219 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-24 03:45:15,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 03:45:15,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951752731] [2023-08-24 03:45:15,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1951752731] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 03:45:15,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 03:45:15,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-24 03:45:15,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763660726] [2023-08-24 03:45:15,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 03:45:15,222 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-24 03:45:15,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 03:45:15,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-24 03:45:15,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-24 03:45:15,224 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 249 out of 600 [2023-08-24 03:45:15,225 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 38 transitions, 112 flow. Second operand has 3 states, 3 states have (on average 256.3333333333333) internal successors, (769), 3 states have internal predecessors, (769), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 03:45:15,225 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 03:45:15,226 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 249 of 600 [2023-08-24 03:45:15,226 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 03:45:15,488 INFO L124 PetriNetUnfolderBase]: 1449/1926 cut-off events. [2023-08-24 03:45:15,489 INFO L125 PetriNetUnfolderBase]: For 15/15 co-relation queries the response was YES. [2023-08-24 03:45:15,491 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3898 conditions, 1926 events. 1449/1926 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 141. Compared 7587 event pairs, 303 based on Foata normal form. 1/1155 useless extension candidates. Maximal degree in co-relation 3878. Up to 1172 conditions per place. [2023-08-24 03:45:15,499 INFO L140 encePairwiseOnDemand]: 595/600 looper letters, 53 selfloop transitions, 4 changer transitions 1/61 dead transitions. [2023-08-24 03:45:15,499 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 61 transitions, 279 flow [2023-08-24 03:45:15,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-24 03:45:15,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-24 03:45:15,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 803 transitions. [2023-08-24 03:45:15,501 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4461111111111111 [2023-08-24 03:45:15,502 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 803 transitions. [2023-08-24 03:45:15,502 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 803 transitions. [2023-08-24 03:45:15,502 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 03:45:15,502 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 803 transitions. [2023-08-24 03:45:15,504 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 267.6666666666667) internal successors, (803), 3 states have internal predecessors, (803), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 03:45:15,507 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 600.0) internal successors, (2400), 4 states have internal predecessors, (2400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 03:45:15,509 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 600.0) internal successors, (2400), 4 states have internal predecessors, (2400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 03:45:15,509 INFO L175 Difference]: Start difference. First operand has 37 places, 38 transitions, 112 flow. Second operand 3 states and 803 transitions. [2023-08-24 03:45:15,509 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 61 transitions, 279 flow [2023-08-24 03:45:15,510 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 61 transitions, 278 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-24 03:45:15,511 INFO L231 Difference]: Finished difference. Result has 39 places, 41 transitions, 137 flow [2023-08-24 03:45:15,511 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=600, PETRI_DIFFERENCE_MINUEND_FLOW=111, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=137, PETRI_PLACES=39, PETRI_TRANSITIONS=41} [2023-08-24 03:45:15,512 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 2 predicate places. [2023-08-24 03:45:15,512 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 41 transitions, 137 flow [2023-08-24 03:45:15,513 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 256.3333333333333) internal successors, (769), 3 states have internal predecessors, (769), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 03:45:15,513 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 03:45:15,513 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 03:45:15,513 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-24 03:45:15,513 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-24 03:45:15,514 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 03:45:15,514 INFO L85 PathProgramCache]: Analyzing trace with hash -296266314, now seen corresponding path program 1 times [2023-08-24 03:45:15,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 03:45:15,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130520508] [2023-08-24 03:45:15,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 03:45:15,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 03:45:15,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 03:45:15,654 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-24 03:45:15,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 03:45:15,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130520508] [2023-08-24 03:45:15,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2130520508] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 03:45:15,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [747103209] [2023-08-24 03:45:15,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 03:45:15,655 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 03:45:15,655 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 03:45:15,656 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-24 03:45:15,690 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-08-24 03:45:15,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 03:45:15,787 INFO L262 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 7 conjunts are in the unsatisfiable core [2023-08-24 03:45:15,790 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 03:45:15,850 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-24 03:45:15,851 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 03:45:15,908 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-24 03:45:15,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [747103209] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 03:45:15,908 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 03:45:15,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2023-08-24 03:45:15,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397886786] [2023-08-24 03:45:15,909 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 03:45:15,909 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-08-24 03:45:15,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 03:45:15,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-08-24 03:45:15,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2023-08-24 03:45:15,914 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 211 out of 600 [2023-08-24 03:45:15,917 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 41 transitions, 137 flow. Second operand has 12 states, 12 states have (on average 213.91666666666666) internal successors, (2567), 12 states have internal predecessors, (2567), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 03:45:15,917 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 03:45:15,917 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 211 of 600 [2023-08-24 03:45:15,918 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 03:45:16,430 INFO L124 PetriNetUnfolderBase]: 2230/3081 cut-off events. [2023-08-24 03:45:16,430 INFO L125 PetriNetUnfolderBase]: For 225/225 co-relation queries the response was YES. [2023-08-24 03:45:16,435 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6779 conditions, 3081 events. 2230/3081 cut-off events. For 225/225 co-relation queries the response was YES. Maximal size of possible extension queue 198. Compared 14171 event pairs, 790 based on Foata normal form. 0/2132 useless extension candidates. Maximal degree in co-relation 4085. Up to 1468 conditions per place. [2023-08-24 03:45:16,448 INFO L140 encePairwiseOnDemand]: 589/600 looper letters, 90 selfloop transitions, 22 changer transitions 0/114 dead transitions. [2023-08-24 03:45:16,449 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 114 transitions, 589 flow [2023-08-24 03:45:16,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-08-24 03:45:16,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-08-24 03:45:16,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 2215 transitions. [2023-08-24 03:45:16,455 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36916666666666664 [2023-08-24 03:45:16,455 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 2215 transitions. [2023-08-24 03:45:16,455 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 2215 transitions. [2023-08-24 03:45:16,456 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 03:45:16,456 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 2215 transitions. [2023-08-24 03:45:16,461 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 221.5) internal successors, (2215), 10 states have internal predecessors, (2215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 03:45:16,469 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 600.0) internal successors, (6600), 11 states have internal predecessors, (6600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 03:45:16,472 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 600.0) internal successors, (6600), 11 states have internal predecessors, (6600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 03:45:16,472 INFO L175 Difference]: Start difference. First operand has 39 places, 41 transitions, 137 flow. Second operand 10 states and 2215 transitions. [2023-08-24 03:45:16,472 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 114 transitions, 589 flow [2023-08-24 03:45:16,475 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 114 transitions, 579 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-24 03:45:16,477 INFO L231 Difference]: Finished difference. Result has 52 places, 57 transitions, 292 flow [2023-08-24 03:45:16,477 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=600, PETRI_DIFFERENCE_MINUEND_FLOW=133, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=292, PETRI_PLACES=52, PETRI_TRANSITIONS=57} [2023-08-24 03:45:16,479 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 15 predicate places. [2023-08-24 03:45:16,481 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 57 transitions, 292 flow [2023-08-24 03:45:16,487 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 213.91666666666666) internal successors, (2567), 12 states have internal predecessors, (2567), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 03:45:16,487 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 03:45:16,488 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 03:45:16,496 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-08-24 03:45:16,693 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,SelfDestructingSolverStorable3 [2023-08-24 03:45:16,694 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-24 03:45:16,694 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 03:45:16,694 INFO L85 PathProgramCache]: Analyzing trace with hash -1525373573, now seen corresponding path program 1 times [2023-08-24 03:45:16,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 03:45:16,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178990629] [2023-08-24 03:45:16,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 03:45:16,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 03:45:16,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 03:45:16,891 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-24 03:45:16,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 03:45:16,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178990629] [2023-08-24 03:45:16,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [178990629] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 03:45:16,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1482710295] [2023-08-24 03:45:16,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 03:45:16,892 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 03:45:16,893 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 03:45:16,893 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-24 03:45:16,896 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-08-24 03:45:17,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 03:45:17,008 INFO L262 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 7 conjunts are in the unsatisfiable core [2023-08-24 03:45:17,010 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 03:45:17,057 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-24 03:45:17,058 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 03:45:17,105 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-24 03:45:17,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1482710295] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 03:45:17,105 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 03:45:17,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2023-08-24 03:45:17,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478213533] [2023-08-24 03:45:17,106 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 03:45:17,106 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-08-24 03:45:17,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 03:45:17,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-08-24 03:45:17,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2023-08-24 03:45:17,110 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 207 out of 600 [2023-08-24 03:45:17,112 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 57 transitions, 292 flow. Second operand has 12 states, 12 states have (on average 210.0) internal successors, (2520), 12 states have internal predecessors, (2520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 03:45:17,112 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 03:45:17,112 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 207 of 600 [2023-08-24 03:45:17,112 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 03:45:17,465 INFO L124 PetriNetUnfolderBase]: 1642/2243 cut-off events. [2023-08-24 03:45:17,465 INFO L125 PetriNetUnfolderBase]: For 376/393 co-relation queries the response was YES. [2023-08-24 03:45:17,469 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5583 conditions, 2243 events. 1642/2243 cut-off events. For 376/393 co-relation queries the response was YES. Maximal size of possible extension queue 142. Compared 9048 event pairs, 823 based on Foata normal form. 17/1625 useless extension candidates. Maximal degree in co-relation 5042. Up to 1987 conditions per place. [2023-08-24 03:45:17,479 INFO L140 encePairwiseOnDemand]: 589/600 looper letters, 33 selfloop transitions, 9 changer transitions 38/82 dead transitions. [2023-08-24 03:45:17,480 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 82 transitions, 522 flow [2023-08-24 03:45:17,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-24 03:45:17,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-24 03:45:17,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1730 transitions. [2023-08-24 03:45:17,485 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36041666666666666 [2023-08-24 03:45:17,485 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1730 transitions. [2023-08-24 03:45:17,485 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1730 transitions. [2023-08-24 03:45:17,486 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 03:45:17,486 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1730 transitions. [2023-08-24 03:45:17,489 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 216.25) internal successors, (1730), 8 states have internal predecessors, (1730), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 03:45:17,494 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 600.0) internal successors, (5400), 9 states have internal predecessors, (5400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 03:45:17,496 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 600.0) internal successors, (5400), 9 states have internal predecessors, (5400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 03:45:17,496 INFO L175 Difference]: Start difference. First operand has 52 places, 57 transitions, 292 flow. Second operand 8 states and 1730 transitions. [2023-08-24 03:45:17,496 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 82 transitions, 522 flow [2023-08-24 03:45:17,499 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 82 transitions, 494 flow, removed 8 selfloop flow, removed 1 redundant places. [2023-08-24 03:45:17,500 INFO L231 Difference]: Finished difference. Result has 60 places, 44 transitions, 210 flow [2023-08-24 03:45:17,501 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=600, PETRI_DIFFERENCE_MINUEND_FLOW=264, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=210, PETRI_PLACES=60, PETRI_TRANSITIONS=44} [2023-08-24 03:45:17,501 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 23 predicate places. [2023-08-24 03:45:17,501 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 44 transitions, 210 flow [2023-08-24 03:45:17,502 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 210.0) internal successors, (2520), 12 states have internal predecessors, (2520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 03:45:17,502 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 03:45:17,503 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 03:45:17,511 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-08-24 03:45:17,708 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 03:45:17,709 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-24 03:45:17,709 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 03:45:17,709 INFO L85 PathProgramCache]: Analyzing trace with hash -827810902, now seen corresponding path program 2 times [2023-08-24 03:45:17,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 03:45:17,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823295655] [2023-08-24 03:45:17,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 03:45:17,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 03:45:17,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 03:45:17,928 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-08-24 03:45:17,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 03:45:17,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823295655] [2023-08-24 03:45:17,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1823295655] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 03:45:17,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [574141025] [2023-08-24 03:45:17,931 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-24 03:45:17,931 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 03:45:17,931 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 03:45:17,932 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-24 03:45:17,934 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-08-24 03:45:18,079 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-24 03:45:18,079 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-24 03:45:18,081 INFO L262 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 7 conjunts are in the unsatisfiable core [2023-08-24 03:45:18,083 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 03:45:18,143 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-08-24 03:45:18,143 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 03:45:18,200 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-08-24 03:45:18,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [574141025] provided 1 perfect and 1 imperfect interpolant sequences [2023-08-24 03:45:18,200 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-08-24 03:45:18,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6, 5] total 12 [2023-08-24 03:45:18,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138574832] [2023-08-24 03:45:18,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 03:45:18,201 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-24 03:45:18,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 03:45:18,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-24 03:45:18,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2023-08-24 03:45:18,204 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 211 out of 600 [2023-08-24 03:45:18,205 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 44 transitions, 210 flow. Second operand has 6 states, 6 states have (on average 215.33333333333334) internal successors, (1292), 6 states have internal predecessors, (1292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 03:45:18,205 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 03:45:18,205 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 211 of 600 [2023-08-24 03:45:18,205 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 03:45:18,471 INFO L124 PetriNetUnfolderBase]: 1804/2426 cut-off events. [2023-08-24 03:45:18,471 INFO L125 PetriNetUnfolderBase]: For 631/631 co-relation queries the response was YES. [2023-08-24 03:45:18,476 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6488 conditions, 2426 events. 1804/2426 cut-off events. For 631/631 co-relation queries the response was YES. Maximal size of possible extension queue 159. Compared 10006 event pairs, 730 based on Foata normal form. 0/1829 useless extension candidates. Maximal degree in co-relation 6465. Up to 1822 conditions per place. [2023-08-24 03:45:18,488 INFO L140 encePairwiseOnDemand]: 595/600 looper letters, 57 selfloop transitions, 5 changer transitions 0/64 dead transitions. [2023-08-24 03:45:18,488 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 64 transitions, 401 flow [2023-08-24 03:45:18,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-24 03:45:18,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-24 03:45:18,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1319 transitions. [2023-08-24 03:45:18,492 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3663888888888889 [2023-08-24 03:45:18,492 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1319 transitions. [2023-08-24 03:45:18,492 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1319 transitions. [2023-08-24 03:45:18,493 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 03:45:18,493 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1319 transitions. [2023-08-24 03:45:18,495 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 219.83333333333334) internal successors, (1319), 6 states have internal predecessors, (1319), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 03:45:18,499 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 600.0) internal successors, (4200), 7 states have internal predecessors, (4200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 03:45:18,500 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 600.0) internal successors, (4200), 7 states have internal predecessors, (4200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 03:45:18,500 INFO L175 Difference]: Start difference. First operand has 60 places, 44 transitions, 210 flow. Second operand 6 states and 1319 transitions. [2023-08-24 03:45:18,500 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 64 transitions, 401 flow [2023-08-24 03:45:18,511 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 64 transitions, 347 flow, removed 14 selfloop flow, removed 9 redundant places. [2023-08-24 03:45:18,512 INFO L231 Difference]: Finished difference. Result has 48 places, 45 transitions, 185 flow [2023-08-24 03:45:18,512 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=600, PETRI_DIFFERENCE_MINUEND_FLOW=167, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=185, PETRI_PLACES=48, PETRI_TRANSITIONS=45} [2023-08-24 03:45:18,513 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 11 predicate places. [2023-08-24 03:45:18,513 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 45 transitions, 185 flow [2023-08-24 03:45:18,514 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 215.33333333333334) internal successors, (1292), 6 states have internal predecessors, (1292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 03:45:18,514 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 03:45:18,514 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 03:45:18,523 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-08-24 03:45:18,720 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 03:45:18,720 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-24 03:45:18,720 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 03:45:18,720 INFO L85 PathProgramCache]: Analyzing trace with hash 495019740, now seen corresponding path program 1 times [2023-08-24 03:45:18,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 03:45:18,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851882077] [2023-08-24 03:45:18,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 03:45:18,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 03:45:18,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 03:45:18,892 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-08-24 03:45:18,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 03:45:18,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851882077] [2023-08-24 03:45:18,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1851882077] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 03:45:18,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1625670894] [2023-08-24 03:45:18,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 03:45:18,893 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 03:45:18,893 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 03:45:18,894 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-24 03:45:18,903 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-08-24 03:45:19,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 03:45:19,034 INFO L262 TraceCheckSpWp]: Trace formula consists of 386 conjuncts, 7 conjunts are in the unsatisfiable core [2023-08-24 03:45:19,035 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 03:45:19,087 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-08-24 03:45:19,087 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 03:45:19,148 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-08-24 03:45:19,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1625670894] provided 1 perfect and 1 imperfect interpolant sequences [2023-08-24 03:45:19,148 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-08-24 03:45:19,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 5] total 11 [2023-08-24 03:45:19,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410983737] [2023-08-24 03:45:19,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 03:45:19,149 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-24 03:45:19,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 03:45:19,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-24 03:45:19,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2023-08-24 03:45:19,151 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 207 out of 600 [2023-08-24 03:45:19,152 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 45 transitions, 185 flow. Second operand has 6 states, 6 states have (on average 211.5) internal successors, (1269), 6 states have internal predecessors, (1269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 03:45:19,153 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 03:45:19,153 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 207 of 600 [2023-08-24 03:45:19,153 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 03:45:19,356 INFO L124 PetriNetUnfolderBase]: 1346/1812 cut-off events. [2023-08-24 03:45:19,356 INFO L125 PetriNetUnfolderBase]: For 498/633 co-relation queries the response was YES. [2023-08-24 03:45:19,359 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4651 conditions, 1812 events. 1346/1812 cut-off events. For 498/633 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 7392 event pairs, 200 based on Foata normal form. 135/1527 useless extension candidates. Maximal degree in co-relation 4617. Up to 1279 conditions per place. [2023-08-24 03:45:19,368 INFO L140 encePairwiseOnDemand]: 593/600 looper letters, 50 selfloop transitions, 8 changer transitions 0/60 dead transitions. [2023-08-24 03:45:19,368 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 60 transitions, 346 flow [2023-08-24 03:45:19,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-24 03:45:19,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-24 03:45:19,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1291 transitions. [2023-08-24 03:45:19,372 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3586111111111111 [2023-08-24 03:45:19,372 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1291 transitions. [2023-08-24 03:45:19,372 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1291 transitions. [2023-08-24 03:45:19,373 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 03:45:19,373 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1291 transitions. [2023-08-24 03:45:19,375 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 215.16666666666666) internal successors, (1291), 6 states have internal predecessors, (1291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 03:45:19,379 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 600.0) internal successors, (4200), 7 states have internal predecessors, (4200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 03:45:19,380 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 600.0) internal successors, (4200), 7 states have internal predecessors, (4200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 03:45:19,380 INFO L175 Difference]: Start difference. First operand has 48 places, 45 transitions, 185 flow. Second operand 6 states and 1291 transitions. [2023-08-24 03:45:19,380 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 60 transitions, 346 flow [2023-08-24 03:45:19,384 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 60 transitions, 331 flow, removed 4 selfloop flow, removed 3 redundant places. [2023-08-24 03:45:19,389 INFO L231 Difference]: Finished difference. Result has 52 places, 47 transitions, 210 flow [2023-08-24 03:45:19,389 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=600, PETRI_DIFFERENCE_MINUEND_FLOW=173, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=210, PETRI_PLACES=52, PETRI_TRANSITIONS=47} [2023-08-24 03:45:19,390 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 15 predicate places. [2023-08-24 03:45:19,391 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 47 transitions, 210 flow [2023-08-24 03:45:19,393 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 211.5) internal successors, (1269), 6 states have internal predecessors, (1269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 03:45:19,393 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 03:45:19,394 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 03:45:19,404 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-08-24 03:45:19,604 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 03:45:19,605 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-24 03:45:19,605 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 03:45:19,605 INFO L85 PathProgramCache]: Analyzing trace with hash -1020146927, now seen corresponding path program 1 times [2023-08-24 03:45:19,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 03:45:19,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002184475] [2023-08-24 03:45:19,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 03:45:19,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 03:45:19,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 03:45:19,708 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-08-24 03:45:19,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 03:45:19,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002184475] [2023-08-24 03:45:19,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1002184475] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 03:45:19,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 03:45:19,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-24 03:45:19,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056157835] [2023-08-24 03:45:19,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 03:45:19,709 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-24 03:45:19,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 03:45:19,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-24 03:45:19,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-24 03:45:19,711 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 239 out of 600 [2023-08-24 03:45:19,713 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 47 transitions, 210 flow. Second operand has 6 states, 6 states have (on average 243.66666666666666) internal successors, (1462), 6 states have internal predecessors, (1462), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 03:45:19,713 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 03:45:19,713 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 239 of 600 [2023-08-24 03:45:19,713 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 03:45:20,094 INFO L124 PetriNetUnfolderBase]: 1889/2588 cut-off events. [2023-08-24 03:45:20,095 INFO L125 PetriNetUnfolderBase]: For 1087/1301 co-relation queries the response was YES. [2023-08-24 03:45:20,098 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6932 conditions, 2588 events. 1889/2588 cut-off events. For 1087/1301 co-relation queries the response was YES. Maximal size of possible extension queue 148. Compared 11236 event pairs, 48 based on Foata normal form. 288/2376 useless extension candidates. Maximal degree in co-relation 6896. Up to 866 conditions per place. [2023-08-24 03:45:20,109 INFO L140 encePairwiseOnDemand]: 593/600 looper letters, 110 selfloop transitions, 12 changer transitions 0/123 dead transitions. [2023-08-24 03:45:20,109 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 123 transitions, 696 flow [2023-08-24 03:45:20,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-24 03:45:20,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-24 03:45:20,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1778 transitions. [2023-08-24 03:45:20,114 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42333333333333334 [2023-08-24 03:45:20,114 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1778 transitions. [2023-08-24 03:45:20,114 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1778 transitions. [2023-08-24 03:45:20,115 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 03:45:20,115 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1778 transitions. [2023-08-24 03:45:20,118 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 254.0) internal successors, (1778), 7 states have internal predecessors, (1778), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 03:45:20,135 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 600.0) internal successors, (4800), 8 states have internal predecessors, (4800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 03:45:20,136 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 600.0) internal successors, (4800), 8 states have internal predecessors, (4800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 03:45:20,137 INFO L175 Difference]: Start difference. First operand has 52 places, 47 transitions, 210 flow. Second operand 7 states and 1778 transitions. [2023-08-24 03:45:20,137 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 123 transitions, 696 flow [2023-08-24 03:45:20,141 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 123 transitions, 680 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-24 03:45:20,143 INFO L231 Difference]: Finished difference. Result has 58 places, 55 transitions, 299 flow [2023-08-24 03:45:20,143 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=600, PETRI_DIFFERENCE_MINUEND_FLOW=200, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=299, PETRI_PLACES=58, PETRI_TRANSITIONS=55} [2023-08-24 03:45:20,143 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 21 predicate places. [2023-08-24 03:45:20,143 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 55 transitions, 299 flow [2023-08-24 03:45:20,144 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 243.66666666666666) internal successors, (1462), 6 states have internal predecessors, (1462), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 03:45:20,144 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 03:45:20,144 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 03:45:20,144 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-24 03:45:20,144 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-24 03:45:20,145 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 03:45:20,145 INFO L85 PathProgramCache]: Analyzing trace with hash 470588981, now seen corresponding path program 2 times [2023-08-24 03:45:20,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 03:45:20,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152138608] [2023-08-24 03:45:20,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 03:45:20,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 03:45:20,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 03:45:20,266 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-08-24 03:45:20,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 03:45:20,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [152138608] [2023-08-24 03:45:20,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [152138608] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 03:45:20,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [422386930] [2023-08-24 03:45:20,267 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-24 03:45:20,267 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 03:45:20,267 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 03:45:20,268 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-24 03:45:20,270 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-08-24 03:45:20,576 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-24 03:45:20,576 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-24 03:45:20,578 INFO L262 TraceCheckSpWp]: Trace formula consists of 386 conjuncts, 7 conjunts are in the unsatisfiable core [2023-08-24 03:45:20,580 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 03:45:20,629 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-08-24 03:45:20,630 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 03:45:20,682 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-08-24 03:45:20,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [422386930] provided 1 perfect and 1 imperfect interpolant sequences [2023-08-24 03:45:20,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-08-24 03:45:20,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 5] total 11 [2023-08-24 03:45:20,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557287692] [2023-08-24 03:45:20,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 03:45:20,683 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-24 03:45:20,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 03:45:20,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-24 03:45:20,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2023-08-24 03:45:20,685 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 211 out of 600 [2023-08-24 03:45:20,686 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 55 transitions, 299 flow. Second operand has 6 states, 6 states have (on average 215.66666666666666) internal successors, (1294), 6 states have internal predecessors, (1294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 03:45:20,686 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 03:45:20,686 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 211 of 600 [2023-08-24 03:45:20,687 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 03:45:20,976 INFO L124 PetriNetUnfolderBase]: 1942/2638 cut-off events. [2023-08-24 03:45:20,977 INFO L125 PetriNetUnfolderBase]: For 3341/3648 co-relation queries the response was YES. [2023-08-24 03:45:20,982 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7837 conditions, 2638 events. 1942/2638 cut-off events. For 3341/3648 co-relation queries the response was YES. Maximal size of possible extension queue 135. Compared 10449 event pairs, 555 based on Foata normal form. 411/2481 useless extension candidates. Maximal degree in co-relation 7799. Up to 1498 conditions per place. [2023-08-24 03:45:20,998 INFO L140 encePairwiseOnDemand]: 593/600 looper letters, 62 selfloop transitions, 13 changer transitions 0/77 dead transitions. [2023-08-24 03:45:20,998 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 77 transitions, 548 flow [2023-08-24 03:45:20,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-24 03:45:20,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-24 03:45:21,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1318 transitions. [2023-08-24 03:45:21,002 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3661111111111111 [2023-08-24 03:45:21,002 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1318 transitions. [2023-08-24 03:45:21,002 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1318 transitions. [2023-08-24 03:45:21,003 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 03:45:21,003 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1318 transitions. [2023-08-24 03:45:21,005 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 219.66666666666666) internal successors, (1318), 6 states have internal predecessors, (1318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 03:45:21,009 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 600.0) internal successors, (4200), 7 states have internal predecessors, (4200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 03:45:21,010 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 600.0) internal successors, (4200), 7 states have internal predecessors, (4200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 03:45:21,010 INFO L175 Difference]: Start difference. First operand has 58 places, 55 transitions, 299 flow. Second operand 6 states and 1318 transitions. [2023-08-24 03:45:21,010 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 77 transitions, 548 flow [2023-08-24 03:45:21,021 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 77 transitions, 525 flow, removed 4 selfloop flow, removed 2 redundant places. [2023-08-24 03:45:21,022 INFO L231 Difference]: Finished difference. Result has 63 places, 57 transitions, 342 flow [2023-08-24 03:45:21,022 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=600, PETRI_DIFFERENCE_MINUEND_FLOW=285, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=342, PETRI_PLACES=63, PETRI_TRANSITIONS=57} [2023-08-24 03:45:21,023 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 26 predicate places. [2023-08-24 03:45:21,023 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 57 transitions, 342 flow [2023-08-24 03:45:21,023 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 215.66666666666666) internal successors, (1294), 6 states have internal predecessors, (1294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 03:45:21,023 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 03:45:21,024 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 03:45:21,036 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-08-24 03:45:21,230 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 03:45:21,230 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-24 03:45:21,231 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 03:45:21,231 INFO L85 PathProgramCache]: Analyzing trace with hash 1758351541, now seen corresponding path program 1 times [2023-08-24 03:45:21,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 03:45:21,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146712391] [2023-08-24 03:45:21,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 03:45:21,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 03:45:21,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 03:45:23,635 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-08-24 03:45:23,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 03:45:23,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146712391] [2023-08-24 03:45:23,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [146712391] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 03:45:23,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1263411033] [2023-08-24 03:45:23,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 03:45:23,636 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 03:45:23,636 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 03:45:23,637 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-24 03:45:23,664 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-08-24 03:45:23,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 03:45:23,795 INFO L262 TraceCheckSpWp]: Trace formula consists of 393 conjuncts, 73 conjunts are in the unsatisfiable core [2023-08-24 03:45:23,799 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 03:45:23,877 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-08-24 03:45:23,969 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-24 03:45:23,969 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-08-24 03:45:24,092 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 03:45:24,092 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 20 [2023-08-24 03:45:24,416 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-24 03:45:24,417 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-08-24 03:45:24,662 INFO L322 Elim1Store]: treesize reduction 25, result has 37.5 percent of original size [2023-08-24 03:45:24,663 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 42 [2023-08-24 03:45:25,091 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-24 03:45:25,092 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-24 03:45:25,132 INFO L322 Elim1Store]: treesize reduction 52, result has 34.2 percent of original size [2023-08-24 03:45:25,134 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 111 treesize of output 124 [2023-08-24 03:45:26,923 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 03:45:26,924 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 10 select indices, 10 select index equivalence classes, 0 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 45 case distinctions, treesize of input 269 treesize of output 573 [2023-08-24 03:45:32,609 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 19 treesize of output 15 [2023-08-24 03:45:42,058 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 26 treesize of output 20 [2023-08-24 03:45:42,321 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 19 treesize of output 15 [2023-08-24 03:45:43,388 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 24 treesize of output 18 [2023-08-24 03:45:44,511 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 26 treesize of output 20 [2023-08-24 03:45:44,560 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 19 treesize of output 15 [2023-08-24 03:45:45,588 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 21 treesize of output 17 [2023-08-24 03:45:45,774 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 26 treesize of output 20 [2023-08-24 03:45:46,029 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 21 treesize of output 17 [2023-08-24 03:45:46,085 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 21 treesize of output 17 [2023-08-24 03:45:46,163 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 19 treesize of output 15 [2023-08-24 03:45:46,337 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 21 treesize of output 17 [2023-08-24 03:45:46,407 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-24 03:45:46,410 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 19 treesize of output 11 [2023-08-24 03:45:46,416 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 19 treesize of output 11 [2023-08-24 03:45:46,427 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-08-24 03:45:46,427 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 03:45:46,683 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_~C~0.offset 4))) (and (or (< |c_thread1Thread1of1ForFork1_#t~mem4| c_~maxb~0) (let ((.cse0 (+ (* c_thread1Thread1of1ForFork1_~i~0 4) c_~B~0.offset))) (and (forall ((v_ArrVal_569 (Array Int Int))) (<= c_~maxc~0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_569) c_~B~0.base) .cse0) c_~maxa~0))) (forall ((v_ArrVal_569 (Array Int Int))) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_569))) (<= (select (select .cse1 c_~C~0.base) .cse2) (+ (select (select .cse1 c_~B~0.base) .cse0) c_~maxa~0))))))) (or (<= c_~maxb~0 |c_thread1Thread1of1ForFork1_#t~mem4|) (let ((.cse3 (+ c_~maxa~0 c_~maxb~0))) (and (<= c_~maxc~0 .cse3) (forall ((v_ArrVal_569 (Array Int Int))) (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_569) c_~C~0.base) .cse2) .cse3))))))) is different from false [2023-08-24 03:45:46,868 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse3 (* |c_thread2Thread1of1ForFork2_~i~1#1| 4))) (let ((.cse0 (+ c_~maxa~0 c_~maxb~0)) (.cse1 (+ (select (select |c_#memory_int| c_~B~0.base) (+ .cse3 c_~B~0.offset)) (select (select |c_#memory_int| c_~A~0.base) (+ .cse3 c_~A~0.offset)))) (.cse4 (+ (* c_thread1Thread1of1ForFork1_~i~0 4) c_~B~0.offset)) (.cse2 (select |c_#memory_int| c_~C~0.base))) (and (or (<= c_~maxc~0 .cse0) (forall ((~C~0.offset Int) (v_ArrVal_567 Int)) (or (< .cse1 v_ArrVal_567) (<= c_~maxb~0 (select (select (store |c_#memory_int| c_~C~0.base (store .cse2 (+ .cse3 ~C~0.offset) v_ArrVal_567)) c_~B~0.base) .cse4))))) (forall ((v_ArrVal_567 Int)) (or (< .cse1 v_ArrVal_567) (forall ((~C~0.offset Int)) (let ((.cse6 (store |c_#memory_int| c_~C~0.base (store .cse2 (+ .cse3 ~C~0.offset) v_ArrVal_567)))) (or (forall ((v_ArrVal_569 (Array Int Int))) (let ((.cse5 (store .cse6 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_569))) (<= (select (select .cse5 c_~C~0.base) (+ ~C~0.offset 4)) (+ (select (select .cse5 c_~B~0.base) .cse4) c_~maxa~0)))) (< (select (select .cse6 c_~B~0.base) .cse4) c_~maxb~0)))))) (forall ((v_ArrVal_567 Int)) (or (< .cse1 v_ArrVal_567) (forall ((~C~0.offset Int)) (let ((.cse7 (store |c_#memory_int| c_~C~0.base (store .cse2 (+ .cse3 ~C~0.offset) v_ArrVal_567)))) (or (<= c_~maxb~0 (select (select .cse7 c_~B~0.base) .cse4)) (forall ((v_ArrVal_569 (Array Int Int))) (<= (select (select (store .cse7 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_569) c_~C~0.base) (+ ~C~0.offset 4)) .cse0))))))) (forall ((v_ArrVal_567 Int)) (or (< .cse1 v_ArrVal_567) (forall ((~C~0.offset Int)) (let ((.cse8 (store |c_#memory_int| c_~C~0.base (store .cse2 (+ .cse3 ~C~0.offset) v_ArrVal_567)))) (or (forall ((v_ArrVal_569 (Array Int Int))) (<= c_~maxc~0 (+ (select (select (store .cse8 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_569) c_~B~0.base) .cse4) c_~maxa~0))) (< (select (select .cse8 c_~B~0.base) .cse4) c_~maxb~0))))))))) is different from false [2023-08-24 03:45:46,924 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~maxa~0 c_~maxb~0)) (.cse1 (+ (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset 4)) (select (select |c_#memory_int| c_~B~0.base) (+ 4 c_~B~0.offset)))) (.cse3 (+ (* c_thread1Thread1of1ForFork1_~i~0 4) c_~B~0.offset)) (.cse2 (select |c_#memory_int| c_~C~0.base))) (and (or (<= c_~maxc~0 .cse0) (forall ((~C~0.offset Int) (v_ArrVal_567 Int)) (or (< .cse1 v_ArrVal_567) (<= c_~maxb~0 (select (select (store |c_#memory_int| c_~C~0.base (store .cse2 (+ ~C~0.offset 4) v_ArrVal_567)) c_~B~0.base) .cse3))))) (forall ((v_ArrVal_567 Int)) (or (forall ((~C~0.offset Int)) (let ((.cse5 (+ ~C~0.offset 4))) (let ((.cse4 (store |c_#memory_int| c_~C~0.base (store .cse2 .cse5 v_ArrVal_567)))) (or (forall ((v_ArrVal_569 (Array Int Int))) (<= (select (select (store .cse4 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_569) c_~C~0.base) .cse5) .cse0)) (<= c_~maxb~0 (select (select .cse4 c_~B~0.base) .cse3)))))) (< .cse1 v_ArrVal_567))) (forall ((v_ArrVal_567 Int)) (or (forall ((~C~0.offset Int)) (let ((.cse7 (+ ~C~0.offset 4))) (let ((.cse8 (store |c_#memory_int| c_~C~0.base (store .cse2 .cse7 v_ArrVal_567)))) (or (forall ((v_ArrVal_569 (Array Int Int))) (let ((.cse6 (store .cse8 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_569))) (<= (select (select .cse6 c_~C~0.base) .cse7) (+ (select (select .cse6 c_~B~0.base) .cse3) c_~maxa~0)))) (< (select (select .cse8 c_~B~0.base) .cse3) c_~maxb~0))))) (< .cse1 v_ArrVal_567))) (forall ((v_ArrVal_567 Int)) (or (< .cse1 v_ArrVal_567) (forall ((~C~0.offset Int)) (let ((.cse9 (store |c_#memory_int| c_~C~0.base (store .cse2 (+ ~C~0.offset 4) v_ArrVal_567)))) (or (forall ((v_ArrVal_569 (Array Int Int))) (<= c_~maxc~0 (+ (select (select (store .cse9 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_569) c_~B~0.base) .cse3) c_~maxa~0))) (< (select (select .cse9 c_~B~0.base) .cse3) c_~maxb~0)))))))) is different from false [2023-08-24 03:45:47,021 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse2 (+ (* c_thread1Thread1of1ForFork1_~i~0 4) c_~B~0.offset)) (.cse0 (+ c_~maxa~0 c_~maxb~0)) (.cse3 (+ 4 c_~B~0.offset)) (.cse4 (+ c_~A~0.offset 4))) (and (or (<= c_~maxc~0 .cse0) (forall ((~C~0.offset Int) (v_ArrVal_566 (Array Int Int)) (v_ArrVal_567 Int)) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_566))) (or (<= c_~maxb~0 (select (select (store .cse1 c_~C~0.base (store (select .cse1 c_~C~0.base) (+ ~C~0.offset 4) v_ArrVal_567)) c_~B~0.base) .cse2)) (< (+ (select (select .cse1 c_~B~0.base) .cse3) (select (select .cse1 c_~A~0.base) .cse4)) v_ArrVal_567))))) (forall ((v_ArrVal_566 (Array Int Int)) (v_ArrVal_567 Int)) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_566))) (or (forall ((~C~0.offset Int)) (let ((.cse5 (store .cse6 c_~C~0.base (store (select .cse6 c_~C~0.base) (+ ~C~0.offset 4) v_ArrVal_567)))) (or (< (select (select .cse5 c_~B~0.base) .cse2) c_~maxb~0) (forall ((v_ArrVal_569 (Array Int Int))) (<= c_~maxc~0 (+ (select (select (store .cse5 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_569) c_~B~0.base) .cse2) c_~maxa~0)))))) (< (+ (select (select .cse6 c_~B~0.base) .cse3) (select (select .cse6 c_~A~0.base) .cse4)) v_ArrVal_567)))) (forall ((v_ArrVal_566 (Array Int Int)) (v_ArrVal_567 Int)) (let ((.cse10 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_566))) (or (forall ((~C~0.offset Int)) (let ((.cse8 (+ ~C~0.offset 4))) (let ((.cse9 (store .cse10 c_~C~0.base (store (select .cse10 c_~C~0.base) .cse8 v_ArrVal_567)))) (or (forall ((v_ArrVal_569 (Array Int Int))) (let ((.cse7 (store .cse9 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_569))) (<= (select (select .cse7 c_~C~0.base) .cse8) (+ (select (select .cse7 c_~B~0.base) .cse2) c_~maxa~0)))) (< (select (select .cse9 c_~B~0.base) .cse2) c_~maxb~0))))) (< (+ (select (select .cse10 c_~B~0.base) .cse3) (select (select .cse10 c_~A~0.base) .cse4)) v_ArrVal_567)))) (forall ((v_ArrVal_566 (Array Int Int)) (v_ArrVal_567 Int)) (let ((.cse13 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_566))) (or (forall ((~C~0.offset Int)) (let ((.cse12 (+ ~C~0.offset 4))) (let ((.cse11 (store .cse13 c_~C~0.base (store (select .cse13 c_~C~0.base) .cse12 v_ArrVal_567)))) (or (<= c_~maxb~0 (select (select .cse11 c_~B~0.base) .cse2)) (forall ((v_ArrVal_569 (Array Int Int))) (<= (select (select (store .cse11 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_569) c_~C~0.base) .cse12) .cse0)))))) (< (+ (select (select .cse13 c_~B~0.base) .cse3) (select (select .cse13 c_~A~0.base) .cse4)) v_ArrVal_567)))))) is different from false [2023-08-24 03:45:47,113 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 03:45:47,115 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 4215 treesize of output 4099 [2023-08-24 03:45:47,211 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 2145 treesize of output 2097 [2023-08-24 03:45:47,280 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 03:45:47,281 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 2181 treesize of output 2148 [2023-08-24 03:45:47,362 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 03:45:47,363 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 2157 treesize of output 2148 [2023-08-24 03:45:47,426 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 2117 treesize of output 2109 [2023-08-24 03:45:47,516 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 03:45:47,517 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 2149 treesize of output 2140 [2023-08-24 03:45:47,615 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 03:45:47,616 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 2241 treesize of output 2184 [2023-08-24 03:45:47,715 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 03:45:47,716 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 2153 treesize of output 2000 Received shutdown request... [2023-08-24 03:58:27,237 WARN L266 SmtUtils]: Removed 2 from assertion stack [2023-08-24 03:58:27,238 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2023-08-24 03:58:27,244 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-08-24 03:58:27,249 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-08-24 03:58:27,265 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-08-24 03:58:27,444 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 03:58:27,445 WARN L619 AbstractCegarLoop]: Verification canceled: while CegarLoopForPetriNet was analyzing trace of length 35 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 9 for 6ms.. [2023-08-24 03:58:27,446 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2023-08-24 03:58:27,447 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2023-08-24 03:58:27,447 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2023-08-24 03:58:27,447 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1] [2023-08-24 03:58:27,451 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-24 03:58:27,451 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-24 03:58:27,454 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.08 03:58:27 BasicIcfg [2023-08-24 03:58:27,454 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-24 03:58:27,454 INFO L158 Benchmark]: Toolchain (without parser) took 804499.25ms. Allocated memory was 371.2MB in the beginning and 1.3GB in the end (delta: 954.2MB). Free memory was 347.8MB in the beginning and 977.2MB in the end (delta: -629.3MB). Peak memory consumption was 818.4MB. Max. memory is 16.0GB. [2023-08-24 03:58:27,454 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 371.2MB. Free memory is still 347.5MB. There was no memory consumed. Max. memory is 16.0GB. [2023-08-24 03:58:27,455 INFO L158 Benchmark]: CACSL2BoogieTranslator took 288.64ms. Allocated memory is still 371.2MB. Free memory was 347.3MB in the beginning and 335.5MB in the end (delta: 11.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.0GB. [2023-08-24 03:58:27,458 INFO L158 Benchmark]: Boogie Procedure Inliner took 60.78ms. Allocated memory is still 371.2MB. Free memory was 335.0MB in the beginning and 332.8MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-24 03:58:27,459 INFO L158 Benchmark]: Boogie Preprocessor took 36.29ms. Allocated memory is still 371.2MB. Free memory was 332.8MB in the beginning and 330.8MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-24 03:58:27,459 INFO L158 Benchmark]: RCFGBuilder took 682.03ms. Allocated memory is still 371.2MB. Free memory was 330.8MB in the beginning and 298.3MB in the end (delta: 32.5MB). Peak memory consumption was 33.6MB. Max. memory is 16.0GB. [2023-08-24 03:58:27,459 INFO L158 Benchmark]: TraceAbstraction took 803423.06ms. Allocated memory was 371.2MB in the beginning and 1.3GB in the end (delta: 954.2MB). Free memory was 297.8MB in the beginning and 977.2MB in the end (delta: -679.4MB). Peak memory consumption was 768.1MB. Max. memory is 16.0GB. [2023-08-24 03:58:27,460 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 371.2MB. Free memory is still 347.5MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 288.64ms. Allocated memory is still 371.2MB. Free memory was 347.3MB in the beginning and 335.5MB in the end (delta: 11.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 60.78ms. Allocated memory is still 371.2MB. Free memory was 335.0MB in the beginning and 332.8MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 36.29ms. Allocated memory is still 371.2MB. Free memory was 332.8MB in the beginning and 330.8MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 682.03ms. Allocated memory is still 371.2MB. Free memory was 330.8MB in the beginning and 298.3MB in the end (delta: 32.5MB). Peak memory consumption was 33.6MB. Max. memory is 16.0GB. * TraceAbstraction took 803423.06ms. Allocated memory was 371.2MB in the beginning and 1.3GB in the end (delta: 954.2MB). Free memory was 297.8MB in the beginning and 977.2MB in the end (delta: -679.4MB). Peak memory consumption was 768.1MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 8.8s, 260 PlacesBefore, 37 PlacesAfterwards, 277 TransitionsBefore, 35 TransitionsAfterwards, 2904 CoEnabledTransitionPairs, 7 FixpointIterations, 184 TrivialSequentialCompositions, 40 ConcurrentSequentialCompositions, 54 TrivialYvCompositions, 13 ConcurrentYvCompositions, 19 ChoiceCompositions, 310 TotalNumberOfCompositions, 4130 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3175, independent: 3075, independent conditional: 0, independent unconditional: 3075, dependent: 100, dependent conditional: 0, dependent unconditional: 100, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1598, independent: 1568, independent conditional: 0, independent unconditional: 1568, dependent: 30, dependent conditional: 0, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3175, independent: 1507, independent conditional: 0, independent unconditional: 1507, dependent: 70, dependent conditional: 0, dependent unconditional: 70, unknown: 1598, unknown conditional: 0, unknown unconditional: 1598] , Statistics on independence cache: Total cache size (in pairs): 122, Positive cache size: 111, Positive conditional cache size: 0, Positive unconditional cache size: 111, Negative cache size: 11, Negative conditional cache size: 0, Negative unconditional cache size: 11, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - TimeoutResultAtElement [Line: 114]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while CegarLoopForPetriNet was analyzing trace of length 35 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 9 for 6ms.. - TimeoutResultAtElement [Line: 108]: 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 35 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 9 for 6ms.. - TimeoutResultAtElement [Line: 106]: 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 35 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 9 for 6ms.. - TimeoutResultAtElement [Line: 107]: 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 35 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 9 for 6ms.. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 312 locations, 4 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: 803.2s, OverallIterations: 10, TraceHistogramMax: 2, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 3.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 9.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 370 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 370 mSDsluCounter, 21 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 12 mSDsCounter, 56 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1080 IncrementalHoareTripleChecker+Invalid, 1136 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 56 mSolverCounterUnsat, 9 mSDtfsCounter, 1080 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 360 GetRequests, 284 SyntacticMatches, 5 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=342occurred in iteration=9, InterpolantAutomatonStates: 53, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 421 NumberOfCodeBlocks, 421 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 549 ConstructedInterpolants, 0 QuantifiedInterpolants, 1270 SizeOfPredicates, 16 NumberOfNonLiveVariables, 2110 ConjunctsInSsa, 40 ConjunctsInUnsatCore, 20 InterpolantComputations, 7 PerfectInterpolantSequences, 116/136 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