./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix045_power.oepc_pso.oepc_rmo.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8393723b Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b9de20b-f8b1-426d-bcc4-2c6fa7fe7a42/bin/uautomizer-TMbwUNV5ro/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b9de20b-f8b1-426d-bcc4-2c6fa7fe7a42/bin/uautomizer-TMbwUNV5ro/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b9de20b-f8b1-426d-bcc4-2c6fa7fe7a42/bin/uautomizer-TMbwUNV5ro/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b9de20b-f8b1-426d-bcc4-2c6fa7fe7a42/bin/uautomizer-TMbwUNV5ro/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix045_power.oepc_pso.oepc_rmo.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b9de20b-f8b1-426d-bcc4-2c6fa7fe7a42/bin/uautomizer-TMbwUNV5ro/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b9de20b-f8b1-426d-bcc4-2c6fa7fe7a42/bin/uautomizer-TMbwUNV5ro --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 ac99c7435b3707a16823c102e546d1d8821c1d75e1c740ce64249f2f34cab350 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-8393723 [2022-11-18 20:07:04,904 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-18 20:07:04,909 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-18 20:07:04,941 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-18 20:07:04,944 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-18 20:07:04,948 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-18 20:07:04,950 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-18 20:07:04,954 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-18 20:07:04,957 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-18 20:07:04,962 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-18 20:07:04,964 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-18 20:07:04,966 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-18 20:07:04,967 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-18 20:07:04,970 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-18 20:07:04,971 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-18 20:07:04,974 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-18 20:07:04,975 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-18 20:07:04,976 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-18 20:07:04,978 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-18 20:07:04,987 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-18 20:07:04,989 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-18 20:07:04,991 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-18 20:07:04,994 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-18 20:07:04,995 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-18 20:07:05,003 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-18 20:07:05,004 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-18 20:07:05,004 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-18 20:07:05,006 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-18 20:07:05,007 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-18 20:07:05,008 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-18 20:07:05,008 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-18 20:07:05,010 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-18 20:07:05,011 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-18 20:07:05,012 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-18 20:07:05,013 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-18 20:07:05,013 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-18 20:07:05,014 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-18 20:07:05,014 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-18 20:07:05,015 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-18 20:07:05,015 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-18 20:07:05,016 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-18 20:07:05,017 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b9de20b-f8b1-426d-bcc4-2c6fa7fe7a42/bin/uautomizer-TMbwUNV5ro/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-18 20:07:05,057 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-18 20:07:05,057 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-18 20:07:05,058 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-18 20:07:05,058 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-18 20:07:05,059 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-18 20:07:05,059 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-18 20:07:05,060 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-18 20:07:05,060 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-18 20:07:05,060 INFO L138 SettingsManager]: * Use SBE=true [2022-11-18 20:07:05,061 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-18 20:07:05,062 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-18 20:07:05,062 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-18 20:07:05,062 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-18 20:07:05,062 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-18 20:07:05,062 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-18 20:07:05,063 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-18 20:07:05,063 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-18 20:07:05,063 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-18 20:07:05,063 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-18 20:07:05,063 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-18 20:07:05,064 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-18 20:07:05,064 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-18 20:07:05,064 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-18 20:07:05,064 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-18 20:07:05,064 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-18 20:07:05,065 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-18 20:07:05,065 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-18 20:07:05,065 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-18 20:07:05,065 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-18 20:07:05,065 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-18 20:07:05,066 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-18 20:07:05,066 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-18 20:07:05,066 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-18 20:07:05,066 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b9de20b-f8b1-426d-bcc4-2c6fa7fe7a42/bin/uautomizer-TMbwUNV5ro/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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b9de20b-f8b1-426d-bcc4-2c6fa7fe7a42/bin/uautomizer-TMbwUNV5ro 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 -> ac99c7435b3707a16823c102e546d1d8821c1d75e1c740ce64249f2f34cab350 [2022-11-18 20:07:05,382 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-18 20:07:05,402 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-18 20:07:05,405 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-18 20:07:05,407 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-18 20:07:05,407 INFO L275 PluginConnector]: CDTParser initialized [2022-11-18 20:07:05,409 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b9de20b-f8b1-426d-bcc4-2c6fa7fe7a42/bin/uautomizer-TMbwUNV5ro/../../sv-benchmarks/c/pthread-wmm/mix045_power.oepc_pso.oepc_rmo.oepc.i [2022-11-18 20:07:05,487 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b9de20b-f8b1-426d-bcc4-2c6fa7fe7a42/bin/uautomizer-TMbwUNV5ro/data/028c47b58/74830a4ba6024bad8f67fac92b6caf2a/FLAG7ce001078 [2022-11-18 20:07:06,108 INFO L306 CDTParser]: Found 1 translation units. [2022-11-18 20:07:06,109 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b9de20b-f8b1-426d-bcc4-2c6fa7fe7a42/sv-benchmarks/c/pthread-wmm/mix045_power.oepc_pso.oepc_rmo.oepc.i [2022-11-18 20:07:06,131 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b9de20b-f8b1-426d-bcc4-2c6fa7fe7a42/bin/uautomizer-TMbwUNV5ro/data/028c47b58/74830a4ba6024bad8f67fac92b6caf2a/FLAG7ce001078 [2022-11-18 20:07:06,356 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b9de20b-f8b1-426d-bcc4-2c6fa7fe7a42/bin/uautomizer-TMbwUNV5ro/data/028c47b58/74830a4ba6024bad8f67fac92b6caf2a [2022-11-18 20:07:06,359 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-18 20:07:06,362 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-18 20:07:06,366 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-18 20:07:06,366 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-18 20:07:06,369 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-18 20:07:06,370 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 08:07:06" (1/1) ... [2022-11-18 20:07:06,372 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@100c0dad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:07:06, skipping insertion in model container [2022-11-18 20:07:06,373 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 08:07:06" (1/1) ... [2022-11-18 20:07:06,380 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-18 20:07:06,444 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-18 20:07:06,679 WARN L234 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b9de20b-f8b1-426d-bcc4-2c6fa7fe7a42/sv-benchmarks/c/pthread-wmm/mix045_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2022-11-18 20:07:06,990 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-18 20:07:07,001 INFO L203 MainTranslator]: Completed pre-run [2022-11-18 20:07:07,023 WARN L234 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b9de20b-f8b1-426d-bcc4-2c6fa7fe7a42/sv-benchmarks/c/pthread-wmm/mix045_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2022-11-18 20:07:07,083 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-18 20:07:07,117 INFO L208 MainTranslator]: Completed translation [2022-11-18 20:07:07,118 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:07:07 WrapperNode [2022-11-18 20:07:07,118 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-18 20:07:07,119 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-18 20:07:07,119 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-18 20:07:07,120 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-18 20:07:07,127 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:07:07" (1/1) ... [2022-11-18 20:07:07,162 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:07:07" (1/1) ... [2022-11-18 20:07:07,191 INFO L138 Inliner]: procedures = 176, calls = 58, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 129 [2022-11-18 20:07:07,195 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-18 20:07:07,196 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-18 20:07:07,196 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-18 20:07:07,196 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-18 20:07:07,205 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:07:07" (1/1) ... [2022-11-18 20:07:07,206 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:07:07" (1/1) ... [2022-11-18 20:07:07,227 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:07:07" (1/1) ... [2022-11-18 20:07:07,227 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:07:07" (1/1) ... [2022-11-18 20:07:07,251 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:07:07" (1/1) ... [2022-11-18 20:07:07,253 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:07:07" (1/1) ... [2022-11-18 20:07:07,254 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:07:07" (1/1) ... [2022-11-18 20:07:07,256 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:07:07" (1/1) ... [2022-11-18 20:07:07,259 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-18 20:07:07,260 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-18 20:07:07,260 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-18 20:07:07,260 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-18 20:07:07,261 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:07:07" (1/1) ... [2022-11-18 20:07:07,278 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-18 20:07:07,290 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b9de20b-f8b1-426d-bcc4-2c6fa7fe7a42/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:07:07,305 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b9de20b-f8b1-426d-bcc4-2c6fa7fe7a42/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-18 20:07:07,330 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b9de20b-f8b1-426d-bcc4-2c6fa7fe7a42/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-18 20:07:07,354 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-18 20:07:07,355 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-18 20:07:07,355 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-18 20:07:07,355 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-18 20:07:07,355 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-18 20:07:07,356 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-18 20:07:07,356 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-18 20:07:07,356 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-18 20:07:07,357 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-18 20:07:07,358 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-11-18 20:07:07,358 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-11-18 20:07:07,358 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-18 20:07:07,358 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-18 20:07:07,358 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-18 20:07:07,359 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-18 20:07:07,361 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-18 20:07:07,531 INFO L235 CfgBuilder]: Building ICFG [2022-11-18 20:07:07,533 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-18 20:07:07,904 INFO L276 CfgBuilder]: Performing block encoding [2022-11-18 20:07:08,108 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-18 20:07:08,111 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-18 20:07:08,115 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:07:08 BoogieIcfgContainer [2022-11-18 20:07:08,116 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-18 20:07:08,118 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-18 20:07:08,118 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-18 20:07:08,122 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-18 20:07:08,122 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 08:07:06" (1/3) ... [2022-11-18 20:07:08,123 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ead16f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 08:07:08, skipping insertion in model container [2022-11-18 20:07:08,123 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:07:07" (2/3) ... [2022-11-18 20:07:08,124 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ead16f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 08:07:08, skipping insertion in model container [2022-11-18 20:07:08,124 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:07:08" (3/3) ... [2022-11-18 20:07:08,125 INFO L112 eAbstractionObserver]: Analyzing ICFG mix045_power.oepc_pso.oepc_rmo.oepc.i [2022-11-18 20:07:08,135 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-18 20:07:08,146 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-18 20:07:08,146 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-11-18 20:07:08,146 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-18 20:07:08,260 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-18 20:07:08,314 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 126 places, 118 transitions, 251 flow [2022-11-18 20:07:08,404 INFO L130 PetriNetUnfolder]: 2/115 cut-off events. [2022-11-18 20:07:08,404 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-18 20:07:08,410 INFO L83 FinitePrefix]: Finished finitePrefix Result has 125 conditions, 115 events. 2/115 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 62 event pairs, 0 based on Foata normal form. 0/111 useless extension candidates. Maximal degree in co-relation 75. Up to 2 conditions per place. [2022-11-18 20:07:08,410 INFO L82 GeneralOperation]: Start removeDead. Operand has 126 places, 118 transitions, 251 flow [2022-11-18 20:07:08,416 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 123 places, 115 transitions, 239 flow [2022-11-18 20:07:08,433 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-18 20:07:08,442 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;@5bee42a6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-18 20:07:08,443 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-11-18 20:07:08,458 INFO L130 PetriNetUnfolder]: 0/46 cut-off events. [2022-11-18 20:07:08,458 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-18 20:07:08,458 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 20:07:08,459 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:07:08,460 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-18 20:07:08,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:07:08,465 INFO L85 PathProgramCache]: Analyzing trace with hash -1344165345, now seen corresponding path program 1 times [2022-11-18 20:07:08,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:07:08,476 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119509102] [2022-11-18 20:07:08,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:07:08,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:07:08,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:07:09,113 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:07:09,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:07:09,113 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119509102] [2022-11-18 20:07:09,114 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [119509102] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:07:09,114 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:07:09,114 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-18 20:07:09,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043018896] [2022-11-18 20:07:09,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:07:09,123 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 20:07:09,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:07:09,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 20:07:09,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 20:07:09,153 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 118 [2022-11-18 20:07:09,156 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 115 transitions, 239 flow. Second operand has 3 states, 3 states have (on average 105.0) internal successors, (315), 3 states have internal predecessors, (315), 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) [2022-11-18 20:07:09,157 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 20:07:09,157 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 118 [2022-11-18 20:07:09,158 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 20:07:09,367 INFO L130 PetriNetUnfolder]: 58/279 cut-off events. [2022-11-18 20:07:09,367 INFO L131 PetriNetUnfolder]: For 10/10 co-relation queries the response was YES. [2022-11-18 20:07:09,370 INFO L83 FinitePrefix]: Finished finitePrefix Result has 408 conditions, 279 events. 58/279 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1101 event pairs, 10 based on Foata normal form. 23/284 useless extension candidates. Maximal degree in co-relation 355. Up to 79 conditions per place. [2022-11-18 20:07:09,372 INFO L137 encePairwiseOnDemand]: 113/118 looper letters, 14 selfloop transitions, 2 changer transitions 0/117 dead transitions. [2022-11-18 20:07:09,372 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 117 transitions, 281 flow [2022-11-18 20:07:09,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 20:07:09,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-18 20:07:09,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 333 transitions. [2022-11-18 20:07:09,389 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.940677966101695 [2022-11-18 20:07:09,389 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 333 transitions. [2022-11-18 20:07:09,389 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 333 transitions. [2022-11-18 20:07:09,391 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 20:07:09,395 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 333 transitions. [2022-11-18 20:07:09,398 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 111.0) internal successors, (333), 3 states have internal predecessors, (333), 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) [2022-11-18 20:07:09,403 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 118.0) internal successors, (472), 4 states have internal predecessors, (472), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:07:09,404 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 118.0) internal successors, (472), 4 states have internal predecessors, (472), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:07:09,406 INFO L175 Difference]: Start difference. First operand has 123 places, 115 transitions, 239 flow. Second operand 3 states and 333 transitions. [2022-11-18 20:07:09,407 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 117 transitions, 281 flow [2022-11-18 20:07:09,410 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 117 transitions, 276 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-11-18 20:07:09,414 INFO L231 Difference]: Finished difference. Result has 120 places, 111 transitions, 232 flow [2022-11-18 20:07:09,416 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=118, PETRI_DIFFERENCE_MINUEND_FLOW=228, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=232, PETRI_PLACES=120, PETRI_TRANSITIONS=111} [2022-11-18 20:07:09,420 INFO L288 CegarLoopForPetriNet]: 123 programPoint places, -3 predicate places. [2022-11-18 20:07:09,420 INFO L495 AbstractCegarLoop]: Abstraction has has 120 places, 111 transitions, 232 flow [2022-11-18 20:07:09,421 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 105.0) internal successors, (315), 3 states have internal predecessors, (315), 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) [2022-11-18 20:07:09,421 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 20:07:09,422 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:07:09,422 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-18 20:07:09,423 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-18 20:07:09,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:07:09,424 INFO L85 PathProgramCache]: Analyzing trace with hash 273444987, now seen corresponding path program 1 times [2022-11-18 20:07:09,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:07:09,425 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056048529] [2022-11-18 20:07:09,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:07:09,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:07:09,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:07:09,927 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:07:09,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:07:09,928 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056048529] [2022-11-18 20:07:09,928 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2056048529] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:07:09,928 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:07:09,928 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-18 20:07:09,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486307671] [2022-11-18 20:07:09,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:07:09,930 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-18 20:07:09,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:07:09,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-18 20:07:09,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-18 20:07:09,933 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 118 [2022-11-18 20:07:09,934 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 111 transitions, 232 flow. Second operand has 7 states, 7 states have (on average 91.0) internal successors, (637), 7 states have internal predecessors, (637), 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) [2022-11-18 20:07:09,935 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 20:07:09,935 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 118 [2022-11-18 20:07:09,935 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 20:07:11,739 INFO L130 PetriNetUnfolder]: 2676/6362 cut-off events. [2022-11-18 20:07:11,740 INFO L131 PetriNetUnfolder]: For 295/295 co-relation queries the response was YES. [2022-11-18 20:07:11,762 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10720 conditions, 6362 events. 2676/6362 cut-off events. For 295/295 co-relation queries the response was YES. Maximal size of possible extension queue 318. Compared 54949 event pairs, 334 based on Foata normal form. 0/6196 useless extension candidates. Maximal degree in co-relation 10664. Up to 1154 conditions per place. [2022-11-18 20:07:11,779 INFO L137 encePairwiseOnDemand]: 108/118 looper letters, 38 selfloop transitions, 6 changer transitions 99/218 dead transitions. [2022-11-18 20:07:11,779 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 218 transitions, 732 flow [2022-11-18 20:07:11,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-18 20:07:11,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-11-18 20:07:11,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1292 transitions. [2022-11-18 20:07:11,788 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8422425032594524 [2022-11-18 20:07:11,788 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1292 transitions. [2022-11-18 20:07:11,788 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1292 transitions. [2022-11-18 20:07:11,790 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 20:07:11,790 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1292 transitions. [2022-11-18 20:07:11,795 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 99.38461538461539) internal successors, (1292), 13 states have internal predecessors, (1292), 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) [2022-11-18 20:07:11,800 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 118.0) internal successors, (1652), 14 states have internal predecessors, (1652), 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) [2022-11-18 20:07:11,802 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 118.0) internal successors, (1652), 14 states have internal predecessors, (1652), 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) [2022-11-18 20:07:11,802 INFO L175 Difference]: Start difference. First operand has 120 places, 111 transitions, 232 flow. Second operand 13 states and 1292 transitions. [2022-11-18 20:07:11,802 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 218 transitions, 732 flow [2022-11-18 20:07:11,806 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 218 transitions, 706 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-18 20:07:11,810 INFO L231 Difference]: Finished difference. Result has 142 places, 103 transitions, 290 flow [2022-11-18 20:07:11,810 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=118, PETRI_DIFFERENCE_MINUEND_FLOW=228, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=290, PETRI_PLACES=142, PETRI_TRANSITIONS=103} [2022-11-18 20:07:11,811 INFO L288 CegarLoopForPetriNet]: 123 programPoint places, 19 predicate places. [2022-11-18 20:07:11,811 INFO L495 AbstractCegarLoop]: Abstraction has has 142 places, 103 transitions, 290 flow [2022-11-18 20:07:11,812 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 91.0) internal successors, (637), 7 states have internal predecessors, (637), 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) [2022-11-18 20:07:11,813 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 20:07:11,813 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:07:11,813 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-18 20:07:11,813 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-18 20:07:11,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:07:11,815 INFO L85 PathProgramCache]: Analyzing trace with hash -542886855, now seen corresponding path program 1 times [2022-11-18 20:07:11,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:07:11,815 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921962917] [2022-11-18 20:07:11,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:07:11,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:07:11,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:07:12,175 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:07:12,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:07:12,177 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1921962917] [2022-11-18 20:07:12,177 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1921962917] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:07:12,177 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:07:12,178 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-18 20:07:12,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166811596] [2022-11-18 20:07:12,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:07:12,179 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-18 20:07:12,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:07:12,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-18 20:07:12,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-18 20:07:12,182 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 118 [2022-11-18 20:07:12,183 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 103 transitions, 290 flow. Second operand has 7 states, 7 states have (on average 91.28571428571429) internal successors, (639), 7 states have internal predecessors, (639), 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) [2022-11-18 20:07:12,183 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 20:07:12,183 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 118 [2022-11-18 20:07:12,183 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 20:07:13,394 INFO L130 PetriNetUnfolder]: 1728/3426 cut-off events. [2022-11-18 20:07:13,394 INFO L131 PetriNetUnfolder]: For 5948/5950 co-relation queries the response was YES. [2022-11-18 20:07:13,410 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9981 conditions, 3426 events. 1728/3426 cut-off events. For 5948/5950 co-relation queries the response was YES. Maximal size of possible extension queue 217. Compared 23747 event pairs, 269 based on Foata normal form. 74/3406 useless extension candidates. Maximal degree in co-relation 9913. Up to 979 conditions per place. [2022-11-18 20:07:13,427 INFO L137 encePairwiseOnDemand]: 106/118 looper letters, 40 selfloop transitions, 14 changer transitions 73/202 dead transitions. [2022-11-18 20:07:13,428 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 202 transitions, 1070 flow [2022-11-18 20:07:13,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-18 20:07:13,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-11-18 20:07:13,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1283 transitions. [2022-11-18 20:07:13,436 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8363754889178618 [2022-11-18 20:07:13,436 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1283 transitions. [2022-11-18 20:07:13,436 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1283 transitions. [2022-11-18 20:07:13,482 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 20:07:13,483 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1283 transitions. [2022-11-18 20:07:13,486 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 98.6923076923077) internal successors, (1283), 13 states have internal predecessors, (1283), 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) [2022-11-18 20:07:13,490 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 118.0) internal successors, (1652), 14 states have internal predecessors, (1652), 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) [2022-11-18 20:07:13,492 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 118.0) internal successors, (1652), 14 states have internal predecessors, (1652), 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) [2022-11-18 20:07:13,493 INFO L175 Difference]: Start difference. First operand has 142 places, 103 transitions, 290 flow. Second operand 13 states and 1283 transitions. [2022-11-18 20:07:13,493 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 202 transitions, 1070 flow [2022-11-18 20:07:13,519 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 202 transitions, 1042 flow, removed 12 selfloop flow, removed 4 redundant places. [2022-11-18 20:07:13,523 INFO L231 Difference]: Finished difference. Result has 141 places, 111 transitions, 431 flow [2022-11-18 20:07:13,524 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=118, PETRI_DIFFERENCE_MINUEND_FLOW=282, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=431, PETRI_PLACES=141, PETRI_TRANSITIONS=111} [2022-11-18 20:07:13,526 INFO L288 CegarLoopForPetriNet]: 123 programPoint places, 18 predicate places. [2022-11-18 20:07:13,526 INFO L495 AbstractCegarLoop]: Abstraction has has 141 places, 111 transitions, 431 flow [2022-11-18 20:07:13,527 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 91.28571428571429) internal successors, (639), 7 states have internal predecessors, (639), 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) [2022-11-18 20:07:13,527 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 20:07:13,527 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:07:13,528 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-18 20:07:13,528 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-18 20:07:13,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:07:13,529 INFO L85 PathProgramCache]: Analyzing trace with hash -585499272, now seen corresponding path program 1 times [2022-11-18 20:07:13,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:07:13,529 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835718861] [2022-11-18 20:07:13,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:07:13,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:07:13,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:07:13,829 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:07:13,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:07:13,829 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835718861] [2022-11-18 20:07:13,830 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [835718861] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:07:13,830 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:07:13,830 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-18 20:07:13,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574985810] [2022-11-18 20:07:13,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:07:13,832 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-18 20:07:13,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:07:13,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-18 20:07:13,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-18 20:07:13,838 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 118 [2022-11-18 20:07:13,839 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 111 transitions, 431 flow. Second operand has 6 states, 6 states have (on average 95.83333333333333) internal successors, (575), 6 states have internal predecessors, (575), 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) [2022-11-18 20:07:13,839 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 20:07:13,839 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 118 [2022-11-18 20:07:13,839 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 20:07:15,283 INFO L130 PetriNetUnfolder]: 2856/5842 cut-off events. [2022-11-18 20:07:15,283 INFO L131 PetriNetUnfolder]: For 7711/8279 co-relation queries the response was YES. [2022-11-18 20:07:15,322 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13999 conditions, 5842 events. 2856/5842 cut-off events. For 7711/8279 co-relation queries the response was YES. Maximal size of possible extension queue 412. Compared 47450 event pairs, 227 based on Foata normal form. 68/5601 useless extension candidates. Maximal degree in co-relation 13922. Up to 1496 conditions per place. [2022-11-18 20:07:15,346 INFO L137 encePairwiseOnDemand]: 108/118 looper letters, 78 selfloop transitions, 17 changer transitions 0/185 dead transitions. [2022-11-18 20:07:15,346 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 185 transitions, 885 flow [2022-11-18 20:07:15,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-18 20:07:15,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-11-18 20:07:15,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1029 transitions. [2022-11-18 20:07:15,350 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8720338983050847 [2022-11-18 20:07:15,350 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1029 transitions. [2022-11-18 20:07:15,350 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1029 transitions. [2022-11-18 20:07:15,351 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 20:07:15,352 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1029 transitions. [2022-11-18 20:07:15,355 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 102.9) internal successors, (1029), 10 states have internal predecessors, (1029), 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) [2022-11-18 20:07:15,357 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 118.0) internal successors, (1298), 11 states have internal predecessors, (1298), 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) [2022-11-18 20:07:15,358 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 118.0) internal successors, (1298), 11 states have internal predecessors, (1298), 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) [2022-11-18 20:07:15,358 INFO L175 Difference]: Start difference. First operand has 141 places, 111 transitions, 431 flow. Second operand 10 states and 1029 transitions. [2022-11-18 20:07:15,358 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 185 transitions, 885 flow [2022-11-18 20:07:15,373 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 185 transitions, 861 flow, removed 12 selfloop flow, removed 9 redundant places. [2022-11-18 20:07:15,377 INFO L231 Difference]: Finished difference. Result has 138 places, 126 transitions, 527 flow [2022-11-18 20:07:15,377 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=118, PETRI_DIFFERENCE_MINUEND_FLOW=407, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=527, PETRI_PLACES=138, PETRI_TRANSITIONS=126} [2022-11-18 20:07:15,378 INFO L288 CegarLoopForPetriNet]: 123 programPoint places, 15 predicate places. [2022-11-18 20:07:15,378 INFO L495 AbstractCegarLoop]: Abstraction has has 138 places, 126 transitions, 527 flow [2022-11-18 20:07:15,378 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 95.83333333333333) internal successors, (575), 6 states have internal predecessors, (575), 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) [2022-11-18 20:07:15,379 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 20:07:15,379 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:07:15,379 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-18 20:07:15,379 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-18 20:07:15,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:07:15,380 INFO L85 PathProgramCache]: Analyzing trace with hash -756451592, now seen corresponding path program 1 times [2022-11-18 20:07:15,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:07:15,380 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206275298] [2022-11-18 20:07:15,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:07:15,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:07:15,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:07:15,683 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:07:15,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:07:15,684 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206275298] [2022-11-18 20:07:15,684 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [206275298] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:07:15,684 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:07:15,684 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-18 20:07:15,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67512835] [2022-11-18 20:07:15,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:07:15,685 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-18 20:07:15,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:07:15,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-18 20:07:15,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-18 20:07:15,687 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 118 [2022-11-18 20:07:15,688 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 126 transitions, 527 flow. Second operand has 7 states, 7 states have (on average 91.71428571428571) internal successors, (642), 7 states have internal predecessors, (642), 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) [2022-11-18 20:07:15,688 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 20:07:15,689 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 118 [2022-11-18 20:07:15,689 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 20:07:17,069 INFO L130 PetriNetUnfolder]: 1401/4484 cut-off events. [2022-11-18 20:07:17,069 INFO L131 PetriNetUnfolder]: For 6959/7372 co-relation queries the response was YES. [2022-11-18 20:07:17,102 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12322 conditions, 4484 events. 1401/4484 cut-off events. For 6959/7372 co-relation queries the response was YES. Maximal size of possible extension queue 340. Compared 44878 event pairs, 251 based on Foata normal form. 134/4379 useless extension candidates. Maximal degree in co-relation 12242. Up to 623 conditions per place. [2022-11-18 20:07:17,128 INFO L137 encePairwiseOnDemand]: 107/118 looper letters, 70 selfloop transitions, 30 changer transitions 24/214 dead transitions. [2022-11-18 20:07:17,129 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 214 transitions, 1257 flow [2022-11-18 20:07:17,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-18 20:07:17,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-11-18 20:07:17,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1269 transitions. [2022-11-18 20:07:17,135 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8272490221642764 [2022-11-18 20:07:17,135 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1269 transitions. [2022-11-18 20:07:17,135 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1269 transitions. [2022-11-18 20:07:17,136 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 20:07:17,137 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1269 transitions. [2022-11-18 20:07:17,140 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 97.61538461538461) internal successors, (1269), 13 states have internal predecessors, (1269), 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) [2022-11-18 20:07:17,143 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 118.0) internal successors, (1652), 14 states have internal predecessors, (1652), 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) [2022-11-18 20:07:17,144 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 118.0) internal successors, (1652), 14 states have internal predecessors, (1652), 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) [2022-11-18 20:07:17,144 INFO L175 Difference]: Start difference. First operand has 138 places, 126 transitions, 527 flow. Second operand 13 states and 1269 transitions. [2022-11-18 20:07:17,144 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 214 transitions, 1257 flow [2022-11-18 20:07:17,181 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 214 transitions, 1255 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-18 20:07:17,184 INFO L231 Difference]: Finished difference. Result has 161 places, 147 transitions, 876 flow [2022-11-18 20:07:17,184 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=118, PETRI_DIFFERENCE_MINUEND_FLOW=525, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=876, PETRI_PLACES=161, PETRI_TRANSITIONS=147} [2022-11-18 20:07:17,185 INFO L288 CegarLoopForPetriNet]: 123 programPoint places, 38 predicate places. [2022-11-18 20:07:17,185 INFO L495 AbstractCegarLoop]: Abstraction has has 161 places, 147 transitions, 876 flow [2022-11-18 20:07:17,186 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 91.71428571428571) internal successors, (642), 7 states have internal predecessors, (642), 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) [2022-11-18 20:07:17,186 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 20:07:17,186 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:07:17,186 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-18 20:07:17,187 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-18 20:07:17,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:07:17,187 INFO L85 PathProgramCache]: Analyzing trace with hash -987646374, now seen corresponding path program 1 times [2022-11-18 20:07:17,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:07:17,188 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81906195] [2022-11-18 20:07:17,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:07:17,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:07:17,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:07:17,458 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:07:17,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:07:17,458 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81906195] [2022-11-18 20:07:17,458 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [81906195] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:07:17,459 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:07:17,459 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-18 20:07:17,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576270033] [2022-11-18 20:07:17,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:07:17,460 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-18 20:07:17,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:07:17,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-18 20:07:17,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-18 20:07:17,463 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 118 [2022-11-18 20:07:17,464 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 147 transitions, 876 flow. Second operand has 7 states, 7 states have (on average 91.71428571428571) internal successors, (642), 7 states have internal predecessors, (642), 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) [2022-11-18 20:07:17,464 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 20:07:17,464 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 118 [2022-11-18 20:07:17,464 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 20:07:19,219 INFO L130 PetriNetUnfolder]: 1941/6259 cut-off events. [2022-11-18 20:07:19,219 INFO L131 PetriNetUnfolder]: For 18286/18852 co-relation queries the response was YES. [2022-11-18 20:07:19,271 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19158 conditions, 6259 events. 1941/6259 cut-off events. For 18286/18852 co-relation queries the response was YES. Maximal size of possible extension queue 451. Compared 66999 event pairs, 414 based on Foata normal form. 144/6027 useless extension candidates. Maximal degree in co-relation 19065. Up to 1029 conditions per place. [2022-11-18 20:07:19,295 INFO L137 encePairwiseOnDemand]: 107/118 looper letters, 73 selfloop transitions, 28 changer transitions 11/202 dead transitions. [2022-11-18 20:07:19,296 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 202 transitions, 1503 flow [2022-11-18 20:07:19,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-18 20:07:19,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-18 20:07:19,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 700 transitions. [2022-11-18 20:07:19,299 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.847457627118644 [2022-11-18 20:07:19,299 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 700 transitions. [2022-11-18 20:07:19,299 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 700 transitions. [2022-11-18 20:07:19,300 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 20:07:19,300 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 700 transitions. [2022-11-18 20:07:19,302 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 100.0) internal successors, (700), 7 states have internal predecessors, (700), 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) [2022-11-18 20:07:19,304 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 118.0) internal successors, (944), 8 states have internal predecessors, (944), 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) [2022-11-18 20:07:19,304 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 118.0) internal successors, (944), 8 states have internal predecessors, (944), 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) [2022-11-18 20:07:19,305 INFO L175 Difference]: Start difference. First operand has 161 places, 147 transitions, 876 flow. Second operand 7 states and 700 transitions. [2022-11-18 20:07:19,305 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 167 places, 202 transitions, 1503 flow [2022-11-18 20:07:19,397 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 167 places, 202 transitions, 1471 flow, removed 16 selfloop flow, removed 0 redundant places. [2022-11-18 20:07:19,401 INFO L231 Difference]: Finished difference. Result has 173 places, 157 transitions, 1097 flow [2022-11-18 20:07:19,401 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=118, PETRI_DIFFERENCE_MINUEND_FLOW=854, PETRI_DIFFERENCE_MINUEND_PLACES=161, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=147, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=120, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1097, PETRI_PLACES=173, PETRI_TRANSITIONS=157} [2022-11-18 20:07:19,402 INFO L288 CegarLoopForPetriNet]: 123 programPoint places, 50 predicate places. [2022-11-18 20:07:19,402 INFO L495 AbstractCegarLoop]: Abstraction has has 173 places, 157 transitions, 1097 flow [2022-11-18 20:07:19,402 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 91.71428571428571) internal successors, (642), 7 states have internal predecessors, (642), 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) [2022-11-18 20:07:19,403 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 20:07:19,403 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:07:19,403 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-18 20:07:19,403 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-18 20:07:19,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:07:19,404 INFO L85 PathProgramCache]: Analyzing trace with hash -1637221608, now seen corresponding path program 2 times [2022-11-18 20:07:19,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:07:19,404 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158089476] [2022-11-18 20:07:19,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:07:19,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:07:19,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:07:19,727 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:07:19,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:07:19,729 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158089476] [2022-11-18 20:07:19,729 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1158089476] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:07:19,730 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:07:19,730 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-18 20:07:19,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992743608] [2022-11-18 20:07:19,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:07:19,735 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-18 20:07:19,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:07:19,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-18 20:07:19,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-18 20:07:19,738 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 118 [2022-11-18 20:07:19,739 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 173 places, 157 transitions, 1097 flow. Second operand has 7 states, 7 states have (on average 95.85714285714286) internal successors, (671), 7 states have internal predecessors, (671), 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) [2022-11-18 20:07:19,739 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 20:07:19,740 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 118 [2022-11-18 20:07:19,740 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 20:07:22,901 INFO L130 PetriNetUnfolder]: 5822/12056 cut-off events. [2022-11-18 20:07:22,901 INFO L131 PetriNetUnfolder]: For 32728/34514 co-relation queries the response was YES. [2022-11-18 20:07:22,983 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38283 conditions, 12056 events. 5822/12056 cut-off events. For 32728/34514 co-relation queries the response was YES. Maximal size of possible extension queue 889. Compared 115598 event pairs, 305 based on Foata normal form. 312/12033 useless extension candidates. Maximal degree in co-relation 38185. Up to 2097 conditions per place. [2022-11-18 20:07:22,998 INFO L137 encePairwiseOnDemand]: 108/118 looper letters, 69 selfloop transitions, 30 changer transitions 76/275 dead transitions. [2022-11-18 20:07:22,998 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 275 transitions, 2385 flow [2022-11-18 20:07:22,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-18 20:07:22,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-11-18 20:07:23,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1341 transitions. [2022-11-18 20:07:23,003 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8741851368970013 [2022-11-18 20:07:23,004 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1341 transitions. [2022-11-18 20:07:23,004 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1341 transitions. [2022-11-18 20:07:23,005 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 20:07:23,005 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1341 transitions. [2022-11-18 20:07:23,008 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 103.15384615384616) internal successors, (1341), 13 states have internal predecessors, (1341), 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) [2022-11-18 20:07:23,011 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 118.0) internal successors, (1652), 14 states have internal predecessors, (1652), 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) [2022-11-18 20:07:23,013 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 118.0) internal successors, (1652), 14 states have internal predecessors, (1652), 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) [2022-11-18 20:07:23,014 INFO L175 Difference]: Start difference. First operand has 173 places, 157 transitions, 1097 flow. Second operand 13 states and 1341 transitions. [2022-11-18 20:07:23,014 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 185 places, 275 transitions, 2385 flow [2022-11-18 20:07:23,299 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 184 places, 275 transitions, 2349 flow, removed 15 selfloop flow, removed 1 redundant places. [2022-11-18 20:07:23,303 INFO L231 Difference]: Finished difference. Result has 188 places, 154 transitions, 1026 flow [2022-11-18 20:07:23,303 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=118, PETRI_DIFFERENCE_MINUEND_FLOW=1061, PETRI_DIFFERENCE_MINUEND_PLACES=172, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=157, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=137, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1026, PETRI_PLACES=188, PETRI_TRANSITIONS=154} [2022-11-18 20:07:23,305 INFO L288 CegarLoopForPetriNet]: 123 programPoint places, 65 predicate places. [2022-11-18 20:07:23,306 INFO L495 AbstractCegarLoop]: Abstraction has has 188 places, 154 transitions, 1026 flow [2022-11-18 20:07:23,306 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 95.85714285714286) internal successors, (671), 7 states have internal predecessors, (671), 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) [2022-11-18 20:07:23,306 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 20:07:23,306 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:07:23,307 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-18 20:07:23,307 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-18 20:07:23,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:07:23,308 INFO L85 PathProgramCache]: Analyzing trace with hash 1375204119, now seen corresponding path program 1 times [2022-11-18 20:07:23,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:07:23,309 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677782328] [2022-11-18 20:07:23,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:07:23,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:07:23,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:07:23,803 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:07:23,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:07:23,807 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677782328] [2022-11-18 20:07:23,807 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1677782328] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:07:23,807 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:07:23,807 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-18 20:07:23,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567499998] [2022-11-18 20:07:23,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:07:23,808 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-18 20:07:23,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:07:23,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-18 20:07:23,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-11-18 20:07:23,811 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 118 [2022-11-18 20:07:23,812 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 188 places, 154 transitions, 1026 flow. Second operand has 8 states, 8 states have (on average 96.0) internal successors, (768), 8 states have internal predecessors, (768), 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) [2022-11-18 20:07:23,812 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 20:07:23,813 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 118 [2022-11-18 20:07:23,813 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 20:07:26,471 INFO L130 PetriNetUnfolder]: 5115/11013 cut-off events. [2022-11-18 20:07:26,472 INFO L131 PetriNetUnfolder]: For 34517/35378 co-relation queries the response was YES. [2022-11-18 20:07:26,555 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37724 conditions, 11013 events. 5115/11013 cut-off events. For 34517/35378 co-relation queries the response was YES. Maximal size of possible extension queue 891. Compared 110097 event pairs, 345 based on Foata normal form. 167/10842 useless extension candidates. Maximal degree in co-relation 37676. Up to 1861 conditions per place. [2022-11-18 20:07:26,564 INFO L137 encePairwiseOnDemand]: 108/118 looper letters, 28 selfloop transitions, 14 changer transitions 96/231 dead transitions. [2022-11-18 20:07:26,564 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 191 places, 231 transitions, 1794 flow [2022-11-18 20:07:26,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-18 20:07:26,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-11-18 20:07:26,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1610 transitions. [2022-11-18 20:07:26,569 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8527542372881356 [2022-11-18 20:07:26,569 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1610 transitions. [2022-11-18 20:07:26,569 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1610 transitions. [2022-11-18 20:07:26,570 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 20:07:26,570 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1610 transitions. [2022-11-18 20:07:26,574 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 100.625) internal successors, (1610), 16 states have internal predecessors, (1610), 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) [2022-11-18 20:07:26,578 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 118.0) internal successors, (2006), 17 states have internal predecessors, (2006), 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) [2022-11-18 20:07:26,578 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 118.0) internal successors, (2006), 17 states have internal predecessors, (2006), 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) [2022-11-18 20:07:26,579 INFO L175 Difference]: Start difference. First operand has 188 places, 154 transitions, 1026 flow. Second operand 16 states and 1610 transitions. [2022-11-18 20:07:26,579 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 191 places, 231 transitions, 1794 flow [2022-11-18 20:07:27,585 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 231 transitions, 1485 flow, removed 127 selfloop flow, removed 23 redundant places. [2022-11-18 20:07:27,588 INFO L231 Difference]: Finished difference. Result has 174 places, 123 transitions, 604 flow [2022-11-18 20:07:27,588 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=118, PETRI_DIFFERENCE_MINUEND_FLOW=805, PETRI_DIFFERENCE_MINUEND_PLACES=153, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=154, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=140, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=604, PETRI_PLACES=174, PETRI_TRANSITIONS=123} [2022-11-18 20:07:27,589 INFO L288 CegarLoopForPetriNet]: 123 programPoint places, 51 predicate places. [2022-11-18 20:07:27,589 INFO L495 AbstractCegarLoop]: Abstraction has has 174 places, 123 transitions, 604 flow [2022-11-18 20:07:27,590 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 96.0) internal successors, (768), 8 states have internal predecessors, (768), 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) [2022-11-18 20:07:27,590 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 20:07:27,590 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:07:27,590 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-18 20:07:27,591 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-18 20:07:27,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:07:27,592 INFO L85 PathProgramCache]: Analyzing trace with hash -730973364, now seen corresponding path program 1 times [2022-11-18 20:07:27,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:07:27,592 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415422953] [2022-11-18 20:07:27,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:07:27,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:07:27,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:07:28,634 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:07:28,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:07:28,635 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415422953] [2022-11-18 20:07:28,635 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [415422953] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:07:28,635 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:07:28,635 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-18 20:07:28,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773546931] [2022-11-18 20:07:28,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:07:28,636 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-18 20:07:28,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:07:28,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-18 20:07:28,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-11-18 20:07:28,639 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 118 [2022-11-18 20:07:28,640 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 174 places, 123 transitions, 604 flow. Second operand has 9 states, 9 states have (on average 86.33333333333333) internal successors, (777), 9 states have internal predecessors, (777), 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) [2022-11-18 20:07:28,640 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 20:07:28,640 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 118 [2022-11-18 20:07:28,641 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 20:07:29,674 INFO L130 PetriNetUnfolder]: 473/3000 cut-off events. [2022-11-18 20:07:29,674 INFO L131 PetriNetUnfolder]: For 6410/6715 co-relation queries the response was YES. [2022-11-18 20:07:29,688 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7792 conditions, 3000 events. 473/3000 cut-off events. For 6410/6715 co-relation queries the response was YES. Maximal size of possible extension queue 407. Compared 35942 event pairs, 9 based on Foata normal form. 13/2805 useless extension candidates. Maximal degree in co-relation 7691. Up to 513 conditions per place. [2022-11-18 20:07:29,690 INFO L137 encePairwiseOnDemand]: 102/118 looper letters, 35 selfloop transitions, 16 changer transitions 48/178 dead transitions. [2022-11-18 20:07:29,691 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 171 places, 178 transitions, 1207 flow [2022-11-18 20:07:29,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-18 20:07:29,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-11-18 20:07:29,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1078 transitions. [2022-11-18 20:07:29,694 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7612994350282486 [2022-11-18 20:07:29,694 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1078 transitions. [2022-11-18 20:07:29,694 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1078 transitions. [2022-11-18 20:07:29,695 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 20:07:29,695 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1078 transitions. [2022-11-18 20:07:29,697 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 89.83333333333333) internal successors, (1078), 12 states have internal predecessors, (1078), 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) [2022-11-18 20:07:29,700 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 118.0) internal successors, (1534), 13 states have internal predecessors, (1534), 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) [2022-11-18 20:07:29,701 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 118.0) internal successors, (1534), 13 states have internal predecessors, (1534), 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) [2022-11-18 20:07:29,701 INFO L175 Difference]: Start difference. First operand has 174 places, 123 transitions, 604 flow. Second operand 12 states and 1078 transitions. [2022-11-18 20:07:29,702 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 171 places, 178 transitions, 1207 flow [2022-11-18 20:07:29,774 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 178 transitions, 1033 flow, removed 31 selfloop flow, removed 22 redundant places. [2022-11-18 20:07:29,776 INFO L231 Difference]: Finished difference. Result has 157 places, 118 transitions, 482 flow [2022-11-18 20:07:29,777 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=118, PETRI_DIFFERENCE_MINUEND_FLOW=494, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=115, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=482, PETRI_PLACES=157, PETRI_TRANSITIONS=118} [2022-11-18 20:07:29,778 INFO L288 CegarLoopForPetriNet]: 123 programPoint places, 34 predicate places. [2022-11-18 20:07:29,778 INFO L495 AbstractCegarLoop]: Abstraction has has 157 places, 118 transitions, 482 flow [2022-11-18 20:07:29,778 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 86.33333333333333) internal successors, (777), 9 states have internal predecessors, (777), 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) [2022-11-18 20:07:29,778 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 20:07:29,779 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:07:29,779 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-18 20:07:29,779 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-18 20:07:29,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:07:29,780 INFO L85 PathProgramCache]: Analyzing trace with hash 1188379142, now seen corresponding path program 2 times [2022-11-18 20:07:29,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:07:29,780 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790789455] [2022-11-18 20:07:29,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:07:29,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:07:29,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:07:30,784 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:07:30,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:07:30,785 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1790789455] [2022-11-18 20:07:30,785 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1790789455] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:07:30,785 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:07:30,785 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-18 20:07:30,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909504816] [2022-11-18 20:07:30,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:07:30,787 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-18 20:07:30,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:07:30,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-18 20:07:30,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-11-18 20:07:30,790 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 118 [2022-11-18 20:07:30,791 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 157 places, 118 transitions, 482 flow. Second operand has 10 states, 10 states have (on average 93.2) internal successors, (932), 10 states have internal predecessors, (932), 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) [2022-11-18 20:07:30,791 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 20:07:30,792 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 118 [2022-11-18 20:07:30,792 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 20:07:31,129 INFO L130 PetriNetUnfolder]: 59/437 cut-off events. [2022-11-18 20:07:31,130 INFO L131 PetriNetUnfolder]: For 335/357 co-relation queries the response was YES. [2022-11-18 20:07:31,131 INFO L83 FinitePrefix]: Finished finitePrefix Result has 958 conditions, 437 events. 59/437 cut-off events. For 335/357 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 2426 event pairs, 3 based on Foata normal form. 3/416 useless extension candidates. Maximal degree in co-relation 929. Up to 50 conditions per place. [2022-11-18 20:07:31,132 INFO L137 encePairwiseOnDemand]: 109/118 looper letters, 25 selfloop transitions, 3 changer transitions 17/133 dead transitions. [2022-11-18 20:07:31,132 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 133 transitions, 638 flow [2022-11-18 20:07:31,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-18 20:07:31,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-11-18 20:07:31,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 947 transitions. [2022-11-18 20:07:31,137 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8025423728813559 [2022-11-18 20:07:31,138 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 947 transitions. [2022-11-18 20:07:31,138 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 947 transitions. [2022-11-18 20:07:31,139 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 20:07:31,139 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 947 transitions. [2022-11-18 20:07:31,142 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 94.7) internal successors, (947), 10 states have internal predecessors, (947), 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) [2022-11-18 20:07:31,144 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 118.0) internal successors, (1298), 11 states have internal predecessors, (1298), 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) [2022-11-18 20:07:31,145 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 118.0) internal successors, (1298), 11 states have internal predecessors, (1298), 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) [2022-11-18 20:07:31,145 INFO L175 Difference]: Start difference. First operand has 157 places, 118 transitions, 482 flow. Second operand 10 states and 947 transitions. [2022-11-18 20:07:31,145 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 133 transitions, 638 flow [2022-11-18 20:07:31,148 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 133 transitions, 502 flow, removed 24 selfloop flow, removed 21 redundant places. [2022-11-18 20:07:31,150 INFO L231 Difference]: Finished difference. Result has 147 places, 113 transitions, 359 flow [2022-11-18 20:07:31,151 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=118, PETRI_DIFFERENCE_MINUEND_FLOW=364, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=115, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=359, PETRI_PLACES=147, PETRI_TRANSITIONS=113} [2022-11-18 20:07:31,152 INFO L288 CegarLoopForPetriNet]: 123 programPoint places, 24 predicate places. [2022-11-18 20:07:31,153 INFO L495 AbstractCegarLoop]: Abstraction has has 147 places, 113 transitions, 359 flow [2022-11-18 20:07:31,154 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 93.2) internal successors, (932), 10 states have internal predecessors, (932), 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) [2022-11-18 20:07:31,154 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 20:07:31,154 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:07:31,155 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-18 20:07:31,155 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-18 20:07:31,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:07:31,156 INFO L85 PathProgramCache]: Analyzing trace with hash 1221387492, now seen corresponding path program 3 times [2022-11-18 20:07:31,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:07:31,158 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973312773] [2022-11-18 20:07:31,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:07:31,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:07:31,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-18 20:07:31,217 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-18 20:07:31,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-18 20:07:31,375 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-18 20:07:31,375 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-18 20:07:31,376 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-11-18 20:07:31,380 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-11-18 20:07:31,380 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-11-18 20:07:31,381 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-11-18 20:07:31,384 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-11-18 20:07:31,384 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-11-18 20:07:31,384 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-18 20:07:31,385 INFO L444 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1, 1] [2022-11-18 20:07:31,391 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-18 20:07:31,391 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-18 20:07:31,498 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 08:07:31 BasicIcfg [2022-11-18 20:07:31,498 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-18 20:07:31,499 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-18 20:07:31,499 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-18 20:07:31,499 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-18 20:07:31,500 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:07:08" (3/4) ... [2022-11-18 20:07:31,502 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-11-18 20:07:31,640 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b9de20b-f8b1-426d-bcc4-2c6fa7fe7a42/bin/uautomizer-TMbwUNV5ro/witness.graphml [2022-11-18 20:07:31,640 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-18 20:07:31,641 INFO L158 Benchmark]: Toolchain (without parser) took 25278.68ms. Allocated memory was 98.6MB in the beginning and 7.8GB in the end (delta: 7.7GB). Free memory was 69.0MB in the beginning and 7.2GB in the end (delta: -7.1GB). Peak memory consumption was 535.3MB. Max. memory is 16.1GB. [2022-11-18 20:07:31,641 INFO L158 Benchmark]: CDTParser took 0.30ms. Allocated memory is still 98.6MB. Free memory is still 55.1MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-18 20:07:31,641 INFO L158 Benchmark]: CACSL2BoogieTranslator took 753.06ms. Allocated memory is still 98.6MB. Free memory was 68.8MB in the beginning and 60.4MB in the end (delta: 8.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-11-18 20:07:31,642 INFO L158 Benchmark]: Boogie Procedure Inliner took 75.88ms. Allocated memory is still 98.6MB. Free memory was 60.4MB in the beginning and 57.8MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-18 20:07:31,642 INFO L158 Benchmark]: Boogie Preprocessor took 63.29ms. Allocated memory is still 98.6MB. Free memory was 57.8MB in the beginning and 56.0MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-18 20:07:31,642 INFO L158 Benchmark]: RCFGBuilder took 856.05ms. Allocated memory was 98.6MB in the beginning and 130.0MB in the end (delta: 31.5MB). Free memory was 56.0MB in the beginning and 82.1MB in the end (delta: -26.1MB). Peak memory consumption was 17.9MB. Max. memory is 16.1GB. [2022-11-18 20:07:31,643 INFO L158 Benchmark]: TraceAbstraction took 23380.52ms. Allocated memory was 130.0MB in the beginning and 7.8GB in the end (delta: 7.7GB). Free memory was 81.5MB in the beginning and 7.2GB in the end (delta: -7.2GB). Peak memory consumption was 493.5MB. Max. memory is 16.1GB. [2022-11-18 20:07:31,643 INFO L158 Benchmark]: Witness Printer took 141.17ms. Allocated memory is still 7.8GB. Free memory was 7.2GB in the beginning and 7.2GB in the end (delta: 24.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2022-11-18 20:07:31,645 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.30ms. Allocated memory is still 98.6MB. Free memory is still 55.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 753.06ms. Allocated memory is still 98.6MB. Free memory was 68.8MB in the beginning and 60.4MB in the end (delta: 8.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 75.88ms. Allocated memory is still 98.6MB. Free memory was 60.4MB in the beginning and 57.8MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 63.29ms. Allocated memory is still 98.6MB. Free memory was 57.8MB in the beginning and 56.0MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 856.05ms. Allocated memory was 98.6MB in the beginning and 130.0MB in the end (delta: 31.5MB). Free memory was 56.0MB in the beginning and 82.1MB in the end (delta: -26.1MB). Peak memory consumption was 17.9MB. Max. memory is 16.1GB. * TraceAbstraction took 23380.52ms. Allocated memory was 130.0MB in the beginning and 7.8GB in the end (delta: 7.7GB). Free memory was 81.5MB in the beginning and 7.2GB in the end (delta: -7.2GB). Peak memory consumption was 493.5MB. Max. memory is 16.1GB. * Witness Printer took 141.17ms. Allocated memory is still 7.8GB. Free memory was 7.2GB in the beginning and 7.2GB in the end (delta: 24.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L713] 0 int __unbuffered_p2_EBX = 0; VAL [__unbuffered_p2_EBX=0] [L731] 0 _Bool a$w_buff1_used; VAL [__unbuffered_p2_EBX=0, a$w_buff1_used=0] [L740] 0 _Bool weak$$choice0; VAL [__unbuffered_p2_EBX=0, a$w_buff1_used=0, weak$$choice0=0] [L741] 0 _Bool weak$$choice2; VAL [__unbuffered_p2_EBX=0, a$w_buff1_used=0, weak$$choice0=0, weak$$choice2=0] [L717] 0 int a$mem_tmp; VAL [__unbuffered_p2_EBX=0, a$mem_tmp=0, a$w_buff1_used=0, weak$$choice0=0, weak$$choice2=0] [L726] 0 _Bool a$read_delayed; VAL [__unbuffered_p2_EBX=0, a$mem_tmp=0, a$read_delayed=0, a$w_buff1_used=0, weak$$choice0=0, weak$$choice2=0] [L715] 0 int a = 0; VAL [__unbuffered_p2_EBX=0, a=0, a$mem_tmp=0, a$read_delayed=0, a$w_buff1_used=0, weak$$choice0=0, weak$$choice2=0] [L725] 0 _Bool a$r_buff1_thd3; VAL [__unbuffered_p2_EBX=0, a=0, a$mem_tmp=0, a$r_buff1_thd3=0, a$read_delayed=0, a$w_buff1_used=0, weak$$choice0=0, weak$$choice2=0] [L711] 0 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$mem_tmp=0, a$r_buff1_thd3=0, a$read_delayed=0, a$w_buff1_used=0, weak$$choice0=0, weak$$choice2=0] [L723] 0 _Bool a$r_buff1_thd1; VAL [__unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$mem_tmp=0, a$r_buff1_thd1=0, a$r_buff1_thd3=0, a$read_delayed=0, a$w_buff1_used=0, weak$$choice0=0, weak$$choice2=0] [L728] 0 int a$w_buff0; VAL [__unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$mem_tmp=0, a$r_buff1_thd1=0, a$r_buff1_thd3=0, a$read_delayed=0, a$w_buff0=0, a$w_buff1_used=0, weak$$choice0=0, weak$$choice2=0] [L724] 0 _Bool a$r_buff1_thd2; VAL [__unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$mem_tmp=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$w_buff0=0, a$w_buff1_used=0, weak$$choice0=0, weak$$choice2=0] [L730] 0 int a$w_buff1; VAL [__unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$mem_tmp=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$w_buff0=0, a$w_buff1=0, a$w_buff1_used=0, weak$$choice0=0, weak$$choice2=0] [L716] 0 _Bool a$flush_delayed; VAL [__unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$w_buff0=0, a$w_buff1=0, a$w_buff1_used=0, weak$$choice0=0, weak$$choice2=0] [L722] 0 _Bool a$r_buff1_thd0; VAL [__unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$w_buff0=0, a$w_buff1=0, a$w_buff1_used=0, weak$$choice0=0, weak$$choice2=0] [L709] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$w_buff0=0, a$w_buff1=0, a$w_buff1_used=0, weak$$choice0=0, weak$$choice2=0] [L727] 0 int *a$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff1=0, a$w_buff1_used=0, weak$$choice0=0, weak$$choice2=0] [L733] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0] [L732] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0] [L729] 0 _Bool a$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0] [L719] 0 _Bool a$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd1=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0] [L718] 0 _Bool a$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0] [L721] 0 _Bool a$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0] [L720] 0 _Bool a$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0] [L735] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0] [L737] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0] [L739] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L841] 0 pthread_t t1193; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, t1193={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L842] FCALL, FORK 0 pthread_create(&t1193, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1193, ((void *)0), P0, ((void *)0))=-2, t1193={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L843] 0 pthread_t t1194; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, t1193={5:0}, t1194={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L844] FCALL, FORK 0 pthread_create(&t1194, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1194, ((void *)0), P1, ((void *)0))=-1, t1193={5:0}, t1194={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L745] 1 a$w_buff1 = a$w_buff0 [L746] 1 a$w_buff0 = 1 [L747] 1 a$w_buff1_used = a$w_buff0_used [L748] 1 a$w_buff0_used = (_Bool)1 [L749] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L749] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L750] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L751] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L752] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L753] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L754] 1 a$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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=0, z=0] [L757] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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=0, z=0] [L845] 0 pthread_t t1195; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1193={5:0}, t1194={6:0}, t1195={3:0}, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L846] FCALL, FORK 0 pthread_create(&t1195, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1195, ((void *)0), P2, ((void *)0))=0, t1193={5:0}, t1194={6:0}, t1195={3:0}, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L774] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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=2, y=0, z=0] [L777] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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=2, y=1, z=0] [L780] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L781] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L782] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L783] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L784] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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=2, y=1, z=0] [L794] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=0] [L797] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=1] [L800] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=1] [L803] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L804] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L805] 3 a$flush_delayed = weak$$choice2 [L806] 3 a$mem_tmp = a [L807] 3 a = !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) [L808] 3 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0)) [L809] 3 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) [L810] 3 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used)) [L811] 3 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L812] 3 a$r_buff0_thd3 = weak$$choice2 ? a$r_buff0_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff0_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3)) [L813] 3 a$r_buff1_thd3 = weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L814] 3 __unbuffered_p2_EBX = a [L815] 3 a = a$flush_delayed ? a$mem_tmp : a [L816] 3 a$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=2, z=1] [L819] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L820] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L821] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L822] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L823] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=2, z=1] [L760] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L761] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L762] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L763] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L764] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=2, z=1] [L767] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=2, z=1] [L787] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=2, z=1] [L826] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=2, z=1] [L848] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1193={5:0}, t1194={6:0}, t1195={3:0}, weak$$choice0=49, weak$$choice2=255, x=2, y=2, z=1] [L850] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=2, z=1] [L850] RET 0 assume_abort_if_not(main$tmp_guard0) [L852] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L853] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L854] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L855] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L856] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1193={5:0}, t1194={6:0}, t1195={3:0}, weak$$choice0=49, weak$$choice2=255, x=2, y=2, z=1] [L859] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1193={5:0}, t1194={6:0}, t1195={3:0}, weak$$choice0=49, weak$$choice2=255, x=2, y=2, z=1] [L861] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=2, z=1] [L18] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=2, z=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: 846]: 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: 844]: 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: 842]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 147 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 23.1s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 17.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 777 SdHoareTripleChecker+Valid, 2.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 777 mSDsluCounter, 754 SdHoareTripleChecker+Invalid, 1.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 592 mSDsCounter, 64 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1401 IncrementalHoareTripleChecker+Invalid, 1465 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 64 mSolverCounterUnsat, 162 mSDtfsCounter, 1401 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 132 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 196 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1097occurred in iteration=6, InterpolantAutomatonStates: 110, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 4.5s InterpolantComputationTime, 896 NumberOfCodeBlocks, 896 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 794 ConstructedInterpolants, 0 QuantifiedInterpolants, 3488 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 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! [2022-11-18 20:07:31,679 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b9de20b-f8b1-426d-bcc4-2c6fa7fe7a42/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE