/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 INSUFFICIENT_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-03 23:33:11,349 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-03 23:33:11,416 INFO L114 SettingsManager]: Loading settings from /storage/repos/CAV22/benchmarks/svcomp-Reach-32bit-Automizer_Default.epf [2023-08-03 23:33:11,419 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-03 23:33:11,420 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-08-03 23:33:11,420 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2023-08-03 23:33:11,420 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-03 23:33:11,439 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-03 23:33:11,439 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-03 23:33:11,440 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-03 23:33:11,440 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-03 23:33:11,440 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-03 23:33:11,441 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-03 23:33:11,441 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-03 23:33:11,441 INFO L153 SettingsManager]: * Use SBE=true [2023-08-03 23:33:11,442 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-03 23:33:11,442 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-03 23:33:11,442 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-03 23:33:11,443 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-03 23:33:11,443 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-03 23:33:11,443 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-03 23:33:11,449 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-03 23:33:11,449 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-03 23:33:11,449 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-03 23:33:11,450 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-03 23:33:11,450 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-03 23:33:11,450 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-03 23:33:11,450 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-03 23:33:11,451 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-03 23:33:11,451 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-03 23:33:11,451 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-03 23:33:11,451 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-03 23:33:11,452 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-03 23:33:11,452 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-03 23:33:11,452 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-03 23:33:11,452 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-03 23:33:11,453 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-03 23:33:11,453 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-08-03 23:33:11,453 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-03 23:33:11,453 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-03 23:33:11,454 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-03 23:33:11,458 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 -> INSUFFICIENT_FIRST [2023-08-03 23:33:11,664 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-03 23:33:11,687 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-03 23:33:11,689 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-03 23:33:11,690 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-03 23:33:11,690 INFO L274 PluginConnector]: CDTParser initialized [2023-08-03 23:33:11,691 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/CAV22/benchmarks/increased_bounds/pthread-wmm_mix031.opt_bound2.i [2023-08-03 23:33:12,807 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-03 23:33:13,043 INFO L384 CDTParser]: Found 1 translation units. [2023-08-03 23:33:13,044 INFO L180 CDTParser]: Scanning /storage/repos/CAV22/benchmarks/increased_bounds/pthread-wmm_mix031.opt_bound2.i [2023-08-03 23:33:13,058 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6986ede7c/0b175caf38e04a10b6de46897fe9c512/FLAG5f42bbbaf [2023-08-03 23:33:13,075 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6986ede7c/0b175caf38e04a10b6de46897fe9c512 [2023-08-03 23:33:13,077 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-03 23:33:13,078 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-03 23:33:13,079 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-03 23:33:13,079 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-03 23:33:13,082 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-03 23:33:13,085 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.08 11:33:13" (1/1) ... [2023-08-03 23:33:13,086 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@66f542af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 11:33:13, skipping insertion in model container [2023-08-03 23:33:13,086 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.08 11:33:13" (1/1) ... [2023-08-03 23:33:13,139 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-03 23:33:13,256 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-03 23:33:13,402 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-03 23:33:13,410 INFO L201 MainTranslator]: Completed pre-run [2023-08-03 23:33:13,423 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-03 23:33:13,445 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [268] [2023-08-03 23:33:13,447 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [268] [2023-08-03 23:33:13,486 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-03 23:33:13,523 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-03 23:33:13,524 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-03 23:33:13,529 INFO L206 MainTranslator]: Completed translation [2023-08-03 23:33:13,531 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 11:33:13 WrapperNode [2023-08-03 23:33:13,532 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-03 23:33:13,533 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-03 23:33:13,533 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-03 23:33:13,533 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-03 23:33:13,539 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 11:33:13" (1/1) ... [2023-08-03 23:33:13,554 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 11:33:13" (1/1) ... [2023-08-03 23:33:13,585 INFO L138 Inliner]: procedures = 175, calls = 49, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 139 [2023-08-03 23:33:13,586 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-03 23:33:13,586 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-03 23:33:13,586 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-03 23:33:13,586 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-03 23:33:13,594 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 11:33:13" (1/1) ... [2023-08-03 23:33:13,594 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 11:33:13" (1/1) ... [2023-08-03 23:33:13,597 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 11:33:13" (1/1) ... [2023-08-03 23:33:13,597 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 11:33:13" (1/1) ... [2023-08-03 23:33:13,604 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 11:33:13" (1/1) ... [2023-08-03 23:33:13,609 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 11:33:13" (1/1) ... [2023-08-03 23:33:13,610 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 11:33:13" (1/1) ... [2023-08-03 23:33:13,612 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 11:33:13" (1/1) ... [2023-08-03 23:33:13,614 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-03 23:33:13,615 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-03 23:33:13,615 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-03 23:33:13,615 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-03 23:33:13,616 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 11:33:13" (1/1) ... [2023-08-03 23:33:13,625 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-03 23:33:13,634 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 23:33:13,654 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-03 23:33:13,685 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-03 23:33:13,709 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-03 23:33:13,710 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-03 23:33:13,710 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-03 23:33:13,710 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-03 23:33:13,710 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-03 23:33:13,711 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-03 23:33:13,711 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-03 23:33:13,712 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-03 23:33:13,712 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-03 23:33:13,712 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-03 23:33:13,712 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-03 23:33:13,712 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-03 23:33:13,712 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-03 23:33:13,714 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-03 23:33:13,870 INFO L236 CfgBuilder]: Building ICFG [2023-08-03 23:33:13,872 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-03 23:33:14,086 INFO L277 CfgBuilder]: Performing block encoding [2023-08-03 23:33:14,224 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-03 23:33:14,225 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2023-08-03 23:33:14,226 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.08 11:33:14 BoogieIcfgContainer [2023-08-03 23:33:14,227 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-03 23:33:14,228 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-03 23:33:14,229 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-03 23:33:14,231 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-03 23:33:14,231 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.08 11:33:13" (1/3) ... [2023-08-03 23:33:14,232 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46650cc9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.08 11:33:14, skipping insertion in model container [2023-08-03 23:33:14,232 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 11:33:13" (2/3) ... [2023-08-03 23:33:14,232 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46650cc9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.08 11:33:14, skipping insertion in model container [2023-08-03 23:33:14,232 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.08 11:33:14" (3/3) ... [2023-08-03 23:33:14,233 INFO L112 eAbstractionObserver]: Analyzing ICFG pthread-wmm_mix031.opt_bound2.i [2023-08-03 23:33:14,239 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-08-03 23:33:14,248 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-03 23:33:14,249 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-08-03 23:33:14,249 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-03 23:33:14,303 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-03 23:33:14,332 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 110 places, 109 transitions, 228 flow [2023-08-03 23:33:14,415 INFO L124 PetriNetUnfolderBase]: 14/227 cut-off events. [2023-08-03 23:33:14,415 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-03 23:33:14,420 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-03 23:33:14,420 INFO L82 GeneralOperation]: Start removeDead. Operand has 110 places, 109 transitions, 228 flow [2023-08-03 23:33:14,423 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 86 places, 82 transitions, 174 flow [2023-08-03 23:33:14,430 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-03 23:33:14,444 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 86 places, 82 transitions, 174 flow [2023-08-03 23:33:14,450 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 86 places, 82 transitions, 174 flow [2023-08-03 23:33:14,450 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 86 places, 82 transitions, 174 flow [2023-08-03 23:33:14,489 INFO L124 PetriNetUnfolderBase]: 2/119 cut-off events. [2023-08-03 23:33:14,489 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-03 23:33:14,490 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-03 23:33:14,491 INFO L119 LiptonReduction]: Number of co-enabled transitions 760 [2023-08-03 23:33:17,311 INFO L134 LiptonReduction]: Checked pairs total: 1200 [2023-08-03 23:33:17,311 INFO L136 LiptonReduction]: Total number of compositions: 70 [2023-08-03 23:33:17,323 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == InUseError ======== [2023-08-03 23:33:17,329 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;@3ecd8811, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-03 23:33:17,329 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2023-08-03 23:33:17,333 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-03 23:33:17,333 INFO L124 PetriNetUnfolderBase]: 0/14 cut-off events. [2023-08-03 23:33:17,333 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-03 23:33:17,333 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 23:33:17,334 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-03 23:33:17,334 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-03 23:33:17,338 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 23:33:17,338 INFO L85 PathProgramCache]: Analyzing trace with hash 430083746, now seen corresponding path program 1 times [2023-08-03 23:33:17,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 23:33:17,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250790027] [2023-08-03 23:33:17,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 23:33:17,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 23:33:17,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 23:33:17,523 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-03 23:33:17,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 23:33:17,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250790027] [2023-08-03 23:33:17,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1250790027] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 23:33:17,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-03 23:33:17,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-03 23:33:17,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256947938] [2023-08-03 23:33:17,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 23:33:17,532 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-03 23:33:17,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 23:33:17,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-03 23:33:17,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-03 23:33:17,566 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 179 [2023-08-03 23:33:17,568 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-03 23:33:17,568 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 23:33:17,568 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 179 [2023-08-03 23:33:17,569 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 23:33:17,617 INFO L124 PetriNetUnfolderBase]: 65/147 cut-off events. [2023-08-03 23:33:17,618 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-03 23:33:17,618 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-03 23:33:17,620 INFO L140 encePairwiseOnDemand]: 176/179 looper letters, 17 selfloop transitions, 2 changer transitions 0/21 dead transitions. [2023-08-03 23:33:17,620 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 24 places, 21 transitions, 90 flow [2023-08-03 23:33:17,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-03 23:33:17,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-03 23:33:17,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 299 transitions. [2023-08-03 23:33:17,631 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5567970204841713 [2023-08-03 23:33:17,632 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 299 transitions. [2023-08-03 23:33:17,632 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 299 transitions. [2023-08-03 23:33:17,633 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 23:33:17,635 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 299 transitions. [2023-08-03 23:33:17,638 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-03 23:33:17,642 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-03 23:33:17,642 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-03 23:33:17,644 INFO L175 Difference]: Start difference. First operand has 22 places, 17 transitions, 44 flow. Second operand 3 states and 299 transitions. [2023-08-03 23:33:17,644 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 24 places, 21 transitions, 90 flow [2023-08-03 23:33:17,646 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 24 places, 21 transitions, 90 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-03 23:33:17,647 INFO L231 Difference]: Finished difference. Result has 25 places, 17 transitions, 52 flow [2023-08-03 23:33:17,649 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-03 23:33:17,651 INFO L281 CegarLoopForPetriNet]: 22 programPoint places, 3 predicate places. [2023-08-03 23:33:17,651 INFO L495 AbstractCegarLoop]: Abstraction has has 25 places, 17 transitions, 52 flow [2023-08-03 23:33:17,652 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-03 23:33:17,652 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 23:33:17,652 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2023-08-03 23:33:17,652 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-03 23:33:17,652 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-03 23:33:17,653 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 23:33:17,653 INFO L85 PathProgramCache]: Analyzing trace with hash 438518743, now seen corresponding path program 1 times [2023-08-03 23:33:17,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 23:33:17,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183378390] [2023-08-03 23:33:17,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 23:33:17,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 23:33:17,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-03 23:33:17,673 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-03 23:33:17,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-03 23:33:17,716 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-03 23:33:17,716 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-03 23:33:17,717 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2023-08-03 23:33:17,721 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 2 remaining) [2023-08-03 23:33:17,721 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-03 23:33:17,721 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2023-08-03 23:33:17,724 INFO L307 ceAbstractionStarter]: Result for error location InUseError was UNSAFE,UNKNOWN (1/2) [2023-08-03 23:33:17,724 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-08-03 23:33:17,724 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-08-03 23:33:17,761 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-03 23:33:17,768 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 134 places, 129 transitions, 282 flow [2023-08-03 23:33:17,827 INFO L124 PetriNetUnfolderBase]: 30/469 cut-off events. [2023-08-03 23:33:17,828 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2023-08-03 23:33:17,830 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-03 23:33:17,830 INFO L82 GeneralOperation]: Start removeDead. Operand has 134 places, 129 transitions, 282 flow [2023-08-03 23:33:17,832 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 110 places, 102 transitions, 228 flow [2023-08-03 23:33:17,832 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-03 23:33:17,833 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 110 places, 102 transitions, 228 flow [2023-08-03 23:33:17,833 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 110 places, 102 transitions, 228 flow [2023-08-03 23:33:17,833 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 110 places, 102 transitions, 228 flow [2023-08-03 23:33:17,863 INFO L124 PetriNetUnfolderBase]: 3/226 cut-off events. [2023-08-03 23:33:17,864 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2023-08-03 23:33:17,866 INFO L83 FinitePrefix]: Finished finitePrefix Result has 259 conditions, 226 events. 3/226 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 587 event pairs, 0 based on Foata normal form. 0/214 useless extension candidates. Maximal degree in co-relation 176. Up to 9 conditions per place. [2023-08-03 23:33:17,870 INFO L119 LiptonReduction]: Number of co-enabled transitions 2236 [2023-08-03 23:33:20,392 INFO L134 LiptonReduction]: Checked pairs total: 8943 [2023-08-03 23:33:20,392 INFO L136 LiptonReduction]: Total number of compositions: 71 [2023-08-03 23:33:20,394 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == InUseError ======== [2023-08-03 23:33:20,395 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;@3ecd8811, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-03 23:33:20,395 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2023-08-03 23:33:20,400 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-03 23:33:20,400 INFO L124 PetriNetUnfolderBase]: 0/39 cut-off events. [2023-08-03 23:33:20,400 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-08-03 23:33:20,400 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 23:33:20,400 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1] [2023-08-03 23:33:20,400 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-03 23:33:20,401 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 23:33:20,401 INFO L85 PathProgramCache]: Analyzing trace with hash -1416553094, now seen corresponding path program 1 times [2023-08-03 23:33:20,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 23:33:20,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213351617] [2023-08-03 23:33:20,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 23:33:20,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 23:33:20,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 23:33:20,452 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-08-03 23:33:20,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 23:33:20,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213351617] [2023-08-03 23:33:20,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1213351617] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 23:33:20,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-03 23:33:20,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-03 23:33:20,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402345489] [2023-08-03 23:33:20,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 23:33:20,453 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-03 23:33:20,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 23:33:20,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-03 23:33:20,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-03 23:33:20,471 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 200 [2023-08-03 23:33:20,472 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 37 transitions, 98 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-03 23:33:20,472 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 23:33:20,472 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 200 [2023-08-03 23:33:20,472 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 23:33:21,066 INFO L124 PetriNetUnfolderBase]: 2993/4950 cut-off events. [2023-08-03 23:33:21,066 INFO L125 PetriNetUnfolderBase]: For 368/368 co-relation queries the response was YES. [2023-08-03 23:33:21,076 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9721 conditions, 4950 events. 2993/4950 cut-off events. For 368/368 co-relation queries the response was YES. Maximal size of possible extension queue 293. Compared 33171 event pairs, 2036 based on Foata normal form. 0/4326 useless extension candidates. Maximal degree in co-relation 2134. Up to 4270 conditions per place. [2023-08-03 23:33:21,098 INFO L140 encePairwiseOnDemand]: 197/200 looper letters, 26 selfloop transitions, 2 changer transitions 0/42 dead transitions. [2023-08-03 23:33:21,099 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 42 transitions, 164 flow [2023-08-03 23:33:21,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-03 23:33:21,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-03 23:33:21,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 350 transitions. [2023-08-03 23:33:21,104 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5833333333333334 [2023-08-03 23:33:21,104 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 350 transitions. [2023-08-03 23:33:21,104 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 350 transitions. [2023-08-03 23:33:21,106 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 23:33:21,106 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 350 transitions. [2023-08-03 23:33:21,108 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 116.66666666666667) internal successors, (350), 3 states have internal predecessors, (350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 23:33:21,111 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 200.0) internal successors, (800), 4 states have internal predecessors, (800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 23:33:21,111 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 200.0) internal successors, (800), 4 states have internal predecessors, (800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 23:33:21,111 INFO L175 Difference]: Start difference. First operand has 46 places, 37 transitions, 98 flow. Second operand 3 states and 350 transitions. [2023-08-03 23:33:21,111 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 42 transitions, 164 flow [2023-08-03 23:33:21,115 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 42 transitions, 160 flow, removed 2 selfloop flow, removed 0 redundant places. [2023-08-03 23:33:21,116 INFO L231 Difference]: Finished difference. Result has 49 places, 38 transitions, 106 flow [2023-08-03 23:33:21,116 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=106, PETRI_PLACES=49, PETRI_TRANSITIONS=38} [2023-08-03 23:33:21,117 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 3 predicate places. [2023-08-03 23:33:21,117 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 38 transitions, 106 flow [2023-08-03 23:33:21,117 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-03 23:33:21,117 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 23:33:21,118 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1] [2023-08-03 23:33:21,118 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-03 23:33:21,118 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-03 23:33:21,118 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 23:33:21,118 INFO L85 PathProgramCache]: Analyzing trace with hash -1849014701, now seen corresponding path program 1 times [2023-08-03 23:33:21,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 23:33:21,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091872823] [2023-08-03 23:33:21,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 23:33:21,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 23:33:21,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 23:33:21,241 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-03 23:33:21,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 23:33:21,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091872823] [2023-08-03 23:33:21,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2091872823] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 23:33:21,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1687067565] [2023-08-03 23:33:21,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 23:33:21,243 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 23:33:21,243 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 23:33:21,251 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-03 23:33:21,273 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-08-03 23:33:21,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 23:33:21,334 INFO L262 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-03 23:33:21,336 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 23:33:21,372 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-03 23:33:21,373 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-03 23:33:21,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1687067565] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 23:33:21,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-03 23:33:21,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2023-08-03 23:33:21,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404846029] [2023-08-03 23:33:21,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 23:33:21,374 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-03 23:33:21,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 23:33:21,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-03 23:33:21,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-08-03 23:33:21,389 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 200 [2023-08-03 23:33:21,390 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 38 transitions, 106 flow. Second operand has 5 states, 5 states have (on average 107.6) internal successors, (538), 5 states have internal predecessors, (538), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 23:33:21,390 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 23:33:21,390 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 200 [2023-08-03 23:33:21,390 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 23:33:21,894 INFO L124 PetriNetUnfolderBase]: 2969/4856 cut-off events. [2023-08-03 23:33:21,895 INFO L125 PetriNetUnfolderBase]: For 311/311 co-relation queries the response was YES. [2023-08-03 23:33:21,905 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9558 conditions, 4856 events. 2969/4856 cut-off events. For 311/311 co-relation queries the response was YES. Maximal size of possible extension queue 291. Compared 32039 event pairs, 1778 based on Foata normal form. 16/4258 useless extension candidates. Maximal degree in co-relation 6976. Up to 4187 conditions per place. [2023-08-03 23:33:21,927 INFO L140 encePairwiseOnDemand]: 196/200 looper letters, 31 selfloop transitions, 4 changer transitions 0/48 dead transitions. [2023-08-03 23:33:21,927 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 48 transitions, 196 flow [2023-08-03 23:33:21,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-03 23:33:21,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-03 23:33:21,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 566 transitions. [2023-08-03 23:33:21,930 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.566 [2023-08-03 23:33:21,930 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 566 transitions. [2023-08-03 23:33:21,930 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 566 transitions. [2023-08-03 23:33:21,930 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 23:33:21,930 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 566 transitions. [2023-08-03 23:33:21,932 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 113.2) internal successors, (566), 5 states have internal predecessors, (566), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 23:33:21,933 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 200.0) internal successors, (1200), 6 states have internal predecessors, (1200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 23:33:21,934 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 200.0) internal successors, (1200), 6 states have internal predecessors, (1200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 23:33:21,934 INFO L175 Difference]: Start difference. First operand has 49 places, 38 transitions, 106 flow. Second operand 5 states and 566 transitions. [2023-08-03 23:33:21,934 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 48 transitions, 196 flow [2023-08-03 23:33:21,935 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 48 transitions, 193 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-03 23:33:21,936 INFO L231 Difference]: Finished difference. Result has 52 places, 38 transitions, 120 flow [2023-08-03 23:33:21,936 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=99, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=120, PETRI_PLACES=52, PETRI_TRANSITIONS=38} [2023-08-03 23:33:21,938 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 6 predicate places. [2023-08-03 23:33:21,939 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 38 transitions, 120 flow [2023-08-03 23:33:21,939 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 107.6) internal successors, (538), 5 states have internal predecessors, (538), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 23:33:21,939 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 23:33:21,939 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 23:33:21,948 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-08-03 23:33:22,144 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 23:33:22,145 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-03 23:33:22,145 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 23:33:22,145 INFO L85 PathProgramCache]: Analyzing trace with hash -355821715, now seen corresponding path program 1 times [2023-08-03 23:33:22,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 23:33:22,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248088392] [2023-08-03 23:33:22,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 23:33:22,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 23:33:22,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 23:33:22,199 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-08-03 23:33:22,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 23:33:22,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248088392] [2023-08-03 23:33:22,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1248088392] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 23:33:22,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1139260143] [2023-08-03 23:33:22,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 23:33:22,200 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 23:33:22,200 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 23:33:22,201 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-03 23:33:22,225 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-03 23:33:22,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 23:33:22,292 INFO L262 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-03 23:33:22,293 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 23:33:22,311 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-08-03 23:33:22,311 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-03 23:33:22,334 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-08-03 23:33:22,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1139260143] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-03 23:33:22,335 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-03 23:33:22,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2023-08-03 23:33:22,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129415252] [2023-08-03 23:33:22,335 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-03 23:33:22,336 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-03 23:33:22,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 23:33:22,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-03 23:33:22,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-03 23:33:22,349 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 200 [2023-08-03 23:33:22,350 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 38 transitions, 120 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-03 23:33:22,350 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 23:33:22,350 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 200 [2023-08-03 23:33:22,350 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 23:33:22,798 INFO L124 PetriNetUnfolderBase]: 2530/4163 cut-off events. [2023-08-03 23:33:22,798 INFO L125 PetriNetUnfolderBase]: For 364/364 co-relation queries the response was YES. [2023-08-03 23:33:22,807 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8169 conditions, 4163 events. 2530/4163 cut-off events. For 364/364 co-relation queries the response was YES. Maximal size of possible extension queue 260. Compared 27004 event pairs, 1512 based on Foata normal form. 4/3699 useless extension candidates. Maximal degree in co-relation 2148. Up to 3505 conditions per place. [2023-08-03 23:33:22,826 INFO L140 encePairwiseOnDemand]: 197/200 looper letters, 31 selfloop transitions, 3 changer transitions 0/47 dead transitions. [2023-08-03 23:33:22,826 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 47 transitions, 202 flow [2023-08-03 23:33:22,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-03 23:33:22,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-03 23:33:22,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 459 transitions. [2023-08-03 23:33:22,828 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.57375 [2023-08-03 23:33:22,828 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 459 transitions. [2023-08-03 23:33:22,828 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 459 transitions. [2023-08-03 23:33:22,828 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 23:33:22,829 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 459 transitions. [2023-08-03 23:33:22,830 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 114.75) internal successors, (459), 4 states have internal predecessors, (459), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 23:33:22,832 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 200.0) internal successors, (1000), 5 states have internal predecessors, (1000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 23:33:22,832 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 200.0) internal successors, (1000), 5 states have internal predecessors, (1000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 23:33:22,832 INFO L175 Difference]: Start difference. First operand has 52 places, 38 transitions, 120 flow. Second operand 4 states and 459 transitions. [2023-08-03 23:33:22,832 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 47 transitions, 202 flow [2023-08-03 23:33:22,835 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 47 transitions, 197 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-08-03 23:33:22,836 INFO L231 Difference]: Finished difference. Result has 53 places, 37 transitions, 113 flow [2023-08-03 23:33:22,836 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=107, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=113, PETRI_PLACES=53, PETRI_TRANSITIONS=37} [2023-08-03 23:33:22,838 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 7 predicate places. [2023-08-03 23:33:22,838 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 37 transitions, 113 flow [2023-08-03 23:33:22,839 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-03 23:33:22,839 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 23:33:22,839 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 23:33:22,852 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-03 23:33:23,044 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 23:33:23,045 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-03 23:33:23,045 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 23:33:23,045 INFO L85 PathProgramCache]: Analyzing trace with hash 820286113, now seen corresponding path program 1 times [2023-08-03 23:33:23,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 23:33:23,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111728210] [2023-08-03 23:33:23,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 23:33:23,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 23:33:23,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 23:33:23,092 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-03 23:33:23,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 23:33:23,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111728210] [2023-08-03 23:33:23,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1111728210] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 23:33:23,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [252706383] [2023-08-03 23:33:23,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 23:33:23,093 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 23:33:23,093 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 23:33:23,095 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-03 23:33:23,109 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-08-03 23:33:23,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 23:33:23,178 INFO L262 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-03 23:33:23,178 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 23:33:23,192 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-03 23:33:23,192 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-03 23:33:23,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [252706383] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 23:33:23,192 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-03 23:33:23,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2023-08-03 23:33:23,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93610309] [2023-08-03 23:33:23,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 23:33:23,193 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-03 23:33:23,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 23:33:23,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-03 23:33:23,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-08-03 23:33:23,203 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 200 [2023-08-03 23:33:23,204 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 37 transitions, 113 flow. Second operand has 4 states, 4 states have (on average 109.5) internal successors, (438), 4 states have internal predecessors, (438), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 23:33:23,204 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 23:33:23,204 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 200 [2023-08-03 23:33:23,204 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 23:33:23,487 INFO L124 PetriNetUnfolderBase]: 1290/2254 cut-off events. [2023-08-03 23:33:23,487 INFO L125 PetriNetUnfolderBase]: For 309/309 co-relation queries the response was YES. [2023-08-03 23:33:23,491 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4560 conditions, 2254 events. 1290/2254 cut-off events. For 309/309 co-relation queries the response was YES. Maximal size of possible extension queue 146. Compared 13464 event pairs, 202 based on Foata normal form. 400/2394 useless extension candidates. Maximal degree in co-relation 2077. Up to 1584 conditions per place. [2023-08-03 23:33:23,492 INFO L140 encePairwiseOnDemand]: 198/200 looper letters, 0 selfloop transitions, 0 changer transitions 52/52 dead transitions. [2023-08-03 23:33:23,492 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 52 transitions, 221 flow [2023-08-03 23:33:23,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-03 23:33:23,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-03 23:33:23,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 468 transitions. [2023-08-03 23:33:23,494 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.585 [2023-08-03 23:33:23,494 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 468 transitions. [2023-08-03 23:33:23,494 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 468 transitions. [2023-08-03 23:33:23,495 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 23:33:23,495 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 468 transitions. [2023-08-03 23:33:23,496 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 117.0) internal successors, (468), 4 states have internal predecessors, (468), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 23:33:23,497 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 200.0) internal successors, (1000), 5 states have internal predecessors, (1000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 23:33:23,498 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 200.0) internal successors, (1000), 5 states have internal predecessors, (1000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 23:33:23,498 INFO L175 Difference]: Start difference. First operand has 53 places, 37 transitions, 113 flow. Second operand 4 states and 468 transitions. [2023-08-03 23:33:23,498 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 52 transitions, 221 flow [2023-08-03 23:33:23,501 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 52 transitions, 214 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-03 23:33:23,501 INFO L231 Difference]: Finished difference. Result has 51 places, 0 transitions, 0 flow [2023-08-03 23:33:23,501 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=0, PETRI_PLACES=51, PETRI_TRANSITIONS=0} [2023-08-03 23:33:23,502 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 5 predicate places. [2023-08-03 23:33:23,502 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 0 transitions, 0 flow [2023-08-03 23:33:23,502 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 109.5) internal successors, (438), 4 states have internal predecessors, (438), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 23:33:23,502 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2023-08-03 23:33:23,503 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 2 remaining) [2023-08-03 23:33:23,511 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-08-03 23:33:23,708 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 23:33:23,709 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2023-08-03 23:33:23,709 INFO L307 ceAbstractionStarter]: Result for error location InUseError was SAFE,SAFE (1/2) [2023-08-03 23:33:23,712 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 134 places, 129 transitions, 282 flow [2023-08-03 23:33:23,742 INFO L124 PetriNetUnfolderBase]: 30/469 cut-off events. [2023-08-03 23:33:23,742 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2023-08-03 23:33:23,743 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-03 23:33:23,744 INFO L82 GeneralOperation]: Start removeDead. Operand has 134 places, 129 transitions, 282 flow [2023-08-03 23:33:23,745 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 133 places, 128 transitions, 276 flow [2023-08-03 23:33:23,745 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-03 23:33:23,745 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 133 places, 128 transitions, 276 flow [2023-08-03 23:33:23,746 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 133 places, 128 transitions, 276 flow [2023-08-03 23:33:23,746 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 133 places, 128 transitions, 276 flow [2023-08-03 23:33:23,776 INFO L124 PetriNetUnfolderBase]: 30/468 cut-off events. [2023-08-03 23:33:23,776 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2023-08-03 23:33:23,777 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-03 23:33:23,782 INFO L119 LiptonReduction]: Number of co-enabled transitions 4148 [2023-08-03 23:33:26,474 INFO L134 LiptonReduction]: Checked pairs total: 14674 [2023-08-03 23:33:26,475 INFO L136 LiptonReduction]: Total number of compositions: 98 [2023-08-03 23:33:26,476 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-03 23:33:26,477 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;@3ecd8811, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-03 23:33:26,477 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2023-08-03 23:33:26,485 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-03 23:33:26,485 INFO L124 PetriNetUnfolderBase]: 1/13 cut-off events. [2023-08-03 23:33:26,485 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-03 23:33:26,485 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 23:33:26,485 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-03 23:33:26,486 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-03 23:33:26,486 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 23:33:26,486 INFO L85 PathProgramCache]: Analyzing trace with hash 733175701, now seen corresponding path program 1 times [2023-08-03 23:33:26,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 23:33:26,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764215521] [2023-08-03 23:33:26,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 23:33:26,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 23:33:26,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 23:33:26,508 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-03 23:33:26,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 23:33:26,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764215521] [2023-08-03 23:33:26,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [764215521] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 23:33:26,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-03 23:33:26,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-03 23:33:26,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823996963] [2023-08-03 23:33:26,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 23:33:26,509 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-03 23:33:26,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 23:33:26,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-03 23:33:26,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-03 23:33:26,517 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 227 [2023-08-03 23:33:26,518 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-03 23:33:26,518 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 23:33:26,518 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 227 [2023-08-03 23:33:26,518 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 23:33:28,241 INFO L124 PetriNetUnfolderBase]: 15012/23337 cut-off events. [2023-08-03 23:33:28,242 INFO L125 PetriNetUnfolderBase]: For 364/364 co-relation queries the response was YES. [2023-08-03 23:33:28,276 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44459 conditions, 23337 events. 15012/23337 cut-off events. For 364/364 co-relation queries the response was YES. Maximal size of possible extension queue 1079. Compared 171873 event pairs, 10800 based on Foata normal form. 620/19653 useless extension candidates. Maximal degree in co-relation 9784. Up to 20629 conditions per place. [2023-08-03 23:33:28,343 INFO L140 encePairwiseOnDemand]: 223/227 looper letters, 33 selfloop transitions, 2 changer transitions 0/48 dead transitions. [2023-08-03 23:33:28,343 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 48 transitions, 186 flow [2023-08-03 23:33:28,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-03 23:33:28,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-03 23:33:28,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 358 transitions. [2023-08-03 23:33:28,345 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5256975036710719 [2023-08-03 23:33:28,345 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 358 transitions. [2023-08-03 23:33:28,345 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 358 transitions. [2023-08-03 23:33:28,345 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 23:33:28,345 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 358 transitions. [2023-08-03 23:33:28,348 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-03 23:33:28,349 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-03 23:33:28,349 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-03 23:33:28,349 INFO L175 Difference]: Start difference. First operand has 52 places, 44 transitions, 108 flow. Second operand 3 states and 358 transitions. [2023-08-03 23:33:28,349 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 48 transitions, 186 flow [2023-08-03 23:33:28,351 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 48 transitions, 184 flow, removed 1 selfloop flow, removed 0 redundant places. [2023-08-03 23:33:28,352 INFO L231 Difference]: Finished difference. Result has 55 places, 44 transitions, 116 flow [2023-08-03 23:33:28,352 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-03 23:33:28,353 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 3 predicate places. [2023-08-03 23:33:28,353 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 44 transitions, 116 flow [2023-08-03 23:33:28,353 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-03 23:33:28,353 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 23:33:28,353 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 23:33:28,353 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-03 23:33:28,354 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-03 23:33:28,354 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 23:33:28,354 INFO L85 PathProgramCache]: Analyzing trace with hash -380353872, now seen corresponding path program 1 times [2023-08-03 23:33:28,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 23:33:28,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752579235] [2023-08-03 23:33:28,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 23:33:28,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 23:33:28,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 23:33:28,394 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-03 23:33:28,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 23:33:28,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752579235] [2023-08-03 23:33:28,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [752579235] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 23:33:28,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [966440055] [2023-08-03 23:33:28,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 23:33:28,395 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 23:33:28,395 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 23:33:28,396 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-03 23:33:28,398 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-08-03 23:33:28,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 23:33:28,472 INFO L262 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-03 23:33:28,473 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 23:33:28,483 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-03 23:33:28,483 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-03 23:33:28,494 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-03 23:33:28,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [966440055] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-03 23:33:28,495 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-03 23:33:28,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2023-08-03 23:33:28,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083155919] [2023-08-03 23:33:28,495 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-03 23:33:28,495 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-03 23:33:28,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 23:33:28,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-03 23:33:28,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-03 23:33:28,508 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 227 [2023-08-03 23:33:28,509 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-03 23:33:28,509 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 23:33:28,509 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 227 [2023-08-03 23:33:28,509 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 23:33:30,092 INFO L124 PetriNetUnfolderBase]: 12690/19378 cut-off events. [2023-08-03 23:33:30,092 INFO L125 PetriNetUnfolderBase]: For 236/236 co-relation queries the response was YES. [2023-08-03 23:33:30,113 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36977 conditions, 19378 events. 12690/19378 cut-off events. For 236/236 co-relation queries the response was YES. Maximal size of possible extension queue 953. Compared 136893 event pairs, 5982 based on Foata normal form. 4/16020 useless extension candidates. Maximal degree in co-relation 27139. Up to 17113 conditions per place. [2023-08-03 23:33:30,167 INFO L140 encePairwiseOnDemand]: 223/227 looper letters, 38 selfloop transitions, 3 changer transitions 1/55 dead transitions. [2023-08-03 23:33:30,167 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 55 transitions, 222 flow [2023-08-03 23:33:30,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-03 23:33:30,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-03 23:33:30,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 467 transitions. [2023-08-03 23:33:30,169 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.51431718061674 [2023-08-03 23:33:30,169 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 467 transitions. [2023-08-03 23:33:30,169 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 467 transitions. [2023-08-03 23:33:30,169 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 23:33:30,169 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 467 transitions. [2023-08-03 23:33:30,171 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-03 23:33:30,173 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-03 23:33:30,173 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-03 23:33:30,173 INFO L175 Difference]: Start difference. First operand has 55 places, 44 transitions, 116 flow. Second operand 4 states and 467 transitions. [2023-08-03 23:33:30,173 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 55 transitions, 222 flow [2023-08-03 23:33:30,174 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 55 transitions, 220 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-03 23:33:30,175 INFO L231 Difference]: Finished difference. Result has 59 places, 44 transitions, 128 flow [2023-08-03 23:33:30,175 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-03 23:33:30,179 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 7 predicate places. [2023-08-03 23:33:30,179 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 44 transitions, 128 flow [2023-08-03 23:33:30,179 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-03 23:33:30,179 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 23:33:30,179 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 23:33:30,187 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-08-03 23:33:30,384 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 23:33:30,385 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-03 23:33:30,385 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 23:33:30,385 INFO L85 PathProgramCache]: Analyzing trace with hash -1943118964, now seen corresponding path program 1 times [2023-08-03 23:33:30,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 23:33:30,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479213863] [2023-08-03 23:33:30,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 23:33:30,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 23:33:30,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 23:33:30,500 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-03 23:33:30,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 23:33:30,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479213863] [2023-08-03 23:33:30,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1479213863] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 23:33:30,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-03 23:33:30,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-03 23:33:30,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738915972] [2023-08-03 23:33:30,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 23:33:30,502 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-03 23:33:30,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 23:33:30,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-03 23:33:30,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-03 23:33:30,504 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 227 [2023-08-03 23:33:30,504 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-03 23:33:30,504 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 23:33:30,504 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 227 [2023-08-03 23:33:30,505 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 23:33:31,799 INFO L124 PetriNetUnfolderBase]: 10842/16986 cut-off events. [2023-08-03 23:33:31,800 INFO L125 PetriNetUnfolderBase]: For 344/344 co-relation queries the response was YES. [2023-08-03 23:33:31,820 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 121837 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-03 23:33:31,853 INFO L140 encePairwiseOnDemand]: 222/227 looper letters, 45 selfloop transitions, 3 changer transitions 0/61 dead transitions. [2023-08-03 23:33:31,854 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 61 transitions, 263 flow [2023-08-03 23:33:31,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-03 23:33:31,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-03 23:33:31,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 379 transitions. [2023-08-03 23:33:31,855 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5565345080763583 [2023-08-03 23:33:31,855 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 379 transitions. [2023-08-03 23:33:31,856 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 379 transitions. [2023-08-03 23:33:31,857 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 23:33:31,857 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 379 transitions. [2023-08-03 23:33:31,858 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-03 23:33:31,859 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-03 23:33:31,859 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-03 23:33:31,859 INFO L175 Difference]: Start difference. First operand has 59 places, 44 transitions, 128 flow. Second operand 3 states and 379 transitions. [2023-08-03 23:33:31,860 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 61 transitions, 263 flow [2023-08-03 23:33:31,861 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 61 transitions, 256 flow, removed 1 selfloop flow, removed 3 redundant places. [2023-08-03 23:33:31,863 INFO L231 Difference]: Finished difference. Result has 59 places, 46 transitions, 142 flow [2023-08-03 23:33:31,863 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-03 23:33:31,865 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 7 predicate places. [2023-08-03 23:33:31,865 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 46 transitions, 142 flow [2023-08-03 23:33:31,866 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-03 23:33:31,866 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 23:33:31,866 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 23:33:31,866 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-03 23:33:31,866 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-03 23:33:31,866 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 23:33:31,867 INFO L85 PathProgramCache]: Analyzing trace with hash -106722588, now seen corresponding path program 1 times [2023-08-03 23:33:31,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 23:33:31,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883586031] [2023-08-03 23:33:31,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 23:33:31,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 23:33:31,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 23:33:31,907 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-03 23:33:31,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 23:33:31,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883586031] [2023-08-03 23:33:31,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [883586031] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 23:33:31,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-03 23:33:31,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-03 23:33:31,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071316613] [2023-08-03 23:33:31,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 23:33:31,908 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-03 23:33:31,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 23:33:31,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-03 23:33:31,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-03 23:33:31,917 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 227 [2023-08-03 23:33:31,917 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-03 23:33:31,918 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 23:33:31,918 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 227 [2023-08-03 23:33:31,918 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 23:33:33,334 INFO L124 PetriNetUnfolderBase]: 10698/16030 cut-off events. [2023-08-03 23:33:33,334 INFO L125 PetriNetUnfolderBase]: For 1289/1289 co-relation queries the response was YES. [2023-08-03 23:33:33,350 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33517 conditions, 16030 events. 10698/16030 cut-off events. For 1289/1289 co-relation queries the response was YES. Maximal size of possible extension queue 857. Compared 110636 event pairs, 8154 based on Foata normal form. 0/13586 useless extension candidates. Maximal degree in co-relation 15757. Up to 14281 conditions per place. [2023-08-03 23:33:33,376 INFO L140 encePairwiseOnDemand]: 223/227 looper letters, 42 selfloop transitions, 2 changer transitions 0/57 dead transitions. [2023-08-03 23:33:33,376 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 57 transitions, 255 flow [2023-08-03 23:33:33,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-03 23:33:33,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-03 23:33:33,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 364 transitions. [2023-08-03 23:33:33,377 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5345080763582967 [2023-08-03 23:33:33,377 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 364 transitions. [2023-08-03 23:33:33,377 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 364 transitions. [2023-08-03 23:33:33,378 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 23:33:33,378 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 364 transitions. [2023-08-03 23:33:33,378 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-03 23:33:33,379 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-03 23:33:33,380 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-03 23:33:33,380 INFO L175 Difference]: Start difference. First operand has 59 places, 46 transitions, 142 flow. Second operand 3 states and 364 transitions. [2023-08-03 23:33:33,380 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 57 transitions, 255 flow [2023-08-03 23:33:33,381 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 57 transitions, 251 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-03 23:33:33,382 INFO L231 Difference]: Finished difference. Result has 61 places, 47 transitions, 153 flow [2023-08-03 23:33:33,382 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-03 23:33:33,382 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 9 predicate places. [2023-08-03 23:33:33,382 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 47 transitions, 153 flow [2023-08-03 23:33:33,383 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-03 23:33:33,383 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 23:33:33,383 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 23:33:33,383 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-03 23:33:33,383 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-03 23:33:33,383 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 23:33:33,383 INFO L85 PathProgramCache]: Analyzing trace with hash 891993983, now seen corresponding path program 1 times [2023-08-03 23:33:33,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 23:33:33,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712954475] [2023-08-03 23:33:33,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 23:33:33,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 23:33:33,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-03 23:33:33,419 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-03 23:33:33,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-03 23:33:33,451 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-03 23:33:33,451 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-03 23:33:33,452 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2023-08-03 23:33:33,452 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 4 remaining) [2023-08-03 23:33:33,452 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 4 remaining) [2023-08-03 23:33:33,452 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 4 remaining) [2023-08-03 23:33:33,452 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-03 23:33:33,452 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2023-08-03 23:33:33,453 INFO L307 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was UNSAFE,UNKNOWN,UNKNOWN,UNKNOWN (2/2) [2023-08-03 23:33:33,456 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 2 thread instances [2023-08-03 23:33:33,456 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-03 23:33:33,502 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.08 11:33:33 BasicIcfg [2023-08-03 23:33:33,503 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-03 23:33:33,503 INFO L158 Benchmark]: Toolchain (without parser) took 20425.00ms. Allocated memory was 511.7MB in the beginning and 2.0GB in the end (delta: 1.5GB). Free memory was 461.8MB in the beginning and 1.6GB in the end (delta: -1.1GB). Peak memory consumption was 440.8MB. Max. memory is 16.0GB. [2023-08-03 23:33:33,503 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 356.5MB. Free memory was 307.8MB in the beginning and 307.7MB in the end (delta: 160.9kB). There was no memory consumed. Max. memory is 16.0GB. [2023-08-03 23:33:33,504 INFO L158 Benchmark]: CACSL2BoogieTranslator took 453.13ms. Allocated memory is still 511.7MB. Free memory was 461.8MB in the beginning and 439.0MB in the end (delta: 22.7MB). Peak memory consumption was 21.0MB. Max. memory is 16.0GB. [2023-08-03 23:33:33,504 INFO L158 Benchmark]: Boogie Procedure Inliner took 52.74ms. Allocated memory is still 511.7MB. Free memory was 439.0MB in the beginning and 436.6MB in the end (delta: 2.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. [2023-08-03 23:33:33,504 INFO L158 Benchmark]: Boogie Preprocessor took 28.18ms. Allocated memory is still 511.7MB. Free memory was 436.6MB in the beginning and 434.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-03 23:33:33,504 INFO L158 Benchmark]: RCFGBuilder took 611.63ms. Allocated memory is still 511.7MB. Free memory was 434.5MB in the beginning and 462.6MB in the end (delta: -28.1MB). Peak memory consumption was 19.4MB. Max. memory is 16.0GB. [2023-08-03 23:33:33,505 INFO L158 Benchmark]: TraceAbstraction took 19274.24ms. Allocated memory was 511.7MB in the beginning and 2.0GB in the end (delta: 1.5GB). Free memory was 461.6MB in the beginning and 1.6GB in the end (delta: -1.1GB). Peak memory consumption was 440.3MB. Max. memory is 16.0GB. [2023-08-03 23:33:33,506 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.10ms. Allocated memory is still 356.5MB. Free memory was 307.8MB in the beginning and 307.7MB in the end (delta: 160.9kB). There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 453.13ms. Allocated memory is still 511.7MB. Free memory was 461.8MB in the beginning and 439.0MB in the end (delta: 22.7MB). Peak memory consumption was 21.0MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 52.74ms. Allocated memory is still 511.7MB. Free memory was 439.0MB in the beginning and 436.6MB in the end (delta: 2.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. * Boogie Preprocessor took 28.18ms. Allocated memory is still 511.7MB. Free memory was 436.6MB in the beginning and 434.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 611.63ms. Allocated memory is still 511.7MB. Free memory was 434.5MB in the beginning and 462.6MB in the end (delta: -28.1MB). Peak memory consumption was 19.4MB. Max. memory is 16.0GB. * TraceAbstraction took 19274.24ms. Allocated memory was 511.7MB in the beginning and 2.0GB in the end (delta: 1.5GB). Free memory was 461.6MB in the beginning and 1.6GB in the end (delta: -1.1GB). Peak memory consumption was 440.3MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 268]: Unsoundness Warning unspecified type, defaulting to int C: short [268] - GenericResultAtLocation [Line: 268]: Unsoundness Warning unspecified type, defaulting to int C: short [268] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.9s, 86 PlacesBefore, 22 PlacesAfterwards, 82 TransitionsBefore, 17 TransitionsAfterwards, 760 CoEnabledTransitionPairs, 7 FixpointIterations, 37 TrivialSequentialCompositions, 24 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 1 ChoiceCompositions, 70 TotalNumberOfCompositions, 1200 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 841, independent: 772, independent conditional: 0, independent unconditional: 772, dependent: 69, dependent conditional: 0, dependent unconditional: 69, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 398, independent: 390, independent conditional: 0, independent unconditional: 390, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 841, independent: 382, independent conditional: 0, independent unconditional: 382, dependent: 61, dependent conditional: 0, dependent unconditional: 61, unknown: 398, unknown conditional: 0, unknown unconditional: 398] , Statistics on independence cache: Total cache size (in pairs): 27, Positive cache size: 23, Positive conditional cache size: 0, Positive unconditional cache size: 23, Negative cache size: 4, Negative conditional cache size: 0, Negative unconditional cache size: 4, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.6s, 110 PlacesBefore, 46 PlacesAfterwards, 102 TransitionsBefore, 37 TransitionsAfterwards, 2236 CoEnabledTransitionPairs, 6 FixpointIterations, 37 TrivialSequentialCompositions, 25 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 1 ChoiceCompositions, 71 TotalNumberOfCompositions, 8943 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3456, independent: 3202, independent conditional: 0, independent unconditional: 3202, dependent: 254, dependent conditional: 0, dependent unconditional: 254, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1068, independent: 1038, independent conditional: 0, independent unconditional: 1038, dependent: 30, dependent conditional: 0, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3456, independent: 2164, independent conditional: 0, independent unconditional: 2164, dependent: 224, dependent conditional: 0, dependent unconditional: 224, unknown: 1068, unknown conditional: 0, unknown unconditional: 1068] , Statistics on independence cache: Total cache size (in pairs): 228, Positive cache size: 210, Positive conditional cache size: 0, Positive unconditional cache size: 210, Negative cache size: 18, Negative conditional cache size: 0, Negative unconditional cache size: 18, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.7s, 133 PlacesBefore, 52 PlacesAfterwards, 128 TransitionsBefore, 44 TransitionsAfterwards, 4148 CoEnabledTransitionPairs, 6 FixpointIterations, 37 TrivialSequentialCompositions, 47 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 11 ConcurrentYvCompositions, 3 ChoiceCompositions, 98 TotalNumberOfCompositions, 14674 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 5008, independent: 4713, independent conditional: 0, independent unconditional: 4713, dependent: 295, dependent conditional: 0, dependent unconditional: 295, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 2001, independent: 1955, independent conditional: 0, independent unconditional: 1955, dependent: 46, dependent conditional: 0, dependent unconditional: 46, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 5008, independent: 2758, independent conditional: 0, independent unconditional: 2758, dependent: 249, dependent conditional: 0, dependent unconditional: 249, unknown: 2001, unknown conditional: 0, unknown unconditional: 2001] , Statistics on independence cache: Total cache size (in pairs): 264, Positive cache size: 242, Positive conditional cache size: 0, Positive unconditional cache size: 242, Negative cache size: 22, Negative conditional cache size: 0, Negative unconditional cache size: 22, 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))=-4, 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))=-3, 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))=-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=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))=-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=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 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: 3.4s, OverallIterations: 2, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.0s, 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.1s 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 - StatisticsResult: Ultimate Automizer benchmark data for thread instance sufficiency 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: 5.9s, OverallIterations: 4, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.6s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 125 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 94 mSDsluCounter, 2 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 11 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 297 IncrementalHoareTripleChecker+Invalid, 308 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 11 mSolverCounterUnsat, 2 mSDtfsCounter, 297 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 63 GetRequests, 50 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=120occurred in iteration=2, InterpolantAutomatonStates: 16, 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.3s InterpolantComputationTime, 91 NumberOfCodeBlocks, 91 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 96 ConstructedInterpolants, 0 QuantifiedInterpolants, 188 SizeOfPredicates, 0 NumberOfNonLiveVariables, 490 ConjunctsInSsa, 11 ConjunctsInUnsatCore, 8 InterpolantComputations, 3 PerfectInterpolantSequences, 50/61 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 1 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: 9.7s, OverallIterations: 5, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 6.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.8s, 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.1s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 68 NumberOfCodeBlocks, 68 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 53 ConstructedInterpolants, 0 QuantifiedInterpolants, 111 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 RESULT: Ultimate proved your program to be incorrect! [2023-08-03 23:33:33,525 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...