/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf --traceabstraction.order.of.the.error.locations.to.be.checked PROGRAM_FIRST -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread/bigshot_s2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-24 10:59:09,805 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-24 10:59:09,841 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 10:59:09,844 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-24 10:59:09,844 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-24 10:59:09,867 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-24 10:59:09,867 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-24 10:59:09,868 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-24 10:59:09,868 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-24 10:59:09,871 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-24 10:59:09,871 INFO L153 SettingsManager]: * Use SBE=true [2023-08-24 10:59:09,872 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-24 10:59:09,872 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-24 10:59:09,873 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-24 10:59:09,873 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-24 10:59:09,873 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-24 10:59:09,873 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-24 10:59:09,873 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-24 10:59:09,873 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-24 10:59:09,874 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-24 10:59:09,874 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-24 10:59:09,874 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-24 10:59:09,875 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-24 10:59:09,875 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-24 10:59:09,875 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-24 10:59:09,875 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-24 10:59:09,875 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-24 10:59:09,876 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-24 10:59:09,876 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-24 10:59:09,876 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-24 10:59:09,877 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-24 10:59:09,877 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-24 10:59:09,877 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-24 10:59:09,877 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-24 10:59:09,877 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-24 10:59:09,878 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Order of the error locations to be checked -> PROGRAM_FIRST [2023-08-24 10:59:10,152 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-24 10:59:10,166 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-24 10:59:10,167 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-24 10:59:10,168 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-24 10:59:10,168 INFO L274 PluginConnector]: CDTParser initialized [2023-08-24 10:59:10,169 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/bigshot_s2.i [2023-08-24 10:59:11,150 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-24 10:59:11,439 INFO L384 CDTParser]: Found 1 translation units. [2023-08-24 10:59:11,439 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/bigshot_s2.i [2023-08-24 10:59:11,454 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d5bd57555/cbc2ae2497e54d13bcf8f828e44eabf6/FLAGa1fd7c829 [2023-08-24 10:59:11,466 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d5bd57555/cbc2ae2497e54d13bcf8f828e44eabf6 [2023-08-24 10:59:11,469 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-24 10:59:11,470 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-24 10:59:11,473 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-24 10:59:11,474 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-24 10:59:11,475 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-24 10:59:11,476 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.08 10:59:11" (1/1) ... [2023-08-24 10:59:11,477 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@798ba16c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 10:59:11, skipping insertion in model container [2023-08-24 10:59:11,477 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.08 10:59:11" (1/1) ... [2023-08-24 10:59:11,512 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-24 10:59:11,811 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/bigshot_s2.i[55203,55216] [2023-08-24 10:59:11,823 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-24 10:59:11,831 INFO L201 MainTranslator]: Completed pre-run [2023-08-24 10:59:11,851 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [274] [2023-08-24 10:59:11,852 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [274] [2023-08-24 10:59:11,860 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/bigshot_s2.i[55203,55216] [2023-08-24 10:59:11,863 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-24 10:59:11,905 INFO L206 MainTranslator]: Completed translation [2023-08-24 10:59:11,905 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 10:59:11 WrapperNode [2023-08-24 10:59:11,905 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-24 10:59:11,906 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-24 10:59:11,906 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-24 10:59:11,906 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-24 10:59:11,910 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 10:59:11" (1/1) ... [2023-08-24 10:59:11,927 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 10:59:11" (1/1) ... [2023-08-24 10:59:11,948 INFO L138 Inliner]: procedures = 323, calls = 33, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 71 [2023-08-24 10:59:11,948 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-24 10:59:11,949 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-24 10:59:11,949 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-24 10:59:11,949 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-24 10:59:11,954 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 10:59:11" (1/1) ... [2023-08-24 10:59:11,954 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 10:59:11" (1/1) ... [2023-08-24 10:59:11,966 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 10:59:11" (1/1) ... [2023-08-24 10:59:11,966 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 10:59:11" (1/1) ... [2023-08-24 10:59:11,970 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 10:59:11" (1/1) ... [2023-08-24 10:59:11,971 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 10:59:11" (1/1) ... [2023-08-24 10:59:11,972 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 10:59:11" (1/1) ... [2023-08-24 10:59:11,973 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 10:59:11" (1/1) ... [2023-08-24 10:59:11,981 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-24 10:59:11,982 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-24 10:59:11,982 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-24 10:59:11,982 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-24 10:59:11,982 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 10:59:11" (1/1) ... [2023-08-24 10:59:11,986 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-24 10:59:11,995 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 10:59:12,014 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 10:59:12,020 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 10:59:12,041 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-24 10:59:12,041 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-24 10:59:12,041 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2023-08-24 10:59:12,042 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-24 10:59:12,042 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-08-24 10:59:12,042 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-08-24 10:59:12,042 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-08-24 10:59:12,042 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-08-24 10:59:12,043 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-24 10:59:12,043 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-08-24 10:59:12,043 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-24 10:59:12,043 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-24 10:59:12,043 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-24 10:59:12,043 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-24 10:59:12,045 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 10:59:12,134 INFO L236 CfgBuilder]: Building ICFG [2023-08-24 10:59:12,135 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-24 10:59:12,333 INFO L277 CfgBuilder]: Performing block encoding [2023-08-24 10:59:12,338 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-24 10:59:12,338 INFO L302 CfgBuilder]: Removed 1 assume(true) statements. [2023-08-24 10:59:12,339 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.08 10:59:12 BoogieIcfgContainer [2023-08-24 10:59:12,339 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-24 10:59:12,340 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-24 10:59:12,341 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-24 10:59:12,343 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-24 10:59:12,343 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.08 10:59:11" (1/3) ... [2023-08-24 10:59:12,343 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3475bb58 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.08 10:59:12, skipping insertion in model container [2023-08-24 10:59:12,343 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 10:59:11" (2/3) ... [2023-08-24 10:59:12,343 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3475bb58 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.08 10:59:12, skipping insertion in model container [2023-08-24 10:59:12,343 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.08 10:59:12" (3/3) ... [2023-08-24 10:59:12,344 INFO L112 eAbstractionObserver]: Analyzing ICFG bigshot_s2.i [2023-08-24 10:59:12,358 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-24 10:59:12,359 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-08-24 10:59:12,359 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-24 10:59:12,428 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-08-24 10:59:12,462 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 85 places, 82 transitions, 180 flow [2023-08-24 10:59:12,508 INFO L124 PetriNetUnfolderBase]: 4/80 cut-off events. [2023-08-24 10:59:12,509 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-08-24 10:59:12,512 INFO L83 FinitePrefix]: Finished finitePrefix Result has 89 conditions, 80 events. 4/80 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 47 event pairs, 0 based on Foata normal form. 0/75 useless extension candidates. Maximal degree in co-relation 48. Up to 2 conditions per place. [2023-08-24 10:59:12,512 INFO L82 GeneralOperation]: Start removeDead. Operand has 85 places, 82 transitions, 180 flow [2023-08-24 10:59:12,516 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 73 places, 69 transitions, 150 flow [2023-08-24 10:59:12,519 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-24 10:59:12,529 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 73 places, 69 transitions, 150 flow [2023-08-24 10:59:12,532 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 73 places, 69 transitions, 150 flow [2023-08-24 10:59:12,532 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 73 places, 69 transitions, 150 flow [2023-08-24 10:59:12,555 INFO L124 PetriNetUnfolderBase]: 3/69 cut-off events. [2023-08-24 10:59:12,555 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-08-24 10:59:12,556 INFO L83 FinitePrefix]: Finished finitePrefix Result has 78 conditions, 69 events. 3/69 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 40 event pairs, 0 based on Foata normal form. 0/66 useless extension candidates. Maximal degree in co-relation 37. Up to 2 conditions per place. [2023-08-24 10:59:12,556 INFO L119 LiptonReduction]: Number of co-enabled transitions 144 [2023-08-24 10:59:14,662 INFO L134 LiptonReduction]: Checked pairs total: 177 [2023-08-24 10:59:14,662 INFO L136 LiptonReduction]: Total number of compositions: 60 [2023-08-24 10:59:14,676 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-24 10:59:14,692 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;@628f1d1d, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-24 10:59:14,693 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-08-24 10:59:14,695 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-24 10:59:14,695 INFO L124 PetriNetUnfolderBase]: 2/13 cut-off events. [2023-08-24 10:59:14,695 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-08-24 10:59:14,695 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 10:59:14,696 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 10:59:14,696 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-24 10:59:14,699 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 10:59:14,699 INFO L85 PathProgramCache]: Analyzing trace with hash 1440544796, now seen corresponding path program 1 times [2023-08-24 10:59:14,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 10:59:14,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552413341] [2023-08-24 10:59:14,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 10:59:14,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 10:59:14,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 10:59:14,887 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 10:59:14,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 10:59:14,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [552413341] [2023-08-24 10:59:14,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [552413341] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 10:59:14,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 10:59:14,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-24 10:59:14,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798731147] [2023-08-24 10:59:14,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 10:59:14,894 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-24 10:59:14,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 10:59:14,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-24 10:59:14,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-24 10:59:14,909 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 69 out of 142 [2023-08-24 10:59:14,910 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 19 places, 14 transitions, 40 flow. Second operand has 3 states, 3 states have (on average 72.66666666666667) internal successors, (218), 3 states have internal predecessors, (218), 0 states have call successors, (0), 0 states 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 10:59:14,910 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 10:59:14,910 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 69 of 142 [2023-08-24 10:59:14,911 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 10:59:14,932 INFO L124 PetriNetUnfolderBase]: 5/20 cut-off events. [2023-08-24 10:59:14,932 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-08-24 10:59:14,932 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50 conditions, 20 events. 5/20 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 11 event pairs, 2 based on Foata normal form. 0/18 useless extension candidates. Maximal degree in co-relation 29. Up to 17 conditions per place. [2023-08-24 10:59:14,933 INFO L140 encePairwiseOnDemand]: 140/142 looper letters, 13 selfloop transitions, 1 changer transitions 0/14 dead transitions. [2023-08-24 10:59:14,933 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 21 places, 14 transitions, 68 flow [2023-08-24 10:59:14,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-24 10:59:14,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-24 10:59:14,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 222 transitions. [2023-08-24 10:59:14,941 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5211267605633803 [2023-08-24 10:59:14,941 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 222 transitions. [2023-08-24 10:59:14,941 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 222 transitions. [2023-08-24 10:59:14,942 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 10:59:14,943 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 222 transitions. [2023-08-24 10:59:14,945 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 74.0) internal successors, (222), 3 states have internal predecessors, (222), 0 states have call successors, (0), 0 states 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 10:59:14,948 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 142.0) internal successors, (568), 4 states have internal predecessors, (568), 0 states have call successors, (0), 0 states 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 10:59:14,949 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 142.0) internal successors, (568), 4 states have internal predecessors, (568), 0 states have call successors, (0), 0 states 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 10:59:14,950 INFO L175 Difference]: Start difference. First operand has 19 places, 14 transitions, 40 flow. Second operand 3 states and 222 transitions. [2023-08-24 10:59:14,950 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 21 places, 14 transitions, 68 flow [2023-08-24 10:59:14,951 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 17 places, 14 transitions, 60 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-24 10:59:14,952 INFO L231 Difference]: Finished difference. Result has 17 places, 13 transitions, 32 flow [2023-08-24 10:59:14,953 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=142, PETRI_DIFFERENCE_MINUEND_FLOW=30, PETRI_DIFFERENCE_MINUEND_PLACES=15, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=13, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=32, PETRI_PLACES=17, PETRI_TRANSITIONS=13} [2023-08-24 10:59:14,955 INFO L281 CegarLoopForPetriNet]: 19 programPoint places, -2 predicate places. [2023-08-24 10:59:14,955 INFO L495 AbstractCegarLoop]: Abstraction has has 17 places, 13 transitions, 32 flow [2023-08-24 10:59:14,956 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 72.66666666666667) internal successors, (218), 3 states have internal predecessors, (218), 0 states have call successors, (0), 0 states 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 10:59:14,956 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 10:59:14,956 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 10:59:14,956 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-24 10:59:14,956 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-24 10:59:14,956 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 10:59:14,957 INFO L85 PathProgramCache]: Analyzing trace with hash 1703930448, now seen corresponding path program 1 times [2023-08-24 10:59:14,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 10:59:14,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114734262] [2023-08-24 10:59:14,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 10:59:14,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 10:59:15,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 10:59:15,474 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 10:59:15,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 10:59:15,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114734262] [2023-08-24 10:59:15,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [114734262] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 10:59:15,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 10:59:15,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-24 10:59:15,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621602800] [2023-08-24 10:59:15,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 10:59:15,476 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-24 10:59:15,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 10:59:15,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-24 10:59:15,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-08-24 10:59:15,479 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 42 out of 142 [2023-08-24 10:59:15,481 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 17 places, 13 transitions, 32 flow. Second operand has 8 states, 8 states have (on average 43.5) internal successors, (348), 8 states have internal predecessors, (348), 0 states have call successors, (0), 0 states 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 10:59:15,481 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 10:59:15,481 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 42 of 142 [2023-08-24 10:59:15,481 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 10:59:15,582 INFO L124 PetriNetUnfolderBase]: 9/28 cut-off events. [2023-08-24 10:59:15,582 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-08-24 10:59:15,582 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63 conditions, 28 events. 9/28 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 23 event pairs, 1 based on Foata normal form. 0/24 useless extension candidates. Maximal degree in co-relation 47. Up to 13 conditions per place. [2023-08-24 10:59:15,582 INFO L140 encePairwiseOnDemand]: 138/142 looper letters, 14 selfloop transitions, 5 changer transitions 0/19 dead transitions. [2023-08-24 10:59:15,582 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 21 places, 19 transitions, 82 flow [2023-08-24 10:59:15,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-24 10:59:15,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-24 10:59:15,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 230 transitions. [2023-08-24 10:59:15,587 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.323943661971831 [2023-08-24 10:59:15,587 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 230 transitions. [2023-08-24 10:59:15,587 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 230 transitions. [2023-08-24 10:59:15,588 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 10:59:15,588 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 230 transitions. [2023-08-24 10:59:15,589 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 46.0) internal successors, (230), 5 states have internal predecessors, (230), 0 states have call successors, (0), 0 states 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 10:59:15,590 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 142.0) internal successors, (852), 6 states have internal predecessors, (852), 0 states have call successors, (0), 0 states 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 10:59:15,591 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 142.0) internal successors, (852), 6 states have internal predecessors, (852), 0 states have call successors, (0), 0 states 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 10:59:15,591 INFO L175 Difference]: Start difference. First operand has 17 places, 13 transitions, 32 flow. Second operand 5 states and 230 transitions. [2023-08-24 10:59:15,591 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 21 places, 19 transitions, 82 flow [2023-08-24 10:59:15,591 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 20 places, 19 transitions, 81 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-24 10:59:15,592 INFO L231 Difference]: Finished difference. Result has 22 places, 16 transitions, 58 flow [2023-08-24 10:59:15,592 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=142, PETRI_DIFFERENCE_MINUEND_FLOW=31, PETRI_DIFFERENCE_MINUEND_PLACES=16, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=13, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=9, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=58, PETRI_PLACES=22, PETRI_TRANSITIONS=16} [2023-08-24 10:59:15,592 INFO L281 CegarLoopForPetriNet]: 19 programPoint places, 3 predicate places. [2023-08-24 10:59:15,592 INFO L495 AbstractCegarLoop]: Abstraction has has 22 places, 16 transitions, 58 flow [2023-08-24 10:59:15,593 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 43.5) internal successors, (348), 8 states have internal predecessors, (348), 0 states have call successors, (0), 0 states 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 10:59:15,593 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 10:59:15,593 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 10:59:15,593 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-24 10:59:15,593 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-24 10:59:15,593 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 10:59:15,593 INFO L85 PathProgramCache]: Analyzing trace with hash 1951074546, now seen corresponding path program 1 times [2023-08-24 10:59:15,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 10:59:15,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546632647] [2023-08-24 10:59:15,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 10:59:15,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 10:59:15,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 10:59:15,897 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 10:59:15,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 10:59:15,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546632647] [2023-08-24 10:59:15,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1546632647] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 10:59:15,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1417562091] [2023-08-24 10:59:15,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 10:59:15,898 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 10:59:15,898 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 10:59:15,903 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 10:59:15,904 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 10:59:16,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 10:59:16,033 INFO L262 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 40 conjunts are in the unsatisfiable core [2023-08-24 10:59:16,037 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 10:59:16,065 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-24 10:59:16,069 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-24 10:59:16,084 INFO L322 Elim1Store]: treesize reduction 13, result has 48.0 percent of original size [2023-08-24 10:59:16,085 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 29 treesize of output 34 [2023-08-24 10:59:16,140 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-24 10:59:16,211 INFO L322 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-08-24 10:59:16,212 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2023-08-24 10:59:16,274 INFO L322 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-08-24 10:59:16,274 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 1 case distinctions, treesize of input 26 treesize of output 28 [2023-08-24 10:59:16,301 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 10:59:16,301 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 10:59:16,424 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 10:59:16,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1417562091] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 10:59:16,424 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 10:59:16,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 5] total 17 [2023-08-24 10:59:16,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223621826] [2023-08-24 10:59:16,425 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 10:59:16,425 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-08-24 10:59:16,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 10:59:16,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-08-24 10:59:16,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=252, Unknown=0, NotChecked=0, Total=306 [2023-08-24 10:59:16,427 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 142 [2023-08-24 10:59:16,427 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 22 places, 16 transitions, 58 flow. Second operand has 18 states, 18 states have (on average 39.05555555555556) internal successors, (703), 18 states have internal predecessors, (703), 0 states have call successors, (0), 0 states 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 10:59:16,427 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 10:59:16,427 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 142 [2023-08-24 10:59:16,427 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 10:59:16,710 INFO L124 PetriNetUnfolderBase]: 14/45 cut-off events. [2023-08-24 10:59:16,710 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2023-08-24 10:59:16,710 INFO L83 FinitePrefix]: Finished finitePrefix Result has 134 conditions, 45 events. 14/45 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 62 event pairs, 1 based on Foata normal form. 2/47 useless extension candidates. Maximal degree in co-relation 113. Up to 14 conditions per place. [2023-08-24 10:59:16,710 INFO L140 encePairwiseOnDemand]: 137/142 looper letters, 17 selfloop transitions, 8 changer transitions 5/30 dead transitions. [2023-08-24 10:59:16,710 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 30 transitions, 163 flow [2023-08-24 10:59:16,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-24 10:59:16,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-24 10:59:16,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 366 transitions. [2023-08-24 10:59:16,712 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2863849765258216 [2023-08-24 10:59:16,712 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 366 transitions. [2023-08-24 10:59:16,712 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 366 transitions. [2023-08-24 10:59:16,713 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 10:59:16,713 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 366 transitions. [2023-08-24 10:59:16,714 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 40.666666666666664) internal successors, (366), 9 states have internal predecessors, (366), 0 states have call successors, (0), 0 states 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 10:59:16,718 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 142.0) internal successors, (1420), 10 states have internal predecessors, (1420), 0 states have call successors, (0), 0 states 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 10:59:16,718 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 142.0) internal successors, (1420), 10 states have internal predecessors, (1420), 0 states have call successors, (0), 0 states 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 10:59:16,718 INFO L175 Difference]: Start difference. First operand has 22 places, 16 transitions, 58 flow. Second operand 9 states and 366 transitions. [2023-08-24 10:59:16,718 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 30 transitions, 163 flow [2023-08-24 10:59:16,719 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 30 transitions, 157 flow, removed 2 selfloop flow, removed 1 redundant places. [2023-08-24 10:59:16,719 INFO L231 Difference]: Finished difference. Result has 33 places, 19 transitions, 98 flow [2023-08-24 10:59:16,720 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=142, PETRI_DIFFERENCE_MINUEND_FLOW=47, PETRI_DIFFERENCE_MINUEND_PLACES=21, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=15, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=9, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=98, PETRI_PLACES=33, PETRI_TRANSITIONS=19} [2023-08-24 10:59:16,720 INFO L281 CegarLoopForPetriNet]: 19 programPoint places, 14 predicate places. [2023-08-24 10:59:16,720 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 19 transitions, 98 flow [2023-08-24 10:59:16,721 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 39.05555555555556) internal successors, (703), 18 states have internal predecessors, (703), 0 states have call successors, (0), 0 states 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 10:59:16,721 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 10:59:16,721 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 10:59:16,729 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 10:59:16,927 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 10:59:16,928 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-24 10:59:16,928 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 10:59:16,928 INFO L85 PathProgramCache]: Analyzing trace with hash -1171585968, now seen corresponding path program 2 times [2023-08-24 10:59:16,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 10:59:16,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782096062] [2023-08-24 10:59:16,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 10:59:16,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 10:59:16,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 10:59:17,312 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 10:59:17,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 10:59:17,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1782096062] [2023-08-24 10:59:17,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1782096062] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 10:59:17,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [808707669] [2023-08-24 10:59:17,313 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-24 10:59:17,313 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 10:59:17,313 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 10:59:17,314 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 10:59:17,353 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 10:59:17,402 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-24 10:59:17,402 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-24 10:59:17,404 INFO L262 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 41 conjunts are in the unsatisfiable core [2023-08-24 10:59:17,405 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 10:59:17,445 INFO L322 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2023-08-24 10:59:17,446 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 29 treesize of output 37 [2023-08-24 10:59:17,469 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-24 10:59:17,541 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-24 10:59:17,546 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-24 10:59:17,546 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 14 [2023-08-24 10:59:17,581 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-24 10:59:17,647 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-24 10:59:17,684 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-24 10:59:17,715 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-24 10:59:17,751 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-24 10:59:17,780 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 10:59:17,780 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 10:59:17,834 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_112 (Array Int Int))) (< 0 (select (select (store |c_#memory_int| |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_dest#1.base| v_ArrVal_112) |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_src#1.base|) (+ |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~offset13#1| 2 |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_src#1.offset|)))) is different from false [2023-08-24 10:59:17,840 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_112 (Array Int Int))) (< 0 (select (select (store |c_#memory_int| |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_dest#1.base| v_ArrVal_112) |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_src#1.base|) (+ |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~offset13#1| 3 |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_src#1.offset|)))) is different from false [2023-08-24 10:59:17,985 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2023-08-24 10:59:17,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [808707669] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 10:59:17,985 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 10:59:17,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 26 [2023-08-24 10:59:17,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433107297] [2023-08-24 10:59:17,986 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 10:59:17,986 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2023-08-24 10:59:17,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 10:59:17,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2023-08-24 10:59:17,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=529, Unknown=8, NotChecked=94, Total=702 [2023-08-24 10:59:17,988 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 142 [2023-08-24 10:59:17,989 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 19 transitions, 98 flow. Second operand has 27 states, 27 states have (on average 37.629629629629626) internal successors, (1016), 27 states have internal predecessors, (1016), 0 states have call successors, (0), 0 states 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 10:59:17,989 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 10:59:17,989 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 142 [2023-08-24 10:59:17,989 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 10:59:18,576 INFO L124 PetriNetUnfolderBase]: 14/44 cut-off events. [2023-08-24 10:59:18,576 INFO L125 PetriNetUnfolderBase]: For 33/33 co-relation queries the response was YES. [2023-08-24 10:59:18,577 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 44 events. 14/44 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 50 event pairs, 2 based on Foata normal form. 2/46 useless extension candidates. Maximal degree in co-relation 153. Up to 13 conditions per place. [2023-08-24 10:59:18,577 INFO L140 encePairwiseOnDemand]: 138/142 looper letters, 17 selfloop transitions, 9 changer transitions 2/28 dead transitions. [2023-08-24 10:59:18,577 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 28 transitions, 186 flow [2023-08-24 10:59:18,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-24 10:59:18,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-24 10:59:18,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 317 transitions. [2023-08-24 10:59:18,579 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2790492957746479 [2023-08-24 10:59:18,579 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 317 transitions. [2023-08-24 10:59:18,579 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 317 transitions. [2023-08-24 10:59:18,580 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 10:59:18,580 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 317 transitions. [2023-08-24 10:59:18,580 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 39.625) internal successors, (317), 8 states have internal predecessors, (317), 0 states have call successors, (0), 0 states 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 10:59:18,582 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 142.0) internal successors, (1278), 9 states have internal predecessors, (1278), 0 states have call successors, (0), 0 states 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 10:59:18,582 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 142.0) internal successors, (1278), 9 states have internal predecessors, (1278), 0 states have call successors, (0), 0 states 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 10:59:18,582 INFO L175 Difference]: Start difference. First operand has 33 places, 19 transitions, 98 flow. Second operand 8 states and 317 transitions. [2023-08-24 10:59:18,582 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 28 transitions, 186 flow [2023-08-24 10:59:18,583 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 28 transitions, 162 flow, removed 8 selfloop flow, removed 5 redundant places. [2023-08-24 10:59:18,584 INFO L231 Difference]: Finished difference. Result has 35 places, 20 transitions, 108 flow [2023-08-24 10:59:18,584 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=142, PETRI_DIFFERENCE_MINUEND_FLOW=67, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=9, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=108, PETRI_PLACES=35, PETRI_TRANSITIONS=20} [2023-08-24 10:59:18,584 INFO L281 CegarLoopForPetriNet]: 19 programPoint places, 16 predicate places. [2023-08-24 10:59:18,584 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 20 transitions, 108 flow [2023-08-24 10:59:18,585 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 37.629629629629626) internal successors, (1016), 27 states have internal predecessors, (1016), 0 states have call successors, (0), 0 states 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 10:59:18,585 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 10:59:18,585 INFO L208 CegarLoopForPetriNet]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 10:59:18,605 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-08-24 10:59:18,790 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 10:59:18,791 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-24 10:59:18,791 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 10:59:18,791 INFO L85 PathProgramCache]: Analyzing trace with hash -1959732808, now seen corresponding path program 3 times [2023-08-24 10:59:18,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 10:59:18,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536961658] [2023-08-24 10:59:18,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 10:59:18,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 10:59:18,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 10:59:19,260 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 10:59:19,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 10:59:19,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536961658] [2023-08-24 10:59:19,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [536961658] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 10:59:19,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1086950310] [2023-08-24 10:59:19,261 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-24 10:59:19,261 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 10:59:19,261 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 10:59:19,262 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 10:59:19,303 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 10:59:19,368 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2023-08-24 10:59:19,368 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-24 10:59:19,370 INFO L262 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 49 conjunts are in the unsatisfiable core [2023-08-24 10:59:19,373 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 10:59:19,401 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-24 10:59:19,403 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-24 10:59:19,442 INFO L322 Elim1Store]: treesize reduction 98, result has 24.6 percent of original size [2023-08-24 10:59:19,443 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 39 treesize of output 61 [2023-08-24 10:59:19,455 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-24 10:59:19,568 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-24 10:59:19,570 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-24 10:59:19,581 INFO L322 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2023-08-24 10:59:19,583 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 8 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 26 treesize of output 28 [2023-08-24 10:59:19,627 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-24 10:59:19,711 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-24 10:59:19,740 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-24 10:59:19,799 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-24 10:59:19,836 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-24 10:59:19,868 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-24 10:59:19,894 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 10:59:19,894 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 10:59:19,916 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_168 (Array Int Int))) (< 0 (select (select (store |c_#memory_int| |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_dest#1.base| v_ArrVal_168) |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_src#1.base|) (+ |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~offset13#1| |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_src#1.offset| 1)))) is different from false [2023-08-24 10:59:19,919 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_168 (Array Int Int))) (< 0 (select (select (store |c_#memory_int| |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_dest#1.base| v_ArrVal_168) |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_src#1.base|) (+ |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~offset13#1| 2 |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_src#1.offset|)))) is different from false [2023-08-24 10:59:19,923 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_168 (Array Int Int))) (< 0 (select (select (store |c_#memory_int| |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_dest#1.base| v_ArrVal_168) |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_src#1.base|) (+ |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~offset13#1| 3 |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_src#1.offset|)))) is different from false [2023-08-24 10:59:19,928 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_168 (Array Int Int))) (< 0 (select (select (store |c_#memory_int| |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_dest#1.base| v_ArrVal_168) |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_src#1.base|) (+ |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~offset13#1| |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_src#1.offset| 4)))) is different from false [2023-08-24 10:59:19,933 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_168 (Array Int Int))) (< 0 (select (select (store |c_#memory_int| |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_dest#1.base| v_ArrVal_168) |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_src#1.base|) (+ |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~offset13#1| 5 |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_src#1.offset|)))) is different from false [2023-08-24 10:59:20,073 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 15 not checked. [2023-08-24 10:59:20,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1086950310] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 10:59:20,073 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 10:59:20,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 29 [2023-08-24 10:59:20,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064068044] [2023-08-24 10:59:20,073 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 10:59:20,074 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2023-08-24 10:59:20,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 10:59:20,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2023-08-24 10:59:20,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=543, Unknown=6, NotChecked=250, Total=870 [2023-08-24 10:59:20,077 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 142 [2023-08-24 10:59:20,078 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 20 transitions, 108 flow. Second operand has 30 states, 30 states have (on average 37.56666666666667) internal successors, (1127), 30 states have internal predecessors, (1127), 0 states have call successors, (0), 0 states 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 10:59:20,078 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 10:59:20,078 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 142 [2023-08-24 10:59:20,078 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 10:59:21,009 INFO L124 PetriNetUnfolderBase]: 17/57 cut-off events. [2023-08-24 10:59:21,011 INFO L125 PetriNetUnfolderBase]: For 109/109 co-relation queries the response was YES. [2023-08-24 10:59:21,011 INFO L83 FinitePrefix]: Finished finitePrefix Result has 232 conditions, 57 events. 17/57 cut-off events. For 109/109 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 99 event pairs, 1 based on Foata normal form. 3/60 useless extension candidates. Maximal degree in co-relation 206. Up to 20 conditions per place. [2023-08-24 10:59:21,012 INFO L140 encePairwiseOnDemand]: 137/142 looper letters, 17 selfloop transitions, 19 changer transitions 6/42 dead transitions. [2023-08-24 10:59:21,012 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 42 transitions, 310 flow [2023-08-24 10:59:21,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-08-24 10:59:21,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2023-08-24 10:59:21,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 620 transitions. [2023-08-24 10:59:21,019 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.272887323943662 [2023-08-24 10:59:21,019 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 620 transitions. [2023-08-24 10:59:21,019 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 620 transitions. [2023-08-24 10:59:21,019 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 10:59:21,020 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 620 transitions. [2023-08-24 10:59:21,021 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 38.75) internal successors, (620), 16 states have internal predecessors, (620), 0 states have call successors, (0), 0 states 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 10:59:21,025 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 142.0) internal successors, (2414), 17 states have internal predecessors, (2414), 0 states have call successors, (0), 0 states 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 10:59:21,025 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 142.0) internal successors, (2414), 17 states have internal predecessors, (2414), 0 states have call successors, (0), 0 states 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 10:59:21,025 INFO L175 Difference]: Start difference. First operand has 35 places, 20 transitions, 108 flow. Second operand 16 states and 620 transitions. [2023-08-24 10:59:21,025 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 42 transitions, 310 flow [2023-08-24 10:59:21,026 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 42 transitions, 290 flow, removed 0 selfloop flow, removed 6 redundant places. [2023-08-24 10:59:21,027 INFO L231 Difference]: Finished difference. Result has 46 places, 30 transitions, 202 flow [2023-08-24 10:59:21,027 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=142, PETRI_DIFFERENCE_MINUEND_FLOW=83, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=8, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=202, PETRI_PLACES=46, PETRI_TRANSITIONS=30} [2023-08-24 10:59:21,028 INFO L281 CegarLoopForPetriNet]: 19 programPoint places, 27 predicate places. [2023-08-24 10:59:21,028 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 30 transitions, 202 flow [2023-08-24 10:59:21,028 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 37.56666666666667) internal successors, (1127), 30 states have internal predecessors, (1127), 0 states have call successors, (0), 0 states 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 10:59:21,028 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 10:59:21,028 INFO L208 CegarLoopForPetriNet]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 10:59:21,035 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-08-24 10:59:21,238 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 10:59:21,238 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-24 10:59:21,238 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 10:59:21,239 INFO L85 PathProgramCache]: Analyzing trace with hash -622481072, now seen corresponding path program 4 times [2023-08-24 10:59:21,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 10:59:21,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44497376] [2023-08-24 10:59:21,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 10:59:21,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 10:59:21,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 10:59:21,619 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 10:59:21,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 10:59:21,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44497376] [2023-08-24 10:59:21,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [44497376] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 10:59:21,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2123523871] [2023-08-24 10:59:21,619 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-08-24 10:59:21,619 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 10:59:21,620 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 10:59:21,620 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 10:59:21,622 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 10:59:21,708 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-08-24 10:59:21,708 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-24 10:59:21,710 INFO L262 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 59 conjunts are in the unsatisfiable core [2023-08-24 10:59:21,713 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 10:59:21,722 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-24 10:59:21,723 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-24 10:59:21,734 INFO L322 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2023-08-24 10:59:21,734 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 20 treesize of output 22 [2023-08-24 10:59:21,774 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-24 10:59:21,834 INFO L322 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-08-24 10:59:21,835 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2023-08-24 10:59:21,866 INFO L322 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-08-24 10:59:21,866 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 1 case distinctions, treesize of input 26 treesize of output 28 [2023-08-24 10:59:21,899 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-24 10:59:21,901 INFO L322 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-08-24 10:59:21,902 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 1 case distinctions, treesize of input 26 treesize of output 28 [2023-08-24 10:59:21,937 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-24 10:59:21,939 INFO L322 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-08-24 10:59:21,939 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 1 case distinctions, treesize of input 26 treesize of output 28 [2023-08-24 10:59:21,988 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-24 10:59:21,990 INFO L322 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-08-24 10:59:21,990 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 1 case distinctions, treesize of input 26 treesize of output 28 [2023-08-24 10:59:22,030 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-24 10:59:22,033 INFO L322 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-08-24 10:59:22,033 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 1 case distinctions, treesize of input 26 treesize of output 28 [2023-08-24 10:59:22,073 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-24 10:59:22,075 INFO L322 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-08-24 10:59:22,075 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 1 case distinctions, treesize of input 26 treesize of output 28 [2023-08-24 10:59:22,099 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 10 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 10:59:22,099 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 10:59:34,552 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_236 Int) (v_ArrVal_234 Int) (v_ArrVal_231 Int) (|v_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~offset13#1_69| Int) (v_ArrVal_229 Int) (|v_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~offset13#1_71| Int) (|v_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~offset13#1_70| Int)) (or (< |v_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~offset13#1_71| (+ |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~offset13#1| 1)) (< |v_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~offset13#1_69| (+ |v_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~offset13#1_70| 1)) (= 66 (select (select (store |c_#memory_int| |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_dest#1.base| (store (store (store (store (select |c_#memory_int| |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_dest#1.base|) (+ |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~offset13#1| |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_dest#1.offset|) v_ArrVal_229) (+ |v_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~offset13#1_71| |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_dest#1.offset|) v_ArrVal_231) (+ |v_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~offset13#1_70| |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_dest#1.offset|) v_ArrVal_234) (+ |v_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~offset13#1_69| |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_dest#1.offset|) v_ArrVal_236)) c_~v~0.base) c_~v~0.offset)) (< |v_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~offset13#1_70| (+ |v_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~offset13#1_71| 1)))) is different from false [2023-08-24 11:00:39,071 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 5 refuted. 6 times theorem prover too weak. 0 trivial. 6 not checked. [2023-08-24 11:00:39,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2123523871] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 11:00:39,071 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 11:00:39,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 10] total 32 [2023-08-24 11:00:39,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026573727] [2023-08-24 11:00:39,072 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 11:00:39,072 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2023-08-24 11:00:39,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 11:00:39,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2023-08-24 11:00:39,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=814, Unknown=29, NotChecked=60, Total=1056 [2023-08-24 11:00:39,074 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 142 [2023-08-24 11:00:39,075 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 30 transitions, 202 flow. Second operand has 33 states, 33 states have (on average 37.54545454545455) internal successors, (1239), 33 states have internal predecessors, (1239), 0 states have call successors, (0), 0 states 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 11:00:39,075 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 11:00:39,075 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 142 [2023-08-24 11:00:39,075 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 11:00:51,912 WARN L234 SmtUtils]: Spent 10.37s on a formula simplification. DAG size of input: 73 DAG size of output: 71 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-24 11:01:20,314 WARN L234 SmtUtils]: Spent 21.00s on a formula simplification. DAG size of input: 74 DAG size of output: 72 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-24 11:01:34,045 INFO L124 PetriNetUnfolderBase]: 12/47 cut-off events. [2023-08-24 11:01:34,045 INFO L125 PetriNetUnfolderBase]: For 73/73 co-relation queries the response was YES. [2023-08-24 11:01:34,045 INFO L83 FinitePrefix]: Finished finitePrefix Result has 216 conditions, 47 events. 12/47 cut-off events. For 73/73 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 63 event pairs, 1 based on Foata normal form. 4/51 useless extension candidates. Maximal degree in co-relation 187. Up to 14 conditions per place. [2023-08-24 11:01:34,045 INFO L140 encePairwiseOnDemand]: 136/142 looper letters, 0 selfloop transitions, 0 changer transitions 34/34 dead transitions. [2023-08-24 11:01:34,046 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 34 transitions, 281 flow [2023-08-24 11:01:34,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-08-24 11:01:34,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2023-08-24 11:01:34,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 499 transitions. [2023-08-24 11:01:34,047 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2703141928494041 [2023-08-24 11:01:34,048 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 499 transitions. [2023-08-24 11:01:34,048 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 499 transitions. [2023-08-24 11:01:34,048 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 11:01:34,048 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 499 transitions. [2023-08-24 11:01:34,049 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 38.38461538461539) internal successors, (499), 13 states have internal predecessors, (499), 0 states have call successors, (0), 0 states 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 11:01:34,051 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 142.0) internal successors, (1988), 14 states have internal predecessors, (1988), 0 states have call successors, (0), 0 states 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 11:01:34,051 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 142.0) internal successors, (1988), 14 states have internal predecessors, (1988), 0 states have call successors, (0), 0 states 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 11:01:34,051 INFO L175 Difference]: Start difference. First operand has 46 places, 30 transitions, 202 flow. Second operand 13 states and 499 transitions. [2023-08-24 11:01:34,051 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 34 transitions, 281 flow [2023-08-24 11:01:34,052 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 34 transitions, 185 flow, removed 20 selfloop flow, removed 14 redundant places. [2023-08-24 11:01:34,053 INFO L231 Difference]: Finished difference. Result has 43 places, 0 transitions, 0 flow [2023-08-24 11:01:34,053 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=142, PETRI_DIFFERENCE_MINUEND_FLOW=79, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=0, PETRI_PLACES=43, PETRI_TRANSITIONS=0} [2023-08-24 11:01:34,053 INFO L281 CegarLoopForPetriNet]: 19 programPoint places, 24 predicate places. [2023-08-24 11:01:34,053 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 0 transitions, 0 flow [2023-08-24 11:01:34,054 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 37.54545454545455) internal successors, (1239), 33 states have internal predecessors, (1239), 0 states have call successors, (0), 0 states 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 11:01:34,056 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2023-08-24 11:01:34,056 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2023-08-24 11:01:34,057 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2023-08-24 11:01:34,062 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 11:01:34,257 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 11:01:34,257 INFO L445 BasicCegarLoop]: Path program histogram: [4, 1, 1] [2023-08-24 11:01:34,259 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-24 11:01:34,260 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-24 11:01:34,261 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.08 11:01:34 BasicIcfg [2023-08-24 11:01:34,261 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-24 11:01:34,262 INFO L158 Benchmark]: Toolchain (without parser) took 142791.35ms. Allocated memory was 379.6MB in the beginning and 690.0MB in the end (delta: 310.4MB). Free memory was 354.4MB in the beginning and 585.7MB in the end (delta: -231.3MB). Peak memory consumption was 79.7MB. Max. memory is 16.0GB. [2023-08-24 11:01:34,262 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 379.6MB. Free memory was 355.9MB in the beginning and 355.8MB in the end (delta: 165.2kB). There was no memory consumed. Max. memory is 16.0GB. [2023-08-24 11:01:34,262 INFO L158 Benchmark]: CACSL2BoogieTranslator took 432.28ms. Allocated memory is still 379.6MB. Free memory was 354.1MB in the beginning and 321.9MB in the end (delta: 32.2MB). Peak memory consumption was 31.5MB. Max. memory is 16.0GB. [2023-08-24 11:01:34,262 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.08ms. Allocated memory is still 379.6MB. Free memory was 321.9MB in the beginning and 319.5MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-24 11:01:34,262 INFO L158 Benchmark]: Boogie Preprocessor took 32.29ms. Allocated memory is still 379.6MB. Free memory was 319.5MB in the beginning and 317.8MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-24 11:01:34,262 INFO L158 Benchmark]: RCFGBuilder took 357.54ms. Allocated memory is still 379.6MB. Free memory was 317.8MB in the beginning and 351.9MB in the end (delta: -34.1MB). Peak memory consumption was 16.2MB. Max. memory is 16.0GB. [2023-08-24 11:01:34,263 INFO L158 Benchmark]: TraceAbstraction took 141920.93ms. Allocated memory was 379.6MB in the beginning and 690.0MB in the end (delta: 310.4MB). Free memory was 351.3MB in the beginning and 585.7MB in the end (delta: -234.3MB). Peak memory consumption was 76.1MB. Max. memory is 16.0GB. [2023-08-24 11:01:34,263 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.11ms. Allocated memory is still 379.6MB. Free memory was 355.9MB in the beginning and 355.8MB in the end (delta: 165.2kB). There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 432.28ms. Allocated memory is still 379.6MB. Free memory was 354.1MB in the beginning and 321.9MB in the end (delta: 32.2MB). Peak memory consumption was 31.5MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 42.08ms. Allocated memory is still 379.6MB. Free memory was 321.9MB in the beginning and 319.5MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 32.29ms. Allocated memory is still 379.6MB. Free memory was 319.5MB in the beginning and 317.8MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 357.54ms. Allocated memory is still 379.6MB. Free memory was 317.8MB in the beginning and 351.9MB in the end (delta: -34.1MB). Peak memory consumption was 16.2MB. Max. memory is 16.0GB. * TraceAbstraction took 141920.93ms. Allocated memory was 379.6MB in the beginning and 690.0MB in the end (delta: 310.4MB). Free memory was 351.3MB in the beginning and 585.7MB in the end (delta: -234.3MB). Peak memory consumption was 76.1MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 274]: Unsoundness Warning unspecified type, defaulting to int C: short [274] - GenericResultAtLocation [Line: 274]: Unsoundness Warning unspecified type, defaulting to int C: short [274] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.1s, 73 PlacesBefore, 19 PlacesAfterwards, 69 TransitionsBefore, 14 TransitionsAfterwards, 144 CoEnabledTransitionPairs, 6 FixpointIterations, 32 TrivialSequentialCompositions, 21 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 6 ConcurrentYvCompositions, 1 ChoiceCompositions, 60 TotalNumberOfCompositions, 177 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 150, independent: 140, independent conditional: 0, independent unconditional: 140, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 89, independent: 84, independent conditional: 0, independent unconditional: 84, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 150, independent: 56, independent conditional: 0, independent unconditional: 56, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 89, unknown conditional: 0, unknown unconditional: 89] , Statistics on independence cache: Total cache size (in pairs): 5, Positive cache size: 3, Positive conditional cache size: 0, Positive unconditional cache size: 3, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - PositiveResult [Line: 1107]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 104 locations, 3 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 141.8s, OverallIterations: 6, TraceHistogramMax: 6, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 57.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.2s, HoareTripleCheckerStatistics: 46 mSolverCounterUnknown, 216 SdHoareTripleChecker+Valid, 15.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 216 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 15.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 279 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 182 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1162 IncrementalHoareTripleChecker+Invalid, 1669 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 182 mSolverCounterUnsat, 0 mSDtfsCounter, 1162 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 221 GetRequests, 68 SyntacticMatches, 8 SemanticMatches, 145 ConstructedPredicates, 8 IntricatePredicates, 3 DeprecatedPredicates, 594 ImplicationChecksByTransitivity, 119.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=202occurred in iteration=5, InterpolantAutomatonStates: 54, 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.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 81.0s InterpolantComputationTime, 151 NumberOfCodeBlocks, 151 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 201 ConstructedInterpolants, 43 QuantifiedInterpolants, 3617 SizeOfPredicates, 35 NumberOfNonLiveVariables, 840 ConjunctsInSsa, 189 ConjunctsInUnsatCore, 14 InterpolantComputations, 2 PerfectInterpolantSequences, 14/141 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2023-08-24 11:01:34,335 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...