./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix022_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_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/mix022_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_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 6a39929e45dd639f23e29d64b9f64559e1eb8cd260c4b1939e3197ae6524cdca --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:47:00,594 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-30 16:47:00,597 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-30 16:47:00,627 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-30 16:47:00,627 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-30 16:47:00,629 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-30 16:47:00,631 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-30 16:47:00,634 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-30 16:47:00,637 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-30 16:47:00,641 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-30 16:47:00,642 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-30 16:47:00,643 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-30 16:47:00,645 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-30 16:47:00,646 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-30 16:47:00,648 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-30 16:47:00,649 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-30 16:47:00,650 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-30 16:47:00,652 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-30 16:47:00,655 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-30 16:47:00,658 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-30 16:47:00,665 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-30 16:47:00,668 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-30 16:47:00,669 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-30 16:47:00,670 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-30 16:47:00,675 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-30 16:47:00,678 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-30 16:47:00,679 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-30 16:47:00,680 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-30 16:47:00,681 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-30 16:47:00,681 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-30 16:47:00,682 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-30 16:47:00,683 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-30 16:47:00,684 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-30 16:47:00,685 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-30 16:47:00,687 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-30 16:47:00,687 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-30 16:47:00,687 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-30 16:47:00,688 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-30 16:47:00,688 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-30 16:47:00,688 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-30 16:47:00,689 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-30 16:47:00,691 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:47:00,725 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-30 16:47:00,725 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-30 16:47:00,726 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-30 16:47:00,726 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-30 16:47:00,727 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-30 16:47:00,727 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-30 16:47:00,728 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-30 16:47:00,728 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-30 16:47:00,728 INFO L138 SettingsManager]: * Use SBE=true [2023-08-30 16:47:00,728 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-30 16:47:00,729 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-30 16:47:00,729 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-30 16:47:00,729 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-30 16:47:00,730 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-30 16:47:00,730 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-30 16:47:00,730 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-30 16:47:00,730 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-30 16:47:00,730 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-30 16:47:00,731 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-08-30 16:47:00,731 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-30 16:47:00,731 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-30 16:47:00,731 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-30 16:47:00,731 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-30 16:47:00,732 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-30 16:47:00,732 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 16:47:00,732 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-30 16:47:00,732 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-30 16:47:00,732 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-30 16:47:00,733 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-30 16:47:00,733 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-30 16:47:00,733 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-30 16:47:00,733 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-08-30 16:47:00,733 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-30 16:47:00,734 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-30 16:47:00,734 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-30 16:47:00,734 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 -> 6a39929e45dd639f23e29d64b9f64559e1eb8cd260c4b1939e3197ae6524cdca 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:47:01,045 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-30 16:47:01,061 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-30 16:47:01,064 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-30 16:47:01,065 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-30 16:47:01,066 INFO L275 PluginConnector]: CDTParser initialized [2023-08-30 16:47:01,067 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix022_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2023-08-30 16:47:02,188 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-30 16:47:02,446 INFO L351 CDTParser]: Found 1 translation units. [2023-08-30 16:47:02,447 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix022_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2023-08-30 16:47:02,471 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b95cffefd/aeb7cf2633124e1dbf0339253567da7c/FLAG8cd41014b [2023-08-30 16:47:02,492 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b95cffefd/aeb7cf2633124e1dbf0339253567da7c [2023-08-30 16:47:02,495 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-30 16:47:02,496 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-30 16:47:02,499 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-30 16:47:02,499 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-30 16:47:02,502 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-30 16:47:02,503 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 04:47:02" (1/1) ... [2023-08-30 16:47:02,503 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@221ace43 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:47:02, skipping insertion in model container [2023-08-30 16:47:02,504 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 04:47:02" (1/1) ... [2023-08-30 16:47:02,510 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-30 16:47:02,564 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-30 16:47:02,735 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/mix022_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[995,1008] [2023-08-30 16:47:02,964 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 16:47:02,976 INFO L203 MainTranslator]: Completed pre-run [2023-08-30 16:47:02,989 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/mix022_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[995,1008] [2023-08-30 16:47:03,047 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 16:47:03,087 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-30 16:47:03,087 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-30 16:47:03,093 INFO L208 MainTranslator]: Completed translation [2023-08-30 16:47:03,094 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:47:03 WrapperNode [2023-08-30 16:47:03,094 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-30 16:47:03,095 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-30 16:47:03,095 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-30 16:47:03,095 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-30 16:47:03,101 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:47:03" (1/1) ... [2023-08-30 16:47:03,129 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:47:03" (1/1) ... [2023-08-30 16:47:03,161 INFO L138 Inliner]: procedures = 175, calls = 43, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 113 [2023-08-30 16:47:03,162 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-30 16:47:03,163 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-30 16:47:03,163 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-30 16:47:03,164 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-30 16:47:03,172 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:47:03" (1/1) ... [2023-08-30 16:47:03,173 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:47:03" (1/1) ... [2023-08-30 16:47:03,189 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:47:03" (1/1) ... [2023-08-30 16:47:03,190 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:47:03" (1/1) ... [2023-08-30 16:47:03,195 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:47:03" (1/1) ... [2023-08-30 16:47:03,209 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:47:03" (1/1) ... [2023-08-30 16:47:03,212 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:47:03" (1/1) ... [2023-08-30 16:47:03,214 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:47:03" (1/1) ... [2023-08-30 16:47:03,216 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-30 16:47:03,217 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-30 16:47:03,218 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-30 16:47:03,228 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-30 16:47:03,230 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:47:03" (1/1) ... [2023-08-30 16:47:03,234 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 16:47:03,248 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 16:47:03,262 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:47:03,270 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:47:03,299 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-30 16:47:03,299 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-30 16:47:03,300 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-30 16:47:03,301 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-30 16:47:03,302 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-30 16:47:03,302 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-30 16:47:03,302 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-30 16:47:03,302 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-30 16:47:03,302 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-30 16:47:03,302 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-30 16:47:03,302 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-30 16:47:03,303 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-30 16:47:03,303 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-30 16:47:03,304 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:47:03,455 INFO L236 CfgBuilder]: Building ICFG [2023-08-30 16:47:03,457 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-30 16:47:03,842 INFO L277 CfgBuilder]: Performing block encoding [2023-08-30 16:47:03,974 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-30 16:47:03,974 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-30 16:47:03,976 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 04:47:03 BoogieIcfgContainer [2023-08-30 16:47:03,976 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-30 16:47:03,978 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-30 16:47:03,978 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-30 16:47:03,981 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-30 16:47:03,981 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.08 04:47:02" (1/3) ... [2023-08-30 16:47:03,982 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f6b4c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 04:47:03, skipping insertion in model container [2023-08-30 16:47:03,982 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:47:03" (2/3) ... [2023-08-30 16:47:03,982 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f6b4c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 04:47:03, skipping insertion in model container [2023-08-30 16:47:03,983 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 04:47:03" (3/3) ... [2023-08-30 16:47:03,984 INFO L112 eAbstractionObserver]: Analyzing ICFG mix022_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2023-08-30 16:47:03,991 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-08-30 16:47:04,000 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-30 16:47:04,000 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-08-30 16:47:04,000 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-30 16:47:04,059 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-30 16:47:04,101 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 94 places, 89 transitions, 188 flow [2023-08-30 16:47:04,153 INFO L130 PetriNetUnfolder]: 2/87 cut-off events. [2023-08-30 16:47:04,153 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 16:47:04,158 INFO L83 FinitePrefix]: Finished finitePrefix Result has 94 conditions, 87 events. 2/87 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 46 event pairs, 0 based on Foata normal form. 0/83 useless extension candidates. Maximal degree in co-relation 52. Up to 2 conditions per place. [2023-08-30 16:47:04,158 INFO L82 GeneralOperation]: Start removeDead. Operand has 94 places, 89 transitions, 188 flow [2023-08-30 16:47:04,161 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 92 places, 87 transitions, 180 flow [2023-08-30 16:47:04,163 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-30 16:47:04,173 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 92 places, 87 transitions, 180 flow [2023-08-30 16:47:04,175 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 92 places, 87 transitions, 180 flow [2023-08-30 16:47:04,175 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 92 places, 87 transitions, 180 flow [2023-08-30 16:47:04,192 INFO L130 PetriNetUnfolder]: 2/87 cut-off events. [2023-08-30 16:47:04,192 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 16:47:04,193 INFO L83 FinitePrefix]: Finished finitePrefix Result has 94 conditions, 87 events. 2/87 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 46 event pairs, 0 based on Foata normal form. 0/83 useless extension candidates. Maximal degree in co-relation 52. Up to 2 conditions per place. [2023-08-30 16:47:04,194 INFO L119 LiptonReduction]: Number of co-enabled transitions 1104 [2023-08-30 16:47:07,110 INFO L134 LiptonReduction]: Checked pairs total: 2841 [2023-08-30 16:47:07,111 INFO L136 LiptonReduction]: Total number of compositions: 81 [2023-08-30 16:47:07,123 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-30 16:47:07,129 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;@9f02e6c, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-30 16:47:07,129 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2023-08-30 16:47:07,133 INFO L130 PetriNetUnfolder]: 0/3 cut-off events. [2023-08-30 16:47:07,133 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 16:47:07,133 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:47:07,133 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-30 16:47:07,134 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-30 16:47:07,138 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:47:07,139 INFO L85 PathProgramCache]: Analyzing trace with hash 405501, now seen corresponding path program 1 times [2023-08-30 16:47:07,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:47:07,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144631426] [2023-08-30 16:47:07,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:47:07,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:47:07,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:47:07,544 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:47:07,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:47:07,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144631426] [2023-08-30 16:47:07,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2144631426] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:47:07,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:47:07,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 16:47:07,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398575398] [2023-08-30 16:47:07,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:47:07,557 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 16:47:07,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:47:07,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 16:47:07,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 16:47:07,590 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 170 [2023-08-30 16:47:07,593 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 18 transitions, 42 flow. Second operand has 3 states, 3 states have (on average 78.0) internal successors, (234), 3 states have internal predecessors, (234), 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:47:07,593 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:47:07,594 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 170 [2023-08-30 16:47:07,595 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:47:07,754 INFO L130 PetriNetUnfolder]: 142/280 cut-off events. [2023-08-30 16:47:07,755 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2023-08-30 16:47:07,757 INFO L83 FinitePrefix]: Finished finitePrefix Result has 545 conditions, 280 events. 142/280 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1206 event pairs, 16 based on Foata normal form. 0/259 useless extension candidates. Maximal degree in co-relation 535. Up to 208 conditions per place. [2023-08-30 16:47:07,760 INFO L137 encePairwiseOnDemand]: 167/170 looper letters, 21 selfloop transitions, 2 changer transitions 2/27 dead transitions. [2023-08-30 16:47:07,760 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 26 places, 27 transitions, 113 flow [2023-08-30 16:47:07,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 16:47:07,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 16:47:07,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 257 transitions. [2023-08-30 16:47:07,779 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.503921568627451 [2023-08-30 16:47:07,780 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 257 transitions. [2023-08-30 16:47:07,780 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 257 transitions. [2023-08-30 16:47:07,783 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:47:07,785 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 257 transitions. [2023-08-30 16:47:07,789 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 85.66666666666667) internal successors, (257), 3 states have internal predecessors, (257), 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:47:07,792 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 170.0) internal successors, (680), 4 states have internal predecessors, (680), 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:47:07,793 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 170.0) internal successors, (680), 4 states have internal predecessors, (680), 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:47:07,795 INFO L175 Difference]: Start difference. First operand has 25 places, 18 transitions, 42 flow. Second operand 3 states and 257 transitions. [2023-08-30 16:47:07,796 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 26 places, 27 transitions, 113 flow [2023-08-30 16:47:07,797 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 24 places, 27 transitions, 110 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 16:47:07,798 INFO L231 Difference]: Finished difference. Result has 24 places, 16 transitions, 40 flow [2023-08-30 16:47:07,800 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=170, PETRI_DIFFERENCE_MINUEND_FLOW=38, PETRI_DIFFERENCE_MINUEND_PLACES=22, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=40, PETRI_PLACES=24, PETRI_TRANSITIONS=16} [2023-08-30 16:47:07,803 INFO L281 CegarLoopForPetriNet]: 25 programPoint places, -1 predicate places. [2023-08-30 16:47:07,803 INFO L495 AbstractCegarLoop]: Abstraction has has 24 places, 16 transitions, 40 flow [2023-08-30 16:47:07,804 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 78.0) internal successors, (234), 3 states have internal predecessors, (234), 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:47:07,804 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:47:07,805 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:47:07,805 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-30 16:47:07,806 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-30 16:47:07,815 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:47:07,815 INFO L85 PathProgramCache]: Analyzing trace with hash 866305467, now seen corresponding path program 1 times [2023-08-30 16:47:07,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:47:07,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904750382] [2023-08-30 16:47:07,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:47:07,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:47:07,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:47:08,121 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:47:08,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:47:08,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904750382] [2023-08-30 16:47:08,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [904750382] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:47:08,122 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:47:08,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 16:47:08,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610177994] [2023-08-30 16:47:08,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:47:08,123 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 16:47:08,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:47:08,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 16:47:08,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 16:47:08,134 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 170 [2023-08-30 16:47:08,134 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 24 places, 16 transitions, 40 flow. Second operand has 3 states, 3 states have (on average 74.33333333333333) internal successors, (223), 3 states have internal predecessors, (223), 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:47:08,134 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:47:08,135 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 170 [2023-08-30 16:47:08,135 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:47:08,248 INFO L130 PetriNetUnfolder]: 224/410 cut-off events. [2023-08-30 16:47:08,248 INFO L131 PetriNetUnfolder]: For 24/24 co-relation queries the response was YES. [2023-08-30 16:47:08,251 INFO L83 FinitePrefix]: Finished finitePrefix Result has 861 conditions, 410 events. 224/410 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1658 event pairs, 66 based on Foata normal form. 20/430 useless extension candidates. Maximal degree in co-relation 851. Up to 255 conditions per place. [2023-08-30 16:47:08,254 INFO L137 encePairwiseOnDemand]: 164/170 looper letters, 21 selfloop transitions, 5 changer transitions 0/26 dead transitions. [2023-08-30 16:47:08,254 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 25 places, 26 transitions, 114 flow [2023-08-30 16:47:08,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 16:47:08,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 16:47:08,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 243 transitions. [2023-08-30 16:47:08,257 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4764705882352941 [2023-08-30 16:47:08,257 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 243 transitions. [2023-08-30 16:47:08,257 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 243 transitions. [2023-08-30 16:47:08,258 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:47:08,258 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 243 transitions. [2023-08-30 16:47:08,259 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 81.0) internal successors, (243), 3 states have internal predecessors, (243), 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:47:08,261 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 170.0) internal successors, (680), 4 states have internal predecessors, (680), 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:47:08,261 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 170.0) internal successors, (680), 4 states have internal predecessors, (680), 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:47:08,262 INFO L175 Difference]: Start difference. First operand has 24 places, 16 transitions, 40 flow. Second operand 3 states and 243 transitions. [2023-08-30 16:47:08,262 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 25 places, 26 transitions, 114 flow [2023-08-30 16:47:08,262 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 23 places, 26 transitions, 108 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 16:47:08,263 INFO L231 Difference]: Finished difference. Result has 25 places, 19 transitions, 70 flow [2023-08-30 16:47:08,263 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=170, PETRI_DIFFERENCE_MINUEND_FLOW=36, PETRI_DIFFERENCE_MINUEND_PLACES=21, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=16, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=11, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=70, PETRI_PLACES=25, PETRI_TRANSITIONS=19} [2023-08-30 16:47:08,264 INFO L281 CegarLoopForPetriNet]: 25 programPoint places, 0 predicate places. [2023-08-30 16:47:08,264 INFO L495 AbstractCegarLoop]: Abstraction has has 25 places, 19 transitions, 70 flow [2023-08-30 16:47:08,265 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 74.33333333333333) internal successors, (223), 3 states have internal predecessors, (223), 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:47:08,265 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:47:08,265 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:47:08,265 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-30 16:47:08,265 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-30 16:47:08,268 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:47:08,268 INFO L85 PathProgramCache]: Analyzing trace with hash 1085664426, now seen corresponding path program 1 times [2023-08-30 16:47:08,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:47:08,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364359488] [2023-08-30 16:47:08,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:47:08,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:47:08,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:47:08,445 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:47:08,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:47:08,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364359488] [2023-08-30 16:47:08,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [364359488] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:47:08,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:47:08,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 16:47:08,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530911987] [2023-08-30 16:47:08,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:47:08,447 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 16:47:08,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:47:08,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 16:47:08,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-30 16:47:08,457 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 170 [2023-08-30 16:47:08,458 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 19 transitions, 70 flow. Second operand has 4 states, 4 states have (on average 74.0) internal successors, (296), 4 states have internal predecessors, (296), 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:47:08,458 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:47:08,458 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 170 [2023-08-30 16:47:08,459 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:47:08,560 INFO L130 PetriNetUnfolder]: 213/391 cut-off events. [2023-08-30 16:47:08,561 INFO L131 PetriNetUnfolder]: For 135/135 co-relation queries the response was YES. [2023-08-30 16:47:08,561 INFO L83 FinitePrefix]: Finished finitePrefix Result has 970 conditions, 391 events. 213/391 cut-off events. For 135/135 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1507 event pairs, 56 based on Foata normal form. 5/396 useless extension candidates. Maximal degree in co-relation 958. Up to 205 conditions per place. [2023-08-30 16:47:08,563 INFO L137 encePairwiseOnDemand]: 165/170 looper letters, 26 selfloop transitions, 5 changer transitions 0/31 dead transitions. [2023-08-30 16:47:08,563 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 31 transitions, 160 flow [2023-08-30 16:47:08,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 16:47:08,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 16:47:08,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 318 transitions. [2023-08-30 16:47:08,565 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4676470588235294 [2023-08-30 16:47:08,565 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 318 transitions. [2023-08-30 16:47:08,565 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 318 transitions. [2023-08-30 16:47:08,565 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:47:08,565 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 318 transitions. [2023-08-30 16:47:08,566 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 79.5) internal successors, (318), 4 states have internal predecessors, (318), 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:47:08,568 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 170.0) internal successors, (850), 5 states have internal predecessors, (850), 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:47:08,568 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 170.0) internal successors, (850), 5 states have internal predecessors, (850), 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:47:08,568 INFO L175 Difference]: Start difference. First operand has 25 places, 19 transitions, 70 flow. Second operand 4 states and 318 transitions. [2023-08-30 16:47:08,569 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 31 transitions, 160 flow [2023-08-30 16:47:08,570 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 31 transitions, 148 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 16:47:08,571 INFO L231 Difference]: Finished difference. Result has 28 places, 20 transitions, 86 flow [2023-08-30 16:47:08,571 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=170, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=86, PETRI_PLACES=28, PETRI_TRANSITIONS=20} [2023-08-30 16:47:08,572 INFO L281 CegarLoopForPetriNet]: 25 programPoint places, 3 predicate places. [2023-08-30 16:47:08,572 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 20 transitions, 86 flow [2023-08-30 16:47:08,573 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 74.0) internal successors, (296), 4 states have internal predecessors, (296), 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:47:08,573 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:47:08,573 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:47:08,573 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-30 16:47:08,573 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-30 16:47:08,574 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:47:08,574 INFO L85 PathProgramCache]: Analyzing trace with hash -705642341, now seen corresponding path program 1 times [2023-08-30 16:47:08,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:47:08,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071125507] [2023-08-30 16:47:08,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:47:08,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:47:08,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:47:08,724 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:47:08,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:47:08,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071125507] [2023-08-30 16:47:08,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1071125507] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:47:08,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:47:08,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 16:47:08,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838799957] [2023-08-30 16:47:08,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:47:08,725 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 16:47:08,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:47:08,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 16:47:08,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 16:47:08,735 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 170 [2023-08-30 16:47:08,736 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 20 transitions, 86 flow. Second operand has 4 states, 4 states have (on average 76.0) internal successors, (304), 4 states have internal predecessors, (304), 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:47:08,736 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:47:08,736 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 170 [2023-08-30 16:47:08,736 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:47:08,838 INFO L130 PetriNetUnfolder]: 93/219 cut-off events. [2023-08-30 16:47:08,839 INFO L131 PetriNetUnfolder]: For 67/71 co-relation queries the response was YES. [2023-08-30 16:47:08,839 INFO L83 FinitePrefix]: Finished finitePrefix Result has 530 conditions, 219 events. 93/219 cut-off events. For 67/71 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 950 event pairs, 16 based on Foata normal form. 34/250 useless extension candidates. Maximal degree in co-relation 516. Up to 100 conditions per place. [2023-08-30 16:47:08,840 INFO L137 encePairwiseOnDemand]: 165/170 looper letters, 25 selfloop transitions, 5 changer transitions 12/47 dead transitions. [2023-08-30 16:47:08,840 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 47 transitions, 253 flow [2023-08-30 16:47:08,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 16:47:08,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 16:47:08,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 410 transitions. [2023-08-30 16:47:08,843 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4823529411764706 [2023-08-30 16:47:08,843 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 410 transitions. [2023-08-30 16:47:08,843 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 410 transitions. [2023-08-30 16:47:08,843 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:47:08,843 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 410 transitions. [2023-08-30 16:47:08,844 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 82.0) internal successors, (410), 5 states have internal predecessors, (410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:47:08,846 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 170.0) internal successors, (1020), 6 states have internal predecessors, (1020), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:47:08,847 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 170.0) internal successors, (1020), 6 states have internal predecessors, (1020), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:47:08,847 INFO L175 Difference]: Start difference. First operand has 28 places, 20 transitions, 86 flow. Second operand 5 states and 410 transitions. [2023-08-30 16:47:08,847 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 47 transitions, 253 flow [2023-08-30 16:47:08,848 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 47 transitions, 250 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 16:47:08,849 INFO L231 Difference]: Finished difference. Result has 34 places, 24 transitions, 120 flow [2023-08-30 16:47:08,849 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=170, PETRI_DIFFERENCE_MINUEND_FLOW=83, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=120, PETRI_PLACES=34, PETRI_TRANSITIONS=24} [2023-08-30 16:47:08,850 INFO L281 CegarLoopForPetriNet]: 25 programPoint places, 9 predicate places. [2023-08-30 16:47:08,850 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 24 transitions, 120 flow [2023-08-30 16:47:08,850 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 76.0) internal successors, (304), 4 states have internal predecessors, (304), 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:47:08,851 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:47:08,851 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:47:08,851 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-30 16:47:08,851 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-30 16:47:08,851 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:47:08,852 INFO L85 PathProgramCache]: Analyzing trace with hash -1013920029, now seen corresponding path program 1 times [2023-08-30 16:47:08,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:47:08,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738249809] [2023-08-30 16:47:08,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:47:08,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:47:08,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:47:09,126 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:47:09,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:47:09,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738249809] [2023-08-30 16:47:09,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [738249809] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:47:09,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:47:09,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 16:47:09,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756495886] [2023-08-30 16:47:09,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:47:09,128 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 16:47:09,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:47:09,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 16:47:09,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-30 16:47:09,147 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 170 [2023-08-30 16:47:09,148 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 24 transitions, 120 flow. Second operand has 5 states, 5 states have (on average 76.2) internal successors, (381), 5 states have internal predecessors, (381), 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:47:09,148 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:47:09,148 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 170 [2023-08-30 16:47:09,148 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:47:09,258 INFO L130 PetriNetUnfolder]: 68/169 cut-off events. [2023-08-30 16:47:09,258 INFO L131 PetriNetUnfolder]: For 139/141 co-relation queries the response was YES. [2023-08-30 16:47:09,259 INFO L83 FinitePrefix]: Finished finitePrefix Result has 534 conditions, 169 events. 68/169 cut-off events. For 139/141 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 663 event pairs, 11 based on Foata normal form. 15/181 useless extension candidates. Maximal degree in co-relation 516. Up to 56 conditions per place. [2023-08-30 16:47:09,259 INFO L137 encePairwiseOnDemand]: 165/170 looper letters, 22 selfloop transitions, 8 changer transitions 12/47 dead transitions. [2023-08-30 16:47:09,260 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 47 transitions, 287 flow [2023-08-30 16:47:09,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-30 16:47:09,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-30 16:47:09,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 558 transitions. [2023-08-30 16:47:09,262 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4689075630252101 [2023-08-30 16:47:09,262 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 558 transitions. [2023-08-30 16:47:09,262 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 558 transitions. [2023-08-30 16:47:09,262 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:47:09,262 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 558 transitions. [2023-08-30 16:47:09,264 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 79.71428571428571) internal successors, (558), 7 states have internal predecessors, (558), 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:47:09,266 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 170.0) internal successors, (1360), 8 states have internal predecessors, (1360), 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:47:09,267 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 170.0) internal successors, (1360), 8 states have internal predecessors, (1360), 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:47:09,267 INFO L175 Difference]: Start difference. First operand has 34 places, 24 transitions, 120 flow. Second operand 7 states and 558 transitions. [2023-08-30 16:47:09,267 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 47 transitions, 287 flow [2023-08-30 16:47:09,271 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 47 transitions, 282 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-08-30 16:47:09,272 INFO L231 Difference]: Finished difference. Result has 42 places, 25 transitions, 148 flow [2023-08-30 16:47:09,272 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=170, PETRI_DIFFERENCE_MINUEND_FLOW=115, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=148, PETRI_PLACES=42, PETRI_TRANSITIONS=25} [2023-08-30 16:47:09,274 INFO L281 CegarLoopForPetriNet]: 25 programPoint places, 17 predicate places. [2023-08-30 16:47:09,274 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 25 transitions, 148 flow [2023-08-30 16:47:09,275 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 76.2) internal successors, (381), 5 states have internal predecessors, (381), 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:47:09,275 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:47:09,275 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:47:09,275 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-30 16:47:09,275 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-30 16:47:09,276 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:47:09,276 INFO L85 PathProgramCache]: Analyzing trace with hash -1794244506, now seen corresponding path program 1 times [2023-08-30 16:47:09,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:47:09,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449289611] [2023-08-30 16:47:09,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:47:09,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:47:09,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:47:10,027 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:47:10,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:47:10,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449289611] [2023-08-30 16:47:10,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [449289611] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:47:10,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:47:10,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 16:47:10,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874388454] [2023-08-30 16:47:10,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:47:10,028 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-30 16:47:10,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:47:10,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-30 16:47:10,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-08-30 16:47:10,055 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 170 [2023-08-30 16:47:10,056 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 25 transitions, 148 flow. Second operand has 6 states, 6 states have (on average 75.33333333333333) internal successors, (452), 6 states have internal predecessors, (452), 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:47:10,056 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:47:10,056 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 170 [2023-08-30 16:47:10,057 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:47:10,204 INFO L130 PetriNetUnfolder]: 71/192 cut-off events. [2023-08-30 16:47:10,205 INFO L131 PetriNetUnfolder]: For 379/382 co-relation queries the response was YES. [2023-08-30 16:47:10,205 INFO L83 FinitePrefix]: Finished finitePrefix Result has 705 conditions, 192 events. 71/192 cut-off events. For 379/382 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 854 event pairs, 3 based on Foata normal form. 1/193 useless extension candidates. Maximal degree in co-relation 683. Up to 85 conditions per place. [2023-08-30 16:47:10,206 INFO L137 encePairwiseOnDemand]: 164/170 looper letters, 21 selfloop transitions, 4 changer transitions 22/52 dead transitions. [2023-08-30 16:47:10,206 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 52 transitions, 404 flow [2023-08-30 16:47:10,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-30 16:47:10,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-30 16:47:10,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 545 transitions. [2023-08-30 16:47:10,209 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4579831932773109 [2023-08-30 16:47:10,209 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 545 transitions. [2023-08-30 16:47:10,209 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 545 transitions. [2023-08-30 16:47:10,209 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:47:10,209 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 545 transitions. [2023-08-30 16:47:10,211 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 77.85714285714286) internal successors, (545), 7 states have internal predecessors, (545), 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:47:10,212 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 170.0) internal successors, (1360), 8 states have internal predecessors, (1360), 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:47:10,213 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 170.0) internal successors, (1360), 8 states have internal predecessors, (1360), 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:47:10,213 INFO L175 Difference]: Start difference. First operand has 42 places, 25 transitions, 148 flow. Second operand 7 states and 545 transitions. [2023-08-30 16:47:10,213 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 52 transitions, 404 flow [2023-08-30 16:47:10,216 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 52 transitions, 345 flow, removed 14 selfloop flow, removed 6 redundant places. [2023-08-30 16:47:10,217 INFO L231 Difference]: Finished difference. Result has 43 places, 24 transitions, 132 flow [2023-08-30 16:47:10,217 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=170, PETRI_DIFFERENCE_MINUEND_FLOW=123, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=132, PETRI_PLACES=43, PETRI_TRANSITIONS=24} [2023-08-30 16:47:10,217 INFO L281 CegarLoopForPetriNet]: 25 programPoint places, 18 predicate places. [2023-08-30 16:47:10,218 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 24 transitions, 132 flow [2023-08-30 16:47:10,218 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 75.33333333333333) internal successors, (452), 6 states have internal predecessors, (452), 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:47:10,218 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:47:10,218 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:47:10,219 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-30 16:47:10,219 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-30 16:47:10,219 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:47:10,219 INFO L85 PathProgramCache]: Analyzing trace with hash -1809778600, now seen corresponding path program 2 times [2023-08-30 16:47:10,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:47:10,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615900265] [2023-08-30 16:47:10,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:47:10,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:47:10,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-30 16:47:10,250 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-30 16:47:10,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-30 16:47:10,312 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-30 16:47:10,312 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-30 16:47:10,313 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2023-08-30 16:47:10,315 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2023-08-30 16:47:10,316 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2023-08-30 16:47:10,316 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2023-08-30 16:47:10,316 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2023-08-30 16:47:10,316 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-30 16:47:10,316 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1] [2023-08-30 16:47:10,322 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-30 16:47:10,322 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-30 16:47:10,384 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.08 04:47:10 BasicIcfg [2023-08-30 16:47:10,384 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-30 16:47:10,384 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-08-30 16:47:10,384 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-08-30 16:47:10,385 INFO L275 PluginConnector]: Witness Printer initialized [2023-08-30 16:47:10,385 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 04:47:03" (3/4) ... [2023-08-30 16:47:10,386 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-08-30 16:47:10,477 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-08-30 16:47:10,477 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-08-30 16:47:10,478 INFO L158 Benchmark]: Toolchain (without parser) took 7981.80ms. Allocated memory was 73.4MB in the beginning and 172.0MB in the end (delta: 98.6MB). Free memory was 49.3MB in the beginning and 137.0MB in the end (delta: -87.7MB). Peak memory consumption was 10.1MB. Max. memory is 16.1GB. [2023-08-30 16:47:10,478 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 60.8MB. Free memory was 38.8MB in the beginning and 38.7MB in the end (delta: 56.7kB). There was no memory consumed. Max. memory is 16.1GB. [2023-08-30 16:47:10,478 INFO L158 Benchmark]: CACSL2BoogieTranslator took 595.74ms. Allocated memory is still 73.4MB. Free memory was 49.2MB in the beginning and 43.4MB in the end (delta: 5.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2023-08-30 16:47:10,479 INFO L158 Benchmark]: Boogie Procedure Inliner took 66.91ms. Allocated memory is still 73.4MB. Free memory was 43.4MB in the beginning and 40.8MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-08-30 16:47:10,479 INFO L158 Benchmark]: Boogie Preprocessor took 53.67ms. Allocated memory is still 73.4MB. Free memory was 40.8MB in the beginning and 39.2MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2023-08-30 16:47:10,479 INFO L158 Benchmark]: RCFGBuilder took 759.08ms. Allocated memory is still 73.4MB. Free memory was 39.2MB in the beginning and 30.0MB in the end (delta: 9.2MB). Peak memory consumption was 14.3MB. Max. memory is 16.1GB. [2023-08-30 16:47:10,479 INFO L158 Benchmark]: TraceAbstraction took 6405.88ms. Allocated memory was 73.4MB in the beginning and 172.0MB in the end (delta: 98.6MB). Free memory was 29.2MB in the beginning and 144.3MB in the end (delta: -115.2MB). Peak memory consumption was 73.4MB. Max. memory is 16.1GB. [2023-08-30 16:47:10,480 INFO L158 Benchmark]: Witness Printer took 93.15ms. Allocated memory is still 172.0MB. Free memory was 144.3MB in the beginning and 137.0MB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2023-08-30 16:47:10,482 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.16ms. Allocated memory is still 60.8MB. Free memory was 38.8MB in the beginning and 38.7MB in the end (delta: 56.7kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 595.74ms. Allocated memory is still 73.4MB. Free memory was 49.2MB in the beginning and 43.4MB in the end (delta: 5.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 66.91ms. Allocated memory is still 73.4MB. Free memory was 43.4MB in the beginning and 40.8MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 53.67ms. Allocated memory is still 73.4MB. Free memory was 40.8MB in the beginning and 39.2MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 759.08ms. Allocated memory is still 73.4MB. Free memory was 39.2MB in the beginning and 30.0MB in the end (delta: 9.2MB). Peak memory consumption was 14.3MB. Max. memory is 16.1GB. * TraceAbstraction took 6405.88ms. Allocated memory was 73.4MB in the beginning and 172.0MB in the end (delta: 98.6MB). Free memory was 29.2MB in the beginning and 144.3MB in the end (delta: -115.2MB). Peak memory consumption was 73.4MB. Max. memory is 16.1GB. * Witness Printer took 93.15ms. Allocated memory is still 172.0MB. Free memory was 144.3MB in the beginning and 137.0MB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.9s, 92 PlacesBefore, 25 PlacesAfterwards, 87 TransitionsBefore, 18 TransitionsAfterwards, 1104 CoEnabledTransitionPairs, 6 FixpointIterations, 35 TrivialSequentialCompositions, 36 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 2 ChoiceCompositions, 81 TotalNumberOfCompositions, 2841 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1220, independent: 1091, independent conditional: 0, independent unconditional: 1091, dependent: 129, dependent conditional: 0, dependent unconditional: 129, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 631, independent: 605, independent conditional: 0, independent unconditional: 605, dependent: 26, dependent conditional: 0, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1220, independent: 486, independent conditional: 0, independent unconditional: 486, dependent: 103, dependent conditional: 0, dependent unconditional: 103, unknown: 631, unknown conditional: 0, unknown unconditional: 631] , Statistics on independence cache: Total cache size (in pairs): 36, Positive cache size: 26, Positive conditional cache size: 0, Positive unconditional cache size: 26, Negative cache size: 10, Negative conditional cache size: 0, Negative unconditional cache size: 10, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L708] 0 int __unbuffered_cnt = 0; [L710] 0 int __unbuffered_p1_EAX = 0; [L712] 0 int __unbuffered_p1_EBX = 0; [L713] 0 _Bool main$tmp_guard0; [L714] 0 _Bool main$tmp_guard1; [L716] 0 int x = 0; [L718] 0 int y = 0; [L719] 0 _Bool y$flush_delayed; [L720] 0 int y$mem_tmp; [L721] 0 _Bool y$r_buff0_thd0; [L722] 0 _Bool y$r_buff0_thd1; [L723] 0 _Bool y$r_buff0_thd2; [L724] 0 _Bool y$r_buff1_thd0; [L725] 0 _Bool y$r_buff1_thd1; [L726] 0 _Bool y$r_buff1_thd2; [L727] 0 _Bool y$read_delayed; [L728] 0 int *y$read_delayed_var; [L729] 0 int y$w_buff0; [L730] 0 _Bool y$w_buff0_used; [L731] 0 int y$w_buff1; [L732] 0 _Bool y$w_buff1_used; [L733] 0 _Bool weak$$choice0; [L734] 0 _Bool weak$$choice2; [L810] 0 pthread_t t585; [L811] FCALL, FORK 0 pthread_create(&t585, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t585, ((void *)0), P0, ((void *)0))=6, t585={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L812] 0 pthread_t t586; [L813] FCALL, FORK 0 pthread_create(&t586, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t586, ((void *)0), P1, ((void *)0))=7, t585={5:0}, t586={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L738] 1 y$w_buff1 = y$w_buff0 [L739] 1 y$w_buff0 = 1 [L740] 1 y$w_buff1_used = y$w_buff0_used [L741] 1 y$w_buff0_used = (_Bool)1 [L742] CALL 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L742] RET 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L743] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L744] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L745] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L746] 1 y$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L749] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L766] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L769] 2 __unbuffered_p1_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L772] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L773] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L774] 2 y$flush_delayed = weak$$choice2 [L775] 2 y$mem_tmp = y [L776] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L777] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L778] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L779] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L780] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L781] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L782] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L783] 2 __unbuffered_p1_EBX = y [L784] 2 y = y$flush_delayed ? y$mem_tmp : y [L785] 2 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L788] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L789] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L790] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L791] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L792] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L752] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L753] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L754] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L755] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L756] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L759] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L761] 1 return 0; [L795] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L797] 2 return 0; [L815] 0 main$tmp_guard0 = __unbuffered_cnt == 2 [L817] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L817] RET 0 assume_abort_if_not(main$tmp_guard0) [L819] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L820] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L821] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L822] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L823] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t585={5:0}, t586={3:0}, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L826] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 2 && __unbuffered_p1_EBX == 0) [L828] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] - UnprovableResult [Line: 18]: 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: 811]: 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: 813]: 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 5 procedures, 108 locations, 5 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 6.2s, OverallIterations: 7, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 160 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 117 mSDsluCounter, 66 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 52 mSDsCounter, 31 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 408 IncrementalHoareTripleChecker+Invalid, 439 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 31 mSolverCounterUnsat, 14 mSDtfsCounter, 408 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=148occurred in iteration=5, InterpolantAutomatonStates: 29, 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.2s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 71 NumberOfCodeBlocks, 71 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 49 ConstructedInterpolants, 0 QuantifiedInterpolants, 309 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 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:47:10,508 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- 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