/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-wmm/safe009_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-24 11:47:40,070 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-24 11:47:40,125 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 11:47:40,128 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-24 11:47:40,129 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-24 11:47:40,155 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-24 11:47:40,156 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-24 11:47:40,158 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-24 11:47:40,158 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-24 11:47:40,158 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-24 11:47:40,159 INFO L153 SettingsManager]: * Use SBE=true [2023-08-24 11:47:40,159 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-24 11:47:40,159 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-24 11:47:40,159 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-24 11:47:40,160 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-24 11:47:40,160 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-24 11:47:40,160 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-24 11:47:40,160 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-24 11:47:40,161 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-24 11:47:40,161 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-24 11:47:40,161 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-24 11:47:40,165 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-24 11:47:40,165 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-24 11:47:40,166 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-24 11:47:40,166 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-24 11:47:40,167 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-24 11:47:40,167 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-24 11:47:40,167 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-24 11:47:40,167 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-24 11:47:40,167 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-24 11:47:40,168 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-24 11:47:40,168 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-24 11:47:40,168 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-24 11:47:40,168 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-24 11:47:40,168 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-24 11:47:40,169 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 11:47:40,393 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-24 11:47:40,408 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-24 11:47:40,409 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-24 11:47:40,410 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-24 11:47:40,411 INFO L274 PluginConnector]: CDTParser initialized [2023-08-24 11:47:40,412 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe009_power.oepc.i [2023-08-24 11:47:41,320 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-24 11:47:41,517 INFO L384 CDTParser]: Found 1 translation units. [2023-08-24 11:47:41,517 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe009_power.oepc.i [2023-08-24 11:47:41,528 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/80cef941d/88cac2666ae04fd9b624ff5541e3b45e/FLAG176c03520 [2023-08-24 11:47:41,536 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/80cef941d/88cac2666ae04fd9b624ff5541e3b45e [2023-08-24 11:47:41,540 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-24 11:47:41,541 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-24 11:47:41,543 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-24 11:47:41,543 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-24 11:47:41,544 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-24 11:47:41,545 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.08 11:47:41" (1/1) ... [2023-08-24 11:47:41,545 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3181e09d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 11:47:41, skipping insertion in model container [2023-08-24 11:47:41,546 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.08 11:47:41" (1/1) ... [2023-08-24 11:47:41,579 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-24 11:47:41,714 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-wmm/safe009_power.oepc.i[995,1008] [2023-08-24 11:47:41,887 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-24 11:47:41,896 INFO L201 MainTranslator]: Completed pre-run [2023-08-24 11:47:41,906 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-wmm/safe009_power.oepc.i[995,1008] [2023-08-24 11:47:41,911 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [268] [2023-08-24 11:47:41,916 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [268] [2023-08-24 11:47:41,952 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-24 11:47:41,978 WARN L669 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-24 11:47:41,978 WARN L669 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-24 11:47:41,983 INFO L206 MainTranslator]: Completed translation [2023-08-24 11:47:41,983 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 11:47:41 WrapperNode [2023-08-24 11:47:41,983 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-24 11:47:41,984 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-24 11:47:41,984 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-24 11:47:41,984 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-24 11:47:41,988 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 11:47:41" (1/1) ... [2023-08-24 11:47:42,015 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 11:47:41" (1/1) ... [2023-08-24 11:47:42,043 INFO L138 Inliner]: procedures = 176, calls = 76, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 169 [2023-08-24 11:47:42,043 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-24 11:47:42,044 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-24 11:47:42,044 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-24 11:47:42,044 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-24 11:47:42,056 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 11:47:41" (1/1) ... [2023-08-24 11:47:42,056 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 11:47:41" (1/1) ... [2023-08-24 11:47:42,058 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 11:47:41" (1/1) ... [2023-08-24 11:47:42,059 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 11:47:41" (1/1) ... [2023-08-24 11:47:42,065 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 11:47:41" (1/1) ... [2023-08-24 11:47:42,066 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 11:47:41" (1/1) ... [2023-08-24 11:47:42,068 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 11:47:41" (1/1) ... [2023-08-24 11:47:42,069 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 11:47:41" (1/1) ... [2023-08-24 11:47:42,072 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-24 11:47:42,073 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-24 11:47:42,073 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-24 11:47:42,073 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-24 11:47:42,073 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 11:47:41" (1/1) ... [2023-08-24 11:47:42,077 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-24 11:47:42,086 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 11:47:42,095 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 11:47:42,141 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-24 11:47:42,141 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-24 11:47:42,142 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-24 11:47:42,142 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-24 11:47:42,142 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-24 11:47:42,142 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-24 11:47:42,142 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-24 11:47:42,142 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-24 11:47:42,143 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-24 11:47:42,143 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-24 11:47:42,143 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-24 11:47:42,143 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-24 11:47:42,143 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-24 11:47:42,143 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-24 11:47:42,144 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-24 11:47:42,144 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-24 11:47:42,132 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 11:47:42,148 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 11:47:42,277 INFO L236 CfgBuilder]: Building ICFG [2023-08-24 11:47:42,279 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-24 11:47:42,625 INFO L277 CfgBuilder]: Performing block encoding [2023-08-24 11:47:42,816 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-24 11:47:42,816 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-24 11:47:42,818 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.08 11:47:42 BoogieIcfgContainer [2023-08-24 11:47:42,818 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-24 11:47:42,820 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-24 11:47:42,820 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-24 11:47:42,822 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-24 11:47:42,822 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.08 11:47:41" (1/3) ... [2023-08-24 11:47:42,823 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c8a6c2e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.08 11:47:42, skipping insertion in model container [2023-08-24 11:47:42,823 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 11:47:41" (2/3) ... [2023-08-24 11:47:42,823 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c8a6c2e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.08 11:47:42, skipping insertion in model container [2023-08-24 11:47:42,824 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.08 11:47:42" (3/3) ... [2023-08-24 11:47:42,824 INFO L112 eAbstractionObserver]: Analyzing ICFG safe009_power.oepc.i [2023-08-24 11:47:42,835 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-24 11:47:42,836 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-08-24 11:47:42,836 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-24 11:47:42,887 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-24 11:47:42,914 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 131 places, 123 transitions, 261 flow [2023-08-24 11:47:42,962 INFO L124 PetriNetUnfolderBase]: 2/120 cut-off events. [2023-08-24 11:47:42,962 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-24 11:47:42,967 INFO L83 FinitePrefix]: Finished finitePrefix Result has 130 conditions, 120 events. 2/120 cut-off events. For 0/0 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/117 useless extension candidates. Maximal degree in co-relation 66. Up to 2 conditions per place. [2023-08-24 11:47:42,967 INFO L82 GeneralOperation]: Start removeDead. Operand has 131 places, 123 transitions, 261 flow [2023-08-24 11:47:42,970 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 117 places, 108 transitions, 225 flow [2023-08-24 11:47:42,972 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-24 11:47:42,981 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 117 places, 108 transitions, 225 flow [2023-08-24 11:47:42,984 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 117 places, 108 transitions, 225 flow [2023-08-24 11:47:42,984 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 117 places, 108 transitions, 225 flow [2023-08-24 11:47:43,010 INFO L124 PetriNetUnfolderBase]: 1/108 cut-off events. [2023-08-24 11:47:43,010 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-24 11:47:43,011 INFO L83 FinitePrefix]: Finished finitePrefix Result has 118 conditions, 108 events. 1/108 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 38 event pairs, 0 based on Foata normal form. 0/107 useless extension candidates. Maximal degree in co-relation 54. Up to 2 conditions per place. [2023-08-24 11:47:43,013 INFO L119 LiptonReduction]: Number of co-enabled transitions 1152 [2023-08-24 11:47:49,269 INFO L134 LiptonReduction]: Checked pairs total: 3511 [2023-08-24 11:47:49,269 INFO L136 LiptonReduction]: Total number of compositions: 91 [2023-08-24 11:47:49,278 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-24 11:47:49,281 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;@5eed6ed8, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-24 11:47:49,281 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2023-08-24 11:47:49,286 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-24 11:47:49,286 INFO L124 PetriNetUnfolderBase]: 1/21 cut-off events. [2023-08-24 11:47:49,286 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-24 11:47:49,287 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 11:47:49,287 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 11:47:49,287 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-24 11:47:49,290 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 11:47:49,290 INFO L85 PathProgramCache]: Analyzing trace with hash -18124322, now seen corresponding path program 1 times [2023-08-24 11:47:49,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 11:47:49,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294383926] [2023-08-24 11:47:49,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:47:49,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 11:47:49,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 11:47:49,473 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 11:47:49,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 11:47:49,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294383926] [2023-08-24 11:47:49,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1294383926] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 11:47:49,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 11:47:49,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-24 11:47:49,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009963855] [2023-08-24 11:47:49,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 11:47:49,483 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-24 11:47:49,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 11:47:49,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-24 11:47:49,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-24 11:47:49,502 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 214 [2023-08-24 11:47:49,504 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 22 transitions, 53 flow. Second operand has 2 states, 2 states have (on average 117.0) internal successors, (234), 2 states have internal predecessors, (234), 0 states have call successors, (0), 0 states 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:47:49,504 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 11:47:49,504 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 214 [2023-08-24 11:47:49,504 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 11:47:49,751 INFO L124 PetriNetUnfolderBase]: 615/942 cut-off events. [2023-08-24 11:47:49,751 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2023-08-24 11:47:49,755 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1913 conditions, 942 events. 615/942 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 4038 event pairs, 615 based on Foata normal form. 48/938 useless extension candidates. Maximal degree in co-relation 1902. Up to 935 conditions per place. [2023-08-24 11:47:49,759 INFO L140 encePairwiseOnDemand]: 213/214 looper letters, 18 selfloop transitions, 0 changer transitions 1/21 dead transitions. [2023-08-24 11:47:49,760 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 21 transitions, 89 flow [2023-08-24 11:47:49,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-24 11:47:49,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-24 11:47:49,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 244 transitions. [2023-08-24 11:47:49,768 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5700934579439252 [2023-08-24 11:47:49,768 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 244 transitions. [2023-08-24 11:47:49,769 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 244 transitions. [2023-08-24 11:47:49,769 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 11:47:49,771 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 244 transitions. [2023-08-24 11:47:49,772 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 122.0) internal successors, (244), 2 states have internal predecessors, (244), 0 states have call successors, (0), 0 states 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:47:49,776 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 214.0) internal successors, (642), 3 states have internal predecessors, (642), 0 states have call successors, (0), 0 states 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:47:49,776 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 214.0) internal successors, (642), 3 states have internal predecessors, (642), 0 states have call successors, (0), 0 states 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:47:49,777 INFO L175 Difference]: Start difference. First operand has 31 places, 22 transitions, 53 flow. Second operand 2 states and 244 transitions. [2023-08-24 11:47:49,778 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 21 transitions, 89 flow [2023-08-24 11:47:49,779 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 21 transitions, 86 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-24 11:47:49,780 INFO L231 Difference]: Finished difference. Result has 29 places, 20 transitions, 46 flow [2023-08-24 11:47:49,781 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=214, PETRI_DIFFERENCE_MINUEND_FLOW=48, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=46, PETRI_PLACES=29, PETRI_TRANSITIONS=20} [2023-08-24 11:47:49,783 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, -2 predicate places. [2023-08-24 11:47:49,783 INFO L495 AbstractCegarLoop]: Abstraction has has 29 places, 20 transitions, 46 flow [2023-08-24 11:47:49,783 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 117.0) internal successors, (234), 2 states have internal predecessors, (234), 0 states have call successors, (0), 0 states 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:47:49,783 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 11:47:49,783 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 11:47:49,784 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-24 11:47:49,784 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-24 11:47:49,789 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 11:47:49,789 INFO L85 PathProgramCache]: Analyzing trace with hash -18935406, now seen corresponding path program 1 times [2023-08-24 11:47:49,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 11:47:49,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038091333] [2023-08-24 11:47:49,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:47:49,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 11:47:49,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 11:47:50,144 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 11:47:50,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 11:47:50,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038091333] [2023-08-24 11:47:50,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2038091333] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 11:47:50,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 11:47:50,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-24 11:47:50,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126811423] [2023-08-24 11:47:50,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 11:47:50,145 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-24 11:47:50,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 11:47:50,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-24 11:47:50,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-24 11:47:50,148 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 214 [2023-08-24 11:47:50,148 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 20 transitions, 46 flow. Second operand has 4 states, 4 states have (on average 110.5) internal successors, (442), 4 states have internal predecessors, (442), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:47:50,148 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 11:47:50,149 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 214 [2023-08-24 11:47:50,149 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 11:47:50,336 INFO L124 PetriNetUnfolderBase]: 503/866 cut-off events. [2023-08-24 11:47:50,336 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-24 11:47:50,338 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1691 conditions, 866 events. 503/866 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 4315 event pairs, 95 based on Foata normal form. 48/913 useless extension candidates. Maximal degree in co-relation 1688. Up to 549 conditions per place. [2023-08-24 11:47:50,341 INFO L140 encePairwiseOnDemand]: 210/214 looper letters, 28 selfloop transitions, 2 changer transitions 15/47 dead transitions. [2023-08-24 11:47:50,341 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 47 transitions, 194 flow [2023-08-24 11:47:50,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-24 11:47:50,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-24 11:47:50,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 587 transitions. [2023-08-24 11:47:50,345 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5485981308411215 [2023-08-24 11:47:50,345 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 587 transitions. [2023-08-24 11:47:50,346 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 587 transitions. [2023-08-24 11:47:50,346 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 11:47:50,346 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 587 transitions. [2023-08-24 11:47:50,348 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 117.4) internal successors, (587), 5 states have internal predecessors, (587), 0 states have call successors, (0), 0 states 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:47:50,351 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 214.0) internal successors, (1284), 6 states have internal predecessors, (1284), 0 states have call successors, (0), 0 states 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:47:50,352 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 214.0) internal successors, (1284), 6 states have internal predecessors, (1284), 0 states have call successors, (0), 0 states 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:47:50,352 INFO L175 Difference]: Start difference. First operand has 29 places, 20 transitions, 46 flow. Second operand 5 states and 587 transitions. [2023-08-24 11:47:50,352 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 47 transitions, 194 flow [2023-08-24 11:47:50,353 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 47 transitions, 194 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-24 11:47:50,353 INFO L231 Difference]: Finished difference. Result has 35 places, 20 transitions, 58 flow [2023-08-24 11:47:50,354 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=214, PETRI_DIFFERENCE_MINUEND_FLOW=46, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=58, PETRI_PLACES=35, PETRI_TRANSITIONS=20} [2023-08-24 11:47:50,355 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 4 predicate places. [2023-08-24 11:47:50,357 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 20 transitions, 58 flow [2023-08-24 11:47:50,357 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 110.5) internal successors, (442), 4 states have internal predecessors, (442), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:47:50,361 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 11:47:50,361 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 11:47:50,361 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-24 11:47:50,361 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-24 11:47:50,363 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 11:47:50,363 INFO L85 PathProgramCache]: Analyzing trace with hash -587014634, now seen corresponding path program 1 times [2023-08-24 11:47:50,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 11:47:50,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491403005] [2023-08-24 11:47:50,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:47:50,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 11:47:50,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 11:47:50,597 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 11:47:50,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 11:47:50,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491403005] [2023-08-24 11:47:50,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1491403005] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 11:47:50,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 11:47:50,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-24 11:47:50,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274690890] [2023-08-24 11:47:50,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 11:47:50,599 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-24 11:47:50,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 11:47:50,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-24 11:47:50,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-24 11:47:50,601 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 214 [2023-08-24 11:47:50,601 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 20 transitions, 58 flow. Second operand has 4 states, 4 states have (on average 110.75) internal successors, (443), 4 states have internal predecessors, (443), 0 states have call successors, (0), 0 states 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:47:50,601 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 11:47:50,602 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 214 [2023-08-24 11:47:50,602 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 11:47:50,763 INFO L124 PetriNetUnfolderBase]: 435/742 cut-off events. [2023-08-24 11:47:50,763 INFO L125 PetriNetUnfolderBase]: For 189/189 co-relation queries the response was YES. [2023-08-24 11:47:50,764 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1668 conditions, 742 events. 435/742 cut-off events. For 189/189 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 3502 event pairs, 80 based on Foata normal form. 32/773 useless extension candidates. Maximal degree in co-relation 1661. Up to 522 conditions per place. [2023-08-24 11:47:50,766 INFO L140 encePairwiseOnDemand]: 210/214 looper letters, 25 selfloop transitions, 2 changer transitions 12/41 dead transitions. [2023-08-24 11:47:50,766 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 41 transitions, 185 flow [2023-08-24 11:47:50,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-24 11:47:50,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-24 11:47:50,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 581 transitions. [2023-08-24 11:47:50,767 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5429906542056074 [2023-08-24 11:47:50,767 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 581 transitions. [2023-08-24 11:47:50,767 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 581 transitions. [2023-08-24 11:47:50,768 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 11:47:50,768 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 581 transitions. [2023-08-24 11:47:50,769 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 116.2) internal successors, (581), 5 states have internal predecessors, (581), 0 states have call successors, (0), 0 states 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:47:50,770 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 214.0) internal successors, (1284), 6 states have internal predecessors, (1284), 0 states have call successors, (0), 0 states 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:47:50,771 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 214.0) internal successors, (1284), 6 states have internal predecessors, (1284), 0 states have call successors, (0), 0 states 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:47:50,771 INFO L175 Difference]: Start difference. First operand has 35 places, 20 transitions, 58 flow. Second operand 5 states and 581 transitions. [2023-08-24 11:47:50,771 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 41 transitions, 185 flow [2023-08-24 11:47:50,772 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 41 transitions, 175 flow, removed 2 selfloop flow, removed 4 redundant places. [2023-08-24 11:47:50,773 INFO L231 Difference]: Finished difference. Result has 36 places, 20 transitions, 62 flow [2023-08-24 11:47:50,773 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=214, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=62, PETRI_PLACES=36, PETRI_TRANSITIONS=20} [2023-08-24 11:47:50,773 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 5 predicate places. [2023-08-24 11:47:50,774 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 20 transitions, 62 flow [2023-08-24 11:47:50,774 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 110.75) internal successors, (443), 4 states have internal predecessors, (443), 0 states have call successors, (0), 0 states 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:47:50,774 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 11:47:50,774 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 11:47:50,774 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-24 11:47:50,774 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-24 11:47:50,774 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 11:47:50,775 INFO L85 PathProgramCache]: Analyzing trace with hash 1284394378, now seen corresponding path program 1 times [2023-08-24 11:47:50,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 11:47:50,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529571335] [2023-08-24 11:47:50,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:47:50,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 11:47:50,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 11:47:50,915 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 11:47:50,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 11:47:50,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529571335] [2023-08-24 11:47:50,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1529571335] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 11:47:50,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 11:47:50,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-24 11:47:50,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503243661] [2023-08-24 11:47:50,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 11:47:50,916 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-24 11:47:50,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 11:47:50,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-24 11:47:50,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-24 11:47:50,917 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 214 [2023-08-24 11:47:50,917 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 20 transitions, 62 flow. Second operand has 5 states, 5 states have (on average 108.4) internal successors, (542), 5 states have internal predecessors, (542), 0 states have call successors, (0), 0 states 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:47:50,917 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 11:47:50,918 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 214 [2023-08-24 11:47:50,918 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 11:47:51,139 INFO L124 PetriNetUnfolderBase]: 718/1149 cut-off events. [2023-08-24 11:47:51,139 INFO L125 PetriNetUnfolderBase]: For 266/266 co-relation queries the response was YES. [2023-08-24 11:47:51,141 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2669 conditions, 1149 events. 718/1149 cut-off events. For 266/266 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 5450 event pairs, 215 based on Foata normal form. 36/1183 useless extension candidates. Maximal degree in co-relation 2661. Up to 381 conditions per place. [2023-08-24 11:47:51,143 INFO L140 encePairwiseOnDemand]: 209/214 looper letters, 33 selfloop transitions, 3 changer transitions 19/56 dead transitions. [2023-08-24 11:47:51,143 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 56 transitions, 261 flow [2023-08-24 11:47:51,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-24 11:47:51,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-24 11:47:51,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 693 transitions. [2023-08-24 11:47:51,144 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5397196261682243 [2023-08-24 11:47:51,145 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 693 transitions. [2023-08-24 11:47:51,145 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 693 transitions. [2023-08-24 11:47:51,145 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 11:47:51,145 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 693 transitions. [2023-08-24 11:47:51,146 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 115.5) internal successors, (693), 6 states have internal predecessors, (693), 0 states have call successors, (0), 0 states 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:47:51,148 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 214.0) internal successors, (1498), 7 states have internal predecessors, (1498), 0 states have call successors, (0), 0 states 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:47:51,149 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 214.0) internal successors, (1498), 7 states have internal predecessors, (1498), 0 states have call successors, (0), 0 states 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:47:51,149 INFO L175 Difference]: Start difference. First operand has 36 places, 20 transitions, 62 flow. Second operand 6 states and 693 transitions. [2023-08-24 11:47:51,149 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 56 transitions, 261 flow [2023-08-24 11:47:51,152 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 56 transitions, 251 flow, removed 2 selfloop flow, removed 4 redundant places. [2023-08-24 11:47:51,153 INFO L231 Difference]: Finished difference. Result has 39 places, 20 transitions, 72 flow [2023-08-24 11:47:51,154 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=214, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=72, PETRI_PLACES=39, PETRI_TRANSITIONS=20} [2023-08-24 11:47:51,154 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 8 predicate places. [2023-08-24 11:47:51,155 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 20 transitions, 72 flow [2023-08-24 11:47:51,155 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 108.4) internal successors, (542), 5 states have internal predecessors, (542), 0 states have call successors, (0), 0 states 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:47:51,155 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 11:47:51,155 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 11:47:51,155 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-24 11:47:51,155 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-24 11:47:51,156 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 11:47:51,156 INFO L85 PathProgramCache]: Analyzing trace with hash 1159778972, now seen corresponding path program 1 times [2023-08-24 11:47:51,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 11:47:51,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916099777] [2023-08-24 11:47:51,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:47:51,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 11:47:51,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 11:47:52,183 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 11:47:52,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 11:47:52,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916099777] [2023-08-24 11:47:52,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [916099777] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 11:47:52,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 11:47:52,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-24 11:47:52,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53786144] [2023-08-24 11:47:52,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 11:47:52,184 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-24 11:47:52,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 11:47:52,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-24 11:47:52,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-08-24 11:47:52,185 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 214 [2023-08-24 11:47:52,186 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 20 transitions, 72 flow. Second operand has 7 states, 7 states have (on average 88.71428571428571) internal successors, (621), 7 states have internal predecessors, (621), 0 states have call successors, (0), 0 states 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:47:52,186 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 11:47:52,186 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 214 [2023-08-24 11:47:52,186 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 11:47:52,345 INFO L124 PetriNetUnfolderBase]: 408/663 cut-off events. [2023-08-24 11:47:52,345 INFO L125 PetriNetUnfolderBase]: For 463/464 co-relation queries the response was YES. [2023-08-24 11:47:52,346 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1657 conditions, 663 events. 408/663 cut-off events. For 463/464 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 2484 event pairs, 149 based on Foata normal form. 32/694 useless extension candidates. Maximal degree in co-relation 1647. Up to 539 conditions per place. [2023-08-24 11:47:52,347 INFO L140 encePairwiseOnDemand]: 209/214 looper letters, 25 selfloop transitions, 3 changer transitions 11/40 dead transitions. [2023-08-24 11:47:52,348 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 40 transitions, 205 flow [2023-08-24 11:47:52,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-24 11:47:52,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-24 11:47:52,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 476 transitions. [2023-08-24 11:47:52,349 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44485981308411215 [2023-08-24 11:47:52,349 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 476 transitions. [2023-08-24 11:47:52,349 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 476 transitions. [2023-08-24 11:47:52,349 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 11:47:52,350 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 476 transitions. [2023-08-24 11:47:52,350 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 95.2) internal successors, (476), 5 states have internal predecessors, (476), 0 states have call successors, (0), 0 states 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:47:52,352 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 214.0) internal successors, (1284), 6 states have internal predecessors, (1284), 0 states have call successors, (0), 0 states 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:47:52,352 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 214.0) internal successors, (1284), 6 states have internal predecessors, (1284), 0 states have call successors, (0), 0 states 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:47:52,352 INFO L175 Difference]: Start difference. First operand has 39 places, 20 transitions, 72 flow. Second operand 5 states and 476 transitions. [2023-08-24 11:47:52,352 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 40 transitions, 205 flow [2023-08-24 11:47:52,354 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 40 transitions, 176 flow, removed 8 selfloop flow, removed 7 redundant places. [2023-08-24 11:47:52,354 INFO L231 Difference]: Finished difference. Result has 37 places, 22 transitions, 79 flow [2023-08-24 11:47:52,354 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=214, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=79, PETRI_PLACES=37, PETRI_TRANSITIONS=22} [2023-08-24 11:47:52,355 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 6 predicate places. [2023-08-24 11:47:52,355 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 22 transitions, 79 flow [2023-08-24 11:47:52,355 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 88.71428571428571) internal successors, (621), 7 states have internal predecessors, (621), 0 states have call successors, (0), 0 states 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:47:52,355 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 11:47:52,355 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 11:47:52,355 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-24 11:47:52,355 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-24 11:47:52,356 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 11:47:52,356 INFO L85 PathProgramCache]: Analyzing trace with hash 912216449, now seen corresponding path program 1 times [2023-08-24 11:47:52,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 11:47:52,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102721040] [2023-08-24 11:47:52,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:47:52,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 11:47:52,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 11:47:52,535 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 11:47:52,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 11:47:52,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102721040] [2023-08-24 11:47:52,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2102721040] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 11:47:52,536 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 11:47:52,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-24 11:47:52,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21035798] [2023-08-24 11:47:52,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 11:47:52,536 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-24 11:47:52,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 11:47:52,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-24 11:47:52,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-24 11:47:52,539 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 214 [2023-08-24 11:47:52,540 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 22 transitions, 79 flow. Second operand has 4 states, 4 states have (on average 108.25) internal successors, (433), 4 states have internal predecessors, (433), 0 states have call successors, (0), 0 states 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:47:52,540 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 11:47:52,540 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 214 [2023-08-24 11:47:52,540 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 11:47:52,642 INFO L124 PetriNetUnfolderBase]: 275/482 cut-off events. [2023-08-24 11:47:52,642 INFO L125 PetriNetUnfolderBase]: For 172/175 co-relation queries the response was YES. [2023-08-24 11:47:52,643 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1219 conditions, 482 events. 275/482 cut-off events. For 172/175 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1968 event pairs, 41 based on Foata normal form. 40/514 useless extension candidates. Maximal degree in co-relation 1211. Up to 249 conditions per place. [2023-08-24 11:47:52,644 INFO L140 encePairwiseOnDemand]: 208/214 looper letters, 36 selfloop transitions, 5 changer transitions 1/45 dead transitions. [2023-08-24 11:47:52,645 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 45 transitions, 231 flow [2023-08-24 11:47:52,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-24 11:47:52,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-24 11:47:52,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 461 transitions. [2023-08-24 11:47:52,646 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5385514018691588 [2023-08-24 11:47:52,646 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 461 transitions. [2023-08-24 11:47:52,646 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 461 transitions. [2023-08-24 11:47:52,646 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 11:47:52,646 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 461 transitions. [2023-08-24 11:47:52,647 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 115.25) internal successors, (461), 4 states have internal predecessors, (461), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:47:52,648 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 214.0) internal successors, (1070), 5 states have internal predecessors, (1070), 0 states have call successors, (0), 0 states 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:47:52,648 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 214.0) internal successors, (1070), 5 states have internal predecessors, (1070), 0 states have call successors, (0), 0 states 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:47:52,648 INFO L175 Difference]: Start difference. First operand has 37 places, 22 transitions, 79 flow. Second operand 4 states and 461 transitions. [2023-08-24 11:47:52,648 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 45 transitions, 231 flow [2023-08-24 11:47:52,650 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 45 transitions, 224 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-08-24 11:47:52,651 INFO L231 Difference]: Finished difference. Result has 38 places, 25 transitions, 108 flow [2023-08-24 11:47:52,651 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=214, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=108, PETRI_PLACES=38, PETRI_TRANSITIONS=25} [2023-08-24 11:47:52,653 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 7 predicate places. [2023-08-24 11:47:52,653 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 25 transitions, 108 flow [2023-08-24 11:47:52,653 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 108.25) internal successors, (433), 4 states have internal predecessors, (433), 0 states have call successors, (0), 0 states 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:47:52,653 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 11:47:52,653 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 11:47:52,653 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-24 11:47:52,653 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-24 11:47:52,653 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 11:47:52,654 INFO L85 PathProgramCache]: Analyzing trace with hash 1904624788, now seen corresponding path program 1 times [2023-08-24 11:47:52,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 11:47:52,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053574294] [2023-08-24 11:47:52,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:47:52,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 11:47:52,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 11:47:52,802 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 11:47:52,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 11:47:52,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053574294] [2023-08-24 11:47:52,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1053574294] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 11:47:52,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 11:47:52,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-24 11:47:52,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207694525] [2023-08-24 11:47:52,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 11:47:52,803 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-24 11:47:52,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 11:47:52,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-24 11:47:52,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-24 11:47:52,804 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 214 [2023-08-24 11:47:52,804 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 25 transitions, 108 flow. Second operand has 5 states, 5 states have (on average 107.8) internal successors, (539), 5 states have internal predecessors, (539), 0 states have call successors, (0), 0 states 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:47:52,804 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 11:47:52,804 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 214 [2023-08-24 11:47:52,804 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 11:47:52,897 INFO L124 PetriNetUnfolderBase]: 132/262 cut-off events. [2023-08-24 11:47:52,897 INFO L125 PetriNetUnfolderBase]: For 185/188 co-relation queries the response was YES. [2023-08-24 11:47:52,897 INFO L83 FinitePrefix]: Finished finitePrefix Result has 820 conditions, 262 events. 132/262 cut-off events. For 185/188 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 972 event pairs, 17 based on Foata normal form. 28/286 useless extension candidates. Maximal degree in co-relation 811. Up to 100 conditions per place. [2023-08-24 11:47:52,898 INFO L140 encePairwiseOnDemand]: 208/214 looper letters, 40 selfloop transitions, 8 changer transitions 1/52 dead transitions. [2023-08-24 11:47:52,898 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 52 transitions, 301 flow [2023-08-24 11:47:52,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-24 11:47:52,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-24 11:47:52,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 574 transitions. [2023-08-24 11:47:52,899 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5364485981308411 [2023-08-24 11:47:52,900 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 574 transitions. [2023-08-24 11:47:52,900 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 574 transitions. [2023-08-24 11:47:52,900 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 11:47:52,900 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 574 transitions. [2023-08-24 11:47:52,901 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 114.8) internal successors, (574), 5 states have internal predecessors, (574), 0 states have call successors, (0), 0 states 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:47:52,902 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 214.0) internal successors, (1284), 6 states have internal predecessors, (1284), 0 states have call successors, (0), 0 states 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:47:52,902 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 214.0) internal successors, (1284), 6 states have internal predecessors, (1284), 0 states have call successors, (0), 0 states 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:47:52,902 INFO L175 Difference]: Start difference. First operand has 38 places, 25 transitions, 108 flow. Second operand 5 states and 574 transitions. [2023-08-24 11:47:52,902 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 52 transitions, 301 flow [2023-08-24 11:47:52,904 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 52 transitions, 291 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-08-24 11:47:52,904 INFO L231 Difference]: Finished difference. Result has 42 places, 28 transitions, 148 flow [2023-08-24 11:47:52,905 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=214, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=148, PETRI_PLACES=42, PETRI_TRANSITIONS=28} [2023-08-24 11:47:52,905 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 11 predicate places. [2023-08-24 11:47:52,905 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 28 transitions, 148 flow [2023-08-24 11:47:52,905 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 107.8) internal successors, (539), 5 states have internal predecessors, (539), 0 states have call successors, (0), 0 states 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:47:52,905 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 11:47:52,905 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 11:47:52,905 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-24 11:47:52,906 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-24 11:47:52,907 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 11:47:52,907 INFO L85 PathProgramCache]: Analyzing trace with hash 1808738317, now seen corresponding path program 1 times [2023-08-24 11:47:52,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 11:47:52,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014455827] [2023-08-24 11:47:52,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:47:52,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 11:47:52,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 11:47:53,112 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 11:47:53,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 11:47:53,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014455827] [2023-08-24 11:47:53,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2014455827] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 11:47:53,113 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 11:47:53,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-24 11:47:53,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748988610] [2023-08-24 11:47:53,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 11:47:53,114 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-24 11:47:53,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 11:47:53,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-24 11:47:53,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-24 11:47:53,115 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 214 [2023-08-24 11:47:53,115 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 28 transitions, 148 flow. Second operand has 6 states, 6 states have (on average 107.66666666666667) internal successors, (646), 6 states have internal predecessors, (646), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:47:53,116 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 11:47:53,116 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 214 [2023-08-24 11:47:53,116 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 11:47:53,209 INFO L124 PetriNetUnfolderBase]: 73/155 cut-off events. [2023-08-24 11:47:53,209 INFO L125 PetriNetUnfolderBase]: For 222/225 co-relation queries the response was YES. [2023-08-24 11:47:53,209 INFO L83 FinitePrefix]: Finished finitePrefix Result has 553 conditions, 155 events. 73/155 cut-off events. For 222/225 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 505 event pairs, 13 based on Foata normal form. 10/162 useless extension candidates. Maximal degree in co-relation 543. Up to 61 conditions per place. [2023-08-24 11:47:53,210 INFO L140 encePairwiseOnDemand]: 208/214 looper letters, 30 selfloop transitions, 11 changer transitions 1/45 dead transitions. [2023-08-24 11:47:53,210 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 45 transitions, 290 flow [2023-08-24 11:47:53,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-24 11:47:53,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-24 11:47:53,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 672 transitions. [2023-08-24 11:47:53,212 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5233644859813084 [2023-08-24 11:47:53,212 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 672 transitions. [2023-08-24 11:47:53,212 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 672 transitions. [2023-08-24 11:47:53,213 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 11:47:53,213 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 672 transitions. [2023-08-24 11:47:53,214 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 112.0) internal successors, (672), 6 states have internal predecessors, (672), 0 states have call successors, (0), 0 states 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:47:53,215 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 214.0) internal successors, (1498), 7 states have internal predecessors, (1498), 0 states have call successors, (0), 0 states 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:47:53,216 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 214.0) internal successors, (1498), 7 states have internal predecessors, (1498), 0 states have call successors, (0), 0 states 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:47:53,216 INFO L175 Difference]: Start difference. First operand has 42 places, 28 transitions, 148 flow. Second operand 6 states and 672 transitions. [2023-08-24 11:47:53,216 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 45 transitions, 290 flow [2023-08-24 11:47:53,217 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 45 transitions, 247 flow, removed 11 selfloop flow, removed 6 redundant places. [2023-08-24 11:47:53,217 INFO L231 Difference]: Finished difference. Result has 43 places, 28 transitions, 150 flow [2023-08-24 11:47:53,217 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=214, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=150, PETRI_PLACES=43, PETRI_TRANSITIONS=28} [2023-08-24 11:47:53,219 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 12 predicate places. [2023-08-24 11:47:53,220 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 28 transitions, 150 flow [2023-08-24 11:47:53,220 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 107.66666666666667) internal successors, (646), 6 states have internal predecessors, (646), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:47:53,220 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 11:47:53,220 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 11:47:53,220 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-24 11:47:53,220 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-24 11:47:53,221 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 11:47:53,221 INFO L85 PathProgramCache]: Analyzing trace with hash 134614752, now seen corresponding path program 1 times [2023-08-24 11:47:53,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 11:47:53,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874066078] [2023-08-24 11:47:53,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:47:53,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 11:47:53,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 11:47:53,994 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 11:47:53,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 11:47:53,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [874066078] [2023-08-24 11:47:53,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [874066078] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 11:47:53,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 11:47:53,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-24 11:47:53,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249828454] [2023-08-24 11:47:53,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 11:47:53,996 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-24 11:47:53,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 11:47:53,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-24 11:47:53,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-24 11:47:53,997 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 214 [2023-08-24 11:47:53,998 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 28 transitions, 150 flow. Second operand has 6 states, 6 states have (on average 102.16666666666667) internal successors, (613), 6 states have internal predecessors, (613), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:47:53,998 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 11:47:53,998 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 214 [2023-08-24 11:47:53,998 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 11:47:54,096 INFO L124 PetriNetUnfolderBase]: 111/226 cut-off events. [2023-08-24 11:47:54,096 INFO L125 PetriNetUnfolderBase]: For 428/428 co-relation queries the response was YES. [2023-08-24 11:47:54,097 INFO L83 FinitePrefix]: Finished finitePrefix Result has 823 conditions, 226 events. 111/226 cut-off events. For 428/428 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 782 event pairs, 28 based on Foata normal form. 1/227 useless extension candidates. Maximal degree in co-relation 814. Up to 138 conditions per place. [2023-08-24 11:47:54,097 INFO L140 encePairwiseOnDemand]: 205/214 looper letters, 30 selfloop transitions, 8 changer transitions 16/55 dead transitions. [2023-08-24 11:47:54,097 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 55 transitions, 416 flow [2023-08-24 11:47:54,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-24 11:47:54,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-24 11:47:54,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 633 transitions. [2023-08-24 11:47:54,099 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4929906542056075 [2023-08-24 11:47:54,099 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 633 transitions. [2023-08-24 11:47:54,099 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 633 transitions. [2023-08-24 11:47:54,099 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 11:47:54,099 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 633 transitions. [2023-08-24 11:47:54,100 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 105.5) internal successors, (633), 6 states have internal predecessors, (633), 0 states have call successors, (0), 0 states 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:47:54,102 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 214.0) internal successors, (1498), 7 states have internal predecessors, (1498), 0 states have call successors, (0), 0 states 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:47:54,103 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 214.0) internal successors, (1498), 7 states have internal predecessors, (1498), 0 states have call successors, (0), 0 states 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:47:54,103 INFO L175 Difference]: Start difference. First operand has 43 places, 28 transitions, 150 flow. Second operand 6 states and 633 transitions. [2023-08-24 11:47:54,103 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 55 transitions, 416 flow [2023-08-24 11:47:54,104 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 55 transitions, 286 flow, removed 20 selfloop flow, removed 9 redundant places. [2023-08-24 11:47:54,105 INFO L231 Difference]: Finished difference. Result has 42 places, 31 transitions, 135 flow [2023-08-24 11:47:54,106 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=214, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=135, PETRI_PLACES=42, PETRI_TRANSITIONS=31} [2023-08-24 11:47:54,106 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 11 predicate places. [2023-08-24 11:47:54,106 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 31 transitions, 135 flow [2023-08-24 11:47:54,107 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 102.16666666666667) internal successors, (613), 6 states have internal predecessors, (613), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:47:54,107 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 11:47:54,107 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 11:47:54,107 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-24 11:47:54,108 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-24 11:47:54,108 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 11:47:54,108 INFO L85 PathProgramCache]: Analyzing trace with hash 1882540136, now seen corresponding path program 2 times [2023-08-24 11:47:54,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 11:47:54,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757940848] [2023-08-24 11:47:54,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:47:54,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 11:47:54,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-24 11:47:54,163 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-24 11:47:54,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-24 11:47:54,252 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-24 11:47:54,253 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-24 11:47:54,253 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2023-08-24 11:47:54,254 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2023-08-24 11:47:54,255 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2023-08-24 11:47:54,255 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2023-08-24 11:47:54,255 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-24 11:47:54,255 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 11:47:54,258 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-24 11:47:54,258 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-24 11:47:54,334 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.08 11:47:54 BasicIcfg [2023-08-24 11:47:54,334 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-24 11:47:54,334 INFO L158 Benchmark]: Toolchain (without parser) took 12793.05ms. Allocated memory was 333.4MB in the beginning and 635.4MB in the end (delta: 302.0MB). Free memory was 308.9MB in the beginning and 358.9MB in the end (delta: -50.0MB). Peak memory consumption was 252.3MB. Max. memory is 16.0GB. [2023-08-24 11:47:54,334 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 333.4MB. Free memory is still 311.9MB. There was no memory consumed. Max. memory is 16.0GB. [2023-08-24 11:47:54,334 INFO L158 Benchmark]: CACSL2BoogieTranslator took 440.62ms. Allocated memory is still 333.4MB. Free memory was 308.5MB in the beginning and 283.6MB in the end (delta: 25.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.0GB. [2023-08-24 11:47:54,335 INFO L158 Benchmark]: Boogie Procedure Inliner took 59.65ms. Allocated memory is still 333.4MB. Free memory was 283.6MB in the beginning and 280.9MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.0GB. [2023-08-24 11:47:54,335 INFO L158 Benchmark]: Boogie Preprocessor took 28.45ms. Allocated memory is still 333.4MB. Free memory was 280.6MB in the beginning and 278.5MB in the end (delta: 2.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. [2023-08-24 11:47:54,335 INFO L158 Benchmark]: RCFGBuilder took 745.48ms. Allocated memory is still 333.4MB. Free memory was 278.1MB in the beginning and 248.3MB in the end (delta: 29.9MB). Peak memory consumption was 34.8MB. Max. memory is 16.0GB. [2023-08-24 11:47:54,335 INFO L158 Benchmark]: TraceAbstraction took 11513.71ms. Allocated memory was 333.4MB in the beginning and 635.4MB in the end (delta: 302.0MB). Free memory was 247.2MB in the beginning and 358.9MB in the end (delta: -111.7MB). Peak memory consumption was 190.3MB. Max. memory is 16.0GB. [2023-08-24 11:47:54,336 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 333.4MB. Free memory is still 311.9MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 440.62ms. Allocated memory is still 333.4MB. Free memory was 308.5MB in the beginning and 283.6MB in the end (delta: 25.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 59.65ms. Allocated memory is still 333.4MB. Free memory was 283.6MB in the beginning and 280.9MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.0GB. * Boogie Preprocessor took 28.45ms. Allocated memory is still 333.4MB. Free memory was 280.6MB in the beginning and 278.5MB in the end (delta: 2.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. * RCFGBuilder took 745.48ms. Allocated memory is still 333.4MB. Free memory was 278.1MB in the beginning and 248.3MB in the end (delta: 29.9MB). Peak memory consumption was 34.8MB. Max. memory is 16.0GB. * TraceAbstraction took 11513.71ms. Allocated memory was 333.4MB in the beginning and 635.4MB in the end (delta: 302.0MB). Free memory was 247.2MB in the beginning and 358.9MB in the end (delta: -111.7MB). Peak memory consumption was 190.3MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 268]: Unsoundness Warning unspecified type, defaulting to int C: short [268] - GenericResultAtLocation [Line: 268]: Unsoundness Warning unspecified type, defaulting to int C: short [268] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6.3s, 117 PlacesBefore, 31 PlacesAfterwards, 108 TransitionsBefore, 22 TransitionsAfterwards, 1152 CoEnabledTransitionPairs, 7 FixpointIterations, 56 TrivialSequentialCompositions, 32 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 91 TotalNumberOfCompositions, 3511 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1267, independent: 1089, independent conditional: 0, independent unconditional: 1089, dependent: 178, dependent conditional: 0, dependent unconditional: 178, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 576, independent: 542, independent conditional: 0, independent unconditional: 542, dependent: 34, dependent conditional: 0, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1267, independent: 547, independent conditional: 0, independent unconditional: 547, dependent: 144, dependent conditional: 0, dependent unconditional: 144, unknown: 576, unknown conditional: 0, unknown unconditional: 576] , Statistics on independence cache: Total cache size (in pairs): 59, Positive cache size: 43, Positive conditional cache size: 0, Positive unconditional cache size: 43, Negative cache size: 16, Negative conditional cache size: 0, Negative unconditional cache size: 16, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L713] 0 _Bool __unbuffered_p0_EAX$flush_delayed; [L714] 0 int __unbuffered_p0_EAX$mem_tmp; [L715] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd0; [L716] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd1; [L717] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd2; [L718] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd3; [L719] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd0; [L720] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd1; [L721] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd2; [L722] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd3; [L723] 0 _Bool __unbuffered_p0_EAX$read_delayed; [L724] 0 int *__unbuffered_p0_EAX$read_delayed_var; [L725] 0 int __unbuffered_p0_EAX$w_buff0; [L726] 0 _Bool __unbuffered_p0_EAX$w_buff0_used; [L727] 0 int __unbuffered_p0_EAX$w_buff1; [L728] 0 _Bool __unbuffered_p0_EAX$w_buff1_used; [L730] 0 int __unbuffered_p1_EAX = 0; [L731] 0 _Bool main$tmp_guard0; [L732] 0 _Bool main$tmp_guard1; [L734] 0 int x = 0; [L736] 0 int y = 0; [L737] 0 _Bool y$flush_delayed; [L738] 0 int y$mem_tmp; [L739] 0 _Bool y$r_buff0_thd0; [L740] 0 _Bool y$r_buff0_thd1; [L741] 0 _Bool y$r_buff0_thd2; [L742] 0 _Bool y$r_buff0_thd3; [L743] 0 _Bool y$r_buff1_thd0; [L744] 0 _Bool y$r_buff1_thd1; [L745] 0 _Bool y$r_buff1_thd2; [L746] 0 _Bool y$r_buff1_thd3; [L747] 0 _Bool y$read_delayed; [L748] 0 int *y$read_delayed_var; [L749] 0 int y$w_buff0; [L750] 0 _Bool y$w_buff0_used; [L751] 0 int y$w_buff1; [L752] 0 _Bool y$w_buff1_used; [L753] 0 _Bool weak$$choice0; [L754] 0 _Bool weak$$choice1; [L755] 0 _Bool weak$$choice2; [L835] 0 pthread_t t1985; [L836] FCALL, FORK 0 pthread_create(&t1985, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1985, ((void *)0), P0, ((void *)0))=-3, t1985={7:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L759] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L760] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L761] 1 y$flush_delayed = weak$$choice2 [L762] EXPR 1 \read(y) [L762] 1 y$mem_tmp = y [L763] 1 weak$$choice1 = __VERIFIER_nondet_bool() [L764] EXPR 1 !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L764] EXPR 1 \read(y) [L764] EXPR 1 !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L764] 1 y = !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L765] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)))) [L766] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)))) [L767] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 || !weak$$choice1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 : weak$$choice0)))) [L768] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L769] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L770] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$r_buff1_thd1 : (_Bool)0) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L771] 1 __unbuffered_p0_EAX$read_delayed = (_Bool)1 [L772] 1 __unbuffered_p0_EAX$read_delayed_var = &y [L773] EXPR 1 \read(y) [L773] 1 __unbuffered_p0_EAX = y [L774] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L774] EXPR 1 \read(y) [L774] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L774] 1 y = y$flush_delayed ? y$mem_tmp : y [L775] 1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L837] 0 pthread_t t1986; [L838] FCALL, FORK 0 pthread_create(&t1986, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1986, ((void *)0), P1, ((void *)0))=-2, t1985={7:0}, t1986={5:0}, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L839] 0 pthread_t t1987; [L778] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L783] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L785] 1 return 0; [L790] 2 __unbuffered_p1_EAX = x VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L840] FCALL, FORK 0 pthread_create(&t1987, ((void *)0), P2, ((void *)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1987, ((void *)0), P2, ((void *)0))=-1, t1985={7:0}, t1986={5:0}, t1987={6:0}, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L793] 2 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L796] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L796] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L796] EXPR 2 \read(y) [L796] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L796] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L796] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L797] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L798] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L799] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L800] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L803] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L805] 2 return 0; [L810] 3 y = 2 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L813] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L813] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L813] EXPR 3 \read(y) [L813] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L813] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L813] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L814] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L815] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L816] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L817] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L820] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L822] 3 return 0; [L842] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1985={7:0}, t1986={5:0}, t1987={6:0}, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L844] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L844] RET 0 assume_abort_if_not(main$tmp_guard0) [L846] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L846] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L846] EXPR 0 \read(y) [L846] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L846] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L846] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L847] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L848] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L849] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L850] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1985={7:0}, t1986={5:0}, t1987={6:0}, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L853] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L854] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L855] 0 y$flush_delayed = weak$$choice2 [L856] EXPR 0 \read(y) [L856] 0 y$mem_tmp = y [L857] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L857] EXPR 0 \read(y) [L857] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L857] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L858] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L859] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L860] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L861] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L862] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L863] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L864] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L865] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L865] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L865] EXPR 0 \read(*__unbuffered_p0_EAX$read_delayed_var) [L865] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L865] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L865] 0 __unbuffered_p0_EAX = __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L866] EXPR 0 \read(y) [L866] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 2 && __unbuffered_p1_EAX == 1) [L867] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L867] 0 y = y$flush_delayed ? y$mem_tmp : y [L868] 0 y$flush_delayed = (_Bool)0 [L870] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\old(expression)=0, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice1=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] - UnprovableResult [Line: 836]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 840]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 838]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 147 locations, 4 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 11.3s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 6.4s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 251 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 251 mSDsluCounter, 5 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2 mSDsCounter, 25 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 563 IncrementalHoareTripleChecker+Invalid, 588 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 25 mSolverCounterUnsat, 3 mSDtfsCounter, 563 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 47 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=150occurred in iteration=8, InterpolantAutomatonStates: 44, 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, 2.8s InterpolantComputationTime, 142 NumberOfCodeBlocks, 142 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 113 ConstructedInterpolants, 0 QuantifiedInterpolants, 779 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-08-24 11:47:54,359 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...