/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_rfi002_tso_bound2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-19404b3-m [2023-08-03 23:55:23,341 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-03 23:55:23,420 INFO L114 SettingsManager]: Loading settings from /storage/repos/CAV22/benchmarks/svcomp-Reach-32bit-Automizer_Default.epf [2023-08-03 23:55:23,426 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-03 23:55:23,427 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-08-03 23:55:23,427 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2023-08-03 23:55:23,428 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-03 23:55:23,454 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-03 23:55:23,455 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-03 23:55:23,459 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-03 23:55:23,459 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-03 23:55:23,459 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-03 23:55:23,460 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-03 23:55:23,461 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-03 23:55:23,461 INFO L153 SettingsManager]: * Use SBE=true [2023-08-03 23:55:23,462 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-03 23:55:23,462 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-03 23:55:23,462 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-03 23:55:23,462 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-03 23:55:23,463 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-03 23:55:23,463 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-03 23:55:23,463 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-03 23:55:23,463 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-03 23:55:23,464 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-03 23:55:23,465 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-03 23:55:23,465 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-03 23:55:23,465 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-03 23:55:23,465 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-03 23:55:23,466 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-03 23:55:23,466 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-03 23:55:23,467 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-03 23:55:23,467 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-03 23:55:23,467 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-03 23:55:23,467 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-03 23:55:23,467 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-03 23:55:23,467 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-03 23:55:23,468 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-03 23:55:23,468 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-08-03 23:55:23,468 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-03 23:55:23,468 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-03 23:55:23,468 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-03 23:55:23,468 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:55:23,693 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-03 23:55:23,717 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-03 23:55:23,719 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-03 23:55:23,720 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-03 23:55:23,720 INFO L274 PluginConnector]: CDTParser initialized [2023-08-03 23:55:23,721 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/CAV22/benchmarks/increased_bounds/pthread-wmm_rfi002_tso_bound2.i [2023-08-03 23:55:24,883 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-03 23:55:25,116 INFO L384 CDTParser]: Found 1 translation units. [2023-08-03 23:55:25,117 INFO L180 CDTParser]: Scanning /storage/repos/CAV22/benchmarks/increased_bounds/pthread-wmm_rfi002_tso_bound2.i [2023-08-03 23:55:25,136 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d5c3ce168/2219a6a7f16f40e880817b8fcaa48021/FLAG48e712c5c [2023-08-03 23:55:25,152 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d5c3ce168/2219a6a7f16f40e880817b8fcaa48021 [2023-08-03 23:55:25,154 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-03 23:55:25,156 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-03 23:55:25,156 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-03 23:55:25,157 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-03 23:55:25,159 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-03 23:55:25,160 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.08 11:55:25" (1/1) ... [2023-08-03 23:55:25,161 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@47e42969 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 11:55:25, skipping insertion in model container [2023-08-03 23:55:25,161 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.08 11:55:25" (1/1) ... [2023-08-03 23:55:25,209 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-03 23:55:25,358 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_rfi002_tso_bound2.i[987,1000] [2023-08-03 23:55:25,592 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-03 23:55:25,601 INFO L201 MainTranslator]: Completed pre-run [2023-08-03 23:55:25,612 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_rfi002_tso_bound2.i[987,1000] [2023-08-03 23:55:25,629 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [268] [2023-08-03 23:55:25,630 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [268] [2023-08-03 23:55:25,680 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-03 23:55:25,726 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-03 23:55:25,727 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-03 23:55:25,734 INFO L206 MainTranslator]: Completed translation [2023-08-03 23:55:25,734 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 11:55:25 WrapperNode [2023-08-03 23:55:25,735 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-03 23:55:25,736 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-03 23:55:25,736 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-03 23:55:25,736 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-03 23:55:25,741 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:55:25" (1/1) ... [2023-08-03 23:55:25,776 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:55:25" (1/1) ... [2023-08-03 23:55:25,813 INFO L138 Inliner]: procedures = 175, calls = 48, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 225 [2023-08-03 23:55:25,813 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-03 23:55:25,814 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-03 23:55:25,814 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-03 23:55:25,814 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-03 23:55:25,821 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 11:55:25" (1/1) ... [2023-08-03 23:55:25,821 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 11:55:25" (1/1) ... [2023-08-03 23:55:25,836 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 11:55:25" (1/1) ... [2023-08-03 23:55:25,836 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 11:55:25" (1/1) ... [2023-08-03 23:55:25,849 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 11:55:25" (1/1) ... [2023-08-03 23:55:25,852 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 11:55:25" (1/1) ... [2023-08-03 23:55:25,867 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 11:55:25" (1/1) ... [2023-08-03 23:55:25,868 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 11:55:25" (1/1) ... [2023-08-03 23:55:25,872 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-03 23:55:25,873 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-03 23:55:25,873 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-03 23:55:25,873 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-03 23:55:25,873 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 11:55:25" (1/1) ... [2023-08-03 23:55:25,885 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-03 23:55:25,895 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 23:55:26,198 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:55:26,210 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:55:26,228 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-03 23:55:26,229 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-03 23:55:26,229 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-03 23:55:26,229 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-03 23:55:26,229 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-03 23:55:26,230 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-03 23:55:26,230 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-03 23:55:26,231 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-03 23:55:26,231 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-03 23:55:26,231 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-03 23:55:26,231 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-03 23:55:26,232 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-03 23:55:26,232 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-03 23:55:26,233 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:55:26,362 INFO L236 CfgBuilder]: Building ICFG [2023-08-03 23:55:26,363 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-03 23:55:26,706 INFO L277 CfgBuilder]: Performing block encoding [2023-08-03 23:55:26,900 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-03 23:55:26,900 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2023-08-03 23:55:26,902 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.08 11:55:26 BoogieIcfgContainer [2023-08-03 23:55:26,903 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-03 23:55:26,905 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-03 23:55:26,905 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-03 23:55:26,907 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-03 23:55:26,908 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.08 11:55:25" (1/3) ... [2023-08-03 23:55:26,908 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@475b9445 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.08 11:55:26, skipping insertion in model container [2023-08-03 23:55:26,909 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 11:55:25" (2/3) ... [2023-08-03 23:55:26,909 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@475b9445 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.08 11:55:26, skipping insertion in model container [2023-08-03 23:55:26,910 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.08 11:55:26" (3/3) ... [2023-08-03 23:55:26,911 INFO L112 eAbstractionObserver]: Analyzing ICFG pthread-wmm_rfi002_tso_bound2.i [2023-08-03 23:55:26,918 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-08-03 23:55:26,926 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-03 23:55:26,927 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2023-08-03 23:55:26,927 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-03 23:55:26,983 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-03 23:55:27,018 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 122 places, 121 transitions, 252 flow [2023-08-03 23:55:27,125 INFO L124 PetriNetUnfolderBase]: 14/240 cut-off events. [2023-08-03 23:55:27,125 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-03 23:55:27,130 INFO L83 FinitePrefix]: Finished finitePrefix Result has 252 conditions, 240 events. 14/240 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 655 event pairs, 0 based on Foata normal form. 0/212 useless extension candidates. Maximal degree in co-relation 145. Up to 8 conditions per place. [2023-08-03 23:55:27,130 INFO L82 GeneralOperation]: Start removeDead. Operand has 122 places, 121 transitions, 252 flow [2023-08-03 23:55:27,134 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 98 places, 94 transitions, 198 flow [2023-08-03 23:55:27,137 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-03 23:55:27,156 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 98 places, 94 transitions, 198 flow [2023-08-03 23:55:27,159 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 98 places, 94 transitions, 198 flow [2023-08-03 23:55:27,159 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 98 places, 94 transitions, 198 flow [2023-08-03 23:55:27,192 INFO L124 PetriNetUnfolderBase]: 2/132 cut-off events. [2023-08-03 23:55:27,193 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-03 23:55:27,193 INFO L83 FinitePrefix]: Finished finitePrefix Result has 144 conditions, 132 events. 2/132 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 187 event pairs, 0 based on Foata normal form. 0/124 useless extension candidates. Maximal degree in co-relation 91. Up to 4 conditions per place. [2023-08-03 23:55:27,194 INFO L119 LiptonReduction]: Number of co-enabled transitions 796 [2023-08-03 23:55:31,303 INFO L134 LiptonReduction]: Checked pairs total: 2219 [2023-08-03 23:55:31,304 INFO L136 LiptonReduction]: Total number of compositions: 80 [2023-08-03 23:55:31,315 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == InUseError ======== [2023-08-03 23:55:31,326 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;@3e72d54e, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-03 23:55:31,327 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2023-08-03 23:55:31,339 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-03 23:55:31,339 INFO L124 PetriNetUnfolderBase]: 0/15 cut-off events. [2023-08-03 23:55:31,339 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-03 23:55:31,339 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 23:55:31,340 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-03 23:55:31,340 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:55:31,346 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 23:55:31,346 INFO L85 PathProgramCache]: Analyzing trace with hash 630448354, now seen corresponding path program 1 times [2023-08-03 23:55:31,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 23:55:31,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895649387] [2023-08-03 23:55:31,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 23:55:31,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 23:55:31,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 23:55:31,593 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:55:31,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 23:55:31,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895649387] [2023-08-03 23:55:31,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1895649387] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 23:55:31,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-03 23:55:31,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-03 23:55:31,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616437054] [2023-08-03 23:55:31,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 23:55:31,602 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-03 23:55:31,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 23:55:31,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-03 23:55:31,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-03 23:55:31,644 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 201 [2023-08-03 23:55:31,648 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 21 transitions, 52 flow. Second operand has 3 states, 3 states have (on average 99.33333333333333) internal successors, (298), 3 states have internal predecessors, (298), 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:55:31,649 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 23:55:31,649 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 201 [2023-08-03 23:55:31,650 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 23:55:31,760 INFO L124 PetriNetUnfolderBase]: 137/271 cut-off events. [2023-08-03 23:55:31,761 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-03 23:55:31,762 INFO L83 FinitePrefix]: Finished finitePrefix Result has 560 conditions, 271 events. 137/271 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1044 event pairs, 42 based on Foata normal form. 0/241 useless extension candidates. Maximal degree in co-relation 536. Up to 252 conditions per place. [2023-08-03 23:55:31,764 INFO L140 encePairwiseOnDemand]: 198/201 looper letters, 23 selfloop transitions, 2 changer transitions 0/27 dead transitions. [2023-08-03 23:55:31,764 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 27 transitions, 114 flow [2023-08-03 23:55:31,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-03 23:55:31,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-03 23:55:31,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 320 transitions. [2023-08-03 23:55:31,776 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5306799336650083 [2023-08-03 23:55:31,777 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 320 transitions. [2023-08-03 23:55:31,777 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 320 transitions. [2023-08-03 23:55:31,778 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 23:55:31,780 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 320 transitions. [2023-08-03 23:55:31,784 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 106.66666666666667) internal successors, (320), 3 states have internal predecessors, (320), 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:55:31,788 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 201.0) internal successors, (804), 4 states have internal predecessors, (804), 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:55:31,788 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 201.0) internal successors, (804), 4 states have internal predecessors, (804), 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:55:31,790 INFO L175 Difference]: Start difference. First operand has 26 places, 21 transitions, 52 flow. Second operand 3 states and 320 transitions. [2023-08-03 23:55:31,791 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 27 transitions, 114 flow [2023-08-03 23:55:31,792 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 27 transitions, 114 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-03 23:55:31,794 INFO L231 Difference]: Finished difference. Result has 29 places, 21 transitions, 60 flow [2023-08-03 23:55:31,795 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=60, PETRI_PLACES=29, PETRI_TRANSITIONS=21} [2023-08-03 23:55:31,798 INFO L281 CegarLoopForPetriNet]: 26 programPoint places, 3 predicate places. [2023-08-03 23:55:31,798 INFO L495 AbstractCegarLoop]: Abstraction has has 29 places, 21 transitions, 60 flow [2023-08-03 23:55:31,798 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 99.33333333333333) internal successors, (298), 3 states have internal predecessors, (298), 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:55:31,798 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 23:55:31,798 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2023-08-03 23:55:31,799 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-03 23:55:31,799 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:55:31,799 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 23:55:31,799 INFO L85 PathProgramCache]: Analyzing trace with hash -1942884139, now seen corresponding path program 1 times [2023-08-03 23:55:31,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 23:55:31,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836214533] [2023-08-03 23:55:31,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 23:55:31,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 23:55:31,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-03 23:55:31,819 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-03 23:55:31,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-03 23:55:31,870 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-03 23:55:31,870 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-03 23:55:31,871 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2023-08-03 23:55:31,876 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 2 remaining) [2023-08-03 23:55:31,876 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-03 23:55:31,877 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2023-08-03 23:55:31,879 INFO L307 ceAbstractionStarter]: Result for error location InUseError was UNSAFE,UNKNOWN (1/2) [2023-08-03 23:55:31,880 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-08-03 23:55:31,880 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-08-03 23:55:31,920 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-03 23:55:31,924 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 147 places, 142 transitions, 308 flow [2023-08-03 23:55:31,992 INFO L124 PetriNetUnfolderBase]: 30/486 cut-off events. [2023-08-03 23:55:31,992 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2023-08-03 23:55:31,994 INFO L83 FinitePrefix]: Finished finitePrefix Result has 519 conditions, 486 events. 30/486 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 2080 event pairs, 0 based on Foata normal form. 0/423 useless extension candidates. Maximal degree in co-relation 352. Up to 18 conditions per place. [2023-08-03 23:55:31,995 INFO L82 GeneralOperation]: Start removeDead. Operand has 147 places, 142 transitions, 308 flow [2023-08-03 23:55:31,996 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 123 places, 115 transitions, 254 flow [2023-08-03 23:55:31,996 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-03 23:55:31,996 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 123 places, 115 transitions, 254 flow [2023-08-03 23:55:31,997 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 123 places, 115 transitions, 254 flow [2023-08-03 23:55:31,997 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 123 places, 115 transitions, 254 flow [2023-08-03 23:55:32,023 INFO L124 PetriNetUnfolderBase]: 3/243 cut-off events. [2023-08-03 23:55:32,024 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2023-08-03 23:55:32,024 INFO L83 FinitePrefix]: Finished finitePrefix Result has 276 conditions, 243 events. 3/243 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 635 event pairs, 0 based on Foata normal form. 0/225 useless extension candidates. Maximal degree in co-relation 190. Up to 9 conditions per place. [2023-08-03 23:55:32,027 INFO L119 LiptonReduction]: Number of co-enabled transitions 2384 [2023-08-03 23:55:35,361 INFO L134 LiptonReduction]: Checked pairs total: 11143 [2023-08-03 23:55:35,362 INFO L136 LiptonReduction]: Total number of compositions: 82 [2023-08-03 23:55:35,364 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == InUseError ======== [2023-08-03 23:55:35,365 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;@3e72d54e, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-03 23:55:35,365 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2023-08-03 23:55:35,371 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-03 23:55:35,371 INFO L124 PetriNetUnfolderBase]: 0/42 cut-off events. [2023-08-03 23:55:35,371 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-08-03 23:55:35,372 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 23:55:35,372 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1] [2023-08-03 23:55:35,372 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:55:35,373 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 23:55:35,373 INFO L85 PathProgramCache]: Analyzing trace with hash -1778943429, now seen corresponding path program 1 times [2023-08-03 23:55:35,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 23:55:35,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042403960] [2023-08-03 23:55:35,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 23:55:35,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 23:55:35,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 23:55:35,459 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:55:35,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 23:55:35,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042403960] [2023-08-03 23:55:35,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1042403960] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 23:55:35,459 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-03 23:55:35,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-03 23:55:35,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85949199] [2023-08-03 23:55:35,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 23:55:35,460 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-03 23:55:35,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 23:55:35,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-03 23:55:35,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-03 23:55:35,470 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 224 [2023-08-03 23:55:35,470 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 39 transitions, 102 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:55:35,470 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 23:55:35,470 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 224 [2023-08-03 23:55:35,470 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 23:55:39,480 INFO L124 PetriNetUnfolderBase]: 21333/29388 cut-off events. [2023-08-03 23:55:39,481 INFO L125 PetriNetUnfolderBase]: For 1302/1302 co-relation queries the response was YES. [2023-08-03 23:55:39,541 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60007 conditions, 29388 events. 21333/29388 cut-off events. For 1302/1302 co-relation queries the response was YES. Maximal size of possible extension queue 1056. Compared 171213 event pairs, 14898 based on Foata normal form. 0/26147 useless extension candidates. Maximal degree in co-relation 9188. Up to 29056 conditions per place. [2023-08-03 23:55:39,676 INFO L140 encePairwiseOnDemand]: 221/224 looper letters, 40 selfloop transitions, 2 changer transitions 0/46 dead transitions. [2023-08-03 23:55:39,676 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 46 transitions, 200 flow [2023-08-03 23:55:39,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-03 23:55:39,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-03 23:55:39,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 364 transitions. [2023-08-03 23:55:39,682 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5416666666666666 [2023-08-03 23:55:39,682 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 364 transitions. [2023-08-03 23:55:39,682 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 364 transitions. [2023-08-03 23:55:39,682 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 23:55:39,682 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 364 transitions. [2023-08-03 23:55:39,684 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:55:39,687 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 224.0) internal successors, (896), 4 states have internal predecessors, (896), 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:55:39,688 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 224.0) internal successors, (896), 4 states have internal predecessors, (896), 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:55:39,688 INFO L175 Difference]: Start difference. First operand has 48 places, 39 transitions, 102 flow. Second operand 3 states and 364 transitions. [2023-08-03 23:55:39,688 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 46 transitions, 200 flow [2023-08-03 23:55:39,694 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 46 transitions, 196 flow, removed 2 selfloop flow, removed 0 redundant places. [2023-08-03 23:55:39,696 INFO L231 Difference]: Finished difference. Result has 51 places, 40 transitions, 110 flow [2023-08-03 23:55:39,696 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=224, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=110, PETRI_PLACES=51, PETRI_TRANSITIONS=40} [2023-08-03 23:55:39,697 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, 3 predicate places. [2023-08-03 23:55:39,697 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 40 transitions, 110 flow [2023-08-03 23:55:39,697 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:55:39,697 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 23:55:39,698 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1] [2023-08-03 23:55:39,698 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-03 23:55:39,698 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:55:39,699 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 23:55:39,699 INFO L85 PathProgramCache]: Analyzing trace with hash -1241429746, now seen corresponding path program 1 times [2023-08-03 23:55:39,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 23:55:39,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509308801] [2023-08-03 23:55:39,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 23:55:39,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 23:55:39,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 23:55:39,808 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:55:39,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 23:55:39,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509308801] [2023-08-03 23:55:39,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1509308801] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 23:55:39,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1658269246] [2023-08-03 23:55:39,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 23:55:39,809 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 23:55:39,809 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 23:55:39,813 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:55:39,820 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:55:39,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 23:55:39,913 INFO L262 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-03 23:55:39,915 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 23:55:39,974 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:55:39,974 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-03 23:55:39,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1658269246] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 23:55:39,975 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-03 23:55:39,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2023-08-03 23:55:39,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882384930] [2023-08-03 23:55:39,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 23:55:39,977 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-03 23:55:39,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 23:55:39,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-03 23:55:39,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-08-03 23:55:39,994 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 224 [2023-08-03 23:55:39,994 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 40 transitions, 110 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:55:39,995 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 23:55:39,995 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 224 [2023-08-03 23:55:39,995 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 23:55:43,103 INFO L124 PetriNetUnfolderBase]: 21273/29436 cut-off events. [2023-08-03 23:55:43,103 INFO L125 PetriNetUnfolderBase]: For 1098/1098 co-relation queries the response was YES. [2023-08-03 23:55:43,149 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59950 conditions, 29436 events. 21273/29436 cut-off events. For 1098/1098 co-relation queries the response was YES. Maximal size of possible extension queue 1069. Compared 174017 event pairs, 9408 based on Foata normal form. 36/26279 useless extension candidates. Maximal degree in co-relation 10410. Up to 28871 conditions per place. [2023-08-03 23:55:43,261 INFO L140 encePairwiseOnDemand]: 220/224 looper letters, 49 selfloop transitions, 4 changer transitions 0/56 dead transitions. [2023-08-03 23:55:43,416 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 56 transitions, 248 flow [2023-08-03 23:55:43,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-03 23:55:43,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-03 23:55:43,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 584 transitions. [2023-08-03 23:55:43,419 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5214285714285715 [2023-08-03 23:55:43,419 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 584 transitions. [2023-08-03 23:55:43,419 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 584 transitions. [2023-08-03 23:55:43,420 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 23:55:43,420 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 584 transitions. [2023-08-03 23:55:43,421 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 116.8) internal successors, (584), 5 states have internal predecessors, (584), 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:55:43,423 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 224.0) internal successors, (1344), 6 states have internal predecessors, (1344), 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:55:43,424 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 224.0) internal successors, (1344), 6 states have internal predecessors, (1344), 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:55:43,424 INFO L175 Difference]: Start difference. First operand has 51 places, 40 transitions, 110 flow. Second operand 5 states and 584 transitions. [2023-08-03 23:55:43,428 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 56 transitions, 248 flow [2023-08-03 23:55:43,429 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 56 transitions, 245 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-03 23:55:43,431 INFO L231 Difference]: Finished difference. Result has 54 places, 40 transitions, 124 flow [2023-08-03 23:55:43,431 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=224, PETRI_DIFFERENCE_MINUEND_FLOW=103, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=124, PETRI_PLACES=54, PETRI_TRANSITIONS=40} [2023-08-03 23:55:43,433 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, 6 predicate places. [2023-08-03 23:55:43,433 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 40 transitions, 124 flow [2023-08-03 23:55:43,434 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:55:43,434 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 23:55:43,434 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 23:55:43,443 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-08-03 23:55:43,640 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:55:43,641 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:55:43,641 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 23:55:43,642 INFO L85 PathProgramCache]: Analyzing trace with hash -29047108, now seen corresponding path program 1 times [2023-08-03 23:55:43,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 23:55:43,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914045379] [2023-08-03 23:55:43,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 23:55:43,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 23:55:43,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 23:55:43,735 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:55:43,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 23:55:43,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914045379] [2023-08-03 23:55:43,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [914045379] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 23:55:43,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [978996851] [2023-08-03 23:55:43,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 23:55:43,736 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 23:55:43,736 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 23:55:44,031 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:55:44,032 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:55:44,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 23:55:44,126 INFO L262 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-03 23:55:44,127 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 23:55:44,144 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:55:44,144 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-03 23:55:44,167 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:55:44,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [978996851] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-03 23:55:44,168 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-03 23:55:44,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2023-08-03 23:55:44,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870565764] [2023-08-03 23:55:44,169 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-03 23:55:44,170 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-03 23:55:44,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 23:55:44,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-03 23:55:44,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-03 23:55:44,184 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 224 [2023-08-03 23:55:44,185 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 40 transitions, 124 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:55:44,185 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 23:55:44,185 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 224 [2023-08-03 23:55:44,185 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 23:55:46,843 INFO L124 PetriNetUnfolderBase]: 19024/26035 cut-off events. [2023-08-03 23:55:46,844 INFO L125 PetriNetUnfolderBase]: For 1152/1152 co-relation queries the response was YES. [2023-08-03 23:55:46,884 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53121 conditions, 26035 events. 19024/26035 cut-off events. For 1152/1152 co-relation queries the response was YES. Maximal size of possible extension queue 1019. Compared 148467 event pairs, 8064 based on Foata normal form. 6/23304 useless extension candidates. Maximal degree in co-relation 9199. Up to 25537 conditions per place. [2023-08-03 23:55:46,959 INFO L140 encePairwiseOnDemand]: 221/224 looper letters, 49 selfloop transitions, 3 changer transitions 0/55 dead transitions. [2023-08-03 23:55:46,959 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 55 transitions, 254 flow [2023-08-03 23:55:46,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-03 23:55:46,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-03 23:55:46,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 477 transitions. [2023-08-03 23:55:46,961 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5323660714285714 [2023-08-03 23:55:46,961 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 477 transitions. [2023-08-03 23:55:46,961 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 477 transitions. [2023-08-03 23:55:46,962 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 23:55:46,962 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 477 transitions. [2023-08-03 23:55:46,963 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 119.25) internal successors, (477), 4 states have internal predecessors, (477), 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:55:46,964 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 224.0) internal successors, (1120), 5 states have internal predecessors, (1120), 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:55:46,965 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 224.0) internal successors, (1120), 5 states have internal predecessors, (1120), 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:55:46,965 INFO L175 Difference]: Start difference. First operand has 54 places, 40 transitions, 124 flow. Second operand 4 states and 477 transitions. [2023-08-03 23:55:46,965 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 55 transitions, 254 flow [2023-08-03 23:55:46,966 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 55 transitions, 249 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-08-03 23:55:46,967 INFO L231 Difference]: Finished difference. Result has 55 places, 39 transitions, 117 flow [2023-08-03 23:55:46,967 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=224, PETRI_DIFFERENCE_MINUEND_FLOW=111, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=117, PETRI_PLACES=55, PETRI_TRANSITIONS=39} [2023-08-03 23:55:46,968 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, 7 predicate places. [2023-08-03 23:55:46,968 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 39 transitions, 117 flow [2023-08-03 23:55:46,968 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:55:46,968 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 23:55:46,969 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 23:55:46,980 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:55:47,174 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:55:47,175 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:55:47,175 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 23:55:47,175 INFO L85 PathProgramCache]: Analyzing trace with hash 1124769150, now seen corresponding path program 1 times [2023-08-03 23:55:47,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 23:55:47,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571728103] [2023-08-03 23:55:47,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 23:55:47,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 23:55:47,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 23:55:47,251 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:55:47,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 23:55:47,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571728103] [2023-08-03 23:55:47,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1571728103] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 23:55:47,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2110000515] [2023-08-03 23:55:47,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 23:55:47,252 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 23:55:47,252 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 23:55:47,253 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:55:47,259 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:55:47,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 23:55:47,350 INFO L262 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-03 23:55:47,351 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 23:55:47,367 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:55:47,367 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-03 23:55:47,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2110000515] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 23:55:47,368 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-03 23:55:47,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2023-08-03 23:55:47,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821484891] [2023-08-03 23:55:47,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 23:55:47,370 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-03 23:55:47,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 23:55:47,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-03 23:55:47,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-08-03 23:55:47,385 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 224 [2023-08-03 23:55:47,386 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 39 transitions, 117 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:55:47,386 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 23:55:47,387 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 224 [2023-08-03 23:55:47,387 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 23:55:48,789 INFO L124 PetriNetUnfolderBase]: 8980/13037 cut-off events. [2023-08-03 23:55:48,790 INFO L125 PetriNetUnfolderBase]: For 682/682 co-relation queries the response was YES. [2023-08-03 23:55:48,821 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26989 conditions, 13037 events. 8980/13037 cut-off events. For 682/682 co-relation queries the response was YES. Maximal size of possible extension queue 431. Compared 71210 event pairs, 100 based on Foata normal form. 2916/14512 useless extension candidates. Maximal degree in co-relation 12817. Up to 11520 conditions per place. [2023-08-03 23:55:48,830 INFO L140 encePairwiseOnDemand]: 222/224 looper letters, 0 selfloop transitions, 0 changer transitions 66/66 dead transitions. [2023-08-03 23:55:48,830 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 66 transitions, 297 flow [2023-08-03 23:55:48,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-03 23:55:48,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-03 23:55:48,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 492 transitions. [2023-08-03 23:55:48,832 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5491071428571429 [2023-08-03 23:55:48,832 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 492 transitions. [2023-08-03 23:55:48,832 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 492 transitions. [2023-08-03 23:55:48,832 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 23:55:48,832 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 492 transitions. [2023-08-03 23:55:48,834 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 123.0) internal successors, (492), 4 states have internal predecessors, (492), 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:55:48,836 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 224.0) internal successors, (1120), 5 states have internal predecessors, (1120), 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:55:48,836 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 224.0) internal successors, (1120), 5 states have internal predecessors, (1120), 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:55:48,837 INFO L175 Difference]: Start difference. First operand has 55 places, 39 transitions, 117 flow. Second operand 4 states and 492 transitions. [2023-08-03 23:55:48,837 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 66 transitions, 297 flow [2023-08-03 23:55:48,862 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 66 transitions, 290 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-03 23:55:48,863 INFO L231 Difference]: Finished difference. Result has 53 places, 0 transitions, 0 flow [2023-08-03 23:55:48,863 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=224, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=0, PETRI_PLACES=53, PETRI_TRANSITIONS=0} [2023-08-03 23:55:48,864 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, 5 predicate places. [2023-08-03 23:55:48,864 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 0 transitions, 0 flow [2023-08-03 23:55:48,865 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:55:48,865 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2023-08-03 23:55:48,865 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 2 remaining) [2023-08-03 23:55:48,875 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:55:49,070 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:55:49,071 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2023-08-03 23:55:49,072 INFO L307 ceAbstractionStarter]: Result for error location InUseError was SAFE,SAFE (1/2) [2023-08-03 23:55:49,074 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 147 places, 142 transitions, 308 flow [2023-08-03 23:55:49,135 INFO L124 PetriNetUnfolderBase]: 30/486 cut-off events. [2023-08-03 23:55:49,135 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2023-08-03 23:55:49,137 INFO L83 FinitePrefix]: Finished finitePrefix Result has 519 conditions, 486 events. 30/486 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 2080 event pairs, 0 based on Foata normal form. 0/423 useless extension candidates. Maximal degree in co-relation 352. Up to 18 conditions per place. [2023-08-03 23:55:49,137 INFO L82 GeneralOperation]: Start removeDead. Operand has 147 places, 142 transitions, 308 flow [2023-08-03 23:55:49,144 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 146 places, 141 transitions, 302 flow [2023-08-03 23:55:49,145 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-03 23:55:49,149 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 146 places, 141 transitions, 302 flow [2023-08-03 23:55:49,150 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 146 places, 141 transitions, 302 flow [2023-08-03 23:55:49,150 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 146 places, 141 transitions, 302 flow [2023-08-03 23:55:49,201 INFO L124 PetriNetUnfolderBase]: 30/485 cut-off events. [2023-08-03 23:55:49,202 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2023-08-03 23:55:49,203 INFO L83 FinitePrefix]: Finished finitePrefix Result has 516 conditions, 485 events. 30/485 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 2068 event pairs, 0 based on Foata normal form. 0/422 useless extension candidates. Maximal degree in co-relation 351. Up to 18 conditions per place. [2023-08-03 23:55:49,210 INFO L119 LiptonReduction]: Number of co-enabled transitions 4404 [2023-08-03 23:55:54,006 INFO L134 LiptonReduction]: Checked pairs total: 16919 [2023-08-03 23:55:54,006 INFO L136 LiptonReduction]: Total number of compositions: 110 [2023-08-03 23:55:54,009 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-03 23:55:54,010 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;@3e72d54e, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-03 23:55:54,010 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2023-08-03 23:55:54,013 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-03 23:55:54,013 INFO L124 PetriNetUnfolderBase]: 0/12 cut-off events. [2023-08-03 23:55:54,013 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-03 23:55:54,013 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 23:55:54,014 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-03 23:55:54,014 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err1ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2023-08-03 23:55:54,014 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 23:55:54,015 INFO L85 PathProgramCache]: Analyzing trace with hash 968731671, now seen corresponding path program 1 times [2023-08-03 23:55:54,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 23:55:54,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296974114] [2023-08-03 23:55:54,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 23:55:54,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 23:55:54,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 23:55:54,057 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:55:54,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 23:55:54,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296974114] [2023-08-03 23:55:54,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1296974114] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 23:55:54,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-03 23:55:54,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-03 23:55:54,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971336290] [2023-08-03 23:55:54,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 23:55:54,058 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-03 23:55:54,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 23:55:54,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-03 23:55:54,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-03 23:55:54,066 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 252 [2023-08-03 23:55:54,066 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 43 transitions, 106 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:55:54,066 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 23:55:54,066 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 252 [2023-08-03 23:55:54,066 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 23:56:05,633 INFO L124 PetriNetUnfolderBase]: 82828/110197 cut-off events. [2023-08-03 23:56:05,633 INFO L125 PetriNetUnfolderBase]: For 1386/1386 co-relation queries the response was YES. [2023-08-03 23:56:05,787 INFO L83 FinitePrefix]: Finished finitePrefix Result has 221613 conditions, 110197 events. 82828/110197 cut-off events. For 1386/1386 co-relation queries the response was YES. Maximal size of possible extension queue 2627. Compared 645698 event pairs, 60468 based on Foata normal form. 0/91332 useless extension candidates. Maximal degree in co-relation 33843. Up to 109661 conditions per place. [2023-08-03 23:56:06,078 INFO L140 encePairwiseOnDemand]: 249/252 looper letters, 45 selfloop transitions, 2 changer transitions 0/50 dead transitions. [2023-08-03 23:56:06,078 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 50 transitions, 214 flow [2023-08-03 23:56:06,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-03 23:56:06,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-03 23:56:06,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 369 transitions. [2023-08-03 23:56:06,079 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4880952380952381 [2023-08-03 23:56:06,080 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 369 transitions. [2023-08-03 23:56:06,080 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 369 transitions. [2023-08-03 23:56:06,080 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 23:56:06,080 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 369 transitions. [2023-08-03 23:56:06,081 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 123.0) internal successors, (369), 3 states have internal predecessors, (369), 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:56:06,082 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 252.0) internal successors, (1008), 4 states have internal predecessors, (1008), 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:56:06,083 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 252.0) internal successors, (1008), 4 states have internal predecessors, (1008), 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:56:06,083 INFO L175 Difference]: Start difference. First operand has 52 places, 43 transitions, 106 flow. Second operand 3 states and 369 transitions. [2023-08-03 23:56:06,083 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 50 transitions, 214 flow [2023-08-03 23:56:06,085 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 50 transitions, 212 flow, removed 1 selfloop flow, removed 0 redundant places. [2023-08-03 23:56:06,085 INFO L231 Difference]: Finished difference. Result has 55 places, 44 transitions, 116 flow [2023-08-03 23:56:06,086 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=252, 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:56:06,086 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 3 predicate places. [2023-08-03 23:56:06,086 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 44 transitions, 116 flow [2023-08-03 23:56:06,086 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:56:06,087 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 23:56:06,087 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 23:56:06,087 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-03 23:56:06,087 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err1ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2023-08-03 23:56:06,087 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 23:56:06,087 INFO L85 PathProgramCache]: Analyzing trace with hash 491799856, now seen corresponding path program 1 times [2023-08-03 23:56:06,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 23:56:06,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897531821] [2023-08-03 23:56:06,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 23:56:06,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 23:56:06,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 23:56:06,170 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:56:06,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 23:56:06,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897531821] [2023-08-03 23:56:06,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1897531821] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 23:56:06,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2120282712] [2023-08-03 23:56:06,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 23:56:06,171 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 23:56:06,171 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 23:56:06,172 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:56:06,175 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:56:06,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 23:56:06,269 INFO L262 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 2 conjunts are in the unsatisfiable core [2023-08-03 23:56:06,270 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 23:56:06,279 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:56:06,279 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-03 23:56:06,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2120282712] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 23:56:06,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-03 23:56:06,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2023-08-03 23:56:06,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078895128] [2023-08-03 23:56:06,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 23:56:06,281 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-03 23:56:06,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 23:56:06,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-03 23:56:06,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-03 23:56:06,290 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 252 [2023-08-03 23:56:06,291 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 44 transitions, 116 flow. Second operand has 3 states, 3 states have (on average 109.66666666666667) internal successors, (329), 3 states have internal predecessors, (329), 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:56:06,291 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 23:56:06,291 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 252 [2023-08-03 23:56:06,291 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 23:56:17,640 INFO L124 PetriNetUnfolderBase]: 82568/110043 cut-off events. [2023-08-03 23:56:17,640 INFO L125 PetriNetUnfolderBase]: For 581/581 co-relation queries the response was YES. [2023-08-03 23:56:17,847 INFO L83 FinitePrefix]: Finished finitePrefix Result has 220998 conditions, 110043 events. 82568/110043 cut-off events. For 581/581 co-relation queries the response was YES. Maximal size of possible extension queue 2630. Compared 651267 event pairs, 58669 based on Foata normal form. 0/91310 useless extension candidates. Maximal degree in co-relation 220946. Up to 108064 conditions per place. [2023-08-03 23:56:18,111 INFO L140 encePairwiseOnDemand]: 249/252 looper letters, 59 selfloop transitions, 2 changer transitions 0/64 dead transitions. [2023-08-03 23:56:18,111 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 64 transitions, 278 flow [2023-08-03 23:56:18,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-03 23:56:18,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-03 23:56:18,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 382 transitions. [2023-08-03 23:56:18,113 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5052910052910053 [2023-08-03 23:56:18,113 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 382 transitions. [2023-08-03 23:56:18,113 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 382 transitions. [2023-08-03 23:56:18,114 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 23:56:18,114 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 382 transitions. [2023-08-03 23:56:18,115 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 127.33333333333333) internal successors, (382), 3 states have internal predecessors, (382), 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:56:18,116 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 252.0) internal successors, (1008), 4 states have internal predecessors, (1008), 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:56:18,116 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 252.0) internal successors, (1008), 4 states have internal predecessors, (1008), 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:56:18,116 INFO L175 Difference]: Start difference. First operand has 55 places, 44 transitions, 116 flow. Second operand 3 states and 382 transitions. [2023-08-03 23:56:18,116 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 64 transitions, 278 flow [2023-08-03 23:56:18,117 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 64 transitions, 276 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-03 23:56:18,118 INFO L231 Difference]: Finished difference. Result has 57 places, 45 transitions, 126 flow [2023-08-03 23:56:18,118 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=252, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=126, PETRI_PLACES=57, PETRI_TRANSITIONS=45} [2023-08-03 23:56:18,119 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 5 predicate places. [2023-08-03 23:56:18,119 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 45 transitions, 126 flow [2023-08-03 23:56:18,119 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 109.66666666666667) internal successors, (329), 3 states have internal predecessors, (329), 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:56:18,119 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 23:56:18,120 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 23:56:18,135 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:56:18,325 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:56:18,326 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err1ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2023-08-03 23:56:18,326 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 23:56:18,326 INFO L85 PathProgramCache]: Analyzing trace with hash 491780705, now seen corresponding path program 1 times [2023-08-03 23:56:18,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 23:56:18,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332399349] [2023-08-03 23:56:18,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 23:56:18,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 23:56:18,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 23:56:18,365 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:56:18,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 23:56:18,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332399349] [2023-08-03 23:56:18,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [332399349] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 23:56:18,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [583104650] [2023-08-03 23:56:18,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 23:56:18,366 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 23:56:18,366 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 23:56:18,368 INFO L229 MonitoredProcess]: Starting monitored process 6 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:56:18,370 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-08-03 23:56:18,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 23:56:18,446 INFO L262 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-03 23:56:18,447 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 23:56:18,464 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:56:18,464 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-03 23:56:18,491 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:56:18,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [583104650] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-03 23:56:18,492 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-03 23:56:18,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2023-08-03 23:56:18,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658807321] [2023-08-03 23:56:18,492 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-03 23:56:18,492 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-03 23:56:18,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 23:56:18,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-03 23:56:18,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-03 23:56:18,504 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 252 [2023-08-03 23:56:18,505 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 45 transitions, 126 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:56:18,505 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 23:56:18,505 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 252 [2023-08-03 23:56:18,505 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 23:56:28,850 INFO L124 PetriNetUnfolderBase]: 73504/96859 cut-off events. [2023-08-03 23:56:28,851 INFO L125 PetriNetUnfolderBase]: For 7218/7218 co-relation queries the response was YES. [2023-08-03 23:56:29,041 INFO L83 FinitePrefix]: Finished finitePrefix Result has 201451 conditions, 96859 events. 73504/96859 cut-off events. For 7218/7218 co-relation queries the response was YES. Maximal size of possible extension queue 2473. Compared 547886 event pairs, 35454 based on Foata normal form. 6/84048 useless extension candidates. Maximal degree in co-relation 34827. Up to 96193 conditions per place. [2023-08-03 23:56:29,266 INFO L140 encePairwiseOnDemand]: 248/252 looper letters, 55 selfloop transitions, 3 changer transitions 1/62 dead transitions. [2023-08-03 23:56:29,266 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 62 transitions, 278 flow [2023-08-03 23:56:29,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-03 23:56:29,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-03 23:56:29,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 483 transitions. [2023-08-03 23:56:29,267 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4791666666666667 [2023-08-03 23:56:29,267 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 483 transitions. [2023-08-03 23:56:29,267 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 483 transitions. [2023-08-03 23:56:29,268 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 23:56:29,268 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 483 transitions. [2023-08-03 23:56:29,269 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 120.75) internal successors, (483), 4 states have internal predecessors, (483), 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:56:29,270 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 252.0) internal successors, (1260), 5 states have internal predecessors, (1260), 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:56:29,271 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 252.0) internal successors, (1260), 5 states have internal predecessors, (1260), 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:56:29,271 INFO L175 Difference]: Start difference. First operand has 57 places, 45 transitions, 126 flow. Second operand 4 states and 483 transitions. [2023-08-03 23:56:29,271 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 62 transitions, 278 flow [2023-08-03 23:56:29,273 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 62 transitions, 276 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-03 23:56:29,274 INFO L231 Difference]: Finished difference. Result has 61 places, 45 transitions, 138 flow [2023-08-03 23:56:29,274 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=252, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=138, PETRI_PLACES=61, PETRI_TRANSITIONS=45} [2023-08-03 23:56:29,275 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 9 predicate places. [2023-08-03 23:56:29,275 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 45 transitions, 138 flow [2023-08-03 23:56:29,275 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:56:29,275 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 23:56:29,275 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 23:56:29,283 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-08-03 23:56:29,483 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 23:56:29,484 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err1ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2023-08-03 23:56:29,484 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 23:56:29,484 INFO L85 PathProgramCache]: Analyzing trace with hash 1812221676, now seen corresponding path program 1 times [2023-08-03 23:56:29,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 23:56:29,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600117485] [2023-08-03 23:56:29,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 23:56:29,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 23:56:29,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 23:56:29,576 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:56:29,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 23:56:29,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600117485] [2023-08-03 23:56:29,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1600117485] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 23:56:29,576 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-03 23:56:29,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-03 23:56:29,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064547603] [2023-08-03 23:56:29,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 23:56:29,577 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-03 23:56:29,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 23:56:29,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-03 23:56:29,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-03 23:56:29,579 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 252 [2023-08-03 23:56:29,579 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 45 transitions, 138 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:56:29,580 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 23:56:29,580 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 252 [2023-08-03 23:56:29,580 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 23:56:38,767 INFO L124 PetriNetUnfolderBase]: 70108/92051 cut-off events. [2023-08-03 23:56:38,767 INFO L125 PetriNetUnfolderBase]: For 7407/7407 co-relation queries the response was YES. [2023-08-03 23:56:38,950 INFO L83 FinitePrefix]: Finished finitePrefix Result has 191427 conditions, 92051 events. 70108/92051 cut-off events. For 7407/7407 co-relation queries the response was YES. Maximal size of possible extension queue 2385. Compared 516564 event pairs, 14668 based on Foata normal form. 0/80632 useless extension candidates. Maximal degree in co-relation 92014. Up to 90217 conditions per place. [2023-08-03 23:56:39,171 INFO L140 encePairwiseOnDemand]: 247/252 looper letters, 59 selfloop transitions, 3 changer transitions 0/65 dead transitions. [2023-08-03 23:56:39,171 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 65 transitions, 313 flow [2023-08-03 23:56:39,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-03 23:56:39,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-03 23:56:39,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 391 transitions. [2023-08-03 23:56:39,173 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5171957671957672 [2023-08-03 23:56:39,173 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 391 transitions. [2023-08-03 23:56:39,173 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 391 transitions. [2023-08-03 23:56:39,173 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 23:56:39,173 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 391 transitions. [2023-08-03 23:56:39,174 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 130.33333333333334) internal successors, (391), 3 states have internal predecessors, (391), 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:56:39,175 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 252.0) internal successors, (1008), 4 states have internal predecessors, (1008), 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:56:39,175 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 252.0) internal successors, (1008), 4 states have internal predecessors, (1008), 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:56:39,175 INFO L175 Difference]: Start difference. First operand has 61 places, 45 transitions, 138 flow. Second operand 3 states and 391 transitions. [2023-08-03 23:56:39,175 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 65 transitions, 313 flow [2023-08-03 23:56:39,176 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 65 transitions, 306 flow, removed 1 selfloop flow, removed 3 redundant places. [2023-08-03 23:56:39,177 INFO L231 Difference]: Finished difference. Result has 61 places, 47 transitions, 152 flow [2023-08-03 23:56:39,177 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=252, PETRI_DIFFERENCE_MINUEND_FLOW=131, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=152, PETRI_PLACES=61, PETRI_TRANSITIONS=47} [2023-08-03 23:56:39,178 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 9 predicate places. [2023-08-03 23:56:39,178 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 47 transitions, 152 flow [2023-08-03 23:56:39,178 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:56:39,178 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 23:56:39,178 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 23:56:39,178 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-03 23:56:39,178 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting P1Err1ASSERT_VIOLATIONERROR_FUNCTION === [P1Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err1ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2023-08-03 23:56:39,179 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 23:56:39,179 INFO L85 PathProgramCache]: Analyzing trace with hash 344297920, now seen corresponding path program 1 times [2023-08-03 23:56:39,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 23:56:39,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63756142] [2023-08-03 23:56:39,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 23:56:39,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 23:56:39,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 23:56:39,257 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:56:39,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 23:56:39,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63756142] [2023-08-03 23:56:39,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [63756142] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 23:56:39,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-03 23:56:39,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-03 23:56:39,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997772565] [2023-08-03 23:56:39,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 23:56:39,258 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-03 23:56:39,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 23:56:39,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-03 23:56:39,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-03 23:56:39,260 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 252 [2023-08-03 23:56:39,261 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 47 transitions, 152 flow. Second operand has 3 states, 3 states have (on average 113.33333333333333) internal successors, (340), 3 states have internal predecessors, (340), 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:56:39,261 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 23:56:39,261 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 252 [2023-08-03 23:56:39,261 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 23:56:47,773 INFO L124 PetriNetUnfolderBase]: 63220/83219 cut-off events. [2023-08-03 23:56:47,773 INFO L125 PetriNetUnfolderBase]: For 10052/10052 co-relation queries the response was YES. [2023-08-03 23:56:47,947 INFO L83 FinitePrefix]: Finished finitePrefix Result has 180531 conditions, 83219 events. 63220/83219 cut-off events. For 10052/10052 co-relation queries the response was YES. Maximal size of possible extension queue 2195. Compared 467199 event pairs, 11968 based on Foata normal form. 0/74860 useless extension candidates. Maximal degree in co-relation 86902. Up to 75697 conditions per place. [2023-08-03 23:56:48,149 INFO L140 encePairwiseOnDemand]: 247/252 looper letters, 65 selfloop transitions, 3 changer transitions 0/71 dead transitions. [2023-08-03 23:56:48,150 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 71 transitions, 355 flow [2023-08-03 23:56:48,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-03 23:56:48,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-03 23:56:48,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 395 transitions. [2023-08-03 23:56:48,151 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5224867724867724 [2023-08-03 23:56:48,151 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 395 transitions. [2023-08-03 23:56:48,151 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 395 transitions. [2023-08-03 23:56:48,152 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 23:56:48,152 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 395 transitions. [2023-08-03 23:56:48,152 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 131.66666666666666) internal successors, (395), 3 states have internal predecessors, (395), 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:56:48,153 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 252.0) internal successors, (1008), 4 states have internal predecessors, (1008), 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:56:48,153 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 252.0) internal successors, (1008), 4 states have internal predecessors, (1008), 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:56:48,153 INFO L175 Difference]: Start difference. First operand has 61 places, 47 transitions, 152 flow. Second operand 3 states and 395 transitions. [2023-08-03 23:56:48,153 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 71 transitions, 355 flow [2023-08-03 23:56:48,155 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 71 transitions, 352 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-03 23:56:48,156 INFO L231 Difference]: Finished difference. Result has 63 places, 49 transitions, 170 flow [2023-08-03 23:56:48,156 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=252, PETRI_DIFFERENCE_MINUEND_FLOW=149, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=170, PETRI_PLACES=63, PETRI_TRANSITIONS=49} [2023-08-03 23:56:48,156 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 11 predicate places. [2023-08-03 23:56:48,156 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 49 transitions, 170 flow [2023-08-03 23:56:48,157 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 113.33333333333333) internal successors, (340), 3 states have internal predecessors, (340), 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:56:48,157 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 23:56:48,157 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 23:56:48,157 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-03 23:56:48,157 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err1ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2023-08-03 23:56:48,158 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 23:56:48,158 INFO L85 PathProgramCache]: Analyzing trace with hash 392178966, now seen corresponding path program 1 times [2023-08-03 23:56:48,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 23:56:48,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673507261] [2023-08-03 23:56:48,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 23:56:48,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 23:56:48,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 23:56:48,215 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-03 23:56:48,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 23:56:48,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673507261] [2023-08-03 23:56:48,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1673507261] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 23:56:48,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2131021524] [2023-08-03 23:56:48,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 23:56:48,216 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 23:56:48,216 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 23:56:48,217 INFO L229 MonitoredProcess]: Starting monitored process 7 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:56:48,219 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-08-03 23:56:48,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 23:56:48,322 INFO L262 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-03 23:56:48,323 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 23:56:48,334 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-03 23:56:48,335 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-03 23:56:48,348 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-03 23:56:48,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2131021524] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-03 23:56:48,348 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-03 23:56:48,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2023-08-03 23:56:48,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040610904] [2023-08-03 23:56:48,349 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-03 23:56:48,349 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-03 23:56:48,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 23:56:48,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-03 23:56:48,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-03 23:56:48,363 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 252 [2023-08-03 23:56:48,363 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 49 transitions, 170 flow. Second operand has 5 states, 5 states have (on average 109.2) internal successors, (546), 5 states have internal predecessors, (546), 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:56:48,363 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 23:56:48,363 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 252 [2023-08-03 23:56:48,364 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 23:56:56,926 INFO L124 PetriNetUnfolderBase]: 60676/80033 cut-off events. [2023-08-03 23:56:56,927 INFO L125 PetriNetUnfolderBase]: For 11474/11474 co-relation queries the response was YES. [2023-08-03 23:56:57,135 INFO L83 FinitePrefix]: Finished finitePrefix Result has 181103 conditions, 80033 events. 60676/80033 cut-off events. For 11474/11474 co-relation queries the response was YES. Maximal size of possible extension queue 2183. Compared 453830 event pairs, 24352 based on Foata normal form. 252/72184 useless extension candidates. Maximal degree in co-relation 87355. Up to 56593 conditions per place. [2023-08-03 23:56:57,341 INFO L140 encePairwiseOnDemand]: 248/252 looper letters, 90 selfloop transitions, 4 changer transitions 0/97 dead transitions. [2023-08-03 23:56:57,341 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 97 transitions, 485 flow [2023-08-03 23:56:57,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-03 23:56:57,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-03 23:56:57,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 510 transitions. [2023-08-03 23:56:57,342 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5059523809523809 [2023-08-03 23:56:57,342 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 510 transitions. [2023-08-03 23:56:57,342 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 510 transitions. [2023-08-03 23:56:57,343 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 23:56:57,343 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 510 transitions. [2023-08-03 23:56:57,344 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 127.5) internal successors, (510), 4 states have internal predecessors, (510), 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:56:57,346 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 252.0) internal successors, (1260), 5 states have internal predecessors, (1260), 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:56:57,346 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 252.0) internal successors, (1260), 5 states have internal predecessors, (1260), 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:56:57,346 INFO L175 Difference]: Start difference. First operand has 63 places, 49 transitions, 170 flow. Second operand 4 states and 510 transitions. [2023-08-03 23:56:57,346 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 97 transitions, 485 flow [2023-08-03 23:56:57,350 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 97 transitions, 479 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-03 23:56:57,351 INFO L231 Difference]: Finished difference. Result has 67 places, 50 transitions, 187 flow [2023-08-03 23:56:57,351 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=252, PETRI_DIFFERENCE_MINUEND_FLOW=167, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=187, PETRI_PLACES=67, PETRI_TRANSITIONS=50} [2023-08-03 23:56:57,352 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 15 predicate places. [2023-08-03 23:56:57,352 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 50 transitions, 187 flow [2023-08-03 23:56:57,352 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 109.2) internal successors, (546), 5 states have internal predecessors, (546), 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:56:57,352 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 23:56:57,352 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 23:56:57,360 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-08-03 23:56:57,557 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 23:56:57,558 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err1ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2023-08-03 23:56:57,558 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 23:56:57,558 INFO L85 PathProgramCache]: Analyzing trace with hash 1289653566, now seen corresponding path program 1 times [2023-08-03 23:56:57,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 23:56:57,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332522838] [2023-08-03 23:56:57,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 23:56:57,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 23:56:57,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-03 23:56:57,579 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-03 23:56:57,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-03 23:56:57,597 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-03 23:56:57,598 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-03 23:56:57,598 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2023-08-03 23:56:57,598 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2023-08-03 23:56:57,598 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 7 remaining) [2023-08-03 23:56:57,598 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1ASSERT_VIOLATIONERROR_FUNCTION (3 of 7 remaining) [2023-08-03 23:56:57,598 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1ASSERT_VIOLATIONERROR_FUNCTION (2 of 7 remaining) [2023-08-03 23:56:57,598 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 7 remaining) [2023-08-03 23:56:57,598 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2023-08-03 23:56:57,599 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-03 23:56:57,599 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2023-08-03 23:56:57,599 INFO L307 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was UNSAFE,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN (2/2) [2023-08-03 23:56:57,602 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 2 thread instances [2023-08-03 23:56:57,602 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-03 23:56:57,656 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.08 11:56:57 BasicIcfg [2023-08-03 23:56:57,656 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-03 23:56:57,657 INFO L158 Benchmark]: Toolchain (without parser) took 92501.08ms. Allocated memory was 520.1MB in the beginning and 15.1GB in the end (delta: 14.6GB). Free memory was 470.7MB in the beginning and 10.9GB in the end (delta: -10.4GB). Peak memory consumption was 4.2GB. Max. memory is 16.0GB. [2023-08-03 23:56:57,657 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 364.9MB. Free memory is still 318.7MB. There was no memory consumed. Max. memory is 16.0GB. [2023-08-03 23:56:57,657 INFO L158 Benchmark]: CACSL2BoogieTranslator took 578.59ms. Allocated memory is still 520.1MB. Free memory was 470.7MB in the beginning and 442.6MB in the end (delta: 28.0MB). Peak memory consumption was 27.3MB. Max. memory is 16.0GB. [2023-08-03 23:56:57,657 INFO L158 Benchmark]: Boogie Procedure Inliner took 77.36ms. Allocated memory is still 520.1MB. Free memory was 442.6MB in the beginning and 438.9MB in the end (delta: 3.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. [2023-08-03 23:56:57,657 INFO L158 Benchmark]: Boogie Preprocessor took 58.45ms. Allocated memory is still 520.1MB. Free memory was 438.9MB in the beginning and 436.4MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-03 23:56:57,658 INFO L158 Benchmark]: RCFGBuilder took 1030.05ms. Allocated memory is still 520.1MB. Free memory was 436.4MB in the beginning and 437.9MB in the end (delta: -1.5MB). Peak memory consumption was 27.8MB. Max. memory is 16.0GB. [2023-08-03 23:56:57,658 INFO L158 Benchmark]: TraceAbstraction took 90751.56ms. Allocated memory was 520.1MB in the beginning and 15.1GB in the end (delta: 14.6GB). Free memory was 436.8MB in the beginning and 10.9GB in the end (delta: -10.4GB). Peak memory consumption was 4.1GB. Max. memory is 16.0GB. [2023-08-03 23:56:57,659 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 364.9MB. Free memory is still 318.7MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 578.59ms. Allocated memory is still 520.1MB. Free memory was 470.7MB in the beginning and 442.6MB in the end (delta: 28.0MB). Peak memory consumption was 27.3MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 77.36ms. Allocated memory is still 520.1MB. Free memory was 442.6MB in the beginning and 438.9MB in the end (delta: 3.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. * Boogie Preprocessor took 58.45ms. Allocated memory is still 520.1MB. Free memory was 438.9MB in the beginning and 436.4MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 1030.05ms. Allocated memory is still 520.1MB. Free memory was 436.4MB in the beginning and 437.9MB in the end (delta: -1.5MB). Peak memory consumption was 27.8MB. Max. memory is 16.0GB. * TraceAbstraction took 90751.56ms. Allocated memory was 520.1MB in the beginning and 15.1GB in the end (delta: 14.6GB). Free memory was 436.8MB in the beginning and 10.9GB in the end (delta: -10.4GB). Peak memory consumption was 4.1GB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 268]: Unsoundness Warning unspecified type, defaulting to int C: short [268] - GenericResultAtLocation [Line: 268]: Unsoundness Warning unspecified type, defaulting to int C: short [268] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.1s, 98 PlacesBefore, 26 PlacesAfterwards, 94 TransitionsBefore, 21 TransitionsAfterwards, 796 CoEnabledTransitionPairs, 7 FixpointIterations, 48 TrivialSequentialCompositions, 23 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 1 ChoiceCompositions, 80 TotalNumberOfCompositions, 2219 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 982, independent: 860, independent conditional: 0, independent unconditional: 860, dependent: 122, dependent conditional: 0, dependent unconditional: 122, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 421, independent: 407, independent conditional: 0, independent unconditional: 407, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 982, independent: 453, independent conditional: 0, independent unconditional: 453, dependent: 108, dependent conditional: 0, dependent unconditional: 108, unknown: 421, unknown conditional: 0, unknown unconditional: 421] , Statistics on independence cache: Total cache size (in pairs): 47, Positive cache size: 40, Positive conditional cache size: 0, Positive unconditional cache size: 40, Negative cache size: 7, Negative conditional cache size: 0, Negative unconditional cache size: 7, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.4s, 123 PlacesBefore, 48 PlacesAfterwards, 115 TransitionsBefore, 39 TransitionsAfterwards, 2384 CoEnabledTransitionPairs, 7 FixpointIterations, 48 TrivialSequentialCompositions, 25 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 1 ChoiceCompositions, 82 TotalNumberOfCompositions, 11143 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3043, independent: 2723, independent conditional: 0, independent unconditional: 2723, dependent: 320, dependent conditional: 0, dependent unconditional: 320, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1031, independent: 992, independent conditional: 0, independent unconditional: 992, dependent: 39, dependent conditional: 0, dependent unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3043, independent: 1731, independent conditional: 0, independent unconditional: 1731, dependent: 281, dependent conditional: 0, dependent unconditional: 281, unknown: 1031, unknown conditional: 0, unknown unconditional: 1031] , Statistics on independence cache: Total cache size (in pairs): 188, Positive cache size: 166, Positive conditional cache size: 0, Positive unconditional cache size: 166, 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 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.9s, 146 PlacesBefore, 52 PlacesAfterwards, 141 TransitionsBefore, 43 TransitionsAfterwards, 4404 CoEnabledTransitionPairs, 7 FixpointIterations, 48 TrivialSequentialCompositions, 46 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 12 ConcurrentYvCompositions, 4 ChoiceCompositions, 110 TotalNumberOfCompositions, 16919 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 4668, independent: 4315, independent conditional: 0, independent unconditional: 4315, dependent: 353, dependent conditional: 0, dependent unconditional: 353, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 2065, independent: 2007, independent conditional: 0, independent unconditional: 2007, dependent: 58, dependent conditional: 0, dependent unconditional: 58, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 4668, independent: 2308, independent conditional: 0, independent unconditional: 2308, dependent: 295, dependent conditional: 0, dependent unconditional: 295, unknown: 2065, unknown conditional: 0, unknown unconditional: 2065] , Statistics on independence cache: Total cache size (in pairs): 203, Positive cache size: 177, Positive conditional cache size: 0, Positive unconditional cache size: 177, Negative cache size: 26, Negative conditional cache size: 0, Negative unconditional cache size: 26, 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_p1_EAX = 0; [L715] 0 int __unbuffered_p1_EBX = 0; [L716] 0 _Bool main$tmp_guard0; [L717] 0 _Bool main$tmp_guard1; [L719] 0 int x = 0; [L720] 0 _Bool x$flush_delayed; [L721] 0 int x$mem_tmp; [L722] 0 _Bool x$r_buff0_thd0; [L723] 0 _Bool x$r_buff0_thd1; [L724] 0 _Bool x$r_buff0_thd2; [L725] 0 _Bool x$r_buff1_thd0; [L726] 0 _Bool x$r_buff1_thd1; [L727] 0 _Bool x$r_buff1_thd2; [L728] 0 _Bool x$read_delayed; [L729] 0 int *x$read_delayed_var; [L730] 0 int x$w_buff0; [L731] 0 _Bool x$w_buff0_used; [L732] 0 int x$w_buff1; [L733] 0 _Bool x$w_buff1_used; [L735] 0 int y = 0; [L736] 0 _Bool y$flush_delayed; [L737] 0 int y$mem_tmp; [L738] 0 _Bool y$r_buff0_thd0; [L739] 0 _Bool y$r_buff0_thd1; [L740] 0 _Bool y$r_buff0_thd2; [L741] 0 _Bool y$r_buff1_thd0; [L742] 0 _Bool y$r_buff1_thd1; [L743] 0 _Bool y$r_buff1_thd2; [L744] 0 _Bool y$read_delayed; [L745] 0 int *y$read_delayed_var; [L746] 0 int y$w_buff0; [L747] 0 _Bool y$w_buff0_used; [L748] 0 int y$w_buff1; [L749] 0 _Bool y$w_buff1_used; [L750] 0 _Bool weak$$choice0; [L751] 0 _Bool weak$$choice2; [L876] 0 pthread_t t1629[2]; [L877] 0 int asdf=0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, asdf=0, main$tmp_guard0=0, main$tmp_guard1=0, t1629={5:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=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] [L877] COND TRUE 0 asdf<2 [L877] FCALL, FORK 0 pthread_create(&t1629[asdf], ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, asdf=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1629[asdf], ((void *)0), P0, ((void *)0))=-3, t1629={5:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=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] [L877] 0 asdf++ VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, asdf=1, main$tmp_guard0=0, main$tmp_guard1=0, t1629={5:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=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] [L877] COND TRUE 0 asdf<2 [L877] FCALL, FORK 0 pthread_create(&t1629[asdf], ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, asdf=1, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1629[asdf], ((void *)0), P0, ((void *)0))=-2, t1629={5:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=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] [L877] 0 asdf++ VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, t1629={5:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=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] [L877] COND FALSE 0 !(asdf<2) [L878] 0 pthread_t t1630[2]; [L879] 0 int asdf=0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, asdf=0, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, t1629={5:0}, t1630={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=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] [L879] COND TRUE 0 asdf<2 [L879] FCALL, FORK 0 pthread_create(&t1630[asdf], ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, asdf=0, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1630[asdf], ((void *)0), P1, ((void *)0))=-1, t1629={5:0}, t1630={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=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] [L795] 3 x$w_buff1 = x$w_buff0 [L796] 3 x$w_buff0 = 2 [L797] 3 x$w_buff1_used = x$w_buff0_used [L798] 3 x$w_buff0_used = (_Bool)1 [L799] CALL 3 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND FALSE 3 !(!expression) [L799] RET 3 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L800] 3 x$r_buff1_thd0 = x$r_buff0_thd0 [L801] 3 x$r_buff1_thd1 = x$r_buff0_thd1 [L802] 3 x$r_buff1_thd2 = x$r_buff0_thd2 [L803] 3 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=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] [L879] 0 asdf++ VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, asdf=1, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, t1629={5:0}, t1630={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=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] [L879] COND TRUE 0 asdf<2 [L879] FCALL, FORK 0 pthread_create(&t1630[asdf], ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, asdf=1, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1630[asdf], ((void *)0), P1, ((void *)0))=0, t1629={5:0}, t1630={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=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] [L795] 4 x$w_buff1 = x$w_buff0 [L796] 4 x$w_buff0 = 2 [L797] 4 x$w_buff1_used = x$w_buff0_used [L798] 4 x$w_buff0_used = (_Bool)1 [L799] CALL 4 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND TRUE 4 !expression [L19] 4 reach_error() VAL [\old(expression)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, expression=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=2, x$w_buff1_used=1, 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] - 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. - 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, 139 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 4.9s, OverallIterations: 2, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 19 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 11 mSDsluCounter, 1 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 3 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 44 IncrementalHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 1 mSDtfsCounter, 44 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=60occurred 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.1s 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, 160 locations, 9 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: 17.1s, OverallIterations: 4, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 12.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.4s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 182 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 149 mSDsluCounter, 2 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 11 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 419 IncrementalHoareTripleChecker+Invalid, 430 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 11 mSolverCounterUnsat, 2 mSDtfsCounter, 419 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=124occurred 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.1s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 91 NumberOfCodeBlocks, 91 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 96 ConstructedInterpolants, 0 QuantifiedInterpolants, 188 SizeOfPredicates, 0 NumberOfNonLiveVariables, 562 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, 160 locations, 9 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: 68.5s, OverallIterations: 7, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 62.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.9s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 220 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 182 mSDsluCounter, 5 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 30 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 566 IncrementalHoareTripleChecker+Invalid, 596 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 30 mSolverCounterUnsat, 5 mSDtfsCounter, 566 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 70 GetRequests, 54 SyntacticMatches, 4 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=187occurred in iteration=6, InterpolantAutomatonStates: 20, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 120 NumberOfCodeBlocks, 120 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 117 ConstructedInterpolants, 0 QuantifiedInterpolants, 293 SizeOfPredicates, 0 NumberOfNonLiveVariables, 618 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 11 InterpolantComputations, 4 PerfectInterpolantSequences, 31/38 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:56:57,681 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...