./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix012_power.oepc_power.opt_pso.oepc_rmo.oepc_rmo.opt_tso.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_878a4fb6-da53-4d80-af9e-16792f99f03b/bin/uautomizer-TMbwUNV5ro/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_878a4fb6-da53-4d80-af9e-16792f99f03b/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_878a4fb6-da53-4d80-af9e-16792f99f03b/bin/uautomizer-TMbwUNV5ro/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_878a4fb6-da53-4d80-af9e-16792f99f03b/bin/uautomizer-TMbwUNV5ro/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix012_power.oepc_power.opt_pso.oepc_rmo.oepc_rmo.opt_tso.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_878a4fb6-da53-4d80-af9e-16792f99f03b/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_878a4fb6-da53-4d80-af9e-16792f99f03b/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 af189c8870b49f611aa022222cf968f0c789441d4d4f9926444b1aa8c8dc68d1 --- 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 19:32:54,336 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-18 19:32:54,338 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-18 19:32:54,359 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-18 19:32:54,360 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-18 19:32:54,361 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-18 19:32:54,362 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-18 19:32:54,364 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-18 19:32:54,366 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-18 19:32:54,367 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-18 19:32:54,368 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-18 19:32:54,369 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-18 19:32:54,370 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-18 19:32:54,371 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-18 19:32:54,372 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-18 19:32:54,373 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-18 19:32:54,374 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-18 19:32:54,375 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-18 19:32:54,377 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-18 19:32:54,379 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-18 19:32:54,381 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-18 19:32:54,383 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-18 19:32:54,384 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-18 19:32:54,385 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-18 19:32:54,389 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-18 19:32:54,389 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-18 19:32:54,389 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-18 19:32:54,390 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-18 19:32:54,391 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-18 19:32:54,392 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-18 19:32:54,393 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-18 19:32:54,393 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-18 19:32:54,394 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-18 19:32:54,395 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-18 19:32:54,397 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-18 19:32:54,397 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-18 19:32:54,398 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-18 19:32:54,398 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-18 19:32:54,398 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-18 19:32:54,399 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-18 19:32:54,400 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-18 19:32:54,401 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_878a4fb6-da53-4d80-af9e-16792f99f03b/bin/uautomizer-TMbwUNV5ro/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-18 19:32:54,423 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-18 19:32:54,424 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-18 19:32:54,424 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-18 19:32:54,424 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-18 19:32:54,425 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-18 19:32:54,425 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-18 19:32:54,426 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-18 19:32:54,426 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-18 19:32:54,426 INFO L138 SettingsManager]: * Use SBE=true [2022-11-18 19:32:54,426 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-18 19:32:54,427 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-18 19:32:54,427 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-18 19:32:54,427 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-18 19:32:54,427 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-18 19:32:54,428 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-18 19:32:54,428 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-18 19:32:54,428 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-18 19:32:54,428 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-18 19:32:54,428 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-18 19:32:54,429 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-18 19:32:54,429 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-18 19:32:54,429 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-18 19:32:54,429 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-18 19:32:54,429 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-18 19:32:54,430 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-18 19:32:54,430 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-18 19:32:54,430 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-18 19:32:54,430 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-18 19:32:54,431 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-18 19:32:54,431 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-18 19:32:54,431 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-18 19:32:54,431 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-18 19:32:54,431 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-18 19:32:54,432 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_878a4fb6-da53-4d80-af9e-16792f99f03b/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_878a4fb6-da53-4d80-af9e-16792f99f03b/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 -> af189c8870b49f611aa022222cf968f0c789441d4d4f9926444b1aa8c8dc68d1 [2022-11-18 19:32:54,749 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-18 19:32:54,780 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-18 19:32:54,782 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-18 19:32:54,784 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-18 19:32:54,785 INFO L275 PluginConnector]: CDTParser initialized [2022-11-18 19:32:54,786 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_878a4fb6-da53-4d80-af9e-16792f99f03b/bin/uautomizer-TMbwUNV5ro/../../sv-benchmarks/c/pthread-wmm/mix012_power.oepc_power.opt_pso.oepc_rmo.oepc_rmo.opt_tso.oepc.i [2022-11-18 19:32:54,871 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_878a4fb6-da53-4d80-af9e-16792f99f03b/bin/uautomizer-TMbwUNV5ro/data/99a53bc2d/8c9ef22118514ea89fc977e5da1c1358/FLAG5cfbbf358 [2022-11-18 19:32:55,503 INFO L306 CDTParser]: Found 1 translation units. [2022-11-18 19:32:55,515 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_878a4fb6-da53-4d80-af9e-16792f99f03b/sv-benchmarks/c/pthread-wmm/mix012_power.oepc_power.opt_pso.oepc_rmo.oepc_rmo.opt_tso.oepc.i [2022-11-18 19:32:55,541 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_878a4fb6-da53-4d80-af9e-16792f99f03b/bin/uautomizer-TMbwUNV5ro/data/99a53bc2d/8c9ef22118514ea89fc977e5da1c1358/FLAG5cfbbf358 [2022-11-18 19:32:55,769 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_878a4fb6-da53-4d80-af9e-16792f99f03b/bin/uautomizer-TMbwUNV5ro/data/99a53bc2d/8c9ef22118514ea89fc977e5da1c1358 [2022-11-18 19:32:55,772 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-18 19:32:55,773 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-18 19:32:55,779 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-18 19:32:55,779 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-18 19:32:55,787 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-18 19:32:55,788 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 07:32:55" (1/1) ... [2022-11-18 19:32:55,790 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@69a5f49d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:32:55, skipping insertion in model container [2022-11-18 19:32:55,791 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 07:32:55" (1/1) ... [2022-11-18 19:32:55,799 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-18 19:32:55,858 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-18 19:32:56,097 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_878a4fb6-da53-4d80-af9e-16792f99f03b/sv-benchmarks/c/pthread-wmm/mix012_power.oepc_power.opt_pso.oepc_rmo.oepc_rmo.opt_tso.oepc.i[996,1009] [2022-11-18 19:32:56,379 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-18 19:32:56,388 INFO L203 MainTranslator]: Completed pre-run [2022-11-18 19:32:56,402 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_878a4fb6-da53-4d80-af9e-16792f99f03b/sv-benchmarks/c/pthread-wmm/mix012_power.oepc_power.opt_pso.oepc_rmo.oepc_rmo.opt_tso.oepc.i[996,1009] [2022-11-18 19:32:56,473 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-18 19:32:56,526 INFO L208 MainTranslator]: Completed translation [2022-11-18 19:32:56,526 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:32:56 WrapperNode [2022-11-18 19:32:56,527 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-18 19:32:56,528 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-18 19:32:56,528 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-18 19:32:56,529 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-18 19:32:56,536 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:32:56" (1/1) ... [2022-11-18 19:32:56,569 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:32:56" (1/1) ... [2022-11-18 19:32:56,610 INFO L138 Inliner]: procedures = 175, calls = 43, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 114 [2022-11-18 19:32:56,611 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-18 19:32:56,611 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-18 19:32:56,611 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-18 19:32:56,612 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-18 19:32:56,620 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:32:56" (1/1) ... [2022-11-18 19:32:56,621 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:32:56" (1/1) ... [2022-11-18 19:32:56,640 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:32:56" (1/1) ... [2022-11-18 19:32:56,640 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:32:56" (1/1) ... [2022-11-18 19:32:56,657 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:32:56" (1/1) ... [2022-11-18 19:32:56,659 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:32:56" (1/1) ... [2022-11-18 19:32:56,660 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:32:56" (1/1) ... [2022-11-18 19:32:56,661 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:32:56" (1/1) ... [2022-11-18 19:32:56,674 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-18 19:32:56,675 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-18 19:32:56,675 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-18 19:32:56,675 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-18 19:32:56,676 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:32:56" (1/1) ... [2022-11-18 19:32:56,682 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-18 19:32:56,693 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_878a4fb6-da53-4d80-af9e-16792f99f03b/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 19:32:56,711 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_878a4fb6-da53-4d80-af9e-16792f99f03b/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-18 19:32:56,740 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_878a4fb6-da53-4d80-af9e-16792f99f03b/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-18 19:32:56,758 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-18 19:32:56,758 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-18 19:32:56,758 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-18 19:32:56,758 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-18 19:32:56,758 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-18 19:32:56,759 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-18 19:32:56,759 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-18 19:32:56,759 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-18 19:32:56,764 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-18 19:32:56,764 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-18 19:32:56,764 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-18 19:32:56,764 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-18 19:32:56,765 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-18 19:32:56,766 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 19:32:56,907 INFO L235 CfgBuilder]: Building ICFG [2022-11-18 19:32:56,909 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-18 19:32:57,260 INFO L276 CfgBuilder]: Performing block encoding [2022-11-18 19:32:57,501 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-18 19:32:57,501 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-18 19:32:57,504 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 07:32:57 BoogieIcfgContainer [2022-11-18 19:32:57,504 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-18 19:32:57,508 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-18 19:32:57,508 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-18 19:32:57,513 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-18 19:32:57,513 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 07:32:55" (1/3) ... [2022-11-18 19:32:57,514 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e1d6842 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 07:32:57, skipping insertion in model container [2022-11-18 19:32:57,514 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:32:56" (2/3) ... [2022-11-18 19:32:57,515 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e1d6842 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 07:32:57, skipping insertion in model container [2022-11-18 19:32:57,515 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 07:32:57" (3/3) ... [2022-11-18 19:32:57,516 INFO L112 eAbstractionObserver]: Analyzing ICFG mix012_power.oepc_power.opt_pso.oepc_rmo.oepc_rmo.opt_tso.oepc.i [2022-11-18 19:32:57,525 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-18 19:32:57,536 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-18 19:32:57,536 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-11-18 19:32:57,537 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-18 19:32:57,619 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-18 19:32:57,672 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 102 places, 97 transitions, 204 flow [2022-11-18 19:32:57,731 INFO L130 PetriNetUnfolder]: 2/95 cut-off events. [2022-11-18 19:32:57,734 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-18 19:32:57,738 INFO L83 FinitePrefix]: Finished finitePrefix Result has 102 conditions, 95 events. 2/95 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 45 event pairs, 0 based on Foata normal form. 0/91 useless extension candidates. Maximal degree in co-relation 56. Up to 2 conditions per place. [2022-11-18 19:32:57,738 INFO L82 GeneralOperation]: Start removeDead. Operand has 102 places, 97 transitions, 204 flow [2022-11-18 19:32:57,742 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 100 places, 95 transitions, 196 flow [2022-11-18 19:32:57,765 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-18 19:32:57,774 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;@19729e6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-18 19:32:57,774 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-11-18 19:32:57,786 INFO L130 PetriNetUnfolder]: 0/44 cut-off events. [2022-11-18 19:32:57,786 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-18 19:32:57,786 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 19:32:57,787 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] [2022-11-18 19:32:57,787 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-18 19:32:57,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:32:57,793 INFO L85 PathProgramCache]: Analyzing trace with hash -18107377, now seen corresponding path program 1 times [2022-11-18 19:32:57,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:32:57,802 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54998534] [2022-11-18 19:32:57,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:32:57,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:32:57,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:32:58,461 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 19:32:58,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:32:58,462 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54998534] [2022-11-18 19:32:58,463 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [54998534] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:32:58,463 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:32:58,464 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-18 19:32:58,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634013255] [2022-11-18 19:32:58,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:32:58,477 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 19:32:58,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:32:58,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 19:32:58,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 19:32:58,521 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 97 [2022-11-18 19:32:58,524 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 95 transitions, 196 flow. Second operand has 3 states, 3 states have (on average 86.0) internal successors, (258), 3 states have internal predecessors, (258), 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 19:32:58,524 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 19:32:58,524 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 97 [2022-11-18 19:32:58,526 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 19:32:58,621 INFO L130 PetriNetUnfolder]: 18/150 cut-off events. [2022-11-18 19:32:58,621 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-11-18 19:32:58,622 INFO L83 FinitePrefix]: Finished finitePrefix Result has 202 conditions, 150 events. 18/150 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 348 event pairs, 2 based on Foata normal form. 8/148 useless extension candidates. Maximal degree in co-relation 153. Up to 31 conditions per place. [2022-11-18 19:32:58,624 INFO L137 encePairwiseOnDemand]: 92/97 looper letters, 10 selfloop transitions, 2 changer transitions 0/95 dead transitions. [2022-11-18 19:32:58,624 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 95 transitions, 223 flow [2022-11-18 19:32:58,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 19:32:58,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-18 19:32:58,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 272 transitions. [2022-11-18 19:32:58,638 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9347079037800687 [2022-11-18 19:32:58,639 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 272 transitions. [2022-11-18 19:32:58,640 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 272 transitions. [2022-11-18 19:32:58,642 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 19:32:58,644 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 272 transitions. [2022-11-18 19:32:58,648 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 90.66666666666667) internal successors, (272), 3 states have internal predecessors, (272), 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 19:32:58,653 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 97.0) internal successors, (388), 4 states have internal predecessors, (388), 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 19:32:58,653 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 97.0) internal successors, (388), 4 states have internal predecessors, (388), 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 19:32:58,655 INFO L175 Difference]: Start difference. First operand has 100 places, 95 transitions, 196 flow. Second operand 3 states and 272 transitions. [2022-11-18 19:32:58,656 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 95 transitions, 223 flow [2022-11-18 19:32:58,659 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 95 transitions, 220 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-18 19:32:58,663 INFO L231 Difference]: Finished difference. Result has 98 places, 91 transitions, 190 flow [2022-11-18 19:32:58,665 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=186, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=190, PETRI_PLACES=98, PETRI_TRANSITIONS=91} [2022-11-18 19:32:58,668 INFO L288 CegarLoopForPetriNet]: 100 programPoint places, -2 predicate places. [2022-11-18 19:32:58,669 INFO L495 AbstractCegarLoop]: Abstraction has has 98 places, 91 transitions, 190 flow [2022-11-18 19:32:58,669 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 86.0) internal successors, (258), 3 states have internal predecessors, (258), 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 19:32:58,670 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 19:32:58,670 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] [2022-11-18 19:32:58,670 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-18 19:32:58,671 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-18 19:32:58,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:32:58,671 INFO L85 PathProgramCache]: Analyzing trace with hash 1159240016, now seen corresponding path program 1 times [2022-11-18 19:32:58,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:32:58,672 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805615002] [2022-11-18 19:32:58,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:32:58,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:32:58,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:32:59,238 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 19:32:59,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:32:59,238 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1805615002] [2022-11-18 19:32:59,239 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1805615002] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:32:59,240 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:32:59,240 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-18 19:32:59,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85072519] [2022-11-18 19:32:59,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:32:59,246 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-18 19:32:59,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:32:59,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-18 19:32:59,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-18 19:32:59,250 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 97 [2022-11-18 19:32:59,251 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 91 transitions, 190 flow. Second operand has 6 states, 6 states have (on average 78.66666666666667) internal successors, (472), 6 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 19:32:59,252 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 19:32:59,252 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 97 [2022-11-18 19:32:59,252 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 19:32:59,720 INFO L130 PetriNetUnfolder]: 173/622 cut-off events. [2022-11-18 19:32:59,721 INFO L131 PetriNetUnfolder]: For 47/47 co-relation queries the response was YES. [2022-11-18 19:32:59,727 INFO L83 FinitePrefix]: Finished finitePrefix Result has 997 conditions, 622 events. 173/622 cut-off events. For 47/47 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 3478 event pairs, 40 based on Foata normal form. 0/599 useless extension candidates. Maximal degree in co-relation 947. Up to 166 conditions per place. [2022-11-18 19:32:59,730 INFO L137 encePairwiseOnDemand]: 91/97 looper letters, 16 selfloop transitions, 2 changer transitions 40/124 dead transitions. [2022-11-18 19:32:59,730 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 124 transitions, 368 flow [2022-11-18 19:32:59,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-18 19:32:59,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-11-18 19:32:59,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 744 transitions. [2022-11-18 19:32:59,739 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.852233676975945 [2022-11-18 19:32:59,740 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 744 transitions. [2022-11-18 19:32:59,741 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 744 transitions. [2022-11-18 19:32:59,742 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 19:32:59,742 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 744 transitions. [2022-11-18 19:32:59,746 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 82.66666666666667) internal successors, (744), 9 states have internal predecessors, (744), 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 19:32:59,751 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 97.0) internal successors, (970), 10 states have internal predecessors, (970), 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 19:32:59,752 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 97.0) internal successors, (970), 10 states have internal predecessors, (970), 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 19:32:59,752 INFO L175 Difference]: Start difference. First operand has 98 places, 91 transitions, 190 flow. Second operand 9 states and 744 transitions. [2022-11-18 19:32:59,752 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 124 transitions, 368 flow [2022-11-18 19:32:59,754 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 124 transitions, 350 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-18 19:32:59,758 INFO L231 Difference]: Finished difference. Result has 111 places, 81 transitions, 186 flow [2022-11-18 19:32:59,758 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=186, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=186, PETRI_PLACES=111, PETRI_TRANSITIONS=81} [2022-11-18 19:32:59,759 INFO L288 CegarLoopForPetriNet]: 100 programPoint places, 11 predicate places. [2022-11-18 19:32:59,759 INFO L495 AbstractCegarLoop]: Abstraction has has 111 places, 81 transitions, 186 flow [2022-11-18 19:32:59,760 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 78.66666666666667) internal successors, (472), 6 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 19:32:59,760 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 19:32:59,761 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] [2022-11-18 19:32:59,761 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-18 19:32:59,761 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-18 19:32:59,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:32:59,762 INFO L85 PathProgramCache]: Analyzing trace with hash 1674638872, now seen corresponding path program 1 times [2022-11-18 19:32:59,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:32:59,763 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241343757] [2022-11-18 19:32:59,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:32:59,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:32:59,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:00,110 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 19:33:00,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:33:00,112 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241343757] [2022-11-18 19:33:00,112 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [241343757] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:33:00,113 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:33:00,113 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-18 19:33:00,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448645762] [2022-11-18 19:33:00,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:33:00,115 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-18 19:33:00,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:33:00,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-18 19:33:00,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-18 19:33:00,119 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 97 [2022-11-18 19:33:00,120 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 81 transitions, 186 flow. Second operand has 6 states, 6 states have (on average 77.66666666666667) internal successors, (466), 6 states have internal predecessors, (466), 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 19:33:00,120 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 19:33:00,121 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 97 [2022-11-18 19:33:00,121 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 19:33:00,482 INFO L130 PetriNetUnfolder]: 167/492 cut-off events. [2022-11-18 19:33:00,482 INFO L131 PetriNetUnfolder]: For 22/22 co-relation queries the response was YES. [2022-11-18 19:33:00,484 INFO L83 FinitePrefix]: Finished finitePrefix Result has 884 conditions, 492 events. 167/492 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 2423 event pairs, 18 based on Foata normal form. 0/481 useless extension candidates. Maximal degree in co-relation 846. Up to 79 conditions per place. [2022-11-18 19:33:00,485 INFO L137 encePairwiseOnDemand]: 88/97 looper letters, 24 selfloop transitions, 5 changer transitions 40/133 dead transitions. [2022-11-18 19:33:00,486 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 133 transitions, 430 flow [2022-11-18 19:33:00,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-18 19:33:00,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-11-18 19:33:00,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 831 transitions. [2022-11-18 19:33:00,489 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.856701030927835 [2022-11-18 19:33:00,489 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 831 transitions. [2022-11-18 19:33:00,490 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 831 transitions. [2022-11-18 19:33:00,490 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 19:33:00,492 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 831 transitions. [2022-11-18 19:33:00,494 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 83.1) internal successors, (831), 10 states have internal predecessors, (831), 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 19:33:00,496 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 97.0) internal successors, (1067), 11 states have internal predecessors, (1067), 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 19:33:00,505 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 97.0) internal successors, (1067), 11 states have internal predecessors, (1067), 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 19:33:00,506 INFO L175 Difference]: Start difference. First operand has 111 places, 81 transitions, 186 flow. Second operand 10 states and 831 transitions. [2022-11-18 19:33:00,506 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 133 transitions, 430 flow [2022-11-18 19:33:00,511 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 133 transitions, 414 flow, removed 6 selfloop flow, removed 8 redundant places. [2022-11-18 19:33:00,513 INFO L231 Difference]: Finished difference. Result has 102 places, 82 transitions, 212 flow [2022-11-18 19:33:00,513 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=170, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=212, PETRI_PLACES=102, PETRI_TRANSITIONS=82} [2022-11-18 19:33:00,516 INFO L288 CegarLoopForPetriNet]: 100 programPoint places, 2 predicate places. [2022-11-18 19:33:00,516 INFO L495 AbstractCegarLoop]: Abstraction has has 102 places, 82 transitions, 212 flow [2022-11-18 19:33:00,517 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 77.66666666666667) internal successors, (466), 6 states have internal predecessors, (466), 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 19:33:00,517 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 19:33:00,517 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] [2022-11-18 19:33:00,517 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-18 19:33:00,518 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-18 19:33:00,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:33:00,519 INFO L85 PathProgramCache]: Analyzing trace with hash 1432821581, now seen corresponding path program 1 times [2022-11-18 19:33:00,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:33:00,520 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199390252] [2022-11-18 19:33:00,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:33:00,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:33:00,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:00,897 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 19:33:00,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:33:00,897 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199390252] [2022-11-18 19:33:00,898 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1199390252] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:33:00,898 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:33:00,898 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-18 19:33:00,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098970366] [2022-11-18 19:33:00,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:33:00,900 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-18 19:33:00,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:33:00,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-18 19:33:00,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-18 19:33:00,906 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 97 [2022-11-18 19:33:00,908 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 82 transitions, 212 flow. Second operand has 7 states, 7 states have (on average 77.85714285714286) internal successors, (545), 7 states have internal predecessors, (545), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:33:00,908 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 19:33:00,908 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 97 [2022-11-18 19:33:00,908 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 19:33:01,141 INFO L130 PetriNetUnfolder]: 35/183 cut-off events. [2022-11-18 19:33:01,141 INFO L131 PetriNetUnfolder]: For 94/94 co-relation queries the response was YES. [2022-11-18 19:33:01,142 INFO L83 FinitePrefix]: Finished finitePrefix Result has 390 conditions, 183 events. 35/183 cut-off events. For 94/94 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 510 event pairs, 6 based on Foata normal form. 7/187 useless extension candidates. Maximal degree in co-relation 365. Up to 26 conditions per place. [2022-11-18 19:33:01,142 INFO L137 encePairwiseOnDemand]: 89/97 looper letters, 16 selfloop transitions, 7 changer transitions 19/106 dead transitions. [2022-11-18 19:33:01,143 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 106 transitions, 389 flow [2022-11-18 19:33:01,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-18 19:33:01,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-11-18 19:33:01,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 804 transitions. [2022-11-18 19:33:01,146 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8288659793814434 [2022-11-18 19:33:01,146 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 804 transitions. [2022-11-18 19:33:01,146 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 804 transitions. [2022-11-18 19:33:01,147 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 19:33:01,147 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 804 transitions. [2022-11-18 19:33:01,150 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 80.4) internal successors, (804), 10 states have internal predecessors, (804), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:33:01,155 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 97.0) internal successors, (1067), 11 states have internal predecessors, (1067), 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 19:33:01,156 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 97.0) internal successors, (1067), 11 states have internal predecessors, (1067), 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 19:33:01,156 INFO L175 Difference]: Start difference. First operand has 102 places, 82 transitions, 212 flow. Second operand 10 states and 804 transitions. [2022-11-18 19:33:01,156 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 106 transitions, 389 flow [2022-11-18 19:33:01,159 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 106 transitions, 350 flow, removed 14 selfloop flow, removed 6 redundant places. [2022-11-18 19:33:01,162 INFO L231 Difference]: Finished difference. Result has 105 places, 82 transitions, 224 flow [2022-11-18 19:33:01,162 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=191, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=224, PETRI_PLACES=105, PETRI_TRANSITIONS=82} [2022-11-18 19:33:01,164 INFO L288 CegarLoopForPetriNet]: 100 programPoint places, 5 predicate places. [2022-11-18 19:33:01,164 INFO L495 AbstractCegarLoop]: Abstraction has has 105 places, 82 transitions, 224 flow [2022-11-18 19:33:01,164 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 77.85714285714286) internal successors, (545), 7 states have internal predecessors, (545), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:33:01,166 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 19:33:01,167 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] [2022-11-18 19:33:01,167 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-18 19:33:01,167 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-18 19:33:01,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:33:01,168 INFO L85 PathProgramCache]: Analyzing trace with hash 1603836424, now seen corresponding path program 1 times [2022-11-18 19:33:01,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:33:01,169 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763336204] [2022-11-18 19:33:01,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:33:01,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:33:01,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:01,650 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 19:33:01,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:33:01,650 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763336204] [2022-11-18 19:33:01,651 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1763336204] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:33:01,651 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:33:01,651 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-18 19:33:01,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183658999] [2022-11-18 19:33:01,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:33:01,653 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-18 19:33:01,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:33:01,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-18 19:33:01,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-18 19:33:01,655 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 97 [2022-11-18 19:33:01,655 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 82 transitions, 224 flow. Second operand has 7 states, 7 states have (on average 74.85714285714286) internal successors, (524), 7 states have internal predecessors, (524), 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 19:33:01,656 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 19:33:01,656 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 97 [2022-11-18 19:33:01,656 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 19:33:01,913 INFO L130 PetriNetUnfolder]: 19/165 cut-off events. [2022-11-18 19:33:01,913 INFO L131 PetriNetUnfolder]: For 69/69 co-relation queries the response was YES. [2022-11-18 19:33:01,914 INFO L83 FinitePrefix]: Finished finitePrefix Result has 323 conditions, 165 events. 19/165 cut-off events. For 69/69 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 369 event pairs, 3 based on Foata normal form. 1/163 useless extension candidates. Maximal degree in co-relation 276. Up to 34 conditions per place. [2022-11-18 19:33:01,915 INFO L137 encePairwiseOnDemand]: 87/97 looper letters, 20 selfloop transitions, 6 changer transitions 6/94 dead transitions. [2022-11-18 19:33:01,915 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 94 transitions, 312 flow [2022-11-18 19:33:01,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-18 19:33:01,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-11-18 19:33:01,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 609 transitions. [2022-11-18 19:33:01,917 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7847938144329897 [2022-11-18 19:33:01,917 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 609 transitions. [2022-11-18 19:33:01,917 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 609 transitions. [2022-11-18 19:33:01,918 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 19:33:01,918 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 609 transitions. [2022-11-18 19:33:01,919 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 76.125) internal successors, (609), 8 states have internal predecessors, (609), 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 19:33:01,921 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 97.0) internal successors, (873), 9 states have internal predecessors, (873), 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 19:33:01,922 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 97.0) internal successors, (873), 9 states have internal predecessors, (873), 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 19:33:01,922 INFO L175 Difference]: Start difference. First operand has 105 places, 82 transitions, 224 flow. Second operand 8 states and 609 transitions. [2022-11-18 19:33:01,922 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 94 transitions, 312 flow [2022-11-18 19:33:01,924 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 94 transitions, 266 flow, removed 13 selfloop flow, removed 13 redundant places. [2022-11-18 19:33:01,925 INFO L231 Difference]: Finished difference. Result has 100 places, 85 transitions, 217 flow [2022-11-18 19:33:01,925 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=178, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=217, PETRI_PLACES=100, PETRI_TRANSITIONS=85} [2022-11-18 19:33:01,926 INFO L288 CegarLoopForPetriNet]: 100 programPoint places, 0 predicate places. [2022-11-18 19:33:01,926 INFO L495 AbstractCegarLoop]: Abstraction has has 100 places, 85 transitions, 217 flow [2022-11-18 19:33:01,927 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 74.85714285714286) internal successors, (524), 7 states have internal predecessors, (524), 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 19:33:01,927 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 19:33:01,927 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] [2022-11-18 19:33:01,927 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-18 19:33:01,927 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-18 19:33:01,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:33:01,928 INFO L85 PathProgramCache]: Analyzing trace with hash 682245986, now seen corresponding path program 2 times [2022-11-18 19:33:01,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:33:01,929 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795952890] [2022-11-18 19:33:01,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:33:01,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:33:01,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:02,583 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 19:33:02,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:33:02,584 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795952890] [2022-11-18 19:33:02,584 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [795952890] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:33:02,584 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:33:02,584 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-18 19:33:02,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1118525530] [2022-11-18 19:33:02,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:33:02,585 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-18 19:33:02,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:33:02,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-18 19:33:02,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-11-18 19:33:02,587 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 97 [2022-11-18 19:33:02,588 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 85 transitions, 217 flow. Second operand has 9 states, 9 states have (on average 74.22222222222223) internal successors, (668), 9 states have internal predecessors, (668), 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 19:33:02,588 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 19:33:02,588 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 97 [2022-11-18 19:33:02,588 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 19:33:02,844 INFO L130 PetriNetUnfolder]: 12/170 cut-off events. [2022-11-18 19:33:02,844 INFO L131 PetriNetUnfolder]: For 13/13 co-relation queries the response was YES. [2022-11-18 19:33:02,845 INFO L83 FinitePrefix]: Finished finitePrefix Result has 285 conditions, 170 events. 12/170 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 425 event pairs, 0 based on Foata normal form. 1/171 useless extension candidates. Maximal degree in co-relation 273. Up to 18 conditions per place. [2022-11-18 19:33:02,845 INFO L137 encePairwiseOnDemand]: 88/97 looper letters, 19 selfloop transitions, 4 changer transitions 11/98 dead transitions. [2022-11-18 19:33:02,845 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 98 transitions, 329 flow [2022-11-18 19:33:02,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-18 19:33:02,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-11-18 19:33:02,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 753 transitions. [2022-11-18 19:33:02,848 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7762886597938145 [2022-11-18 19:33:02,848 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 753 transitions. [2022-11-18 19:33:02,848 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 753 transitions. [2022-11-18 19:33:02,849 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 19:33:02,849 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 753 transitions. [2022-11-18 19:33:02,851 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 75.3) internal successors, (753), 10 states have internal predecessors, (753), 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 19:33:02,853 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 97.0) internal successors, (1067), 11 states have internal predecessors, (1067), 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 19:33:02,853 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 97.0) internal successors, (1067), 11 states have internal predecessors, (1067), 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 19:33:02,853 INFO L175 Difference]: Start difference. First operand has 100 places, 85 transitions, 217 flow. Second operand 10 states and 753 transitions. [2022-11-18 19:33:02,854 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 98 transitions, 329 flow [2022-11-18 19:33:02,855 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 98 transitions, 314 flow, removed 5 selfloop flow, removed 5 redundant places. [2022-11-18 19:33:02,857 INFO L231 Difference]: Finished difference. Result has 106 places, 85 transitions, 228 flow [2022-11-18 19:33:02,857 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=206, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=228, PETRI_PLACES=106, PETRI_TRANSITIONS=85} [2022-11-18 19:33:02,858 INFO L288 CegarLoopForPetriNet]: 100 programPoint places, 6 predicate places. [2022-11-18 19:33:02,858 INFO L495 AbstractCegarLoop]: Abstraction has has 106 places, 85 transitions, 228 flow [2022-11-18 19:33:02,859 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 74.22222222222223) internal successors, (668), 9 states have internal predecessors, (668), 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 19:33:02,859 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 19:33:02,859 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] [2022-11-18 19:33:02,859 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-18 19:33:02,860 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-18 19:33:02,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:33:02,860 INFO L85 PathProgramCache]: Analyzing trace with hash 971928100, now seen corresponding path program 3 times [2022-11-18 19:33:02,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:33:02,861 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24088402] [2022-11-18 19:33:02,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:33:02,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:33:02,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-18 19:33:02,927 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-18 19:33:02,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-18 19:33:03,035 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-18 19:33:03,035 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-18 19:33:03,036 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2022-11-18 19:33:03,038 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2022-11-18 19:33:03,038 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2022-11-18 19:33:03,043 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2022-11-18 19:33:03,044 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2022-11-18 19:33:03,044 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-18 19:33:03,044 INFO L444 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1] [2022-11-18 19:33:03,055 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-18 19:33:03,056 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-18 19:33:03,184 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 07:33:03 BasicIcfg [2022-11-18 19:33:03,186 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-18 19:33:03,187 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-18 19:33:03,187 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-18 19:33:03,187 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-18 19:33:03,188 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 07:32:57" (3/4) ... [2022-11-18 19:33:03,189 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-11-18 19:33:03,316 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_878a4fb6-da53-4d80-af9e-16792f99f03b/bin/uautomizer-TMbwUNV5ro/witness.graphml [2022-11-18 19:33:03,316 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-18 19:33:03,317 INFO L158 Benchmark]: Toolchain (without parser) took 7543.85ms. Allocated memory was 144.7MB in the beginning and 203.4MB in the end (delta: 58.7MB). Free memory was 108.6MB in the beginning and 167.0MB in the end (delta: -58.4MB). Peak memory consumption was 108.8MB. Max. memory is 16.1GB. [2022-11-18 19:33:03,318 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 86.0MB. Free memory was 59.4MB in the beginning and 59.4MB in the end (delta: 29.2kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-18 19:33:03,318 INFO L158 Benchmark]: CACSL2BoogieTranslator took 748.38ms. Allocated memory is still 144.7MB. Free memory was 108.3MB in the beginning and 109.0MB in the end (delta: -701.4kB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-11-18 19:33:03,319 INFO L158 Benchmark]: Boogie Procedure Inliner took 82.34ms. Allocated memory is still 144.7MB. Free memory was 108.4MB in the beginning and 106.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-18 19:33:03,319 INFO L158 Benchmark]: Boogie Preprocessor took 62.69ms. Allocated memory is still 144.7MB. Free memory was 106.3MB in the beginning and 104.8MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-18 19:33:03,319 INFO L158 Benchmark]: RCFGBuilder took 829.88ms. Allocated memory is still 144.7MB. Free memory was 104.8MB in the beginning and 74.1MB in the end (delta: 30.7MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. [2022-11-18 19:33:03,320 INFO L158 Benchmark]: TraceAbstraction took 5678.33ms. Allocated memory was 144.7MB in the beginning and 203.4MB in the end (delta: 58.7MB). Free memory was 73.4MB in the beginning and 66.3MB in the end (delta: 7.0MB). Peak memory consumption was 67.2MB. Max. memory is 16.1GB. [2022-11-18 19:33:03,320 INFO L158 Benchmark]: Witness Printer took 129.62ms. Allocated memory is still 203.4MB. Free memory was 66.3MB in the beginning and 167.0MB in the end (delta: -100.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-11-18 19:33:03,323 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.22ms. Allocated memory is still 86.0MB. Free memory was 59.4MB in the beginning and 59.4MB in the end (delta: 29.2kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 748.38ms. Allocated memory is still 144.7MB. Free memory was 108.3MB in the beginning and 109.0MB in the end (delta: -701.4kB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 82.34ms. Allocated memory is still 144.7MB. Free memory was 108.4MB in the beginning and 106.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 62.69ms. Allocated memory is still 144.7MB. Free memory was 106.3MB in the beginning and 104.8MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 829.88ms. Allocated memory is still 144.7MB. Free memory was 104.8MB in the beginning and 74.1MB in the end (delta: 30.7MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. * TraceAbstraction took 5678.33ms. Allocated memory was 144.7MB in the beginning and 203.4MB in the end (delta: 58.7MB). Free memory was 73.4MB in the beginning and 66.3MB in the end (delta: 7.0MB). Peak memory consumption was 67.2MB. Max. memory is 16.1GB. * Witness Printer took 129.62ms. Allocated memory is still 203.4MB. Free memory was 66.3MB in the beginning and 167.0MB in the end (delta: -100.7MB). Peak memory consumption was 8.4MB. 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: [L735] 0 _Bool weak$$choice0; VAL [weak$$choice0=0] [L736] 0 _Bool weak$$choice2; VAL [weak$$choice0=0, weak$$choice2=0] [L731] 0 int y$w_buff0; VAL [weak$$choice0=0, weak$$choice2=0, y$w_buff0=0] [L733] 0 int y$w_buff1; VAL [weak$$choice0=0, weak$$choice2=0, y$w_buff0=0, y$w_buff1=0] [L710] 0 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_p0_EAX=0, weak$$choice0=0, weak$$choice2=0, y$w_buff0=0, y$w_buff1=0] [L725] 0 _Bool y$r_buff0_thd2; VAL [__unbuffered_p0_EAX=0, weak$$choice0=0, weak$$choice2=0, y$r_buff0_thd2=0, y$w_buff0=0, y$w_buff1=0] [L722] 0 int y$mem_tmp; VAL [__unbuffered_p0_EAX=0, weak$$choice0=0, weak$$choice2=0, y$mem_tmp=0, y$r_buff0_thd2=0, y$w_buff0=0, y$w_buff1=0] [L712] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, weak$$choice0=0, weak$$choice2=0, y$mem_tmp=0, y$r_buff0_thd2=0, y$w_buff0=0, y$w_buff1=0] [L723] 0 _Bool y$r_buff0_thd0; VAL [__unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, weak$$choice0=0, weak$$choice2=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd2=0, y$w_buff0=0, y$w_buff1=0] [L724] 0 _Bool y$r_buff0_thd1; VAL [__unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, weak$$choice0=0, weak$$choice2=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$w_buff0=0, y$w_buff1=0] [L729] 0 _Bool y$read_delayed; VAL [__unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, weak$$choice0=0, weak$$choice2=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$read_delayed=0, y$w_buff0=0, y$w_buff1=0] [L708] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, weak$$choice0=0, weak$$choice2=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$read_delayed=0, y$w_buff0=0, y$w_buff1=0] [L721] 0 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, weak$$choice0=0, weak$$choice2=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$read_delayed=0, y$w_buff0=0, y$w_buff1=0] [L734] 0 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, weak$$choice0=0, weak$$choice2=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$read_delayed=0, y$w_buff0=0, y$w_buff1=0, y$w_buff1_used=0] [L716] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$read_delayed=0, y$w_buff0=0, y$w_buff1=0, y$w_buff1_used=0] [L715] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$read_delayed=0, y$w_buff0=0, y$w_buff1=0, y$w_buff1_used=0] [L714] 0 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$read_delayed=0, y$w_buff0=0, y$w_buff1=0, y$w_buff1_used=0] [L730] 0 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff1=0, y$w_buff1_used=0] [L732] 0 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L718] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L726] 0 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L720] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L728] 0 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L727] 0 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L812] 0 pthread_t t305; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t305={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L813] FCALL, FORK 0 pthread_create(&t305, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t305, ((void *)0), P0, ((void *)0))=-1, t305={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L814] 0 pthread_t t306; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t305={5:0}, t306={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L815] FCALL, FORK 0 pthread_create(&t306, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t306, ((void *)0), P1, ((void *)0))=0, t305={5:0}, t306={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L740] 1 y$w_buff1 = y$w_buff0 [L741] 1 y$w_buff0 = 1 [L742] 1 y$w_buff1_used = y$w_buff0_used [L743] 1 y$w_buff0_used = (_Bool)1 [L744] CALL 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L744] RET 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L745] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L746] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L747] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L748] 1 y$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L751] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L768] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L771] 2 __unbuffered_p1_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L774] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L775] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L776] 2 y$flush_delayed = weak$$choice2 [L777] 2 y$mem_tmp = y [L778] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L779] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L780] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L781] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L782] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L783] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L784] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L785] 2 __unbuffered_p1_EBX = y [L786] 2 y = y$flush_delayed ? y$mem_tmp : y [L787] 2 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=66, weak$$choice2=255, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L790] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L791] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L792] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L793] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L794] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=66, weak$$choice2=255, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L754] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L755] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L756] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L757] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L758] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=66, weak$$choice2=255, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L761] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=66, weak$$choice2=255, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L797] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=66, weak$$choice2=255, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L817] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t305={5:0}, t306={3:0}, weak$$choice0=66, weak$$choice2=255, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L819] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=66, weak$$choice2=255, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L819] RET 0 assume_abort_if_not(main$tmp_guard0) [L821] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L822] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L823] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L824] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L825] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t305={5:0}, t306={3:0}, weak$$choice0=66, weak$$choice2=255, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L828] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t305={5:0}, t306={3:0}, weak$$choice0=66, weak$$choice2=255, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L830] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=66, weak$$choice2=255, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L18] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=66, weak$$choice2=255, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - 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: 815]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 813]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 116 locations, 5 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 5.4s, OverallIterations: 7, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 1.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 198 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 198 mSDsluCounter, 203 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 159 mSDsCounter, 15 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 516 IncrementalHoareTripleChecker+Invalid, 531 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 15 mSolverCounterUnsat, 44 mSDtfsCounter, 516 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 62 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=228occurred in iteration=6, InterpolantAutomatonStates: 50, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 475 NumberOfCodeBlocks, 475 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 393 ConstructedInterpolants, 0 QuantifiedInterpolants, 1194 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-11-18 19:33:03,366 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_878a4fb6-da53-4d80-af9e-16792f99f03b/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE