/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 PROGRAM_FIRST -tc /storage/repos/CAV22/benchmarks/AutomizerCInline.xml -i /storage/repos/CAV22/benchmarks/increased_bounds/pthread-wmm_mix031.opt_bound2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-19404b3-m [2023-08-04 05:58:14,315 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-04 05:58:14,367 INFO L114 SettingsManager]: Loading settings from /storage/repos/CAV22/benchmarks/svcomp-Reach-32bit-Automizer_Default.epf [2023-08-04 05:58:14,370 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-04 05:58:14,370 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-08-04 05:58:14,371 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2023-08-04 05:58:14,371 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-04 05:58:14,407 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-04 05:58:14,407 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-04 05:58:14,412 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-04 05:58:14,412 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-04 05:58:14,412 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-04 05:58:14,413 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-04 05:58:14,413 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-04 05:58:14,413 INFO L153 SettingsManager]: * Use SBE=true [2023-08-04 05:58:14,413 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-04 05:58:14,414 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-04 05:58:14,414 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-04 05:58:14,414 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-04 05:58:14,414 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-04 05:58:14,414 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-04 05:58:14,416 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-04 05:58:14,416 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-04 05:58:14,417 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-04 05:58:14,418 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-04 05:58:14,418 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-04 05:58:14,418 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-04 05:58:14,418 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-04 05:58:14,418 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-04 05:58:14,419 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-04 05:58:14,419 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-04 05:58:14,419 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-04 05:58:14,419 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-04 05:58:14,419 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-04 05:58:14,419 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-04 05:58:14,419 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-04 05:58:14,420 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-04 05:58:14,420 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-08-04 05:58:14,420 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-04 05:58:14,420 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-04 05:58:14,420 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-04 05:58:14,421 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 -> PROGRAM_FIRST [2023-08-04 05:58:14,635 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-04 05:58:14,654 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-04 05:58:14,657 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-04 05:58:14,658 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-04 05:58:14,659 INFO L274 PluginConnector]: CDTParser initialized [2023-08-04 05:58:14,660 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/CAV22/benchmarks/increased_bounds/pthread-wmm_mix031.opt_bound2.i [2023-08-04 05:58:15,840 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-04 05:58:16,021 INFO L384 CDTParser]: Found 1 translation units. [2023-08-04 05:58:16,021 INFO L180 CDTParser]: Scanning /storage/repos/CAV22/benchmarks/increased_bounds/pthread-wmm_mix031.opt_bound2.i [2023-08-04 05:58:16,033 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e5ea3376d/d4009c924c274578ae28a5a694f0a2a7/FLAG6745a8864 [2023-08-04 05:58:16,045 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e5ea3376d/d4009c924c274578ae28a5a694f0a2a7 [2023-08-04 05:58:16,047 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-04 05:58:16,048 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-04 05:58:16,049 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-04 05:58:16,049 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-04 05:58:16,052 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-04 05:58:16,052 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.08 05:58:16" (1/1) ... [2023-08-04 05:58:16,053 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c1cbb8a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 05:58:16, skipping insertion in model container [2023-08-04 05:58:16,053 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.08 05:58:16" (1/1) ... [2023-08-04 05:58:16,082 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-04 05:58:16,236 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/CAV22/benchmarks/increased_bounds/pthread-wmm_mix031.opt_bound2.i[987,1000] [2023-08-04 05:58:16,432 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-04 05:58:16,438 INFO L201 MainTranslator]: Completed pre-run [2023-08-04 05:58:16,445 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/CAV22/benchmarks/increased_bounds/pthread-wmm_mix031.opt_bound2.i[987,1000] [2023-08-04 05:58:16,452 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [268] [2023-08-04 05:58:16,453 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [268] [2023-08-04 05:58:16,481 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-04 05:58:16,510 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-04 05:58:16,510 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-04 05:58:16,515 INFO L206 MainTranslator]: Completed translation [2023-08-04 05:58:16,515 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 05:58:16 WrapperNode [2023-08-04 05:58:16,516 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-04 05:58:16,517 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-04 05:58:16,517 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-04 05:58:16,517 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-04 05:58:16,522 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 05:58:16" (1/1) ... [2023-08-04 05:58:16,549 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 05:58:16" (1/1) ... [2023-08-04 05:58:16,565 INFO L138 Inliner]: procedures = 175, calls = 49, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 139 [2023-08-04 05:58:16,565 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-04 05:58:16,566 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-04 05:58:16,566 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-04 05:58:16,566 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-04 05:58:16,572 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 05:58:16" (1/1) ... [2023-08-04 05:58:16,572 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 05:58:16" (1/1) ... [2023-08-04 05:58:16,574 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 05:58:16" (1/1) ... [2023-08-04 05:58:16,574 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 05:58:16" (1/1) ... [2023-08-04 05:58:16,591 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 05:58:16" (1/1) ... [2023-08-04 05:58:16,593 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 05:58:16" (1/1) ... [2023-08-04 05:58:16,594 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 05:58:16" (1/1) ... [2023-08-04 05:58:16,595 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 05:58:16" (1/1) ... [2023-08-04 05:58:16,597 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-04 05:58:16,598 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-04 05:58:16,598 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-04 05:58:16,598 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-04 05:58:16,598 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 05:58:16" (1/1) ... [2023-08-04 05:58:16,602 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-04 05:58:16,617 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 05:58:16,645 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-04 05:58:16,650 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-04 05:58:16,667 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-04 05:58:16,667 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-04 05:58:16,668 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-04 05:58:16,668 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-04 05:58:16,668 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-04 05:58:16,668 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-04 05:58:16,668 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-04 05:58:16,668 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-04 05:58:16,668 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-04 05:58:16,668 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-04 05:58:16,668 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-04 05:58:16,668 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-04 05:58:16,668 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-04 05:58:16,669 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-04 05:58:16,753 INFO L236 CfgBuilder]: Building ICFG [2023-08-04 05:58:16,754 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-04 05:58:17,077 INFO L277 CfgBuilder]: Performing block encoding [2023-08-04 05:58:17,185 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-04 05:58:17,185 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2023-08-04 05:58:17,187 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.08 05:58:17 BoogieIcfgContainer [2023-08-04 05:58:17,187 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-04 05:58:17,191 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-04 05:58:17,191 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-04 05:58:17,194 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-04 05:58:17,194 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.08 05:58:16" (1/3) ... [2023-08-04 05:58:17,196 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@178bb7b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.08 05:58:17, skipping insertion in model container [2023-08-04 05:58:17,196 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 05:58:16" (2/3) ... [2023-08-04 05:58:17,197 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@178bb7b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.08 05:58:17, skipping insertion in model container [2023-08-04 05:58:17,198 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.08 05:58:17" (3/3) ... [2023-08-04 05:58:17,199 INFO L112 eAbstractionObserver]: Analyzing ICFG pthread-wmm_mix031.opt_bound2.i [2023-08-04 05:58:17,207 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-08-04 05:58:17,215 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-04 05:58:17,215 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-08-04 05:58:17,216 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-04 05:58:17,263 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-04 05:58:17,295 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 110 places, 109 transitions, 228 flow [2023-08-04 05:58:17,373 INFO L124 PetriNetUnfolderBase]: 14/227 cut-off events. [2023-08-04 05:58:17,373 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 05:58:17,377 INFO L83 FinitePrefix]: Finished finitePrefix Result has 239 conditions, 227 events. 14/227 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 645 event pairs, 0 based on Foata normal form. 0/201 useless extension candidates. Maximal degree in co-relation 134. Up to 8 conditions per place. [2023-08-04 05:58:17,377 INFO L82 GeneralOperation]: Start removeDead. Operand has 110 places, 109 transitions, 228 flow [2023-08-04 05:58:17,381 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 109 places, 108 transitions, 224 flow [2023-08-04 05:58:17,384 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-04 05:58:17,396 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 109 places, 108 transitions, 224 flow [2023-08-04 05:58:17,400 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 109 places, 108 transitions, 224 flow [2023-08-04 05:58:17,400 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 109 places, 108 transitions, 224 flow [2023-08-04 05:58:17,443 INFO L124 PetriNetUnfolderBase]: 14/226 cut-off events. [2023-08-04 05:58:17,443 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 05:58:17,445 INFO L83 FinitePrefix]: Finished finitePrefix Result has 237 conditions, 226 events. 14/226 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 643 event pairs, 0 based on Foata normal form. 0/200 useless extension candidates. Maximal degree in co-relation 132. Up to 8 conditions per place. [2023-08-04 05:58:17,447 INFO L119 LiptonReduction]: Number of co-enabled transitions 1716 [2023-08-04 05:58:19,982 INFO L134 LiptonReduction]: Checked pairs total: 3896 [2023-08-04 05:58:19,982 INFO L136 LiptonReduction]: Total number of compositions: 95 [2023-08-04 05:58:20,002 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-04 05:58:20,031 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;@765572e7, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-04 05:58:20,032 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-08-04 05:58:20,035 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-04 05:58:20,036 INFO L124 PetriNetUnfolderBase]: 1/16 cut-off events. [2023-08-04 05:58:20,036 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 05:58:20,036 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 05:58:20,036 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-04 05:58:20,037 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 05:58:20,040 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 05:58:20,041 INFO L85 PathProgramCache]: Analyzing trace with hash 453530166, now seen corresponding path program 1 times [2023-08-04 05:58:20,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 05:58:20,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327863837] [2023-08-04 05:58:20,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 05:58:20,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 05:58:20,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 05:58:20,304 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-04 05:58:20,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 05:58:20,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327863837] [2023-08-04 05:58:20,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [327863837] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 05:58:20,306 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 05:58:20,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-04 05:58:20,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349095126] [2023-08-04 05:58:20,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 05:58:20,314 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 05:58:20,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 05:58:20,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 05:58:20,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 05:58:20,385 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 204 [2023-08-04 05:58:20,387 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 26 transitions, 60 flow. Second operand has 3 states, 3 states have (on average 94.66666666666667) internal successors, (284), 3 states have internal predecessors, (284), 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-04 05:58:20,388 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 05:58:20,388 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 204 [2023-08-04 05:58:20,388 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 05:58:20,483 INFO L124 PetriNetUnfolderBase]: 352/647 cut-off events. [2023-08-04 05:58:20,483 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-08-04 05:58:20,485 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1279 conditions, 647 events. 352/647 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2971 event pairs, 286 based on Foata normal form. 28/543 useless extension candidates. Maximal degree in co-relation 1267. Up to 609 conditions per place. [2023-08-04 05:58:20,487 INFO L140 encePairwiseOnDemand]: 200/204 looper letters, 23 selfloop transitions, 2 changer transitions 1/29 dead transitions. [2023-08-04 05:58:20,488 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 29 transitions, 118 flow [2023-08-04 05:58:20,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 05:58:20,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 05:58:20,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 307 transitions. [2023-08-04 05:58:20,497 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5016339869281046 [2023-08-04 05:58:20,498 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 307 transitions. [2023-08-04 05:58:20,498 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 307 transitions. [2023-08-04 05:58:20,499 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 05:58:20,501 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 307 transitions. [2023-08-04 05:58:20,503 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 102.33333333333333) internal successors, (307), 3 states have internal predecessors, (307), 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-04 05:58:20,506 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 204.0) internal successors, (816), 4 states have internal predecessors, (816), 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-04 05:58:20,507 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 204.0) internal successors, (816), 4 states have internal predecessors, (816), 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-04 05:58:20,508 INFO L175 Difference]: Start difference. First operand has 30 places, 26 transitions, 60 flow. Second operand 3 states and 307 transitions. [2023-08-04 05:58:20,509 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 29 transitions, 118 flow [2023-08-04 05:58:20,510 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 29 transitions, 118 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-04 05:58:20,511 INFO L231 Difference]: Finished difference. Result has 33 places, 25 transitions, 66 flow [2023-08-04 05:58:20,513 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=204, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=66, PETRI_PLACES=33, PETRI_TRANSITIONS=25} [2023-08-04 05:58:20,516 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 3 predicate places. [2023-08-04 05:58:20,516 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 25 transitions, 66 flow [2023-08-04 05:58:20,516 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 94.66666666666667) internal successors, (284), 3 states have internal predecessors, (284), 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-04 05:58:20,516 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 05:58:20,517 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 05:58:20,517 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-04 05:58:20,517 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 05:58:20,517 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 05:58:20,517 INFO L85 PathProgramCache]: Analyzing trace with hash -1086339861, now seen corresponding path program 1 times [2023-08-04 05:58:20,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 05:58:20,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853894721] [2023-08-04 05:58:20,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 05:58:20,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 05:58:20,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 05:58:20,569 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-04 05:58:20,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 05:58:20,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853894721] [2023-08-04 05:58:20,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [853894721] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 05:58:20,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [616233309] [2023-08-04 05:58:20,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 05:58:20,570 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 05:58:20,570 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 05:58:20,573 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-04 05:58:20,607 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-04 05:58:20,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 05:58:20,648 INFO L262 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-04 05:58:20,650 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 05:58:20,683 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-04 05:58:20,683 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 05:58:20,696 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-04 05:58:20,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [616233309] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 05:58:20,697 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 05:58:20,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2023-08-04 05:58:20,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629129838] [2023-08-04 05:58:20,698 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 05:58:20,698 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 05:58:20,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 05:58:20,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 05:58:20,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-04 05:58:20,711 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 204 [2023-08-04 05:58:20,712 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 25 transitions, 66 flow. Second operand has 5 states, 5 states have (on average 94.4) internal successors, (472), 5 states have internal predecessors, (472), 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-04 05:58:20,712 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 05:58:20,712 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 204 [2023-08-04 05:58:20,712 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 05:58:20,732 INFO L124 PetriNetUnfolderBase]: 6/21 cut-off events. [2023-08-04 05:58:20,732 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-08-04 05:58:20,732 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58 conditions, 21 events. 6/21 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 30 event pairs, 0 based on Foata normal form. 4/25 useless extension candidates. Maximal degree in co-relation 52. Up to 14 conditions per place. [2023-08-04 05:58:20,732 INFO L140 encePairwiseOnDemand]: 201/204 looper letters, 0 selfloop transitions, 0 changer transitions 12/12 dead transitions. [2023-08-04 05:58:20,732 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 18 places, 12 transitions, 55 flow [2023-08-04 05:58:20,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-04 05:58:20,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-04 05:58:20,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 380 transitions. [2023-08-04 05:58:20,735 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46568627450980393 [2023-08-04 05:58:20,736 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 380 transitions. [2023-08-04 05:58:20,736 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 380 transitions. [2023-08-04 05:58:20,736 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 05:58:20,736 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 380 transitions. [2023-08-04 05:58:20,737 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 95.0) internal successors, (380), 4 states have internal predecessors, (380), 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-04 05:58:20,739 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 204.0) internal successors, (1020), 5 states have internal predecessors, (1020), 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-04 05:58:20,739 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 204.0) internal successors, (1020), 5 states have internal predecessors, (1020), 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-04 05:58:20,739 INFO L175 Difference]: Start difference. First operand has 33 places, 25 transitions, 66 flow. Second operand 4 states and 380 transitions. [2023-08-04 05:58:20,739 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 18 places, 12 transitions, 55 flow [2023-08-04 05:58:20,740 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 15 places, 12 transitions, 49 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-04 05:58:20,740 INFO L231 Difference]: Finished difference. Result has 15 places, 0 transitions, 0 flow [2023-08-04 05:58:20,740 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=204, PETRI_DIFFERENCE_MINUEND_FLOW=19, PETRI_DIFFERENCE_MINUEND_PLACES=12, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=8, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=8, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=0, PETRI_PLACES=15, PETRI_TRANSITIONS=0} [2023-08-04 05:58:20,741 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, -15 predicate places. [2023-08-04 05:58:20,741 INFO L495 AbstractCegarLoop]: Abstraction has has 15 places, 0 transitions, 0 flow [2023-08-04 05:58:20,741 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 94.4) internal successors, (472), 5 states have internal predecessors, (472), 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-04 05:58:20,743 INFO L805 garLoopResultBuilder]: Registering result SAFE for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2023-08-04 05:58:20,743 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 3 remaining) [2023-08-04 05:58:20,743 INFO L805 garLoopResultBuilder]: Registering result SAFE for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 3 remaining) [2023-08-04 05:58:20,760 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-08-04 05:58:20,948 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-04 05:58:20,949 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2023-08-04 05:58:20,951 INFO L307 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was SAFE,SAFE,SAFE (1/2) [2023-08-04 05:58:20,958 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 110 places, 109 transitions, 228 flow [2023-08-04 05:58:20,976 INFO L124 PetriNetUnfolderBase]: 14/227 cut-off events. [2023-08-04 05:58:20,976 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 05:58:20,977 INFO L83 FinitePrefix]: Finished finitePrefix Result has 239 conditions, 227 events. 14/227 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 645 event pairs, 0 based on Foata normal form. 0/201 useless extension candidates. Maximal degree in co-relation 134. Up to 8 conditions per place. [2023-08-04 05:58:20,978 INFO L82 GeneralOperation]: Start removeDead. Operand has 110 places, 109 transitions, 228 flow [2023-08-04 05:58:20,978 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 86 places, 82 transitions, 174 flow [2023-08-04 05:58:20,978 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-04 05:58:20,978 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 86 places, 82 transitions, 174 flow [2023-08-04 05:58:20,979 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 86 places, 82 transitions, 174 flow [2023-08-04 05:58:20,979 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 86 places, 82 transitions, 174 flow [2023-08-04 05:58:20,987 INFO L124 PetriNetUnfolderBase]: 2/119 cut-off events. [2023-08-04 05:58:20,987 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 05:58:20,988 INFO L83 FinitePrefix]: Finished finitePrefix Result has 131 conditions, 119 events. 2/119 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 176 event pairs, 0 based on Foata normal form. 0/113 useless extension candidates. Maximal degree in co-relation 80. Up to 4 conditions per place. [2023-08-04 05:58:20,989 INFO L119 LiptonReduction]: Number of co-enabled transitions 760 [2023-08-04 05:58:23,118 INFO L134 LiptonReduction]: Checked pairs total: 1170 [2023-08-04 05:58:23,118 INFO L136 LiptonReduction]: Total number of compositions: 70 [2023-08-04 05:58:23,119 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == InUseError ======== [2023-08-04 05:58:23,120 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;@765572e7, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-04 05:58:23,120 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2023-08-04 05:58:23,122 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-04 05:58:23,122 INFO L124 PetriNetUnfolderBase]: 0/14 cut-off events. [2023-08-04 05:58:23,122 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 05:58:23,122 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 05:58:23,122 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-04 05:58:23,122 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-04 05:58:23,123 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 05:58:23,123 INFO L85 PathProgramCache]: Analyzing trace with hash 520651331, now seen corresponding path program 1 times [2023-08-04 05:58:23,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 05:58:23,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529556504] [2023-08-04 05:58:23,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 05:58:23,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 05:58:23,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 05:58:23,176 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-04 05:58:23,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 05:58:23,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529556504] [2023-08-04 05:58:23,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [529556504] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 05:58:23,176 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 05:58:23,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-04 05:58:23,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117324612] [2023-08-04 05:58:23,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 05:58:23,177 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 05:58:23,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 05:58:23,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 05:58:23,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 05:58:23,190 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 179 [2023-08-04 05:58:23,190 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 22 places, 17 transitions, 44 flow. Second operand has 3 states, 3 states have (on average 94.33333333333333) internal successors, (283), 3 states have internal predecessors, (283), 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-04 05:58:23,190 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 05:58:23,190 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 179 [2023-08-04 05:58:23,190 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 05:58:23,224 INFO L124 PetriNetUnfolderBase]: 65/147 cut-off events. [2023-08-04 05:58:23,225 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 05:58:23,225 INFO L83 FinitePrefix]: Finished finitePrefix Result has 308 conditions, 147 events. 65/147 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 506 event pairs, 20 based on Foata normal form. 0/135 useless extension candidates. Maximal degree in co-relation 288. Up to 126 conditions per place. [2023-08-04 05:58:23,225 INFO L140 encePairwiseOnDemand]: 176/179 looper letters, 17 selfloop transitions, 2 changer transitions 0/21 dead transitions. [2023-08-04 05:58:23,225 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 24 places, 21 transitions, 90 flow [2023-08-04 05:58:23,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 05:58:23,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 05:58:23,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 299 transitions. [2023-08-04 05:58:23,228 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5567970204841713 [2023-08-04 05:58:23,228 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 299 transitions. [2023-08-04 05:58:23,228 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 299 transitions. [2023-08-04 05:58:23,228 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 05:58:23,228 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 299 transitions. [2023-08-04 05:58:23,229 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 99.66666666666667) internal successors, (299), 3 states have internal predecessors, (299), 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-04 05:58:23,231 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 179.0) internal successors, (716), 4 states have internal predecessors, (716), 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-04 05:58:23,232 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 179.0) internal successors, (716), 4 states have internal predecessors, (716), 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-04 05:58:23,232 INFO L175 Difference]: Start difference. First operand has 22 places, 17 transitions, 44 flow. Second operand 3 states and 299 transitions. [2023-08-04 05:58:23,232 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 24 places, 21 transitions, 90 flow [2023-08-04 05:58:23,233 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 24 places, 21 transitions, 90 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-04 05:58:23,233 INFO L231 Difference]: Finished difference. Result has 25 places, 17 transitions, 52 flow [2023-08-04 05:58:23,233 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=179, PETRI_DIFFERENCE_MINUEND_FLOW=44, PETRI_DIFFERENCE_MINUEND_PLACES=22, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=52, PETRI_PLACES=25, PETRI_TRANSITIONS=17} [2023-08-04 05:58:23,235 INFO L281 CegarLoopForPetriNet]: 22 programPoint places, 3 predicate places. [2023-08-04 05:58:23,235 INFO L495 AbstractCegarLoop]: Abstraction has has 25 places, 17 transitions, 52 flow [2023-08-04 05:58:23,235 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 94.33333333333333) internal successors, (283), 3 states have internal predecessors, (283), 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-04 05:58:23,235 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 05:58:23,236 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2023-08-04 05:58:23,236 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-04 05:58:23,236 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-04 05:58:23,236 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 05:58:23,236 INFO L85 PathProgramCache]: Analyzing trace with hash -1049774025, now seen corresponding path program 1 times [2023-08-04 05:58:23,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 05:58:23,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481851308] [2023-08-04 05:58:23,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 05:58:23,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 05:58:23,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-04 05:58:23,263 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-04 05:58:23,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-04 05:58:23,284 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-04 05:58:23,284 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-04 05:58:23,284 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2023-08-04 05:58:23,284 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 2 remaining) [2023-08-04 05:58:23,285 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-04 05:58:23,285 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2023-08-04 05:58:23,285 INFO L307 ceAbstractionStarter]: Result for error location InUseError was UNSAFE,UNKNOWN (2/2) [2023-08-04 05:58:23,286 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-08-04 05:58:23,286 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-08-04 05:58:23,304 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-04 05:58:23,306 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 134 places, 129 transitions, 282 flow [2023-08-04 05:58:23,352 INFO L124 PetriNetUnfolderBase]: 30/469 cut-off events. [2023-08-04 05:58:23,353 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2023-08-04 05:58:23,354 INFO L83 FinitePrefix]: Finished finitePrefix Result has 502 conditions, 469 events. 30/469 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 2049 event pairs, 0 based on Foata normal form. 0/412 useless extension candidates. Maximal degree in co-relation 338. Up to 18 conditions per place. [2023-08-04 05:58:23,354 INFO L82 GeneralOperation]: Start removeDead. Operand has 134 places, 129 transitions, 282 flow [2023-08-04 05:58:23,357 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 133 places, 128 transitions, 276 flow [2023-08-04 05:58:23,359 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-04 05:58:23,359 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 133 places, 128 transitions, 276 flow [2023-08-04 05:58:23,364 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 133 places, 128 transitions, 276 flow [2023-08-04 05:58:23,364 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 133 places, 128 transitions, 276 flow [2023-08-04 05:58:23,402 INFO L124 PetriNetUnfolderBase]: 30/468 cut-off events. [2023-08-04 05:58:23,403 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2023-08-04 05:58:23,404 INFO L83 FinitePrefix]: Finished finitePrefix Result has 499 conditions, 468 events. 30/468 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 2023 event pairs, 0 based on Foata normal form. 0/411 useless extension candidates. Maximal degree in co-relation 336. Up to 18 conditions per place. [2023-08-04 05:58:23,410 INFO L119 LiptonReduction]: Number of co-enabled transitions 4148 [2023-08-04 05:58:26,005 INFO L134 LiptonReduction]: Checked pairs total: 16108 [2023-08-04 05:58:26,005 INFO L136 LiptonReduction]: Total number of compositions: 98 [2023-08-04 05:58:26,006 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-04 05:58:26,007 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;@765572e7, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-04 05:58:26,007 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2023-08-04 05:58:26,009 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-04 05:58:26,009 INFO L124 PetriNetUnfolderBase]: 1/13 cut-off events. [2023-08-04 05:58:26,009 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 05:58:26,009 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 05:58:26,009 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-04 05:58:26,009 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-04 05:58:26,010 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 05:58:26,010 INFO L85 PathProgramCache]: Analyzing trace with hash 756082183, now seen corresponding path program 1 times [2023-08-04 05:58:26,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 05:58:26,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410562253] [2023-08-04 05:58:26,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 05:58:26,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 05:58:26,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 05:58:26,032 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-04 05:58:26,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 05:58:26,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410562253] [2023-08-04 05:58:26,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [410562253] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 05:58:26,032 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 05:58:26,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-04 05:58:26,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145704311] [2023-08-04 05:58:26,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 05:58:26,033 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 05:58:26,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 05:58:26,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 05:58:26,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 05:58:26,040 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 227 [2023-08-04 05:58:26,040 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 44 transitions, 108 flow. Second operand has 3 states, 3 states have (on average 108.66666666666667) internal successors, (326), 3 states have internal predecessors, (326), 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-04 05:58:26,040 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 05:58:26,040 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 227 [2023-08-04 05:58:26,041 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 05:58:28,096 INFO L124 PetriNetUnfolderBase]: 15012/23369 cut-off events. [2023-08-04 05:58:28,097 INFO L125 PetriNetUnfolderBase]: For 364/364 co-relation queries the response was YES. [2023-08-04 05:58:28,139 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44523 conditions, 23369 events. 15012/23369 cut-off events. For 364/364 co-relation queries the response was YES. Maximal size of possible extension queue 1083. Compared 173030 event pairs, 10800 based on Foata normal form. 620/19761 useless extension candidates. Maximal degree in co-relation 9797. Up to 20629 conditions per place. [2023-08-04 05:58:28,233 INFO L140 encePairwiseOnDemand]: 223/227 looper letters, 33 selfloop transitions, 2 changer transitions 0/48 dead transitions. [2023-08-04 05:58:28,234 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 48 transitions, 186 flow [2023-08-04 05:58:28,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 05:58:28,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 05:58:28,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 358 transitions. [2023-08-04 05:58:28,235 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5256975036710719 [2023-08-04 05:58:28,235 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 358 transitions. [2023-08-04 05:58:28,235 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 358 transitions. [2023-08-04 05:58:28,235 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 05:58:28,235 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 358 transitions. [2023-08-04 05:58:28,236 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 119.33333333333333) internal successors, (358), 3 states have internal predecessors, (358), 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-04 05:58:28,237 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 227.0) internal successors, (908), 4 states have internal predecessors, (908), 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-04 05:58:28,237 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 227.0) internal successors, (908), 4 states have internal predecessors, (908), 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-04 05:58:28,237 INFO L175 Difference]: Start difference. First operand has 52 places, 44 transitions, 108 flow. Second operand 3 states and 358 transitions. [2023-08-04 05:58:28,237 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 48 transitions, 186 flow [2023-08-04 05:58:28,241 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 48 transitions, 184 flow, removed 1 selfloop flow, removed 0 redundant places. [2023-08-04 05:58:28,241 INFO L231 Difference]: Finished difference. Result has 55 places, 44 transitions, 116 flow [2023-08-04 05:58:28,242 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=227, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=116, PETRI_PLACES=55, PETRI_TRANSITIONS=44} [2023-08-04 05:58:28,244 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 3 predicate places. [2023-08-04 05:58:28,244 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 44 transitions, 116 flow [2023-08-04 05:58:28,245 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 108.66666666666667) internal successors, (326), 3 states have internal predecessors, (326), 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-04 05:58:28,245 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 05:58:28,245 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 05:58:28,245 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-04 05:58:28,245 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-04 05:58:28,245 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 05:58:28,246 INFO L85 PathProgramCache]: Analyzing trace with hash 155983325, now seen corresponding path program 1 times [2023-08-04 05:58:28,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 05:58:28,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276392367] [2023-08-04 05:58:28,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 05:58:28,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 05:58:28,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 05:58:28,303 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-04 05:58:28,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 05:58:28,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276392367] [2023-08-04 05:58:28,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1276392367] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 05:58:28,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [201544711] [2023-08-04 05:58:28,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 05:58:28,304 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 05:58:28,304 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 05:58:28,305 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-04 05:58:28,351 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-08-04 05:58:28,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 05:58:28,392 INFO L262 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-04 05:58:28,393 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 05:58:28,404 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-04 05:58:28,404 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 05:58:28,417 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-04 05:58:28,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [201544711] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 05:58:28,417 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 05:58:28,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2023-08-04 05:58:28,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172719101] [2023-08-04 05:58:28,417 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 05:58:28,418 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 05:58:28,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 05:58:28,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 05:58:28,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-04 05:58:28,431 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 227 [2023-08-04 05:58:28,432 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 44 transitions, 116 flow. Second operand has 5 states, 5 states have (on average 108.4) internal successors, (542), 5 states have internal predecessors, (542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 05:58:28,432 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 05:58:28,432 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 227 [2023-08-04 05:58:28,432 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 05:58:30,222 INFO L124 PetriNetUnfolderBase]: 12690/19426 cut-off events. [2023-08-04 05:58:30,223 INFO L125 PetriNetUnfolderBase]: For 236/236 co-relation queries the response was YES. [2023-08-04 05:58:30,263 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37025 conditions, 19426 events. 12690/19426 cut-off events. For 236/236 co-relation queries the response was YES. Maximal size of possible extension queue 962. Compared 137764 event pairs, 5982 based on Foata normal form. 4/16084 useless extension candidates. Maximal degree in co-relation 27175. Up to 17113 conditions per place. [2023-08-04 05:58:30,330 INFO L140 encePairwiseOnDemand]: 223/227 looper letters, 38 selfloop transitions, 3 changer transitions 1/55 dead transitions. [2023-08-04 05:58:30,331 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 55 transitions, 222 flow [2023-08-04 05:58:30,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-04 05:58:30,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-04 05:58:30,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 467 transitions. [2023-08-04 05:58:30,332 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.51431718061674 [2023-08-04 05:58:30,332 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 467 transitions. [2023-08-04 05:58:30,332 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 467 transitions. [2023-08-04 05:58:30,332 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 05:58:30,333 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 467 transitions. [2023-08-04 05:58:30,333 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 116.75) internal successors, (467), 4 states have internal predecessors, (467), 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-04 05:58:30,335 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 227.0) internal successors, (1135), 5 states have internal predecessors, (1135), 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-04 05:58:30,335 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 227.0) internal successors, (1135), 5 states have internal predecessors, (1135), 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-04 05:58:30,335 INFO L175 Difference]: Start difference. First operand has 55 places, 44 transitions, 116 flow. Second operand 4 states and 467 transitions. [2023-08-04 05:58:30,335 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 55 transitions, 222 flow [2023-08-04 05:58:30,337 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 55 transitions, 220 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-04 05:58:30,340 INFO L231 Difference]: Finished difference. Result has 59 places, 44 transitions, 128 flow [2023-08-04 05:58:30,340 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=227, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=128, PETRI_PLACES=59, PETRI_TRANSITIONS=44} [2023-08-04 05:58:30,343 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 7 predicate places. [2023-08-04 05:58:30,343 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 44 transitions, 128 flow [2023-08-04 05:58:30,344 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 108.4) internal successors, (542), 5 states have internal predecessors, (542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 05:58:30,344 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 05:58:30,344 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 05:58:30,352 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-08-04 05:58:30,550 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2023-08-04 05:58:30,551 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-04 05:58:30,552 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 05:58:30,552 INFO L85 PathProgramCache]: Analyzing trace with hash -1748912652, now seen corresponding path program 1 times [2023-08-04 05:58:30,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 05:58:30,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126310268] [2023-08-04 05:58:30,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 05:58:30,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 05:58:30,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 05:58:30,695 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-04 05:58:30,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 05:58:30,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126310268] [2023-08-04 05:58:30,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [126310268] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 05:58:30,695 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 05:58:30,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-04 05:58:30,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753284318] [2023-08-04 05:58:30,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 05:58:30,696 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 05:58:30,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 05:58:30,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 05:58:30,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 05:58:30,698 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 227 [2023-08-04 05:58:30,698 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 44 transitions, 128 flow. Second operand has 3 states, 3 states have (on average 113.0) internal successors, (339), 3 states have internal predecessors, (339), 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-04 05:58:30,698 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 05:58:30,698 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 227 [2023-08-04 05:58:30,698 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 05:58:32,165 INFO L124 PetriNetUnfolderBase]: 10842/16986 cut-off events. [2023-08-04 05:58:32,165 INFO L125 PetriNetUnfolderBase]: For 344/344 co-relation queries the response was YES. [2023-08-04 05:58:32,199 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32105 conditions, 16986 events. 10842/16986 cut-off events. For 344/344 co-relation queries the response was YES. Maximal size of possible extension queue 835. Compared 121836 event pairs, 2106 based on Foata normal form. 0/14239 useless extension candidates. Maximal degree in co-relation 15027. Up to 13633 conditions per place. [2023-08-04 05:58:32,241 INFO L140 encePairwiseOnDemand]: 222/227 looper letters, 45 selfloop transitions, 3 changer transitions 0/61 dead transitions. [2023-08-04 05:58:32,241 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 61 transitions, 263 flow [2023-08-04 05:58:32,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 05:58:32,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 05:58:32,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 379 transitions. [2023-08-04 05:58:32,243 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5565345080763583 [2023-08-04 05:58:32,243 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 379 transitions. [2023-08-04 05:58:32,243 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 379 transitions. [2023-08-04 05:58:32,244 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 05:58:32,244 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 379 transitions. [2023-08-04 05:58:32,245 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 126.33333333333333) internal successors, (379), 3 states have internal predecessors, (379), 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-04 05:58:32,246 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 227.0) internal successors, (908), 4 states have internal predecessors, (908), 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-04 05:58:32,246 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 227.0) internal successors, (908), 4 states have internal predecessors, (908), 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-04 05:58:32,247 INFO L175 Difference]: Start difference. First operand has 59 places, 44 transitions, 128 flow. Second operand 3 states and 379 transitions. [2023-08-04 05:58:32,247 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 61 transitions, 263 flow [2023-08-04 05:58:32,248 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 61 transitions, 256 flow, removed 1 selfloop flow, removed 3 redundant places. [2023-08-04 05:58:32,249 INFO L231 Difference]: Finished difference. Result has 59 places, 46 transitions, 142 flow [2023-08-04 05:58:32,249 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=227, PETRI_DIFFERENCE_MINUEND_FLOW=121, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=142, PETRI_PLACES=59, PETRI_TRANSITIONS=46} [2023-08-04 05:58:32,250 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 7 predicate places. [2023-08-04 05:58:32,250 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 46 transitions, 142 flow [2023-08-04 05:58:32,250 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 113.0) internal successors, (339), 3 states have internal predecessors, (339), 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-04 05:58:32,250 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 05:58:32,250 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 05:58:32,250 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-04 05:58:32,250 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-04 05:58:32,251 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 05:58:32,251 INFO L85 PathProgramCache]: Analyzing trace with hash 1618638533, now seen corresponding path program 1 times [2023-08-04 05:58:32,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 05:58:32,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921058113] [2023-08-04 05:58:32,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 05:58:32,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 05:58:32,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 05:58:32,278 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-04 05:58:32,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 05:58:32,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921058113] [2023-08-04 05:58:32,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [921058113] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 05:58:32,278 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 05:58:32,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-04 05:58:32,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862279750] [2023-08-04 05:58:32,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 05:58:32,279 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 05:58:32,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 05:58:32,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 05:58:32,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 05:58:32,287 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 227 [2023-08-04 05:58:32,287 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 46 transitions, 142 flow. Second operand has 3 states, 3 states have (on average 110.33333333333333) internal successors, (331), 3 states have internal predecessors, (331), 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-04 05:58:32,287 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 05:58:32,287 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 227 [2023-08-04 05:58:32,287 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 05:58:33,529 INFO L124 PetriNetUnfolderBase]: 10698/16078 cut-off events. [2023-08-04 05:58:33,529 INFO L125 PetriNetUnfolderBase]: For 1273/1273 co-relation queries the response was YES. [2023-08-04 05:58:33,558 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33565 conditions, 16078 events. 10698/16078 cut-off events. For 1273/1273 co-relation queries the response was YES. Maximal size of possible extension queue 861. Compared 111351 event pairs, 8154 based on Foata normal form. 0/13650 useless extension candidates. Maximal degree in co-relation 15781. Up to 14281 conditions per place. [2023-08-04 05:58:33,603 INFO L140 encePairwiseOnDemand]: 223/227 looper letters, 42 selfloop transitions, 2 changer transitions 0/57 dead transitions. [2023-08-04 05:58:33,604 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 57 transitions, 255 flow [2023-08-04 05:58:33,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 05:58:33,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 05:58:33,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 364 transitions. [2023-08-04 05:58:33,605 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5345080763582967 [2023-08-04 05:58:33,605 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 364 transitions. [2023-08-04 05:58:33,605 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 364 transitions. [2023-08-04 05:58:33,605 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 05:58:33,606 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 364 transitions. [2023-08-04 05:58:33,606 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 121.33333333333333) internal successors, (364), 3 states have internal predecessors, (364), 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-04 05:58:33,607 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 227.0) internal successors, (908), 4 states have internal predecessors, (908), 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-04 05:58:33,607 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 227.0) internal successors, (908), 4 states have internal predecessors, (908), 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-04 05:58:33,607 INFO L175 Difference]: Start difference. First operand has 59 places, 46 transitions, 142 flow. Second operand 3 states and 364 transitions. [2023-08-04 05:58:33,607 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 57 transitions, 255 flow [2023-08-04 05:58:33,608 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 57 transitions, 251 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-04 05:58:33,609 INFO L231 Difference]: Finished difference. Result has 61 places, 47 transitions, 153 flow [2023-08-04 05:58:33,609 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=227, PETRI_DIFFERENCE_MINUEND_FLOW=139, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=153, PETRI_PLACES=61, PETRI_TRANSITIONS=47} [2023-08-04 05:58:33,609 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 9 predicate places. [2023-08-04 05:58:33,609 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 47 transitions, 153 flow [2023-08-04 05:58:33,610 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 110.33333333333333) internal successors, (331), 3 states have internal predecessors, (331), 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-04 05:58:33,610 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 05:58:33,610 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 05:58:33,610 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-04 05:58:33,610 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-04 05:58:33,610 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 05:58:33,610 INFO L85 PathProgramCache]: Analyzing trace with hash -1201878894, now seen corresponding path program 1 times [2023-08-04 05:58:33,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 05:58:33,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825718516] [2023-08-04 05:58:33,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 05:58:33,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 05:58:33,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-04 05:58:33,621 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-04 05:58:33,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-04 05:58:33,633 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-04 05:58:33,633 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-04 05:58:33,633 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2023-08-04 05:58:33,633 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 4 remaining) [2023-08-04 05:58:33,633 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 4 remaining) [2023-08-04 05:58:33,633 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 4 remaining) [2023-08-04 05:58:33,633 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-04 05:58:33,633 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2023-08-04 05:58:33,634 INFO L307 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was UNSAFE,UNKNOWN,UNKNOWN,UNKNOWN (1/2) [2023-08-04 05:58:33,635 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 2 thread instances [2023-08-04 05:58:33,635 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-04 05:58:33,669 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.08 05:58:33 BasicIcfg [2023-08-04 05:58:33,669 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-04 05:58:33,669 INFO L158 Benchmark]: Toolchain (without parser) took 17621.75ms. Allocated memory was 383.8MB in the beginning and 2.5GB in the end (delta: 2.1GB). Free memory was 332.5MB in the beginning and 1.3GB in the end (delta: -972.2MB). Peak memory consumption was 1.1GB. Max. memory is 16.0GB. [2023-08-04 05:58:33,670 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 383.8MB. Free memory is still 336.4MB. There was no memory consumed. Max. memory is 16.0GB. [2023-08-04 05:58:33,670 INFO L158 Benchmark]: CACSL2BoogieTranslator took 467.23ms. Allocated memory is still 383.8MB. Free memory was 332.2MB in the beginning and 309.5MB in the end (delta: 22.6MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. [2023-08-04 05:58:33,670 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.76ms. Allocated memory is still 383.8MB. Free memory was 309.5MB in the beginning and 307.1MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-04 05:58:33,670 INFO L158 Benchmark]: Boogie Preprocessor took 31.12ms. Allocated memory is still 383.8MB. Free memory was 307.1MB in the beginning and 305.3MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-04 05:58:33,670 INFO L158 Benchmark]: RCFGBuilder took 590.02ms. Allocated memory was 383.8MB in the beginning and 570.4MB in the end (delta: 186.6MB). Free memory was 305.3MB in the beginning and 520.8MB in the end (delta: -215.4MB). Peak memory consumption was 23.7MB. Max. memory is 16.0GB. [2023-08-04 05:58:33,671 INFO L158 Benchmark]: TraceAbstraction took 16477.93ms. Allocated memory was 570.4MB in the beginning and 2.5GB in the end (delta: 1.9GB). Free memory was 519.7MB in the beginning and 1.3GB in the end (delta: -785.0MB). Peak memory consumption was 1.1GB. Max. memory is 16.0GB. [2023-08-04 05:58:33,672 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 383.8MB. Free memory is still 336.4MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 467.23ms. Allocated memory is still 383.8MB. Free memory was 332.2MB in the beginning and 309.5MB in the end (delta: 22.6MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 48.76ms. Allocated memory is still 383.8MB. Free memory was 309.5MB in the beginning and 307.1MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 31.12ms. Allocated memory is still 383.8MB. Free memory was 307.1MB in the beginning and 305.3MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 590.02ms. Allocated memory was 383.8MB in the beginning and 570.4MB in the end (delta: 186.6MB). Free memory was 305.3MB in the beginning and 520.8MB in the end (delta: -215.4MB). Peak memory consumption was 23.7MB. Max. memory is 16.0GB. * TraceAbstraction took 16477.93ms. Allocated memory was 570.4MB in the beginning and 2.5GB in the end (delta: 1.9GB). Free memory was 519.7MB in the beginning and 1.3GB in the end (delta: -785.0MB). Peak memory consumption was 1.1GB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 268]: Unsoundness Warning unspecified type, defaulting to int C: short [268] - GenericResultAtLocation [Line: 268]: Unsoundness Warning unspecified type, defaulting to int C: short [268] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.6s, 109 PlacesBefore, 30 PlacesAfterwards, 108 TransitionsBefore, 26 TransitionsAfterwards, 1716 CoEnabledTransitionPairs, 6 FixpointIterations, 37 TrivialSequentialCompositions, 45 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 10 ConcurrentYvCompositions, 3 ChoiceCompositions, 95 TotalNumberOfCompositions, 3896 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1868, independent: 1732, independent conditional: 0, independent unconditional: 1732, dependent: 136, dependent conditional: 0, dependent unconditional: 136, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 943, independent: 918, independent conditional: 0, independent unconditional: 918, dependent: 25, dependent conditional: 0, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1868, independent: 814, independent conditional: 0, independent unconditional: 814, dependent: 111, dependent conditional: 0, dependent unconditional: 111, unknown: 943, unknown conditional: 0, unknown unconditional: 943] , Statistics on independence cache: Total cache size (in pairs): 71, Positive cache size: 60, Positive conditional cache size: 0, Positive unconditional cache size: 60, Negative cache size: 11, Negative conditional cache size: 0, Negative unconditional cache size: 11, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.1s, 86 PlacesBefore, 22 PlacesAfterwards, 82 TransitionsBefore, 17 TransitionsAfterwards, 760 CoEnabledTransitionPairs, 6 FixpointIterations, 37 TrivialSequentialCompositions, 24 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 1 ChoiceCompositions, 70 TotalNumberOfCompositions, 1170 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 787, independent: 726, independent conditional: 0, independent unconditional: 726, dependent: 61, dependent conditional: 0, dependent unconditional: 61, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 406, independent: 397, independent conditional: 0, independent unconditional: 397, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 787, independent: 329, independent conditional: 0, independent unconditional: 329, dependent: 52, dependent conditional: 0, dependent unconditional: 52, unknown: 406, unknown conditional: 0, unknown unconditional: 406] , Statistics on independence cache: Total cache size (in pairs): 29, Positive cache size: 24, Positive conditional cache size: 0, Positive unconditional cache size: 24, Negative cache size: 5, Negative conditional cache size: 0, Negative unconditional cache size: 5, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.6s, 133 PlacesBefore, 52 PlacesAfterwards, 128 TransitionsBefore, 44 TransitionsAfterwards, 4148 CoEnabledTransitionPairs, 7 FixpointIterations, 37 TrivialSequentialCompositions, 48 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 10 ConcurrentYvCompositions, 3 ChoiceCompositions, 98 TotalNumberOfCompositions, 16108 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 5354, independent: 5015, independent conditional: 0, independent unconditional: 5015, dependent: 339, dependent conditional: 0, dependent unconditional: 339, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 2059, independent: 2015, independent conditional: 0, independent unconditional: 2015, dependent: 44, dependent conditional: 0, dependent unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 5354, independent: 3000, independent conditional: 0, independent unconditional: 3000, dependent: 295, dependent conditional: 0, dependent unconditional: 295, unknown: 2059, unknown conditional: 0, unknown unconditional: 2059] , Statistics on independence cache: Total cache size (in pairs): 317, Positive cache size: 296, Positive conditional cache size: 0, Positive unconditional cache size: 296, Negative cache size: 21, Negative conditional cache size: 0, Negative unconditional cache size: 21, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p0_EBX = 0; [L715] 0 int __unbuffered_p1_EAX = 0; [L717] 0 int __unbuffered_p1_EBX = 0; [L719] 0 int a = 0; [L720] 0 _Bool main$tmp_guard0; [L721] 0 _Bool main$tmp_guard1; [L723] 0 int x = 0; [L725] 0 int y = 0; [L726] 0 _Bool y$flush_delayed; [L727] 0 int y$mem_tmp; [L728] 0 _Bool y$r_buff0_thd0; [L729] 0 _Bool y$r_buff0_thd1; [L730] 0 _Bool y$r_buff0_thd2; [L731] 0 _Bool y$r_buff1_thd0; [L732] 0 _Bool y$r_buff1_thd1; [L733] 0 _Bool y$r_buff1_thd2; [L734] 0 _Bool y$read_delayed; [L735] 0 int *y$read_delayed_var; [L736] 0 int y$w_buff0; [L737] 0 _Bool y$w_buff0_used; [L738] 0 int y$w_buff1; [L739] 0 _Bool y$w_buff1_used; [L741] 0 int z = 0; [L742] 0 _Bool weak$$choice0; [L743] 0 _Bool weak$$choice2; [L823] 0 pthread_t t835[2]; [L824] 0 int asdf=0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, asdf=0, main$tmp_guard0=0, main$tmp_guard1=0, t835={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L824] COND TRUE 0 asdf<2 [L824] FCALL, FORK 0 pthread_create(&t835[asdf], ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, arg={0:0}, asdf=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t835[asdf], ((void *)0), P0, ((void *)0))=-1, t835={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L824] 0 asdf++ VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, arg={0:0}, asdf=1, main$tmp_guard0=0, main$tmp_guard1=0, t835={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L824] COND TRUE 0 asdf<2 [L824] FCALL, FORK 0 pthread_create(&t835[asdf], ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, arg={0:0}, asdf=1, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t835[asdf], ((void *)0), P0, ((void *)0))=0, t835={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L824] 0 asdf++ VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, arg={0:0}, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, t835={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L824] COND FALSE 0 !(asdf<2) [L825] 0 pthread_t t836[2]; [L826] 0 int asdf=0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, arg={0:0}, asdf=0, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, t835={5:0}, t836={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L826] COND TRUE 0 asdf<2 [L826] FCALL, FORK 0 pthread_create(&t836[asdf], ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, arg={0:0}, asdf=0, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t836[asdf], ((void *)0), P1, ((void *)0))=1, t835={5:0}, t836={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L781] 3 y$w_buff1 = y$w_buff0 [L782] 3 y$w_buff0 = 1 [L783] 3 y$w_buff1_used = y$w_buff0_used [L784] 3 y$w_buff0_used = (_Bool)1 [L785] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L19] COND FALSE 3 !(!expression) [L785] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L786] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L787] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L788] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L789] 3 y$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L826] 0 asdf++ VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, arg={0:0}, asdf=1, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, t835={5:0}, t836={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L826] COND TRUE 0 asdf<2 [L826] FCALL, FORK 0 pthread_create(&t836[asdf], ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, arg={0:0}, asdf=1, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t836[asdf], ((void *)0), P1, ((void *)0))=2, t835={5:0}, t836={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L781] 4 y$w_buff1 = y$w_buff0 [L782] 4 y$w_buff0 = 1 [L783] 4 y$w_buff1_used = y$w_buff0_used [L784] 4 y$w_buff0_used = (_Bool)1 [L785] CALL 4 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L19] COND TRUE 4 !expression [L19] 4 reach_error() VAL [\old(expression)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, arg={0:0}, expression=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=1, y$w_buff1_used=1, y=0, z=0] - UnprovableResult [Line: 19]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 126 locations, 5 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 3.7s, OverallIterations: 2, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.7s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 40 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 24 mSDsluCounter, 1 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 6 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 87 IncrementalHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6 mSolverCounterUnsat, 1 mSDtfsCounter, 87 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=66occurred in iteration=1, InterpolantAutomatonStates: 7, 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.2s InterpolantComputationTime, 21 NumberOfCodeBlocks, 21 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 25 ConstructedInterpolants, 0 QuantifiedInterpolants, 51 SizeOfPredicates, 0 NumberOfNonLiveVariables, 155 ConjunctsInSsa, 3 ConjunctsInUnsatCore, 4 InterpolantComputations, 1 PerfectInterpolantSequences, 0/3 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 7 procedures, 146 locations, 6 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: 10.3s, OverallIterations: 5, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 7.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.7s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 87 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 61 mSDsluCounter, 4 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 18 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 276 IncrementalHoareTripleChecker+Invalid, 294 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 18 mSolverCounterUnsat, 4 mSDtfsCounter, 276 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=153occurred in iteration=4, InterpolantAutomatonStates: 13, 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.2s InterpolantComputationTime, 68 NumberOfCodeBlocks, 68 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 53 ConstructedInterpolants, 0 QuantifiedInterpolants, 159 SizeOfPredicates, 0 NumberOfNonLiveVariables, 156 ConjunctsInSsa, 3 ConjunctsInUnsatCore, 6 InterpolantComputations, 3 PerfectInterpolantSequences, 12/15 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 for thread instance sufficiency with 1 thread instances CFG has 5 procedures, 126 locations, 5 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 2.3s, OverallIterations: 2, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 19 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 9 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 39 IncrementalHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 0 mSDtfsCounter, 39 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=52occurred in iteration=1, InterpolantAutomatonStates: 3, 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, 11 NumberOfCodeBlocks, 11 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 4 ConstructedInterpolants, 0 QuantifiedInterpolants, 6 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 1/1 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-04 05:58:33,691 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...