./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/safe002_power.opt_pso.oepc_pso.opt_rmo.opt.i --full-output --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations AFTER --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version b8dbc81d Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe002_power.opt_pso.oepc_pso.opt_rmo.opt.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 390a12f9f7a5c311c1cdcecac54987f654ebac30db2fbb7661324a5599d93cf6 --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations AFTER --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-08-30 16:54:43,063 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-30 16:54:43,065 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-30 16:54:43,096 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-30 16:54:43,100 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-30 16:54:43,103 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-30 16:54:43,105 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-30 16:54:43,108 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-30 16:54:43,110 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-30 16:54:43,114 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-30 16:54:43,115 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-30 16:54:43,117 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-30 16:54:43,118 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-30 16:54:43,119 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-30 16:54:43,121 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-30 16:54:43,124 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-30 16:54:43,125 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-30 16:54:43,126 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-30 16:54:43,129 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-30 16:54:43,134 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-30 16:54:43,146 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-30 16:54:43,147 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-30 16:54:43,148 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-30 16:54:43,148 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-30 16:54:43,155 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-30 16:54:43,156 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-30 16:54:43,156 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-30 16:54:43,158 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-30 16:54:43,158 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-30 16:54:43,159 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-30 16:54:43,160 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-30 16:54:43,161 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-30 16:54:43,163 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-30 16:54:43,164 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-30 16:54:43,164 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-30 16:54:43,165 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-30 16:54:43,165 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-30 16:54:43,166 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-30 16:54:43,166 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-30 16:54:43,167 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-30 16:54:43,167 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-30 16:54:43,169 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-08-30 16:54:43,200 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-30 16:54:43,200 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-30 16:54:43,201 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-30 16:54:43,201 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-30 16:54:43,202 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-30 16:54:43,202 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-30 16:54:43,203 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-30 16:54:43,203 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-30 16:54:43,203 INFO L138 SettingsManager]: * Use SBE=true [2023-08-30 16:54:43,203 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-30 16:54:43,204 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-30 16:54:43,204 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-30 16:54:43,205 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-30 16:54:43,205 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-30 16:54:43,205 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-30 16:54:43,205 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-30 16:54:43,205 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-30 16:54:43,206 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-30 16:54:43,206 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-08-30 16:54:43,206 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-30 16:54:43,206 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-30 16:54:43,206 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-30 16:54:43,207 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-30 16:54:43,207 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-30 16:54:43,207 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 16:54:43,207 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-30 16:54:43,207 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-30 16:54:43,208 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-30 16:54:43,208 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-30 16:54:43,208 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-30 16:54:43,208 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-30 16:54:43,208 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-08-30 16:54:43,209 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-30 16:54:43,209 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-30 16:54:43,209 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-30 16:54:43,209 INFO L138 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.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 390a12f9f7a5c311c1cdcecac54987f654ebac30db2fbb7661324a5599d93cf6 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: When to check the insufficient erros location relative to the other error locations -> AFTER [2023-08-30 16:54:43,516 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-30 16:54:43,539 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-30 16:54:43,541 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-30 16:54:43,543 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-30 16:54:43,543 INFO L275 PluginConnector]: CDTParser initialized [2023-08-30 16:54:43,545 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe002_power.opt_pso.oepc_pso.opt_rmo.opt.i [2023-08-30 16:54:44,647 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-30 16:54:44,870 INFO L351 CDTParser]: Found 1 translation units. [2023-08-30 16:54:44,871 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe002_power.opt_pso.oepc_pso.opt_rmo.opt.i [2023-08-30 16:54:44,893 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bd393beac/df087ae0a8d9457e812faab8dae8d896/FLAGa903501ba [2023-08-30 16:54:44,906 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bd393beac/df087ae0a8d9457e812faab8dae8d896 [2023-08-30 16:54:44,908 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-30 16:54:44,909 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-30 16:54:44,911 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-30 16:54:44,911 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-30 16:54:44,914 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-30 16:54:44,914 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 04:54:44" (1/1) ... [2023-08-30 16:54:44,915 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@47c55dbe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:54:44, skipping insertion in model container [2023-08-30 16:54:44,915 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 04:54:44" (1/1) ... [2023-08-30 16:54:44,921 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-30 16:54:44,959 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-30 16:54:45,148 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe002_power.opt_pso.oepc_pso.opt_rmo.opt.i[1019,1032] [2023-08-30 16:54:45,367 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 16:54:45,378 INFO L203 MainTranslator]: Completed pre-run [2023-08-30 16:54:45,389 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe002_power.opt_pso.oepc_pso.opt_rmo.opt.i[1019,1032] [2023-08-30 16:54:45,445 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 16:54:45,482 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-30 16:54:45,483 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-30 16:54:45,488 INFO L208 MainTranslator]: Completed translation [2023-08-30 16:54:45,489 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:54:45 WrapperNode [2023-08-30 16:54:45,489 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-30 16:54:45,490 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-30 16:54:45,490 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-30 16:54:45,490 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-30 16:54:45,496 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:54:45" (1/1) ... [2023-08-30 16:54:45,527 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:54:45" (1/1) ... [2023-08-30 16:54:45,561 INFO L138 Inliner]: procedures = 176, calls = 54, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 128 [2023-08-30 16:54:45,561 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-30 16:54:45,563 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-30 16:54:45,563 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-30 16:54:45,563 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-30 16:54:45,571 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:54:45" (1/1) ... [2023-08-30 16:54:45,572 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:54:45" (1/1) ... [2023-08-30 16:54:45,588 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:54:45" (1/1) ... [2023-08-30 16:54:45,589 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:54:45" (1/1) ... [2023-08-30 16:54:45,595 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:54:45" (1/1) ... [2023-08-30 16:54:45,609 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:54:45" (1/1) ... [2023-08-30 16:54:45,611 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:54:45" (1/1) ... [2023-08-30 16:54:45,612 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:54:45" (1/1) ... [2023-08-30 16:54:45,617 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-30 16:54:45,622 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-30 16:54:45,622 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-30 16:54:45,622 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-30 16:54:45,623 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:54:45" (1/1) ... [2023-08-30 16:54:45,628 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 16:54:45,639 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 16:54:45,685 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-30 16:54:45,715 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-30 16:54:45,734 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-30 16:54:45,734 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-30 16:54:45,735 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-30 16:54:45,735 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-30 16:54:45,735 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-30 16:54:45,735 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-30 16:54:45,735 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-30 16:54:45,735 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-30 16:54:45,735 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-30 16:54:45,736 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-30 16:54:45,736 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-30 16:54:45,736 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-30 16:54:45,736 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-30 16:54:45,736 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-30 16:54:45,736 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-30 16:54:45,738 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-30 16:54:45,947 INFO L236 CfgBuilder]: Building ICFG [2023-08-30 16:54:45,948 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-30 16:54:46,232 INFO L277 CfgBuilder]: Performing block encoding [2023-08-30 16:54:46,368 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-30 16:54:46,368 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-30 16:54:46,370 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 04:54:46 BoogieIcfgContainer [2023-08-30 16:54:46,370 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-30 16:54:46,372 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-30 16:54:46,372 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-30 16:54:46,375 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-30 16:54:46,375 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.08 04:54:44" (1/3) ... [2023-08-30 16:54:46,376 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ddaff61 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 04:54:46, skipping insertion in model container [2023-08-30 16:54:46,376 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:54:45" (2/3) ... [2023-08-30 16:54:46,376 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ddaff61 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 04:54:46, skipping insertion in model container [2023-08-30 16:54:46,376 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 04:54:46" (3/3) ... [2023-08-30 16:54:46,377 INFO L112 eAbstractionObserver]: Analyzing ICFG safe002_power.opt_pso.oepc_pso.opt_rmo.opt.i [2023-08-30 16:54:46,384 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-08-30 16:54:46,392 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-30 16:54:46,392 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-08-30 16:54:46,393 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-30 16:54:46,435 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-30 16:54:46,465 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 115 places, 107 transitions, 229 flow [2023-08-30 16:54:46,502 INFO L130 PetriNetUnfolder]: 2/104 cut-off events. [2023-08-30 16:54:46,502 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 16:54:46,506 INFO L83 FinitePrefix]: Finished finitePrefix Result has 114 conditions, 104 events. 2/104 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 56 event pairs, 0 based on Foata normal form. 0/100 useless extension candidates. Maximal degree in co-relation 68. Up to 2 conditions per place. [2023-08-30 16:54:46,507 INFO L82 GeneralOperation]: Start removeDead. Operand has 115 places, 107 transitions, 229 flow [2023-08-30 16:54:46,510 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 112 places, 104 transitions, 217 flow [2023-08-30 16:54:46,513 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-30 16:54:46,521 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 112 places, 104 transitions, 217 flow [2023-08-30 16:54:46,524 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 112 places, 104 transitions, 217 flow [2023-08-30 16:54:46,525 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 112 places, 104 transitions, 217 flow [2023-08-30 16:54:46,551 INFO L130 PetriNetUnfolder]: 2/104 cut-off events. [2023-08-30 16:54:46,551 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 16:54:46,552 INFO L83 FinitePrefix]: Finished finitePrefix Result has 114 conditions, 104 events. 2/104 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 56 event pairs, 0 based on Foata normal form. 0/100 useless extension candidates. Maximal degree in co-relation 68. Up to 2 conditions per place. [2023-08-30 16:54:46,553 INFO L119 LiptonReduction]: Number of co-enabled transitions 1790 [2023-08-30 16:54:50,030 INFO L134 LiptonReduction]: Checked pairs total: 4542 [2023-08-30 16:54:50,030 INFO L136 LiptonReduction]: Total number of compositions: 93 [2023-08-30 16:54:50,042 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-30 16:54:50,054 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;@5d024a41, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-30 16:54:50,054 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2023-08-30 16:54:50,058 INFO L130 PetriNetUnfolder]: 0/8 cut-off events. [2023-08-30 16:54:50,058 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 16:54:50,058 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:54:50,059 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-30 16:54:50,059 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-30 16:54:50,063 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:54:50,063 INFO L85 PathProgramCache]: Analyzing trace with hash 440961859, now seen corresponding path program 1 times [2023-08-30 16:54:50,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:54:50,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317453609] [2023-08-30 16:54:50,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:54:50,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:54:50,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:54:50,501 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-30 16:54:50,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:54:50,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [317453609] [2023-08-30 16:54:50,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [317453609] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:54:50,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:54:50,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 16:54:50,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408358135] [2023-08-30 16:54:50,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:54:50,511 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 16:54:50,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:54:50,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 16:54:50,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 16:54:50,552 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 200 [2023-08-30 16:54:50,554 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 23 transitions, 55 flow. Second operand has 3 states, 3 states have (on average 95.66666666666667) internal successors, (287), 3 states have internal predecessors, (287), 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-30 16:54:50,575 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:54:50,576 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 200 [2023-08-30 16:54:50,577 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:54:50,840 INFO L130 PetriNetUnfolder]: 711/1168 cut-off events. [2023-08-30 16:54:50,841 INFO L131 PetriNetUnfolder]: For 14/14 co-relation queries the response was YES. [2023-08-30 16:54:50,846 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2287 conditions, 1168 events. 711/1168 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 5622 event pairs, 117 based on Foata normal form. 0/1100 useless extension candidates. Maximal degree in co-relation 2276. Up to 859 conditions per place. [2023-08-30 16:54:50,853 INFO L137 encePairwiseOnDemand]: 196/200 looper letters, 27 selfloop transitions, 2 changer transitions 2/33 dead transitions. [2023-08-30 16:54:50,853 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 33 transitions, 140 flow [2023-08-30 16:54:50,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 16:54:50,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 16:54:50,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 316 transitions. [2023-08-30 16:54:50,872 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5266666666666666 [2023-08-30 16:54:50,873 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 316 transitions. [2023-08-30 16:54:50,873 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 316 transitions. [2023-08-30 16:54:50,876 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:54:50,878 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 316 transitions. [2023-08-30 16:54:50,883 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 105.33333333333333) internal successors, (316), 3 states have internal predecessors, (316), 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-30 16:54:50,886 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 200.0) internal successors, (800), 4 states have internal predecessors, (800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:54:50,887 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 200.0) internal successors, (800), 4 states have internal predecessors, (800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:54:50,888 INFO L175 Difference]: Start difference. First operand has 32 places, 23 transitions, 55 flow. Second operand 3 states and 316 transitions. [2023-08-30 16:54:50,889 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 33 transitions, 140 flow [2023-08-30 16:54:50,892 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 33 transitions, 136 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-30 16:54:50,893 INFO L231 Difference]: Finished difference. Result has 30 places, 20 transitions, 50 flow [2023-08-30 16:54:50,895 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=48, PETRI_DIFFERENCE_MINUEND_PLACES=28, 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=50, PETRI_PLACES=30, PETRI_TRANSITIONS=20} [2023-08-30 16:54:50,900 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, -2 predicate places. [2023-08-30 16:54:50,900 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 20 transitions, 50 flow [2023-08-30 16:54:50,900 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 95.66666666666667) internal successors, (287), 3 states have internal predecessors, (287), 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-30 16:54:50,901 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:54:50,901 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:54:50,901 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-30 16:54:50,901 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-30 16:54:50,902 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:54:50,902 INFO L85 PathProgramCache]: Analyzing trace with hash 1675886639, now seen corresponding path program 1 times [2023-08-30 16:54:50,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:54:50,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094222425] [2023-08-30 16:54:50,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:54:50,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:54:50,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:54:51,250 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-30 16:54:51,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:54:51,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094222425] [2023-08-30 16:54:51,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1094222425] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:54:51,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:54:51,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 16:54:51,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955096941] [2023-08-30 16:54:51,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:54:51,257 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 16:54:51,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:54:51,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 16:54:51,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 16:54:51,276 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 200 [2023-08-30 16:54:51,277 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 20 transitions, 50 flow. Second operand has 3 states, 3 states have (on average 90.0) internal successors, (270), 3 states have internal predecessors, (270), 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-30 16:54:51,277 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:54:51,277 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 200 [2023-08-30 16:54:51,277 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:54:51,555 INFO L130 PetriNetUnfolder]: 1317/2014 cut-off events. [2023-08-30 16:54:51,555 INFO L131 PetriNetUnfolder]: For 97/97 co-relation queries the response was YES. [2023-08-30 16:54:51,558 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4198 conditions, 2014 events. 1317/2014 cut-off events. For 97/97 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 9444 event pairs, 419 based on Foata normal form. 70/2084 useless extension candidates. Maximal degree in co-relation 4188. Up to 1272 conditions per place. [2023-08-30 16:54:51,567 INFO L137 encePairwiseOnDemand]: 193/200 looper letters, 31 selfloop transitions, 6 changer transitions 0/37 dead transitions. [2023-08-30 16:54:51,567 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 37 transitions, 164 flow [2023-08-30 16:54:51,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 16:54:51,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 16:54:51,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 299 transitions. [2023-08-30 16:54:51,569 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49833333333333335 [2023-08-30 16:54:51,570 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 299 transitions. [2023-08-30 16:54:51,570 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 299 transitions. [2023-08-30 16:54:51,570 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:54:51,570 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 299 transitions. [2023-08-30 16:54:51,571 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 99.66666666666667) internal successors, (299), 3 states have internal predecessors, (299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:54:51,574 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 200.0) internal successors, (800), 4 states have internal predecessors, (800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:54:51,575 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 200.0) internal successors, (800), 4 states have internal predecessors, (800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:54:51,575 INFO L175 Difference]: Start difference. First operand has 30 places, 20 transitions, 50 flow. Second operand 3 states and 299 transitions. [2023-08-30 16:54:51,575 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 37 transitions, 164 flow [2023-08-30 16:54:51,576 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 37 transitions, 158 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 16:54:51,577 INFO L231 Difference]: Finished difference. Result has 31 places, 25 transitions, 92 flow [2023-08-30 16:54:51,577 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=46, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=92, PETRI_PLACES=31, PETRI_TRANSITIONS=25} [2023-08-30 16:54:51,578 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, -1 predicate places. [2023-08-30 16:54:51,578 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 25 transitions, 92 flow [2023-08-30 16:54:51,578 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 90.0) internal successors, (270), 3 states have internal predecessors, (270), 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-30 16:54:51,578 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:54:51,579 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:54:51,579 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-30 16:54:51,579 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-30 16:54:51,580 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:54:51,580 INFO L85 PathProgramCache]: Analyzing trace with hash 412876948, now seen corresponding path program 1 times [2023-08-30 16:54:51,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:54:51,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494414851] [2023-08-30 16:54:51,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:54:51,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:54:51,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:54:51,843 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-30 16:54:51,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:54:51,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494414851] [2023-08-30 16:54:51,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1494414851] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:54:51,844 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:54:51,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 16:54:51,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770992606] [2023-08-30 16:54:51,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:54:51,846 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 16:54:51,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:54:51,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 16:54:51,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-30 16:54:51,865 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 200 [2023-08-30 16:54:51,866 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 25 transitions, 92 flow. Second operand has 4 states, 4 states have (on average 89.5) internal successors, (358), 4 states have internal predecessors, (358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:54:51,866 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:54:51,866 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 200 [2023-08-30 16:54:51,867 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:54:52,146 INFO L130 PetriNetUnfolder]: 1263/1933 cut-off events. [2023-08-30 16:54:52,146 INFO L131 PetriNetUnfolder]: For 827/827 co-relation queries the response was YES. [2023-08-30 16:54:52,149 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4983 conditions, 1933 events. 1263/1933 cut-off events. For 827/827 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 8774 event pairs, 156 based on Foata normal form. 12/1945 useless extension candidates. Maximal degree in co-relation 4971. Up to 1103 conditions per place. [2023-08-30 16:54:52,157 INFO L137 encePairwiseOnDemand]: 193/200 looper letters, 38 selfloop transitions, 10 changer transitions 0/48 dead transitions. [2023-08-30 16:54:52,157 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 48 transitions, 264 flow [2023-08-30 16:54:52,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 16:54:52,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 16:54:52,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 393 transitions. [2023-08-30 16:54:52,159 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49125 [2023-08-30 16:54:52,159 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 393 transitions. [2023-08-30 16:54:52,160 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 393 transitions. [2023-08-30 16:54:52,160 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:54:52,160 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 393 transitions. [2023-08-30 16:54:52,162 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 98.25) internal successors, (393), 4 states have internal predecessors, (393), 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-30 16:54:52,163 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 200.0) internal successors, (1000), 5 states have internal predecessors, (1000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:54:52,164 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 200.0) internal successors, (1000), 5 states have internal predecessors, (1000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:54:52,164 INFO L175 Difference]: Start difference. First operand has 31 places, 25 transitions, 92 flow. Second operand 4 states and 393 transitions. [2023-08-30 16:54:52,164 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 48 transitions, 264 flow [2023-08-30 16:54:52,170 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 48 transitions, 242 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 16:54:52,171 INFO L231 Difference]: Finished difference. Result has 35 places, 31 transitions, 154 flow [2023-08-30 16:54:52,172 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=154, PETRI_PLACES=35, PETRI_TRANSITIONS=31} [2023-08-30 16:54:52,173 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 3 predicate places. [2023-08-30 16:54:52,176 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 31 transitions, 154 flow [2023-08-30 16:54:52,176 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 89.5) internal successors, (358), 4 states have internal predecessors, (358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:54:52,176 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:54:52,176 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:54:52,177 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-30 16:54:52,177 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-30 16:54:52,178 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:54:52,178 INFO L85 PathProgramCache]: Analyzing trace with hash -87159557, now seen corresponding path program 1 times [2023-08-30 16:54:52,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:54:52,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234166115] [2023-08-30 16:54:52,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:54:52,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:54:52,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:54:52,400 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-30 16:54:52,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:54:52,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234166115] [2023-08-30 16:54:52,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [234166115] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:54:52,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:54:52,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 16:54:52,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50830707] [2023-08-30 16:54:52,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:54:52,402 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 16:54:52,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:54:52,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 16:54:52,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-30 16:54:52,416 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 200 [2023-08-30 16:54:52,417 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 31 transitions, 154 flow. Second operand has 4 states, 4 states have (on average 89.75) internal successors, (359), 4 states have internal predecessors, (359), 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-30 16:54:52,417 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:54:52,419 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 200 [2023-08-30 16:54:52,419 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:54:52,698 INFO L130 PetriNetUnfolder]: 1214/1860 cut-off events. [2023-08-30 16:54:52,698 INFO L131 PetriNetUnfolder]: For 1554/1554 co-relation queries the response was YES. [2023-08-30 16:54:52,701 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5243 conditions, 1860 events. 1214/1860 cut-off events. For 1554/1554 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 8469 event pairs, 291 based on Foata normal form. 15/1875 useless extension candidates. Maximal degree in co-relation 5228. Up to 1069 conditions per place. [2023-08-30 16:54:52,709 INFO L137 encePairwiseOnDemand]: 193/200 looper letters, 45 selfloop transitions, 12 changer transitions 0/57 dead transitions. [2023-08-30 16:54:52,709 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 57 transitions, 352 flow [2023-08-30 16:54:52,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 16:54:52,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 16:54:52,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 397 transitions. [2023-08-30 16:54:52,711 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49625 [2023-08-30 16:54:52,711 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 397 transitions. [2023-08-30 16:54:52,711 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 397 transitions. [2023-08-30 16:54:52,712 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:54:52,712 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 397 transitions. [2023-08-30 16:54:52,713 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 99.25) internal successors, (397), 4 states have internal predecessors, (397), 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-30 16:54:52,714 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 200.0) internal successors, (1000), 5 states have internal predecessors, (1000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:54:52,715 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 200.0) internal successors, (1000), 5 states have internal predecessors, (1000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:54:52,715 INFO L175 Difference]: Start difference. First operand has 35 places, 31 transitions, 154 flow. Second operand 4 states and 397 transitions. [2023-08-30 16:54:52,715 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 57 transitions, 352 flow [2023-08-30 16:54:52,721 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 57 transitions, 352 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-30 16:54:52,722 INFO L231 Difference]: Finished difference. Result has 41 places, 34 transitions, 234 flow [2023-08-30 16:54:52,722 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=234, PETRI_PLACES=41, PETRI_TRANSITIONS=34} [2023-08-30 16:54:52,723 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 9 predicate places. [2023-08-30 16:54:52,723 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 34 transitions, 234 flow [2023-08-30 16:54:52,723 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 89.75) internal successors, (359), 4 states have internal predecessors, (359), 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-30 16:54:52,723 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:54:52,723 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:54:52,724 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-30 16:54:52,724 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-30 16:54:52,724 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:54:52,724 INFO L85 PathProgramCache]: Analyzing trace with hash 1593055990, now seen corresponding path program 1 times [2023-08-30 16:54:52,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:54:52,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452509436] [2023-08-30 16:54:52,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:54:52,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:54:52,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:54:52,884 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-30 16:54:52,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:54:52,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452509436] [2023-08-30 16:54:52,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [452509436] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:54:52,885 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:54:52,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 16:54:52,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712174614] [2023-08-30 16:54:52,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:54:52,885 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 16:54:52,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:54:52,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 16:54:52,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-08-30 16:54:52,899 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 200 [2023-08-30 16:54:52,900 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 34 transitions, 234 flow. Second operand has 5 states, 5 states have (on average 89.4) internal successors, (447), 5 states have internal predecessors, (447), 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-30 16:54:52,900 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:54:52,900 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 200 [2023-08-30 16:54:52,900 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:54:53,283 INFO L130 PetriNetUnfolder]: 1726/2663 cut-off events. [2023-08-30 16:54:53,283 INFO L131 PetriNetUnfolder]: For 4995/4995 co-relation queries the response was YES. [2023-08-30 16:54:53,289 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8276 conditions, 2663 events. 1726/2663 cut-off events. For 4995/4995 co-relation queries the response was YES. Maximal size of possible extension queue 145. Compared 13012 event pairs, 403 based on Foata normal form. 57/2720 useless extension candidates. Maximal degree in co-relation 8256. Up to 1211 conditions per place. [2023-08-30 16:54:53,297 INFO L137 encePairwiseOnDemand]: 193/200 looper letters, 41 selfloop transitions, 9 changer transitions 15/65 dead transitions. [2023-08-30 16:54:53,297 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 65 transitions, 480 flow [2023-08-30 16:54:53,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 16:54:53,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 16:54:53,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 490 transitions. [2023-08-30 16:54:53,299 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49 [2023-08-30 16:54:53,299 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 490 transitions. [2023-08-30 16:54:53,299 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 490 transitions. [2023-08-30 16:54:53,300 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:54:53,300 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 490 transitions. [2023-08-30 16:54:53,301 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 98.0) internal successors, (490), 5 states have internal predecessors, (490), 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-30 16:54:53,303 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 200.0) internal successors, (1200), 6 states have internal predecessors, (1200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:54:53,303 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 200.0) internal successors, (1200), 6 states have internal predecessors, (1200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:54:53,303 INFO L175 Difference]: Start difference. First operand has 41 places, 34 transitions, 234 flow. Second operand 5 states and 490 transitions. [2023-08-30 16:54:53,303 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 65 transitions, 480 flow [2023-08-30 16:54:53,313 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 65 transitions, 476 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 16:54:53,314 INFO L231 Difference]: Finished difference. Result has 45 places, 28 transitions, 193 flow [2023-08-30 16:54:53,314 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=230, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=193, PETRI_PLACES=45, PETRI_TRANSITIONS=28} [2023-08-30 16:54:53,315 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 13 predicate places. [2023-08-30 16:54:53,315 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 28 transitions, 193 flow [2023-08-30 16:54:53,316 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 89.4) internal successors, (447), 5 states have internal predecessors, (447), 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-30 16:54:53,316 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:54:53,316 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:54:53,316 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-30 16:54:53,316 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-30 16:54:53,317 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:54:53,317 INFO L85 PathProgramCache]: Analyzing trace with hash 1869600855, now seen corresponding path program 1 times [2023-08-30 16:54:53,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:54:53,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615542114] [2023-08-30 16:54:53,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:54:53,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:54:53,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:54:53,463 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-30 16:54:53,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:54:53,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615542114] [2023-08-30 16:54:53,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [615542114] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:54:53,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:54:53,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 16:54:53,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080864790] [2023-08-30 16:54:53,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:54:53,465 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 16:54:53,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:54:53,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 16:54:53,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 16:54:53,470 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 200 [2023-08-30 16:54:53,470 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 28 transitions, 193 flow. Second operand has 3 states, 3 states have (on average 96.66666666666667) internal successors, (290), 3 states have internal predecessors, (290), 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-30 16:54:53,470 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:54:53,471 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 200 [2023-08-30 16:54:53,471 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:54:53,660 INFO L130 PetriNetUnfolder]: 835/1325 cut-off events. [2023-08-30 16:54:53,660 INFO L131 PetriNetUnfolder]: For 2773/2782 co-relation queries the response was YES. [2023-08-30 16:54:53,664 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4385 conditions, 1325 events. 835/1325 cut-off events. For 2773/2782 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 5919 event pairs, 321 based on Foata normal form. 9/1318 useless extension candidates. Maximal degree in co-relation 4363. Up to 1079 conditions per place. [2023-08-30 16:54:53,671 INFO L137 encePairwiseOnDemand]: 197/200 looper letters, 26 selfloop transitions, 3 changer transitions 0/36 dead transitions. [2023-08-30 16:54:53,671 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 36 transitions, 281 flow [2023-08-30 16:54:53,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 16:54:53,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 16:54:53,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 306 transitions. [2023-08-30 16:54:53,673 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.51 [2023-08-30 16:54:53,673 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 306 transitions. [2023-08-30 16:54:53,673 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 306 transitions. [2023-08-30 16:54:53,673 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:54:53,673 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 306 transitions. [2023-08-30 16:54:53,674 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 102.0) internal successors, (306), 3 states have internal predecessors, (306), 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-30 16:54:53,675 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 200.0) internal successors, (800), 4 states have internal predecessors, (800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:54:53,676 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 200.0) internal successors, (800), 4 states have internal predecessors, (800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:54:53,676 INFO L175 Difference]: Start difference. First operand has 45 places, 28 transitions, 193 flow. Second operand 3 states and 306 transitions. [2023-08-30 16:54:53,676 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 36 transitions, 281 flow [2023-08-30 16:54:53,682 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 36 transitions, 217 flow, removed 4 selfloop flow, removed 9 redundant places. [2023-08-30 16:54:53,683 INFO L231 Difference]: Finished difference. Result has 39 places, 28 transitions, 146 flow [2023-08-30 16:54:53,683 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=135, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=146, PETRI_PLACES=39, PETRI_TRANSITIONS=28} [2023-08-30 16:54:53,684 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 7 predicate places. [2023-08-30 16:54:53,684 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 28 transitions, 146 flow [2023-08-30 16:54:53,684 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 96.66666666666667) internal successors, (290), 3 states have internal predecessors, (290), 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-30 16:54:53,684 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:54:53,684 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:54:53,685 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-30 16:54:53,685 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-30 16:54:53,685 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:54:53,685 INFO L85 PathProgramCache]: Analyzing trace with hash 1637706220, now seen corresponding path program 2 times [2023-08-30 16:54:53,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:54:53,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320496710] [2023-08-30 16:54:53,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:54:53,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:54:53,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:54:53,819 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-30 16:54:53,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:54:53,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1320496710] [2023-08-30 16:54:53,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1320496710] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:54:53,820 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:54:53,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 16:54:53,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644102547] [2023-08-30 16:54:53,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:54:53,821 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 16:54:53,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:54:53,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 16:54:53,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-08-30 16:54:53,834 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 200 [2023-08-30 16:54:53,835 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 28 transitions, 146 flow. Second operand has 5 states, 5 states have (on average 89.4) internal successors, (447), 5 states have internal predecessors, (447), 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-30 16:54:53,835 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:54:53,835 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 200 [2023-08-30 16:54:53,835 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:54:54,095 INFO L130 PetriNetUnfolder]: 1130/1740 cut-off events. [2023-08-30 16:54:54,095 INFO L131 PetriNetUnfolder]: For 1505/1505 co-relation queries the response was YES. [2023-08-30 16:54:54,098 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4810 conditions, 1740 events. 1130/1740 cut-off events. For 1505/1505 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 7908 event pairs, 341 based on Foata normal form. 54/1794 useless extension candidates. Maximal degree in co-relation 4793. Up to 1074 conditions per place. [2023-08-30 16:54:54,102 INFO L137 encePairwiseOnDemand]: 193/200 looper letters, 33 selfloop transitions, 8 changer transitions 11/52 dead transitions. [2023-08-30 16:54:54,103 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 52 transitions, 332 flow [2023-08-30 16:54:54,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 16:54:54,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 16:54:54,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 482 transitions. [2023-08-30 16:54:54,105 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.482 [2023-08-30 16:54:54,105 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 482 transitions. [2023-08-30 16:54:54,105 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 482 transitions. [2023-08-30 16:54:54,105 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:54:54,105 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 482 transitions. [2023-08-30 16:54:54,107 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 96.4) internal successors, (482), 5 states have internal predecessors, (482), 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-30 16:54:54,108 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 200.0) internal successors, (1200), 6 states have internal predecessors, (1200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:54:54,108 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 200.0) internal successors, (1200), 6 states have internal predecessors, (1200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:54:54,109 INFO L175 Difference]: Start difference. First operand has 39 places, 28 transitions, 146 flow. Second operand 5 states and 482 transitions. [2023-08-30 16:54:54,109 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 52 transitions, 332 flow [2023-08-30 16:54:54,111 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 52 transitions, 324 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 16:54:54,112 INFO L231 Difference]: Finished difference. Result has 43 places, 26 transitions, 155 flow [2023-08-30 16:54:54,112 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=140, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=155, PETRI_PLACES=43, PETRI_TRANSITIONS=26} [2023-08-30 16:54:54,113 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 11 predicate places. [2023-08-30 16:54:54,113 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 26 transitions, 155 flow [2023-08-30 16:54:54,113 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 89.4) internal successors, (447), 5 states have internal predecessors, (447), 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-30 16:54:54,113 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:54:54,114 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:54:54,114 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-30 16:54:54,114 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-30 16:54:54,114 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:54:54,115 INFO L85 PathProgramCache]: Analyzing trace with hash 2123051309, now seen corresponding path program 1 times [2023-08-30 16:54:54,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:54:54,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434756962] [2023-08-30 16:54:54,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:54:54,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:54:54,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:54:54,265 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-30 16:54:54,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:54:54,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434756962] [2023-08-30 16:54:54,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1434756962] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:54:54,266 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:54:54,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 16:54:54,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761508032] [2023-08-30 16:54:54,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:54:54,266 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 16:54:54,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:54:54,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 16:54:54,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-30 16:54:54,278 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 200 [2023-08-30 16:54:54,278 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 26 transitions, 155 flow. Second operand has 4 states, 4 states have (on average 90.25) internal successors, (361), 4 states have internal predecessors, (361), 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-30 16:54:54,279 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:54:54,279 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 200 [2023-08-30 16:54:54,279 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:54:54,392 INFO L130 PetriNetUnfolder]: 490/761 cut-off events. [2023-08-30 16:54:54,392 INFO L131 PetriNetUnfolder]: For 952/952 co-relation queries the response was YES. [2023-08-30 16:54:54,394 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2409 conditions, 761 events. 490/761 cut-off events. For 952/952 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 2747 event pairs, 103 based on Foata normal form. 9/770 useless extension candidates. Maximal degree in co-relation 2390. Up to 442 conditions per place. [2023-08-30 16:54:54,397 INFO L137 encePairwiseOnDemand]: 196/200 looper letters, 31 selfloop transitions, 5 changer transitions 0/36 dead transitions. [2023-08-30 16:54:54,397 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 36 transitions, 251 flow [2023-08-30 16:54:54,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 16:54:54,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 16:54:54,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 380 transitions. [2023-08-30 16:54:54,399 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.475 [2023-08-30 16:54:54,399 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 380 transitions. [2023-08-30 16:54:54,399 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 380 transitions. [2023-08-30 16:54:54,400 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:54:54,400 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 380 transitions. [2023-08-30 16:54:54,401 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 95.0) internal successors, (380), 4 states have internal predecessors, (380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:54:54,402 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 200.0) internal successors, (1000), 5 states have internal predecessors, (1000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:54:54,402 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 200.0) internal successors, (1000), 5 states have internal predecessors, (1000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:54:54,403 INFO L175 Difference]: Start difference. First operand has 43 places, 26 transitions, 155 flow. Second operand 4 states and 380 transitions. [2023-08-30 16:54:54,403 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 36 transitions, 251 flow [2023-08-30 16:54:54,405 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 36 transitions, 228 flow, removed 2 selfloop flow, removed 5 redundant places. [2023-08-30 16:54:54,406 INFO L231 Difference]: Finished difference. Result has 42 places, 26 transitions, 148 flow [2023-08-30 16:54:54,406 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=132, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=148, PETRI_PLACES=42, PETRI_TRANSITIONS=26} [2023-08-30 16:54:54,406 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 10 predicate places. [2023-08-30 16:54:54,407 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 26 transitions, 148 flow [2023-08-30 16:54:54,407 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 90.25) internal successors, (361), 4 states have internal predecessors, (361), 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-30 16:54:54,407 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:54:54,407 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:54:54,407 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-30 16:54:54,407 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-30 16:54:54,408 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:54:54,408 INFO L85 PathProgramCache]: Analyzing trace with hash 1390049791, now seen corresponding path program 1 times [2023-08-30 16:54:54,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:54:54,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285890809] [2023-08-30 16:54:54,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:54:54,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:54:54,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:54:54,545 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-30 16:54:54,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:54:54,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285890809] [2023-08-30 16:54:54,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1285890809] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:54:54,546 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:54:54,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 16:54:54,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844797353] [2023-08-30 16:54:54,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:54:54,547 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 16:54:54,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:54:54,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 16:54:54,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 16:54:54,555 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 200 [2023-08-30 16:54:54,555 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 26 transitions, 148 flow. Second operand has 4 states, 4 states have (on average 93.5) internal successors, (374), 4 states have internal predecessors, (374), 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-30 16:54:54,556 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:54:54,556 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 200 [2023-08-30 16:54:54,556 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:54:54,721 INFO L130 PetriNetUnfolder]: 625/977 cut-off events. [2023-08-30 16:54:54,722 INFO L131 PetriNetUnfolder]: For 946/946 co-relation queries the response was YES. [2023-08-30 16:54:54,724 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2875 conditions, 977 events. 625/977 cut-off events. For 946/946 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 3877 event pairs, 181 based on Foata normal form. 27/1004 useless extension candidates. Maximal degree in co-relation 2858. Up to 405 conditions per place. [2023-08-30 16:54:54,727 INFO L137 encePairwiseOnDemand]: 196/200 looper letters, 24 selfloop transitions, 2 changer transitions 22/48 dead transitions. [2023-08-30 16:54:54,727 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 48 transitions, 296 flow [2023-08-30 16:54:54,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 16:54:54,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 16:54:54,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 496 transitions. [2023-08-30 16:54:54,729 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.496 [2023-08-30 16:54:54,729 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 496 transitions. [2023-08-30 16:54:54,729 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 496 transitions. [2023-08-30 16:54:54,730 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:54:54,730 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 496 transitions. [2023-08-30 16:54:54,731 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 99.2) internal successors, (496), 5 states have internal predecessors, (496), 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-30 16:54:54,732 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 200.0) internal successors, (1200), 6 states have internal predecessors, (1200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:54:54,733 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 200.0) internal successors, (1200), 6 states have internal predecessors, (1200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:54:54,733 INFO L175 Difference]: Start difference. First operand has 42 places, 26 transitions, 148 flow. Second operand 5 states and 496 transitions. [2023-08-30 16:54:54,733 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 48 transitions, 296 flow [2023-08-30 16:54:54,735 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 48 transitions, 286 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-30 16:54:54,736 INFO L231 Difference]: Finished difference. Result has 44 places, 20 transitions, 88 flow [2023-08-30 16:54:54,736 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=138, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=88, PETRI_PLACES=44, PETRI_TRANSITIONS=20} [2023-08-30 16:54:54,737 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 12 predicate places. [2023-08-30 16:54:54,737 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 20 transitions, 88 flow [2023-08-30 16:54:54,738 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 93.5) internal successors, (374), 4 states have internal predecessors, (374), 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-30 16:54:54,738 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:54:54,738 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:54:54,738 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-30 16:54:54,738 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-30 16:54:54,739 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:54:54,739 INFO L85 PathProgramCache]: Analyzing trace with hash 490125121, now seen corresponding path program 2 times [2023-08-30 16:54:54,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:54:54,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472264690] [2023-08-30 16:54:54,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:54:54,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:54:54,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:54:54,914 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-30 16:54:54,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:54:54,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1472264690] [2023-08-30 16:54:54,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1472264690] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:54:54,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:54:54,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 16:54:54,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831046118] [2023-08-30 16:54:54,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:54:54,916 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 16:54:54,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:54:54,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 16:54:54,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 16:54:54,927 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 200 [2023-08-30 16:54:54,928 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 20 transitions, 88 flow. Second operand has 4 states, 4 states have (on average 93.0) internal successors, (372), 4 states have internal predecessors, (372), 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-30 16:54:54,928 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:54:54,928 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 200 [2023-08-30 16:54:54,928 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:54:55,035 INFO L130 PetriNetUnfolder]: 214/378 cut-off events. [2023-08-30 16:54:55,036 INFO L131 PetriNetUnfolder]: For 333/334 co-relation queries the response was YES. [2023-08-30 16:54:55,036 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1029 conditions, 378 events. 214/378 cut-off events. For 333/334 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1446 event pairs, 42 based on Foata normal form. 40/417 useless extension candidates. Maximal degree in co-relation 1012. Up to 241 conditions per place. [2023-08-30 16:54:55,038 INFO L137 encePairwiseOnDemand]: 194/200 looper letters, 24 selfloop transitions, 4 changer transitions 18/48 dead transitions. [2023-08-30 16:54:55,038 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 48 transitions, 274 flow [2023-08-30 16:54:55,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 16:54:55,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 16:54:55,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 498 transitions. [2023-08-30 16:54:55,040 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.498 [2023-08-30 16:54:55,040 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 498 transitions. [2023-08-30 16:54:55,040 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 498 transitions. [2023-08-30 16:54:55,041 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:54:55,041 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 498 transitions. [2023-08-30 16:54:55,042 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 99.6) internal successors, (498), 5 states have internal predecessors, (498), 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-30 16:54:55,043 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 200.0) internal successors, (1200), 6 states have internal predecessors, (1200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:54:55,044 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 200.0) internal successors, (1200), 6 states have internal predecessors, (1200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:54:55,044 INFO L175 Difference]: Start difference. First operand has 44 places, 20 transitions, 88 flow. Second operand 5 states and 498 transitions. [2023-08-30 16:54:55,044 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 48 transitions, 274 flow [2023-08-30 16:54:55,046 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 48 transitions, 228 flow, removed 8 selfloop flow, removed 11 redundant places. [2023-08-30 16:54:55,046 INFO L231 Difference]: Finished difference. Result has 37 places, 23 transitions, 96 flow [2023-08-30 16:54:55,047 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=96, PETRI_PLACES=37, PETRI_TRANSITIONS=23} [2023-08-30 16:54:55,048 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 5 predicate places. [2023-08-30 16:54:55,048 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 23 transitions, 96 flow [2023-08-30 16:54:55,048 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 93.0) internal successors, (372), 4 states have internal predecessors, (372), 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-30 16:54:55,048 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:54:55,049 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:54:55,049 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-30 16:54:55,049 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-30 16:54:55,049 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:54:55,050 INFO L85 PathProgramCache]: Analyzing trace with hash -998333636, now seen corresponding path program 1 times [2023-08-30 16:54:55,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:54:55,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253881032] [2023-08-30 16:54:55,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:54:55,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:54:55,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:54:55,225 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-30 16:54:55,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:54:55,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253881032] [2023-08-30 16:54:55,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [253881032] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:54:55,226 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:54:55,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 16:54:55,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372616590] [2023-08-30 16:54:55,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:54:55,227 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 16:54:55,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:54:55,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 16:54:55,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-30 16:54:55,242 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 200 [2023-08-30 16:54:55,243 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 23 transitions, 96 flow. Second operand has 5 states, 5 states have (on average 92.8) internal successors, (464), 5 states have internal predecessors, (464), 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-30 16:54:55,243 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:54:55,243 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 200 [2023-08-30 16:54:55,243 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:54:55,354 INFO L130 PetriNetUnfolder]: 100/203 cut-off events. [2023-08-30 16:54:55,354 INFO L131 PetriNetUnfolder]: For 127/128 co-relation queries the response was YES. [2023-08-30 16:54:55,355 INFO L83 FinitePrefix]: Finished finitePrefix Result has 656 conditions, 203 events. 100/203 cut-off events. For 127/128 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 660 event pairs, 17 based on Foata normal form. 25/227 useless extension candidates. Maximal degree in co-relation 642. Up to 88 conditions per place. [2023-08-30 16:54:55,356 INFO L137 encePairwiseOnDemand]: 194/200 looper letters, 28 selfloop transitions, 7 changer transitions 16/53 dead transitions. [2023-08-30 16:54:55,356 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 53 transitions, 320 flow [2023-08-30 16:54:55,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 16:54:55,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 16:54:55,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 593 transitions. [2023-08-30 16:54:55,358 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49416666666666664 [2023-08-30 16:54:55,358 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 593 transitions. [2023-08-30 16:54:55,359 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 593 transitions. [2023-08-30 16:54:55,359 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:54:55,359 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 593 transitions. [2023-08-30 16:54:55,361 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 98.83333333333333) internal successors, (593), 6 states have internal predecessors, (593), 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-30 16:54:55,364 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 200.0) internal successors, (1400), 7 states have internal predecessors, (1400), 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-30 16:54:55,364 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 200.0) internal successors, (1400), 7 states have internal predecessors, (1400), 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-30 16:54:55,364 INFO L175 Difference]: Start difference. First operand has 37 places, 23 transitions, 96 flow. Second operand 6 states and 593 transitions. [2023-08-30 16:54:55,364 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 53 transitions, 320 flow [2023-08-30 16:54:55,365 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 53 transitions, 314 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-08-30 16:54:55,367 INFO L231 Difference]: Finished difference. Result has 41 places, 26 transitions, 146 flow [2023-08-30 16:54:55,367 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=146, PETRI_PLACES=41, PETRI_TRANSITIONS=26} [2023-08-30 16:54:55,368 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 9 predicate places. [2023-08-30 16:54:55,368 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 26 transitions, 146 flow [2023-08-30 16:54:55,368 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 92.8) internal successors, (464), 5 states have internal predecessors, (464), 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-30 16:54:55,369 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:54:55,369 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:54:55,369 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-30 16:54:55,369 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-30 16:54:55,369 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:54:55,370 INFO L85 PathProgramCache]: Analyzing trace with hash 1062997089, now seen corresponding path program 1 times [2023-08-30 16:54:55,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:54:55,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530069576] [2023-08-30 16:54:55,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:54:55,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:54:55,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:54:55,602 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-30 16:54:55,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:54:55,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530069576] [2023-08-30 16:54:55,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [530069576] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:54:55,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:54:55,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 16:54:55,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268275884] [2023-08-30 16:54:55,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:54:55,605 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-30 16:54:55,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:54:55,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-30 16:54:55,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-30 16:54:55,618 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 200 [2023-08-30 16:54:55,619 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 26 transitions, 146 flow. Second operand has 6 states, 6 states have (on average 92.66666666666667) internal successors, (556), 6 states have internal predecessors, (556), 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-30 16:54:55,619 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:54:55,619 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 200 [2023-08-30 16:54:55,619 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:54:55,716 INFO L130 PetriNetUnfolder]: 54/120 cut-off events. [2023-08-30 16:54:55,718 INFO L131 PetriNetUnfolder]: For 156/157 co-relation queries the response was YES. [2023-08-30 16:54:55,718 INFO L83 FinitePrefix]: Finished finitePrefix Result has 434 conditions, 120 events. 54/120 cut-off events. For 156/157 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 302 event pairs, 14 based on Foata normal form. 8/127 useless extension candidates. Maximal degree in co-relation 417. Up to 48 conditions per place. [2023-08-30 16:54:55,719 INFO L137 encePairwiseOnDemand]: 194/200 looper letters, 25 selfloop transitions, 10 changer transitions 8/45 dead transitions. [2023-08-30 16:54:55,719 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 45 transitions, 316 flow [2023-08-30 16:54:55,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-30 16:54:55,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-30 16:54:55,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 675 transitions. [2023-08-30 16:54:55,721 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48214285714285715 [2023-08-30 16:54:55,722 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 675 transitions. [2023-08-30 16:54:55,722 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 675 transitions. [2023-08-30 16:54:55,722 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:54:55,722 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 675 transitions. [2023-08-30 16:54:55,724 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 96.42857142857143) internal successors, (675), 7 states have internal predecessors, (675), 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-30 16:54:55,726 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 200.0) internal successors, (1600), 8 states have internal predecessors, (1600), 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-30 16:54:55,726 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 200.0) internal successors, (1600), 8 states have internal predecessors, (1600), 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-30 16:54:55,726 INFO L175 Difference]: Start difference. First operand has 41 places, 26 transitions, 146 flow. Second operand 7 states and 675 transitions. [2023-08-30 16:54:55,726 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 45 transitions, 316 flow [2023-08-30 16:54:55,728 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 45 transitions, 263 flow, removed 20 selfloop flow, removed 5 redundant places. [2023-08-30 16:54:55,728 INFO L231 Difference]: Finished difference. Result has 43 places, 26 transitions, 140 flow [2023-08-30 16:54:55,729 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=140, PETRI_PLACES=43, PETRI_TRANSITIONS=26} [2023-08-30 16:54:55,730 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 11 predicate places. [2023-08-30 16:54:55,730 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 26 transitions, 140 flow [2023-08-30 16:54:55,730 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 92.66666666666667) internal successors, (556), 6 states have internal predecessors, (556), 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-30 16:54:55,731 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:54:55,731 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:54:55,731 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-30 16:54:55,731 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-30 16:54:55,731 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:54:55,732 INFO L85 PathProgramCache]: Analyzing trace with hash 215029981, now seen corresponding path program 1 times [2023-08-30 16:54:55,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:54:55,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438645959] [2023-08-30 16:54:55,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:54:55,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:54:55,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:54:56,369 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-30 16:54:56,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:54:56,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438645959] [2023-08-30 16:54:56,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1438645959] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:54:56,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:54:56,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 16:54:56,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965901560] [2023-08-30 16:54:56,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:54:56,371 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-30 16:54:56,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:54:56,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-30 16:54:56,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-08-30 16:54:56,389 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 200 [2023-08-30 16:54:56,390 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 26 transitions, 140 flow. Second operand has 7 states, 7 states have (on average 90.57142857142857) internal successors, (634), 7 states have internal predecessors, (634), 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-30 16:54:56,390 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:54:56,390 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 200 [2023-08-30 16:54:56,390 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:54:56,534 INFO L130 PetriNetUnfolder]: 56/128 cut-off events. [2023-08-30 16:54:56,534 INFO L131 PetriNetUnfolder]: For 198/198 co-relation queries the response was YES. [2023-08-30 16:54:56,535 INFO L83 FinitePrefix]: Finished finitePrefix Result has 449 conditions, 128 events. 56/128 cut-off events. For 198/198 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 358 event pairs, 5 based on Foata normal form. 1/129 useless extension candidates. Maximal degree in co-relation 432. Up to 45 conditions per place. [2023-08-30 16:54:56,535 INFO L137 encePairwiseOnDemand]: 194/200 looper letters, 25 selfloop transitions, 3 changer transitions 23/53 dead transitions. [2023-08-30 16:54:56,535 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 53 transitions, 403 flow [2023-08-30 16:54:56,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-30 16:54:56,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-30 16:54:56,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 654 transitions. [2023-08-30 16:54:56,537 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46714285714285714 [2023-08-30 16:54:56,537 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 654 transitions. [2023-08-30 16:54:56,537 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 654 transitions. [2023-08-30 16:54:56,538 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:54:56,538 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 654 transitions. [2023-08-30 16:54:56,539 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 93.42857142857143) internal successors, (654), 7 states have internal predecessors, (654), 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-30 16:54:56,541 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 200.0) internal successors, (1600), 8 states have internal predecessors, (1600), 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-30 16:54:56,542 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 200.0) internal successors, (1600), 8 states have internal predecessors, (1600), 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-30 16:54:56,542 INFO L175 Difference]: Start difference. First operand has 43 places, 26 transitions, 140 flow. Second operand 7 states and 654 transitions. [2023-08-30 16:54:56,542 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 53 transitions, 403 flow [2023-08-30 16:54:56,543 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 53 transitions, 321 flow, removed 24 selfloop flow, removed 6 redundant places. [2023-08-30 16:54:56,545 INFO L231 Difference]: Finished difference. Result has 44 places, 26 transitions, 116 flow [2023-08-30 16:54:56,545 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=116, PETRI_PLACES=44, PETRI_TRANSITIONS=26} [2023-08-30 16:54:56,546 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 12 predicate places. [2023-08-30 16:54:56,547 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 26 transitions, 116 flow [2023-08-30 16:54:56,547 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 90.57142857142857) internal successors, (634), 7 states have internal predecessors, (634), 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-30 16:54:56,547 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:54:56,548 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:54:56,548 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-30 16:54:56,548 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-30 16:54:56,548 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:54:56,548 INFO L85 PathProgramCache]: Analyzing trace with hash 1689701431, now seen corresponding path program 2 times [2023-08-30 16:54:56,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:54:56,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128675187] [2023-08-30 16:54:56,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:54:56,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:54:56,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-30 16:54:56,599 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-30 16:54:56,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-30 16:54:56,689 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-30 16:54:56,689 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-30 16:54:56,690 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2023-08-30 16:54:56,691 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2023-08-30 16:54:56,692 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2023-08-30 16:54:56,692 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2023-08-30 16:54:56,692 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2023-08-30 16:54:56,692 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2023-08-30 16:54:56,692 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-30 16:54:56,693 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:54:56,698 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-30 16:54:56,699 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-30 16:54:56,757 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.08 04:54:56 BasicIcfg [2023-08-30 16:54:56,757 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-30 16:54:56,757 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-08-30 16:54:56,757 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-08-30 16:54:56,758 INFO L275 PluginConnector]: Witness Printer initialized [2023-08-30 16:54:56,758 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 04:54:46" (3/4) ... [2023-08-30 16:54:56,759 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-08-30 16:54:56,830 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-08-30 16:54:56,830 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-08-30 16:54:56,831 INFO L158 Benchmark]: Toolchain (without parser) took 11921.87ms. Allocated memory was 75.5MB in the beginning and 247.5MB in the end (delta: 172.0MB). Free memory was 45.8MB in the beginning and 96.4MB in the end (delta: -50.6MB). Peak memory consumption was 120.5MB. Max. memory is 16.1GB. [2023-08-30 16:54:56,831 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 56.6MB. Free memory was 34.4MB in the beginning and 34.3MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. [2023-08-30 16:54:56,831 INFO L158 Benchmark]: CACSL2BoogieTranslator took 578.64ms. Allocated memory is still 75.5MB. Free memory was 45.4MB in the beginning and 40.0MB in the end (delta: 5.4MB). Peak memory consumption was 9.5MB. Max. memory is 16.1GB. [2023-08-30 16:54:56,831 INFO L158 Benchmark]: Boogie Procedure Inliner took 71.43ms. Allocated memory is still 75.5MB. Free memory was 40.0MB in the beginning and 37.7MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-30 16:54:56,832 INFO L158 Benchmark]: Boogie Preprocessor took 58.83ms. Allocated memory is still 75.5MB. Free memory was 37.7MB in the beginning and 35.5MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-30 16:54:56,832 INFO L158 Benchmark]: RCFGBuilder took 748.52ms. Allocated memory is still 75.5MB. Free memory was 35.5MB in the beginning and 48.5MB in the end (delta: -13.0MB). Peak memory consumption was 11.6MB. Max. memory is 16.1GB. [2023-08-30 16:54:56,832 INFO L158 Benchmark]: TraceAbstraction took 10384.81ms. Allocated memory was 75.5MB in the beginning and 247.5MB in the end (delta: 172.0MB). Free memory was 47.7MB in the beginning and 105.8MB in the end (delta: -58.1MB). Peak memory consumption was 114.1MB. Max. memory is 16.1GB. [2023-08-30 16:54:56,832 INFO L158 Benchmark]: Witness Printer took 72.95ms. Allocated memory is still 247.5MB. Free memory was 105.8MB in the beginning and 96.4MB in the end (delta: 9.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2023-08-30 16:54:56,834 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 56.6MB. Free memory was 34.4MB in the beginning and 34.3MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 578.64ms. Allocated memory is still 75.5MB. Free memory was 45.4MB in the beginning and 40.0MB in the end (delta: 5.4MB). Peak memory consumption was 9.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 71.43ms. Allocated memory is still 75.5MB. Free memory was 40.0MB in the beginning and 37.7MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 58.83ms. Allocated memory is still 75.5MB. Free memory was 37.7MB in the beginning and 35.5MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 748.52ms. Allocated memory is still 75.5MB. Free memory was 35.5MB in the beginning and 48.5MB in the end (delta: -13.0MB). Peak memory consumption was 11.6MB. Max. memory is 16.1GB. * TraceAbstraction took 10384.81ms. Allocated memory was 75.5MB in the beginning and 247.5MB in the end (delta: 172.0MB). Free memory was 47.7MB in the beginning and 105.8MB in the end (delta: -58.1MB). Peak memory consumption was 114.1MB. Max. memory is 16.1GB. * Witness Printer took 72.95ms. Allocated memory is still 247.5MB. Free memory was 105.8MB in the beginning and 96.4MB in the end (delta: 9.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.5s, 112 PlacesBefore, 32 PlacesAfterwards, 104 TransitionsBefore, 23 TransitionsAfterwards, 1790 CoEnabledTransitionPairs, 7 FixpointIterations, 38 TrivialSequentialCompositions, 48 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 6 ConcurrentYvCompositions, 1 ChoiceCompositions, 93 TotalNumberOfCompositions, 4542 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2102, independent: 1934, independent conditional: 0, independent unconditional: 1934, dependent: 168, dependent conditional: 0, dependent unconditional: 168, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1011, independent: 966, independent conditional: 0, independent unconditional: 966, dependent: 45, dependent conditional: 0, dependent unconditional: 45, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2102, independent: 968, independent conditional: 0, independent unconditional: 968, dependent: 123, dependent conditional: 0, dependent unconditional: 123, unknown: 1011, unknown conditional: 0, unknown unconditional: 1011] , Statistics on independence cache: Total cache size (in pairs): 77, Positive cache size: 60, Positive conditional cache size: 0, Positive unconditional cache size: 60, Negative cache size: 17, Negative conditional cache size: 0, Negative unconditional cache size: 17, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p0_EBX = 0; [L716] 0 int __unbuffered_p2_EAX = 0; [L717] 0 _Bool main$tmp_guard0; [L718] 0 _Bool main$tmp_guard1; [L720] 0 int x = 0; [L721] 0 _Bool x$flush_delayed; [L722] 0 int x$mem_tmp; [L723] 0 _Bool x$r_buff0_thd0; [L724] 0 _Bool x$r_buff0_thd1; [L725] 0 _Bool x$r_buff0_thd2; [L726] 0 _Bool x$r_buff0_thd3; [L727] 0 _Bool x$r_buff1_thd0; [L728] 0 _Bool x$r_buff1_thd1; [L729] 0 _Bool x$r_buff1_thd2; [L730] 0 _Bool x$r_buff1_thd3; [L731] 0 _Bool x$read_delayed; [L732] 0 int *x$read_delayed_var; [L733] 0 int x$w_buff0; [L734] 0 _Bool x$w_buff0_used; [L735] 0 int x$w_buff1; [L736] 0 _Bool x$w_buff1_used; [L738] 0 int y = 0; [L739] 0 _Bool weak$$choice0; [L740] 0 _Bool weak$$choice2; [L829] 0 pthread_t t1828; [L830] FCALL, FORK 0 pthread_create(&t1828, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1828, ((void *)0), P0, ((void *)0))=-1, t1828={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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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=0] [L831] 0 pthread_t t1829; [L832] FCALL, FORK 0 pthread_create(&t1829, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1829, ((void *)0), P1, ((void *)0))=0, t1828={5:0}, t1829={6: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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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=0] [L833] 0 pthread_t t1830; [L834] FCALL, FORK 0 pthread_create(&t1830, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1830, ((void *)0), P2, ((void *)0))=1, t1828={5:0}, t1829={6:0}, t1830={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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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=0] [L772] 2 x$w_buff1 = x$w_buff0 [L773] 2 x$w_buff0 = 1 [L774] 2 x$w_buff1_used = x$w_buff0_used [L775] 2 x$w_buff0_used = (_Bool)1 [L776] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L776] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L777] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L778] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L779] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L780] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L781] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L784] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1] [L801] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, 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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1] [L804] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, 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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2] [L744] 1 __unbuffered_p0_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2] [L807] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L808] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L809] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L810] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L811] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2] [L814] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L816] 3 return 0; [L747] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L748] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L749] 1 x$flush_delayed = weak$$choice2 [L750] 1 x$mem_tmp = x [L751] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L752] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L753] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L754] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L755] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L756] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L757] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L758] 1 __unbuffered_p0_EBX = x [L759] 1 x = x$flush_delayed ? x$mem_tmp : x [L760] 1 x$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2] [L787] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L788] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L789] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L790] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L791] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L765] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L767] 1 return 0; [L794] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L796] 2 return 0; [L836] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L838] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L838] RET 0 assume_abort_if_not(main$tmp_guard0) [L840] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L841] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L842] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L843] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L844] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1828={5:0}, t1829={6:0}, t1830={3: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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L847] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 2 && __unbuffered_p0_EBX == 0 && __unbuffered_p2_EAX == 1) [L849] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] - 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: 830]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 832]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 834]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 133 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 10.2s, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 3.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.6s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 451 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 359 mSDsluCounter, 124 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 82 mSDsCounter, 83 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 949 IncrementalHoareTripleChecker+Invalid, 1032 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 83 mSolverCounterUnsat, 42 mSDtfsCounter, 949 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 47 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=234occurred in iteration=4, InterpolantAutomatonStates: 61, 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.4s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 186 NumberOfCodeBlocks, 186 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 153 ConstructedInterpolants, 0 QuantifiedInterpolants, 671 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-08-30 16:54:56,860 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE