/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s /storage/repos/CAV22/benchmarks/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.order.of.the.error.locations.to.be.checked TOGETHER -tc /storage/repos/CAV22/benchmarks/AutomizerCInline.xml -i /storage/repos/CAV22/benchmarks/added_bound_to_unbounded/pthread-ext_25_stack_longer-1_bound2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-19404b3-m [2023-08-03 15:48:18,067 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-03 15:48:18,126 INFO L114 SettingsManager]: Loading settings from /storage/repos/CAV22/benchmarks/svcomp-Reach-32bit-Automizer_Default.epf [2023-08-03 15:48:18,131 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-03 15:48:18,132 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-08-03 15:48:18,132 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2023-08-03 15:48:18,132 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-03 15:48:18,151 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-03 15:48:18,152 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-03 15:48:18,155 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-03 15:48:18,155 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-03 15:48:18,155 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-03 15:48:18,155 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-03 15:48:18,156 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-03 15:48:18,156 INFO L153 SettingsManager]: * Use SBE=true [2023-08-03 15:48:18,156 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-03 15:48:18,157 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-03 15:48:18,157 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-03 15:48:18,157 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-03 15:48:18,157 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-03 15:48:18,157 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-03 15:48:18,158 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-03 15:48:18,158 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-03 15:48:18,158 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-03 15:48:18,159 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-03 15:48:18,159 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-03 15:48:18,159 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-03 15:48:18,159 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-03 15:48:18,160 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-03 15:48:18,160 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-03 15:48:18,160 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-03 15:48:18,161 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-03 15:48:18,161 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-03 15:48:18,161 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-03 15:48:18,161 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-03 15:48:18,161 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-03 15:48:18,161 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-03 15:48:18,161 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-08-03 15:48:18,162 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-03 15:48:18,162 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-03 15:48:18,162 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-03 15:48:18,162 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 -> TOGETHER [2023-08-03 15:48:18,317 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-03 15:48:18,338 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-03 15:48:18,339 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-03 15:48:18,340 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-03 15:48:18,340 INFO L274 PluginConnector]: CDTParser initialized [2023-08-03 15:48:18,341 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/CAV22/benchmarks/added_bound_to_unbounded/pthread-ext_25_stack_longer-1_bound2.i [2023-08-03 15:48:19,248 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-03 15:48:19,489 INFO L384 CDTParser]: Found 1 translation units. [2023-08-03 15:48:19,490 INFO L180 CDTParser]: Scanning /storage/repos/CAV22/benchmarks/added_bound_to_unbounded/pthread-ext_25_stack_longer-1_bound2.i [2023-08-03 15:48:19,503 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d85fb2219/1644301d74b64f12ac2ed328270a76a1/FLAG55023b40e [2023-08-03 15:48:19,515 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d85fb2219/1644301d74b64f12ac2ed328270a76a1 [2023-08-03 15:48:19,517 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-03 15:48:19,517 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-03 15:48:19,518 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-03 15:48:19,518 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-03 15:48:19,520 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-03 15:48:19,521 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.08 03:48:19" (1/1) ... [2023-08-03 15:48:19,521 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@338b966e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 03:48:19, skipping insertion in model container [2023-08-03 15:48:19,521 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.08 03:48:19" (1/1) ... [2023-08-03 15:48:19,548 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-03 15:48:19,759 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/CAV22/benchmarks/added_bound_to_unbounded/pthread-ext_25_stack_longer-1_bound2.i[31182,31195] [2023-08-03 15:48:19,768 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-03 15:48:19,776 INFO L201 MainTranslator]: Completed pre-run [2023-08-03 15:48:19,800 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [256] [2023-08-03 15:48:19,801 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [256] [2023-08-03 15:48:19,818 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/CAV22/benchmarks/added_bound_to_unbounded/pthread-ext_25_stack_longer-1_bound2.i[31182,31195] [2023-08-03 15:48:19,824 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-03 15:48:19,850 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-03 15:48:19,850 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-03 15:48:19,854 INFO L206 MainTranslator]: Completed translation [2023-08-03 15:48:19,855 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 03:48:19 WrapperNode [2023-08-03 15:48:19,855 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-03 15:48:19,856 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-03 15:48:19,856 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-03 15:48:19,856 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-03 15:48:19,860 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 03:48:19" (1/1) ... [2023-08-03 15:48:19,882 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 03:48:19" (1/1) ... [2023-08-03 15:48:19,905 INFO L138 Inliner]: procedures = 179, calls = 36, calls flagged for inlining = 18, calls inlined = 22, statements flattened = 179 [2023-08-03 15:48:19,905 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-03 15:48:19,905 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-03 15:48:19,905 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-03 15:48:19,906 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-03 15:48:19,911 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 03:48:19" (1/1) ... [2023-08-03 15:48:19,911 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 03:48:19" (1/1) ... [2023-08-03 15:48:19,913 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 03:48:19" (1/1) ... [2023-08-03 15:48:19,913 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 03:48:19" (1/1) ... [2023-08-03 15:48:19,925 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 03:48:19" (1/1) ... [2023-08-03 15:48:19,927 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 03:48:19" (1/1) ... [2023-08-03 15:48:19,928 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 03:48:19" (1/1) ... [2023-08-03 15:48:19,929 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 03:48:19" (1/1) ... [2023-08-03 15:48:19,940 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-03 15:48:19,940 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-03 15:48:19,940 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-03 15:48:19,940 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-03 15:48:19,941 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 03:48:19" (1/1) ... [2023-08-03 15:48:19,945 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-03 15:48:19,953 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 15:48:19,970 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-03 15:48:19,987 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-03 15:48:20,008 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-03 15:48:20,008 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2023-08-03 15:48:20,008 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2023-08-03 15:48:20,008 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-03 15:48:20,008 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-03 15:48:20,009 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-03 15:48:20,009 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-03 15:48:20,009 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-03 15:48:20,010 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-03 15:48:20,010 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-03 15:48:20,010 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-03 15:48:20,010 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-03 15:48:20,011 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-03 15:48:20,130 INFO L236 CfgBuilder]: Building ICFG [2023-08-03 15:48:20,133 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-03 15:48:20,325 INFO L277 CfgBuilder]: Performing block encoding [2023-08-03 15:48:20,468 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-03 15:48:20,469 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2023-08-03 15:48:20,472 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.08 03:48:20 BoogieIcfgContainer [2023-08-03 15:48:20,472 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-03 15:48:20,474 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-03 15:48:20,475 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-03 15:48:20,477 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-03 15:48:20,477 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.08 03:48:19" (1/3) ... [2023-08-03 15:48:20,477 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c4736ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.08 03:48:20, skipping insertion in model container [2023-08-03 15:48:20,478 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 03:48:19" (2/3) ... [2023-08-03 15:48:20,478 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c4736ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.08 03:48:20, skipping insertion in model container [2023-08-03 15:48:20,478 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.08 03:48:20" (3/3) ... [2023-08-03 15:48:20,479 INFO L112 eAbstractionObserver]: Analyzing ICFG pthread-ext_25_stack_longer-1_bound2.i [2023-08-03 15:48:20,484 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-08-03 15:48:20,489 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-03 15:48:20,490 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-08-03 15:48:20,490 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-03 15:48:20,576 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-03 15:48:20,602 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 96 places, 100 transitions, 205 flow [2023-08-03 15:48:20,631 INFO L124 PetriNetUnfolderBase]: 8/110 cut-off events. [2023-08-03 15:48:20,631 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-03 15:48:20,635 INFO L83 FinitePrefix]: Finished finitePrefix Result has 115 conditions, 110 events. 8/110 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 113 event pairs, 0 based on Foata normal form. 0/99 useless extension candidates. Maximal degree in co-relation 77. Up to 4 conditions per place. [2023-08-03 15:48:20,635 INFO L82 GeneralOperation]: Start removeDead. Operand has 96 places, 100 transitions, 205 flow [2023-08-03 15:48:20,637 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 96 places, 100 transitions, 205 flow [2023-08-03 15:48:20,640 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-03 15:48:20,645 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 96 places, 100 transitions, 205 flow [2023-08-03 15:48:20,647 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 96 places, 100 transitions, 205 flow [2023-08-03 15:48:20,647 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 96 places, 100 transitions, 205 flow [2023-08-03 15:48:20,664 INFO L124 PetriNetUnfolderBase]: 8/110 cut-off events. [2023-08-03 15:48:20,664 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-03 15:48:20,665 INFO L83 FinitePrefix]: Finished finitePrefix Result has 115 conditions, 110 events. 8/110 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 113 event pairs, 0 based on Foata normal form. 0/99 useless extension candidates. Maximal degree in co-relation 77. Up to 4 conditions per place. [2023-08-03 15:48:20,666 INFO L119 LiptonReduction]: Number of co-enabled transitions 1984 [2023-08-03 15:48:24,841 INFO L134 LiptonReduction]: Checked pairs total: 1726 [2023-08-03 15:48:24,841 INFO L136 LiptonReduction]: Total number of compositions: 99 [2023-08-03 15:48:24,856 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-03 15:48:24,859 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=true, 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;@700ccbd7, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-03 15:48:24,860 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-08-03 15:48:24,866 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-03 15:48:24,866 INFO L124 PetriNetUnfolderBase]: 1/11 cut-off events. [2023-08-03 15:48:24,867 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-03 15:48:24,867 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 15:48:24,867 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2023-08-03 15:48:24,867 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-03 15:48:24,870 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 15:48:24,871 INFO L85 PathProgramCache]: Analyzing trace with hash -1092898197, now seen corresponding path program 1 times [2023-08-03 15:48:24,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 15:48:24,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680484884] [2023-08-03 15:48:24,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 15:48:24,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 15:48:24,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-03 15:48:24,962 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-03 15:48:24,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-03 15:48:24,995 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-03 15:48:24,996 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-03 15:48:24,997 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2023-08-03 15:48:24,999 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 3 remaining) [2023-08-03 15:48:24,999 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 3 remaining) [2023-08-03 15:48:24,999 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-03 15:48:24,999 INFO L445 BasicCegarLoop]: Path program histogram: [1] [2023-08-03 15:48:25,005 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-08-03 15:48:25,005 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-08-03 15:48:25,058 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-03 15:48:25,063 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 155 places, 163 transitions, 338 flow [2023-08-03 15:48:25,100 INFO L124 PetriNetUnfolderBase]: 15/188 cut-off events. [2023-08-03 15:48:25,100 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-08-03 15:48:25,102 INFO L83 FinitePrefix]: Finished finitePrefix Result has 198 conditions, 188 events. 15/188 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 342 event pairs, 0 based on Foata normal form. 0/168 useless extension candidates. Maximal degree in co-relation 139. Up to 6 conditions per place. [2023-08-03 15:48:25,102 INFO L82 GeneralOperation]: Start removeDead. Operand has 155 places, 163 transitions, 338 flow [2023-08-03 15:48:25,104 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 155 places, 163 transitions, 338 flow [2023-08-03 15:48:25,104 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-03 15:48:25,104 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 155 places, 163 transitions, 338 flow [2023-08-03 15:48:25,105 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 155 places, 163 transitions, 338 flow [2023-08-03 15:48:25,106 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 155 places, 163 transitions, 338 flow [2023-08-03 15:48:25,136 INFO L124 PetriNetUnfolderBase]: 15/188 cut-off events. [2023-08-03 15:48:25,136 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-08-03 15:48:25,140 INFO L83 FinitePrefix]: Finished finitePrefix Result has 198 conditions, 188 events. 15/188 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 342 event pairs, 0 based on Foata normal form. 0/168 useless extension candidates. Maximal degree in co-relation 139. Up to 6 conditions per place. [2023-08-03 15:48:25,145 INFO L119 LiptonReduction]: Number of co-enabled transitions 11780 [2023-08-03 15:48:28,905 INFO L134 LiptonReduction]: Checked pairs total: 23811 [2023-08-03 15:48:28,905 INFO L136 LiptonReduction]: Total number of compositions: 125 [2023-08-03 15:48:28,906 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-03 15:48:28,907 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=true, 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;@700ccbd7, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-03 15:48:28,907 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2023-08-03 15:48:28,910 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-03 15:48:28,910 INFO L124 PetriNetUnfolderBase]: 3/33 cut-off events. [2023-08-03 15:48:28,910 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-08-03 15:48:28,910 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 15:48:28,910 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1] [2023-08-03 15:48:28,910 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-03 15:48:28,911 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 15:48:28,911 INFO L85 PathProgramCache]: Analyzing trace with hash 1302958535, now seen corresponding path program 1 times [2023-08-03 15:48:28,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 15:48:28,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843206823] [2023-08-03 15:48:28,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 15:48:28,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 15:48:28,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 15:48:29,032 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-03 15:48:29,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 15:48:29,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843206823] [2023-08-03 15:48:29,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1843206823] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 15:48:29,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [867315927] [2023-08-03 15:48:29,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 15:48:29,033 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 15:48:29,033 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 15:48:29,036 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-03 15:48:29,037 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-08-03 15:48:29,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 15:48:29,107 INFO L262 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-03 15:48:29,108 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 15:48:29,134 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-03 15:48:29,135 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-03 15:48:29,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [867315927] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 15:48:29,135 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-03 15:48:29,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2023-08-03 15:48:29,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066235175] [2023-08-03 15:48:29,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 15:48:29,140 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-03 15:48:29,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 15:48:29,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-03 15:48:29,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-08-03 15:48:29,162 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 133 out of 288 [2023-08-03 15:48:29,164 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 58 transitions, 128 flow. Second operand has 5 states, 5 states have (on average 134.6) internal successors, (673), 5 states have internal predecessors, (673), 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-03 15:48:29,164 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 15:48:29,165 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 288 [2023-08-03 15:48:29,165 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 15:48:29,368 INFO L124 PetriNetUnfolderBase]: 934/1547 cut-off events. [2023-08-03 15:48:29,368 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2023-08-03 15:48:29,370 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2993 conditions, 1547 events. 934/1547 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 7715 event pairs, 0 based on Foata normal form. 0/1191 useless extension candidates. Maximal degree in co-relation 291. Up to 987 conditions per place. [2023-08-03 15:48:29,375 INFO L140 encePairwiseOnDemand]: 282/288 looper letters, 75 selfloop transitions, 4 changer transitions 1/101 dead transitions. [2023-08-03 15:48:29,375 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 101 transitions, 370 flow [2023-08-03 15:48:29,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-03 15:48:29,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-03 15:48:29,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 751 transitions. [2023-08-03 15:48:29,389 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5215277777777778 [2023-08-03 15:48:29,390 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 751 transitions. [2023-08-03 15:48:29,390 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 751 transitions. [2023-08-03 15:48:29,403 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 15:48:29,404 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 751 transitions. [2023-08-03 15:48:29,408 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 150.2) internal successors, (751), 5 states have internal predecessors, (751), 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-03 15:48:29,412 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 288.0) internal successors, (1728), 6 states have internal predecessors, (1728), 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-03 15:48:29,412 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 288.0) internal successors, (1728), 6 states have internal predecessors, (1728), 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-03 15:48:29,413 INFO L175 Difference]: Start difference. First operand has 53 places, 58 transitions, 128 flow. Second operand 5 states and 751 transitions. [2023-08-03 15:48:29,429 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 101 transitions, 370 flow [2023-08-03 15:48:29,431 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 101 transitions, 369 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-03 15:48:29,433 INFO L231 Difference]: Finished difference. Result has 58 places, 57 transitions, 142 flow [2023-08-03 15:48:29,434 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=288, PETRI_DIFFERENCE_MINUEND_FLOW=117, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=142, PETRI_PLACES=58, PETRI_TRANSITIONS=57} [2023-08-03 15:48:29,436 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 5 predicate places. [2023-08-03 15:48:29,436 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 57 transitions, 142 flow [2023-08-03 15:48:29,437 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 134.6) internal successors, (673), 5 states have internal predecessors, (673), 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-03 15:48:29,437 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 15:48:29,437 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 15:48:29,448 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-08-03 15:48:29,641 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 15:48:29,641 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-03 15:48:29,642 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 15:48:29,642 INFO L85 PathProgramCache]: Analyzing trace with hash -280930235, now seen corresponding path program 1 times [2023-08-03 15:48:29,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 15:48:29,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659999504] [2023-08-03 15:48:29,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 15:48:29,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 15:48:29,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 15:48:29,752 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-03 15:48:29,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 15:48:29,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1659999504] [2023-08-03 15:48:29,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1659999504] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 15:48:29,752 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-03 15:48:29,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-03 15:48:29,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809978187] [2023-08-03 15:48:29,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 15:48:29,753 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-03 15:48:29,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 15:48:29,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-03 15:48:29,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-03 15:48:29,765 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 288 [2023-08-03 15:48:29,765 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 57 transitions, 142 flow. Second operand has 4 states, 4 states have (on average 131.75) internal successors, (527), 4 states have internal predecessors, (527), 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-03 15:48:29,765 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 15:48:29,765 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 288 [2023-08-03 15:48:29,766 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 15:48:29,996 INFO L124 PetriNetUnfolderBase]: 1171/2247 cut-off events. [2023-08-03 15:48:29,996 INFO L125 PetriNetUnfolderBase]: For 1159/1159 co-relation queries the response was YES. [2023-08-03 15:48:29,999 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4828 conditions, 2247 events. 1171/2247 cut-off events. For 1159/1159 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 13657 event pairs, 281 based on Foata normal form. 0/1876 useless extension candidates. Maximal degree in co-relation 4195. Up to 1213 conditions per place. [2023-08-03 15:48:30,007 INFO L140 encePairwiseOnDemand]: 278/288 looper letters, 78 selfloop transitions, 8 changer transitions 0/104 dead transitions. [2023-08-03 15:48:30,007 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 104 transitions, 460 flow [2023-08-03 15:48:30,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-03 15:48:30,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-03 15:48:30,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 731 transitions. [2023-08-03 15:48:30,009 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5076388888888889 [2023-08-03 15:48:30,009 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 731 transitions. [2023-08-03 15:48:30,009 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 731 transitions. [2023-08-03 15:48:30,010 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 15:48:30,010 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 731 transitions. [2023-08-03 15:48:30,011 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 146.2) internal successors, (731), 5 states have internal predecessors, (731), 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-03 15:48:30,013 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 288.0) internal successors, (1728), 6 states have internal predecessors, (1728), 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-03 15:48:30,014 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 288.0) internal successors, (1728), 6 states have internal predecessors, (1728), 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-03 15:48:30,014 INFO L175 Difference]: Start difference. First operand has 58 places, 57 transitions, 142 flow. Second operand 5 states and 731 transitions. [2023-08-03 15:48:30,014 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 104 transitions, 460 flow [2023-08-03 15:48:30,016 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 104 transitions, 459 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-03 15:48:30,017 INFO L231 Difference]: Finished difference. Result has 65 places, 64 transitions, 211 flow [2023-08-03 15:48:30,018 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=288, PETRI_DIFFERENCE_MINUEND_FLOW=141, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=211, PETRI_PLACES=65, PETRI_TRANSITIONS=64} [2023-08-03 15:48:30,019 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 12 predicate places. [2023-08-03 15:48:30,019 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 64 transitions, 211 flow [2023-08-03 15:48:30,020 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 131.75) internal successors, (527), 4 states have internal predecessors, (527), 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-03 15:48:30,020 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 15:48:30,020 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 15:48:30,020 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-03 15:48:30,020 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-03 15:48:30,022 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 15:48:30,022 INFO L85 PathProgramCache]: Analyzing trace with hash 1594258178, now seen corresponding path program 1 times [2023-08-03 15:48:30,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 15:48:30,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259420112] [2023-08-03 15:48:30,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 15:48:30,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 15:48:30,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 15:48:30,087 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-03 15:48:30,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 15:48:30,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259420112] [2023-08-03 15:48:30,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [259420112] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 15:48:30,088 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-03 15:48:30,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-03 15:48:30,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051127342] [2023-08-03 15:48:30,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 15:48:30,088 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-03 15:48:30,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 15:48:30,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-03 15:48:30,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-03 15:48:30,095 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 133 out of 288 [2023-08-03 15:48:30,096 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 64 transitions, 211 flow. Second operand has 3 states, 3 states have (on average 136.66666666666666) internal successors, (410), 3 states have internal predecessors, (410), 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-03 15:48:30,096 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 15:48:30,096 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 288 [2023-08-03 15:48:30,096 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 15:48:30,362 INFO L124 PetriNetUnfolderBase]: 1485/2757 cut-off events. [2023-08-03 15:48:30,363 INFO L125 PetriNetUnfolderBase]: For 2352/2369 co-relation queries the response was YES. [2023-08-03 15:48:30,367 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6777 conditions, 2757 events. 1485/2757 cut-off events. For 2352/2369 co-relation queries the response was YES. Maximal size of possible extension queue 158. Compared 17062 event pairs, 312 based on Foata normal form. 72/2552 useless extension candidates. Maximal degree in co-relation 4221. Up to 1879 conditions per place. [2023-08-03 15:48:30,377 INFO L140 encePairwiseOnDemand]: 283/288 looper letters, 62 selfloop transitions, 3 changer transitions 0/86 dead transitions. [2023-08-03 15:48:30,377 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 86 transitions, 435 flow [2023-08-03 15:48:30,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-03 15:48:30,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-03 15:48:30,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 457 transitions. [2023-08-03 15:48:30,379 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5289351851851852 [2023-08-03 15:48:30,379 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 457 transitions. [2023-08-03 15:48:30,379 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 457 transitions. [2023-08-03 15:48:30,379 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 15:48:30,379 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 457 transitions. [2023-08-03 15:48:30,380 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 152.33333333333334) internal successors, (457), 3 states have internal predecessors, (457), 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-03 15:48:30,381 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 288.0) internal successors, (1152), 4 states have internal predecessors, (1152), 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-03 15:48:30,381 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 288.0) internal successors, (1152), 4 states have internal predecessors, (1152), 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-03 15:48:30,382 INFO L175 Difference]: Start difference. First operand has 65 places, 64 transitions, 211 flow. Second operand 3 states and 457 transitions. [2023-08-03 15:48:30,382 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 86 transitions, 435 flow [2023-08-03 15:48:30,384 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 86 transitions, 435 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-03 15:48:30,385 INFO L231 Difference]: Finished difference. Result has 68 places, 66 transitions, 232 flow [2023-08-03 15:48:30,385 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=288, PETRI_DIFFERENCE_MINUEND_FLOW=211, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=232, PETRI_PLACES=68, PETRI_TRANSITIONS=66} [2023-08-03 15:48:30,386 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 15 predicate places. [2023-08-03 15:48:30,386 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 66 transitions, 232 flow [2023-08-03 15:48:30,386 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 136.66666666666666) internal successors, (410), 3 states have internal predecessors, (410), 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-03 15:48:30,386 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 15:48:30,387 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 15:48:30,387 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-03 15:48:30,387 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-03 15:48:30,387 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 15:48:30,387 INFO L85 PathProgramCache]: Analyzing trace with hash -1321627054, now seen corresponding path program 1 times [2023-08-03 15:48:30,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 15:48:30,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978412091] [2023-08-03 15:48:30,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 15:48:30,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 15:48:30,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 15:48:30,453 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-03 15:48:30,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 15:48:30,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978412091] [2023-08-03 15:48:30,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1978412091] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 15:48:30,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-03 15:48:30,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-03 15:48:30,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538246170] [2023-08-03 15:48:30,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 15:48:30,454 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-03 15:48:30,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 15:48:30,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-03 15:48:30,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-03 15:48:30,491 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 288 [2023-08-03 15:48:30,492 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 66 transitions, 232 flow. Second operand has 5 states, 5 states have (on average 130.2) internal successors, (651), 5 states have internal predecessors, (651), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 15:48:30,492 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 15:48:30,492 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 288 [2023-08-03 15:48:30,493 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 15:48:30,871 INFO L124 PetriNetUnfolderBase]: 1965/3678 cut-off events. [2023-08-03 15:48:30,871 INFO L125 PetriNetUnfolderBase]: For 3095/3124 co-relation queries the response was YES. [2023-08-03 15:48:30,876 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9166 conditions, 3678 events. 1965/3678 cut-off events. For 3095/3124 co-relation queries the response was YES. Maximal size of possible extension queue 159. Compared 23511 event pairs, 1052 based on Foata normal form. 20/3306 useless extension candidates. Maximal degree in co-relation 5774. Up to 2001 conditions per place. [2023-08-03 15:48:30,888 INFO L140 encePairwiseOnDemand]: 282/288 looper letters, 85 selfloop transitions, 5 changer transitions 0/114 dead transitions. [2023-08-03 15:48:30,889 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 114 transitions, 572 flow [2023-08-03 15:48:30,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-03 15:48:30,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-03 15:48:30,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 722 transitions. [2023-08-03 15:48:30,890 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5013888888888889 [2023-08-03 15:48:30,890 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 722 transitions. [2023-08-03 15:48:30,890 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 722 transitions. [2023-08-03 15:48:30,891 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 15:48:30,891 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 722 transitions. [2023-08-03 15:48:30,892 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 144.4) internal successors, (722), 5 states have internal predecessors, (722), 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-03 15:48:30,894 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 288.0) internal successors, (1728), 6 states have internal predecessors, (1728), 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-03 15:48:30,894 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 288.0) internal successors, (1728), 6 states have internal predecessors, (1728), 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-03 15:48:30,894 INFO L175 Difference]: Start difference. First operand has 68 places, 66 transitions, 232 flow. Second operand 5 states and 722 transitions. [2023-08-03 15:48:30,894 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 114 transitions, 572 flow [2023-08-03 15:48:30,899 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 114 transitions, 569 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-03 15:48:30,900 INFO L231 Difference]: Finished difference. Result has 73 places, 68 transitions, 255 flow [2023-08-03 15:48:30,900 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=288, PETRI_DIFFERENCE_MINUEND_FLOW=229, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=255, PETRI_PLACES=73, PETRI_TRANSITIONS=68} [2023-08-03 15:48:30,902 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 20 predicate places. [2023-08-03 15:48:30,902 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 68 transitions, 255 flow [2023-08-03 15:48:30,902 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 130.2) internal successors, (651), 5 states have internal predecessors, (651), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 15:48:30,902 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 15:48:30,902 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 15:48:30,902 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-03 15:48:30,902 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-03 15:48:30,903 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 15:48:30,903 INFO L85 PathProgramCache]: Analyzing trace with hash -1490531057, now seen corresponding path program 1 times [2023-08-03 15:48:30,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 15:48:30,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535279093] [2023-08-03 15:48:30,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 15:48:30,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 15:48:30,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 15:48:30,975 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-03 15:48:30,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 15:48:30,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535279093] [2023-08-03 15:48:30,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [535279093] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 15:48:30,975 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-03 15:48:30,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-03 15:48:30,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312558831] [2023-08-03 15:48:30,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 15:48:30,976 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-03 15:48:30,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 15:48:30,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-03 15:48:30,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-03 15:48:31,002 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 288 [2023-08-03 15:48:31,003 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 68 transitions, 255 flow. Second operand has 5 states, 5 states have (on average 130.6) internal successors, (653), 5 states have internal predecessors, (653), 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-03 15:48:31,003 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 15:48:31,003 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 288 [2023-08-03 15:48:31,003 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 15:48:31,448 INFO L124 PetriNetUnfolderBase]: 2690/5081 cut-off events. [2023-08-03 15:48:31,449 INFO L125 PetriNetUnfolderBase]: For 4826/4855 co-relation queries the response was YES. [2023-08-03 15:48:31,455 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13191 conditions, 5081 events. 2690/5081 cut-off events. For 4826/4855 co-relation queries the response was YES. Maximal size of possible extension queue 220. Compared 34604 event pairs, 1464 based on Foata normal form. 29/4595 useless extension candidates. Maximal degree in co-relation 8451. Up to 2764 conditions per place. [2023-08-03 15:48:31,472 INFO L140 encePairwiseOnDemand]: 282/288 looper letters, 87 selfloop transitions, 5 changer transitions 0/116 dead transitions. [2023-08-03 15:48:31,473 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 116 transitions, 629 flow [2023-08-03 15:48:31,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-03 15:48:31,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-03 15:48:31,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 718 transitions. [2023-08-03 15:48:31,474 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4986111111111111 [2023-08-03 15:48:31,475 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 718 transitions. [2023-08-03 15:48:31,475 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 718 transitions. [2023-08-03 15:48:31,475 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 15:48:31,475 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 718 transitions. [2023-08-03 15:48:31,476 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 143.6) internal successors, (718), 5 states have internal predecessors, (718), 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-03 15:48:31,478 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 288.0) internal successors, (1728), 6 states have internal predecessors, (1728), 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-03 15:48:31,478 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 288.0) internal successors, (1728), 6 states have internal predecessors, (1728), 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-03 15:48:31,478 INFO L175 Difference]: Start difference. First operand has 73 places, 68 transitions, 255 flow. Second operand 5 states and 718 transitions. [2023-08-03 15:48:31,478 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 116 transitions, 629 flow [2023-08-03 15:48:31,482 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 116 transitions, 623 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-03 15:48:31,483 INFO L231 Difference]: Finished difference. Result has 77 places, 70 transitions, 277 flow [2023-08-03 15:48:31,483 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=288, PETRI_DIFFERENCE_MINUEND_FLOW=251, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=277, PETRI_PLACES=77, PETRI_TRANSITIONS=70} [2023-08-03 15:48:31,484 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 24 predicate places. [2023-08-03 15:48:31,484 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 70 transitions, 277 flow [2023-08-03 15:48:31,484 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 130.6) internal successors, (653), 5 states have internal predecessors, (653), 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-03 15:48:31,484 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 15:48:31,484 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 15:48:31,484 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-03 15:48:31,484 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-03 15:48:31,485 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 15:48:31,485 INFO L85 PathProgramCache]: Analyzing trace with hash -887399513, now seen corresponding path program 1 times [2023-08-03 15:48:31,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 15:48:31,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074721355] [2023-08-03 15:48:31,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 15:48:31,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 15:48:31,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-03 15:48:31,516 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-03 15:48:31,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-03 15:48:31,533 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-03 15:48:31,533 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-03 15:48:31,533 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2023-08-03 15:48:31,533 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 4 remaining) [2023-08-03 15:48:31,533 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2023-08-03 15:48:31,534 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 4 remaining) [2023-08-03 15:48:31,534 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-03 15:48:31,534 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2023-08-03 15:48:31,537 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 2 thread instances [2023-08-03 15:48:31,537 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-03 15:48:31,588 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.08 03:48:31 BasicIcfg [2023-08-03 15:48:31,588 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-03 15:48:31,588 INFO L158 Benchmark]: Toolchain (without parser) took 12070.75ms. Allocated memory was 377.5MB in the beginning and 616.6MB in the end (delta: 239.1MB). Free memory was 341.3MB in the beginning and 417.4MB in the end (delta: -76.1MB). Peak memory consumption was 164.5MB. Max. memory is 16.0GB. [2023-08-03 15:48:31,589 INFO L158 Benchmark]: CDTParser took 0.08ms. Allocated memory is still 377.5MB. Free memory is still 334.4MB. There was no memory consumed. Max. memory is 16.0GB. [2023-08-03 15:48:31,590 INFO L158 Benchmark]: CACSL2BoogieTranslator took 336.84ms. Allocated memory is still 377.5MB. Free memory was 341.3MB in the beginning and 320.7MB in the end (delta: 20.6MB). Peak memory consumption was 18.9MB. Max. memory is 16.0GB. [2023-08-03 15:48:31,590 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.52ms. Allocated memory is still 377.5MB. Free memory was 320.7MB in the beginning and 318.2MB in the end (delta: 2.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. [2023-08-03 15:48:31,590 INFO L158 Benchmark]: Boogie Preprocessor took 34.18ms. Allocated memory is still 377.5MB. Free memory was 318.2MB in the beginning and 316.6MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.0GB. [2023-08-03 15:48:31,590 INFO L158 Benchmark]: RCFGBuilder took 532.23ms. Allocated memory is still 377.5MB. Free memory was 316.5MB in the beginning and 279.7MB in the end (delta: 36.9MB). Peak memory consumption was 37.7MB. Max. memory is 16.0GB. [2023-08-03 15:48:31,590 INFO L158 Benchmark]: TraceAbstraction took 11113.68ms. Allocated memory was 377.5MB in the beginning and 616.6MB in the end (delta: 239.1MB). Free memory was 278.8MB in the beginning and 417.4MB in the end (delta: -138.5MB). Peak memory consumption was 103.6MB. Max. memory is 16.0GB. [2023-08-03 15:48:31,591 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.08ms. Allocated memory is still 377.5MB. Free memory is still 334.4MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 336.84ms. Allocated memory is still 377.5MB. Free memory was 341.3MB in the beginning and 320.7MB in the end (delta: 20.6MB). Peak memory consumption was 18.9MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 49.52ms. Allocated memory is still 377.5MB. Free memory was 320.7MB in the beginning and 318.2MB in the end (delta: 2.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. * Boogie Preprocessor took 34.18ms. Allocated memory is still 377.5MB. Free memory was 318.2MB in the beginning and 316.6MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.0GB. * RCFGBuilder took 532.23ms. Allocated memory is still 377.5MB. Free memory was 316.5MB in the beginning and 279.7MB in the end (delta: 36.9MB). Peak memory consumption was 37.7MB. Max. memory is 16.0GB. * TraceAbstraction took 11113.68ms. Allocated memory was 377.5MB in the beginning and 616.6MB in the end (delta: 239.1MB). Free memory was 278.8MB in the beginning and 417.4MB in the end (delta: -138.5MB). Peak memory consumption was 103.6MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 256]: Unsoundness Warning unspecified type, defaulting to int C: short [256] - GenericResultAtLocation [Line: 256]: Unsoundness Warning unspecified type, defaulting to int C: short [256] - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.2s, 96 PlacesBefore, 17 PlacesAfterwards, 100 TransitionsBefore, 17 TransitionsAfterwards, 1984 CoEnabledTransitionPairs, 5 FixpointIterations, 20 TrivialSequentialCompositions, 59 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 16 ConcurrentYvCompositions, 4 ChoiceCompositions, 99 TotalNumberOfCompositions, 1726 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1518, independent: 1471, independent conditional: 0, independent unconditional: 1471, dependent: 47, dependent conditional: 0, dependent unconditional: 47, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1073, independent: 1049, independent conditional: 0, independent unconditional: 1049, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1518, independent: 422, independent conditional: 0, independent unconditional: 422, dependent: 23, dependent conditional: 0, dependent unconditional: 23, unknown: 1073, unknown conditional: 0, unknown unconditional: 1073] , Statistics on independence cache: Total cache size (in pairs): 26, Positive cache size: 19, Positive conditional cache size: 0, Positive unconditional cache size: 19, Negative cache size: 7, Negative conditional cache size: 0, Negative unconditional cache size: 7, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.8s, 155 PlacesBefore, 53 PlacesAfterwards, 163 TransitionsBefore, 58 TransitionsAfterwards, 11780 CoEnabledTransitionPairs, 5 FixpointIterations, 20 TrivialSequentialCompositions, 79 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 23 ConcurrentYvCompositions, 3 ChoiceCompositions, 125 TotalNumberOfCompositions, 23811 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 10674, independent: 10291, independent conditional: 0, independent unconditional: 10291, dependent: 383, dependent conditional: 0, dependent unconditional: 383, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 5875, independent: 5809, independent conditional: 0, independent unconditional: 5809, dependent: 66, dependent conditional: 0, dependent unconditional: 66, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 10674, independent: 4482, independent conditional: 0, independent unconditional: 4482, dependent: 317, dependent conditional: 0, dependent unconditional: 317, unknown: 5875, unknown conditional: 0, unknown unconditional: 5875] , Statistics on independence cache: Total cache size (in pairs): 358, Positive cache size: 326, Positive conditional cache size: 0, Positive unconditional cache size: 326, Negative cache size: 32, Negative conditional cache size: 0, Negative unconditional cache size: 32, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 749]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L701] 0 int memory[(2*320+1)]; [L702] 0 int next_alloc_idx = 1; [L703] 0 int m = 0; [L704] 0 int top; [L759] 0 int m2 = 0; [L760] 0 int state = 0; [L778] 0 pthread_t t; [L779] 0 int asdf=0; VAL [asdf=0, m2={4:0}, m={3:0}, next_alloc_idx=1, state=0, t={5:0}, top=0] [L779] COND TRUE 0 asdf<2 [L779] FCALL, FORK 0 pthread_create(&t, 0, thr1, 0) VAL [asdf=0, m2={4:0}, m={3:0}, next_alloc_idx=1, pthread_create(&t, 0, thr1, 0)=-1, state=0, t={5:0}, top=0] [L763] CALL 1 __VERIFIER_atomic_acquire(&m2) [L693] EXPR 1 \read(*m) [L693] CALL 1 assume_abort_if_not(*m==0) [L4] COND FALSE 1 !(!cond) [L693] RET 1 assume_abort_if_not(*m==0) [L694] 1 *m = 1 [L763] RET 1 __VERIFIER_atomic_acquire(&m2) [L766] 1 case 0: [L767] CALL 1 EBStack_init() [L719] 1 top = 0 VAL [m2={4:0}, m={3:0}, next_alloc_idx=1, state=0, top=0] [L767] RET 1 EBStack_init() [L768] 1 state = 1 VAL [arg={0:0}, arg={0:0}, m2={4:0}, m={3:0}, next_alloc_idx=1, state=1, top=0] [L769] 1 case 1: [L770] CALL 1 __VERIFIER_atomic_release(&m2) [L698] EXPR 1 \read(*m) [L698] CALL 1 assume_abort_if_not(*m==1) [L4] COND FALSE 1 !(!cond) [L698] RET 1 assume_abort_if_not(*m==1) [L699] 1 *m = 0 [L770] RET 1 __VERIFIER_atomic_release(&m2) [L771] CALL 1 push_loop() [L752] 1 int r = -1; [L753] 1 int arg = __VERIFIER_nondet_int(); [L754] COND TRUE 1 1 [L755] CALL, EXPR 1 push(arg) [L728] 1 int oldTop = -1, newTop = -1; [L729] CALL, EXPR 1 index_malloc() [L706] 1 int curr_alloc_idx = -1; [L707] CALL 1 __VERIFIER_atomic_acquire(&m) [L693] EXPR 1 \read(*m) [L693] CALL 1 assume_abort_if_not(*m==0) [L4] COND FALSE 1 !(!cond) [L693] RET 1 assume_abort_if_not(*m==0) [L694] 1 *m = 1 [L707] RET 1 __VERIFIER_atomic_acquire(&m) [L708] COND FALSE 1 !(next_alloc_idx+2-1 > (2*320+1)) VAL [curr_alloc_idx=-1, m2={4:0}, m={3:0}, next_alloc_idx=1, state=1, top=0] [L712] 1 curr_alloc_idx = next_alloc_idx VAL [curr_alloc_idx=1, m2={4:0}, m={3:0}, next_alloc_idx=1, state=1, top=0] [L713] 1 next_alloc_idx += 2 VAL [curr_alloc_idx=1, m2={4:0}, m={3:0}, next_alloc_idx=3, state=1, top=0] [L714] CALL 1 __VERIFIER_atomic_release(&m) [L698] EXPR 1 \read(*m) [L698] CALL 1 assume_abort_if_not(*m==1) [L4] COND FALSE 1 !(!cond) [L698] RET 1 assume_abort_if_not(*m==1) [L699] 1 *m = 0 [L714] RET 1 __VERIFIER_atomic_release(&m) [L716] 1 return curr_alloc_idx; [L729] RET, EXPR 1 index_malloc() [L729] 1 newTop = index_malloc() [L730] COND FALSE 1 !(newTop == 0) [L733] 1 memory[newTop+0] = d VAL [\old(d)=0, d=0, m2={4:0}, m={3:0}, newTop=1, next_alloc_idx=3, oldTop=-1, state=1, top=0] [L734] CALL 1 __VERIFIER_atomic_acquire(&m) [L693] EXPR 1 \read(*m) [L693] CALL 1 assume_abort_if_not(*m==0) [L4] COND FALSE 1 !(!cond) [L693] RET 1 assume_abort_if_not(*m==0) [L694] 1 *m = 1 [L734] RET 1 __VERIFIER_atomic_acquire(&m) [L735] 1 oldTop = top VAL [\old(d)=0, d=0, m2={4:0}, m={3:0}, newTop=1, next_alloc_idx=3, oldTop=0, state=1, top=0] [L736] 1 memory[newTop+1] = oldTop VAL [\old(d)=0, d=0, m2={4:0}, m={3:0}, newTop=1, next_alloc_idx=3, oldTop=0, state=1, top=0] [L738] 1 top = newTop VAL [\old(d)=0, d=0, m2={4:0}, m={3:0}, newTop=1, next_alloc_idx=3, oldTop=0, state=1, top=1] [L740] CALL 1 __VERIFIER_atomic_release(&m) [L698] EXPR 1 \read(*m) [L698] CALL 1 assume_abort_if_not(*m==1) [L4] COND FALSE 1 !(!cond) [L698] RET 1 assume_abort_if_not(*m==1) [L699] 1 *m = 0 [L740] RET 1 __VERIFIER_atomic_release(&m) [L741] 1 return 1; [L755] RET, EXPR 1 push(arg) [L755] 1 r = push(arg) VAL [arg=0, m2={4:0}, m={3:0}, next_alloc_idx=3, push(arg)=1, r=1, state=1, top=1] [L756] CALL 1 __VERIFIER_atomic_assert(r) [L749] EXPR 1 !r || !isEmpty() [L749] CALL, EXPR 1 isEmpty() [L722] COND FALSE 1 !(top == 0) [L725] 1 return 0; [L749] RET, EXPR 1 isEmpty() [L749] EXPR 1 !r || !isEmpty() [L749] COND TRUE 1 !(!(!r || !isEmpty())) [L749] 1 reach_error() VAL [\old(r)=1, m2={4:0}, m={3:0}, next_alloc_idx=3, r=1, state=1, top=1] - UnprovableResult [Line: 779]: 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 3 procedures, 151 locations, 3 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 4.4s, OverallIterations: 1, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.2s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=39occurred in iteration=0, InterpolantAutomatonStates: 0, 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.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 6 NumberOfCodeBlocks, 6 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 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 - StatisticsResult: Ultimate Automizer benchmark data with 2 thread instances CFG has 4 procedures, 208 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: 6.5s, OverallIterations: 6, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.8s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 440 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 363 mSDsluCounter, 124 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 87 mSDsCounter, 28 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 793 IncrementalHoareTripleChecker+Invalid, 821 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 28 mSolverCounterUnsat, 37 mSDtfsCounter, 793 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 32 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=277occurred in iteration=5, InterpolantAutomatonStates: 23, 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.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 105 NumberOfCodeBlocks, 105 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 78 ConstructedInterpolants, 0 QuantifiedInterpolants, 208 SizeOfPredicates, 0 NumberOfNonLiveVariables, 111 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 6 InterpolantComputations, 5 PerfectInterpolantSequences, 13/18 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-03 15:48:31,614 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...