./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/safe029_power.oepc_pso.oepc_rmo.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5e519f3a 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_8e4dbed5-a0dc-4eb0-a1a5-402c96fd873d/bin/uautomizer-Dbtcem3rbc/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e4dbed5-a0dc-4eb0-a1a5-402c96fd873d/bin/uautomizer-Dbtcem3rbc/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e4dbed5-a0dc-4eb0-a1a5-402c96fd873d/bin/uautomizer-Dbtcem3rbc/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e4dbed5-a0dc-4eb0-a1a5-402c96fd873d/bin/uautomizer-Dbtcem3rbc/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/safe029_power.oepc_pso.oepc_rmo.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e4dbed5-a0dc-4eb0-a1a5-402c96fd873d/bin/uautomizer-Dbtcem3rbc/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e4dbed5-a0dc-4eb0-a1a5-402c96fd873d/bin/uautomizer-Dbtcem3rbc --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 7db5da573de5a20455a36e013b1614f5d7f4dede9c4027ebf8a62a657a5ca5e2 --- 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-5e519f3 [2022-11-02 20:37:55,496 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-02 20:37:55,498 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-02 20:37:55,543 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-02 20:37:55,544 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-02 20:37:55,550 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-02 20:37:55,554 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-02 20:37:55,559 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-02 20:37:55,566 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-02 20:37:55,568 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-02 20:37:55,570 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-02 20:37:55,574 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-02 20:37:55,576 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-02 20:37:55,581 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-02 20:37:55,583 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-02 20:37:55,586 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-02 20:37:55,589 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-02 20:37:55,596 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-02 20:37:55,598 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-02 20:37:55,602 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-02 20:37:55,610 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-02 20:37:55,611 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-02 20:37:55,613 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-02 20:37:55,614 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-02 20:37:55,618 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-02 20:37:55,619 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-02 20:37:55,619 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-02 20:37:55,621 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-02 20:37:55,621 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-02 20:37:55,623 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-02 20:37:55,623 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-02 20:37:55,624 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-02 20:37:55,625 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-02 20:37:55,627 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-02 20:37:55,628 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-02 20:37:55,628 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-02 20:37:55,629 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-02 20:37:55,630 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-02 20:37:55,630 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-02 20:37:55,632 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-02 20:37:55,633 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-02 20:37:55,634 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e4dbed5-a0dc-4eb0-a1a5-402c96fd873d/bin/uautomizer-Dbtcem3rbc/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-02 20:37:55,662 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-02 20:37:55,662 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-02 20:37:55,662 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-02 20:37:55,663 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-02 20:37:55,663 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-02 20:37:55,664 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-02 20:37:55,664 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-02 20:37:55,665 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-02 20:37:55,665 INFO L138 SettingsManager]: * Use SBE=true [2022-11-02 20:37:55,665 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-02 20:37:55,665 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-02 20:37:55,666 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-02 20:37:55,666 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-02 20:37:55,666 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-02 20:37:55,666 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-02 20:37:55,667 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-02 20:37:55,667 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-02 20:37:55,667 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-02 20:37:55,667 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-02 20:37:55,668 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-02 20:37:55,668 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-02 20:37:55,668 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-02 20:37:55,668 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-02 20:37:55,669 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-02 20:37:55,669 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:37:55,669 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-02 20:37:55,669 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-02 20:37:55,670 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-02 20:37:55,670 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-02 20:37:55,670 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-02 20:37:55,670 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-02 20:37:55,671 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-02 20:37:55,671 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-02 20:37:55,671 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_8e4dbed5-a0dc-4eb0-a1a5-402c96fd873d/bin/uautomizer-Dbtcem3rbc/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_8e4dbed5-a0dc-4eb0-a1a5-402c96fd873d/bin/uautomizer-Dbtcem3rbc 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 -> 7db5da573de5a20455a36e013b1614f5d7f4dede9c4027ebf8a62a657a5ca5e2 [2022-11-02 20:37:55,953 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-02 20:37:55,993 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-02 20:37:55,997 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-02 20:37:55,998 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-02 20:37:55,999 INFO L275 PluginConnector]: CDTParser initialized [2022-11-02 20:37:56,001 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e4dbed5-a0dc-4eb0-a1a5-402c96fd873d/bin/uautomizer-Dbtcem3rbc/../../sv-benchmarks/c/pthread-wmm/safe029_power.oepc_pso.oepc_rmo.oepc.i [2022-11-02 20:37:56,081 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e4dbed5-a0dc-4eb0-a1a5-402c96fd873d/bin/uautomizer-Dbtcem3rbc/data/cd3d94e34/e32975a18a8c4745a8e17fe1a9933bf3/FLAGf5e16cf3a [2022-11-02 20:37:56,690 INFO L306 CDTParser]: Found 1 translation units. [2022-11-02 20:37:56,691 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e4dbed5-a0dc-4eb0-a1a5-402c96fd873d/sv-benchmarks/c/pthread-wmm/safe029_power.oepc_pso.oepc_rmo.oepc.i [2022-11-02 20:37:56,713 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e4dbed5-a0dc-4eb0-a1a5-402c96fd873d/bin/uautomizer-Dbtcem3rbc/data/cd3d94e34/e32975a18a8c4745a8e17fe1a9933bf3/FLAGf5e16cf3a [2022-11-02 20:37:56,942 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e4dbed5-a0dc-4eb0-a1a5-402c96fd873d/bin/uautomizer-Dbtcem3rbc/data/cd3d94e34/e32975a18a8c4745a8e17fe1a9933bf3 [2022-11-02 20:37:56,946 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-02 20:37:56,949 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-02 20:37:56,954 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-02 20:37:56,954 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-02 20:37:56,957 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-02 20:37:56,959 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:37:56" (1/1) ... [2022-11-02 20:37:56,960 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1b0e807d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:37:56, skipping insertion in model container [2022-11-02 20:37:56,961 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:37:56" (1/1) ... [2022-11-02 20:37:56,969 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-02 20:37:57,032 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-02 20:37:57,301 WARN L230 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_8e4dbed5-a0dc-4eb0-a1a5-402c96fd873d/sv-benchmarks/c/pthread-wmm/safe029_power.oepc_pso.oepc_rmo.oepc.i[970,983] [2022-11-02 20:37:57,615 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:37:57,625 INFO L203 MainTranslator]: Completed pre-run [2022-11-02 20:37:57,640 WARN L230 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_8e4dbed5-a0dc-4eb0-a1a5-402c96fd873d/sv-benchmarks/c/pthread-wmm/safe029_power.oepc_pso.oepc_rmo.oepc.i[970,983] [2022-11-02 20:37:57,686 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:37:57,738 INFO L208 MainTranslator]: Completed translation [2022-11-02 20:37:57,738 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:37:57 WrapperNode [2022-11-02 20:37:57,739 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-02 20:37:57,740 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-02 20:37:57,740 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-02 20:37:57,741 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-02 20:37:57,750 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:37:57" (1/1) ... [2022-11-02 20:37:57,794 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:37:57" (1/1) ... [2022-11-02 20:37:57,840 INFO L138 Inliner]: procedures = 175, calls = 41, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 258 [2022-11-02 20:37:57,846 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-02 20:37:57,852 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-02 20:37:57,852 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-02 20:37:57,853 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-02 20:37:57,862 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:37:57" (1/1) ... [2022-11-02 20:37:57,863 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:37:57" (1/1) ... [2022-11-02 20:37:57,886 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:37:57" (1/1) ... [2022-11-02 20:37:57,886 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:37:57" (1/1) ... [2022-11-02 20:37:57,895 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:37:57" (1/1) ... [2022-11-02 20:37:57,898 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:37:57" (1/1) ... [2022-11-02 20:37:57,910 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:37:57" (1/1) ... [2022-11-02 20:37:57,912 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:37:57" (1/1) ... [2022-11-02 20:37:57,915 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-02 20:37:57,931 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-02 20:37:57,931 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-02 20:37:57,931 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-02 20:37:57,932 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:37:57" (1/1) ... [2022-11-02 20:37:57,938 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:37:57,951 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e4dbed5-a0dc-4eb0-a1a5-402c96fd873d/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:37:57,960 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e4dbed5-a0dc-4eb0-a1a5-402c96fd873d/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-02 20:37:57,974 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e4dbed5-a0dc-4eb0-a1a5-402c96fd873d/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-02 20:37:58,006 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-02 20:37:58,006 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-02 20:37:58,006 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-02 20:37:58,006 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-02 20:37:58,006 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-02 20:37:58,007 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-02 20:37:58,007 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-02 20:37:58,007 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-02 20:37:58,007 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-02 20:37:58,007 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-02 20:37:58,008 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-02 20:37:58,008 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-02 20:37:58,008 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-02 20:37:58,010 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-02 20:37:58,216 INFO L235 CfgBuilder]: Building ICFG [2022-11-02 20:37:58,218 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-02 20:37:58,969 INFO L276 CfgBuilder]: Performing block encoding [2022-11-02 20:37:59,519 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-02 20:37:59,519 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-02 20:37:59,521 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:37:59 BoogieIcfgContainer [2022-11-02 20:37:59,522 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-02 20:37:59,524 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-02 20:37:59,524 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-02 20:37:59,528 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-02 20:37:59,528 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 08:37:56" (1/3) ... [2022-11-02 20:37:59,528 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34ad6163 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:37:59, skipping insertion in model container [2022-11-02 20:37:59,529 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:37:57" (2/3) ... [2022-11-02 20:37:59,529 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34ad6163 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:37:59, skipping insertion in model container [2022-11-02 20:37:59,529 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:37:59" (3/3) ... [2022-11-02 20:37:59,531 INFO L112 eAbstractionObserver]: Analyzing ICFG safe029_power.oepc_pso.oepc_rmo.oepc.i [2022-11-02 20:37:59,540 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-02 20:37:59,551 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-02 20:37:59,551 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-11-02 20:37:59,551 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-02 20:37:59,615 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-02 20:37:59,671 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 98 places, 93 transitions, 196 flow [2022-11-02 20:37:59,731 INFO L130 PetriNetUnfolder]: 2/91 cut-off events. [2022-11-02 20:37:59,731 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-02 20:37:59,735 INFO L83 FinitePrefix]: Finished finitePrefix Result has 98 conditions, 91 events. 2/91 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 44 event pairs, 0 based on Foata normal form. 0/87 useless extension candidates. Maximal degree in co-relation 55. Up to 2 conditions per place. [2022-11-02 20:37:59,735 INFO L82 GeneralOperation]: Start removeDead. Operand has 98 places, 93 transitions, 196 flow [2022-11-02 20:37:59,740 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 96 places, 91 transitions, 188 flow [2022-11-02 20:37:59,760 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-02 20:37:59,769 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;@6c156d42, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-02 20:37:59,770 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-11-02 20:37:59,796 INFO L130 PetriNetUnfolder]: 0/41 cut-off events. [2022-11-02 20:37:59,797 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-02 20:37:59,798 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:37:59,798 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:37:59,799 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-02 20:37:59,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:37:59,806 INFO L85 PathProgramCache]: Analyzing trace with hash -761824995, now seen corresponding path program 1 times [2022-11-02 20:37:59,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:37:59,819 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958572541] [2022-11-02 20:37:59,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:37:59,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:37:59,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:38:00,516 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-02 20:38:00,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:38:00,518 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958572541] [2022-11-02 20:38:00,519 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1958572541] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:38:00,519 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:38:00,519 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:38:00,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113203392] [2022-11-02 20:38:00,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:38:00,530 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:38:00,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:38:00,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:38:00,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:38:00,566 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 93 [2022-11-02 20:38:00,570 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 91 transitions, 188 flow. Second operand has 3 states, 3 states have (on average 82.0) internal successors, (246), 3 states have internal predecessors, (246), 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-02 20:38:00,570 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:38:00,570 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 93 [2022-11-02 20:38:00,571 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:38:00,721 INFO L130 PetriNetUnfolder]: 18/233 cut-off events. [2022-11-02 20:38:00,721 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-11-02 20:38:00,725 INFO L83 FinitePrefix]: Finished finitePrefix Result has 285 conditions, 233 events. 18/233 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 803 event pairs, 12 based on Foata normal form. 8/227 useless extension candidates. Maximal degree in co-relation 239. Up to 31 conditions per place. [2022-11-02 20:38:00,727 INFO L137 encePairwiseOnDemand]: 88/93 looper letters, 10 selfloop transitions, 2 changer transitions 0/91 dead transitions. [2022-11-02 20:38:00,728 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 91 transitions, 215 flow [2022-11-02 20:38:00,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:38:00,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:38:00,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 260 transitions. [2022-11-02 20:38:00,751 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.931899641577061 [2022-11-02 20:38:00,752 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 260 transitions. [2022-11-02 20:38:00,753 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 260 transitions. [2022-11-02 20:38:00,758 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:38:00,761 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 260 transitions. [2022-11-02 20:38:00,767 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 86.66666666666667) internal successors, (260), 3 states have internal predecessors, (260), 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-02 20:38:00,776 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 93.0) internal successors, (372), 4 states have internal predecessors, (372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:38:00,777 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 93.0) internal successors, (372), 4 states have internal predecessors, (372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:38:00,779 INFO L175 Difference]: Start difference. First operand has 96 places, 91 transitions, 188 flow. Second operand 3 states and 260 transitions. [2022-11-02 20:38:00,781 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 91 transitions, 215 flow [2022-11-02 20:38:00,784 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 91 transitions, 212 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:38:00,787 INFO L231 Difference]: Finished difference. Result has 94 places, 87 transitions, 182 flow [2022-11-02 20:38:00,790 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=93, PETRI_DIFFERENCE_MINUEND_FLOW=178, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=182, PETRI_PLACES=94, PETRI_TRANSITIONS=87} [2022-11-02 20:38:00,795 INFO L287 CegarLoopForPetriNet]: 96 programPoint places, -2 predicate places. [2022-11-02 20:38:00,795 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 87 transitions, 182 flow [2022-11-02 20:38:00,795 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 82.0) internal successors, (246), 3 states have internal predecessors, (246), 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-02 20:38:00,796 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:38:00,796 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02 20:38:00,796 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-02 20:38:00,797 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-02 20:38:00,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:38:00,797 INFO L85 PathProgramCache]: Analyzing trace with hash -29849764, now seen corresponding path program 1 times [2022-11-02 20:38:00,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:38:00,798 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467109520] [2022-11-02 20:38:00,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:38:00,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:38:00,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:38:01,311 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-02 20:38:01,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:38:01,314 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467109520] [2022-11-02 20:38:01,314 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1467109520] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:38:01,314 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:38:01,314 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 20:38:01,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894902470] [2022-11-02 20:38:01,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:38:01,316 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:38:01,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:38:01,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:38:01,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:38:01,324 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 93 [2022-11-02 20:38:01,326 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 87 transitions, 182 flow. Second operand has 6 states, 6 states have (on average 74.66666666666667) internal successors, (448), 6 states have internal predecessors, (448), 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-02 20:38:01,327 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:38:01,327 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 93 [2022-11-02 20:38:01,327 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:38:01,858 INFO L130 PetriNetUnfolder]: 179/654 cut-off events. [2022-11-02 20:38:01,858 INFO L131 PetriNetUnfolder]: For 34/34 co-relation queries the response was YES. [2022-11-02 20:38:01,861 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1031 conditions, 654 events. 179/654 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 3816 event pairs, 62 based on Foata normal form. 0/631 useless extension candidates. Maximal degree in co-relation 984. Up to 186 conditions per place. [2022-11-02 20:38:01,863 INFO L137 encePairwiseOnDemand]: 86/93 looper letters, 17 selfloop transitions, 3 changer transitions 43/125 dead transitions. [2022-11-02 20:38:01,864 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 125 transitions, 382 flow [2022-11-02 20:38:01,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-02 20:38:01,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-11-02 20:38:01,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 713 transitions. [2022-11-02 20:38:01,868 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8518518518518519 [2022-11-02 20:38:01,868 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 713 transitions. [2022-11-02 20:38:01,869 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 713 transitions. [2022-11-02 20:38:01,869 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:38:01,870 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 713 transitions. [2022-11-02 20:38:01,872 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 79.22222222222223) internal successors, (713), 9 states have internal predecessors, (713), 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-02 20:38:01,875 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 93.0) internal successors, (930), 10 states have internal predecessors, (930), 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-02 20:38:01,876 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 93.0) internal successors, (930), 10 states have internal predecessors, (930), 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-02 20:38:01,876 INFO L175 Difference]: Start difference. First operand has 94 places, 87 transitions, 182 flow. Second operand 9 states and 713 transitions. [2022-11-02 20:38:01,877 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 125 transitions, 382 flow [2022-11-02 20:38:01,878 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 125 transitions, 364 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:38:01,881 INFO L231 Difference]: Finished difference. Result has 107 places, 79 transitions, 201 flow [2022-11-02 20:38:01,881 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=93, PETRI_DIFFERENCE_MINUEND_FLOW=178, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=201, PETRI_PLACES=107, PETRI_TRANSITIONS=79} [2022-11-02 20:38:01,882 INFO L287 CegarLoopForPetriNet]: 96 programPoint places, 11 predicate places. [2022-11-02 20:38:01,882 INFO L495 AbstractCegarLoop]: Abstraction has has 107 places, 79 transitions, 201 flow [2022-11-02 20:38:01,883 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 74.66666666666667) internal successors, (448), 6 states have internal predecessors, (448), 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-02 20:38:01,883 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:38:01,883 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02 20:38:01,884 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-02 20:38:01,884 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-02 20:38:01,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:38:01,885 INFO L85 PathProgramCache]: Analyzing trace with hash 600139611, now seen corresponding path program 1 times [2022-11-02 20:38:01,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:38:01,885 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020422780] [2022-11-02 20:38:01,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:38:01,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:38:01,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:38:02,892 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-02 20:38:02,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:38:02,894 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020422780] [2022-11-02 20:38:02,894 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1020422780] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:38:02,895 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:38:02,895 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-02 20:38:02,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237657108] [2022-11-02 20:38:02,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:38:02,898 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-02 20:38:02,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:38:02,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-02 20:38:02,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2022-11-02 20:38:02,902 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 70 out of 93 [2022-11-02 20:38:02,903 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 79 transitions, 201 flow. Second operand has 11 states, 11 states have (on average 71.27272727272727) internal successors, (784), 11 states have internal predecessors, (784), 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-02 20:38:02,904 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:38:02,904 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 70 of 93 [2022-11-02 20:38:02,904 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:38:03,477 INFO L130 PetriNetUnfolder]: 160/440 cut-off events. [2022-11-02 20:38:03,477 INFO L131 PetriNetUnfolder]: For 343/345 co-relation queries the response was YES. [2022-11-02 20:38:03,480 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1014 conditions, 440 events. 160/440 cut-off events. For 343/345 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 1906 event pairs, 45 based on Foata normal form. 12/437 useless extension candidates. Maximal degree in co-relation 956. Up to 170 conditions per place. [2022-11-02 20:38:03,484 INFO L137 encePairwiseOnDemand]: 80/93 looper letters, 16 selfloop transitions, 11 changer transitions 34/122 dead transitions. [2022-11-02 20:38:03,484 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 122 transitions, 441 flow [2022-11-02 20:38:03,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-02 20:38:03,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-11-02 20:38:03,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1184 transitions. [2022-11-02 20:38:03,488 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7956989247311828 [2022-11-02 20:38:03,488 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1184 transitions. [2022-11-02 20:38:03,489 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1184 transitions. [2022-11-02 20:38:03,490 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:38:03,492 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1184 transitions. [2022-11-02 20:38:03,495 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 74.0) internal successors, (1184), 16 states have internal predecessors, (1184), 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-02 20:38:03,499 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 93.0) internal successors, (1581), 17 states have internal predecessors, (1581), 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-02 20:38:03,501 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 93.0) internal successors, (1581), 17 states have internal predecessors, (1581), 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-02 20:38:03,501 INFO L175 Difference]: Start difference. First operand has 107 places, 79 transitions, 201 flow. Second operand 16 states and 1184 transitions. [2022-11-02 20:38:03,502 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 122 transitions, 441 flow [2022-11-02 20:38:03,508 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 122 transitions, 420 flow, removed 9 selfloop flow, removed 4 redundant places. [2022-11-02 20:38:03,511 INFO L231 Difference]: Finished difference. Result has 113 places, 85 transitions, 280 flow [2022-11-02 20:38:03,511 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=93, PETRI_DIFFERENCE_MINUEND_FLOW=192, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=280, PETRI_PLACES=113, PETRI_TRANSITIONS=85} [2022-11-02 20:38:03,514 INFO L287 CegarLoopForPetriNet]: 96 programPoint places, 17 predicate places. [2022-11-02 20:38:03,514 INFO L495 AbstractCegarLoop]: Abstraction has has 113 places, 85 transitions, 280 flow [2022-11-02 20:38:03,515 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 71.27272727272727) internal successors, (784), 11 states have internal predecessors, (784), 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-02 20:38:03,515 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:38:03,515 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02 20:38:03,516 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-02 20:38:03,516 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-02 20:38:03,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:38:03,517 INFO L85 PathProgramCache]: Analyzing trace with hash -871931512, now seen corresponding path program 1 times [2022-11-02 20:38:03,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:38:03,518 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035068191] [2022-11-02 20:38:03,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:38:03,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:38:03,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:38:03,914 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-02 20:38:03,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:38:03,915 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035068191] [2022-11-02 20:38:03,916 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1035068191] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:38:03,916 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:38:03,916 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 20:38:03,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807264681] [2022-11-02 20:38:03,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:38:03,918 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:38:03,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:38:03,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:38:03,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:38:03,925 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 93 [2022-11-02 20:38:03,926 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 85 transitions, 280 flow. Second operand has 6 states, 6 states have (on average 75.0) internal successors, (450), 6 states have internal predecessors, (450), 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-02 20:38:03,926 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:38:03,926 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 93 [2022-11-02 20:38:03,927 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:38:04,429 INFO L130 PetriNetUnfolder]: 181/562 cut-off events. [2022-11-02 20:38:04,430 INFO L131 PetriNetUnfolder]: For 1536/1593 co-relation queries the response was YES. [2022-11-02 20:38:04,434 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1851 conditions, 562 events. 181/562 cut-off events. For 1536/1593 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 2984 event pairs, 35 based on Foata normal form. 12/557 useless extension candidates. Maximal degree in co-relation 1783. Up to 158 conditions per place. [2022-11-02 20:38:04,439 INFO L137 encePairwiseOnDemand]: 87/93 looper letters, 28 selfloop transitions, 3 changer transitions 23/118 dead transitions. [2022-11-02 20:38:04,439 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 118 transitions, 611 flow [2022-11-02 20:38:04,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-02 20:38:04,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-11-02 20:38:04,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 705 transitions. [2022-11-02 20:38:04,443 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8422939068100358 [2022-11-02 20:38:04,444 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 705 transitions. [2022-11-02 20:38:04,444 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 705 transitions. [2022-11-02 20:38:04,445 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:38:04,445 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 705 transitions. [2022-11-02 20:38:04,448 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 78.33333333333333) internal successors, (705), 9 states have internal predecessors, (705), 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-02 20:38:04,452 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 93.0) internal successors, (930), 10 states have internal predecessors, (930), 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-02 20:38:04,456 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 93.0) internal successors, (930), 10 states have internal predecessors, (930), 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-02 20:38:04,457 INFO L175 Difference]: Start difference. First operand has 113 places, 85 transitions, 280 flow. Second operand 9 states and 705 transitions. [2022-11-02 20:38:04,457 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 118 transitions, 611 flow [2022-11-02 20:38:04,469 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 118 transitions, 577 flow, removed 14 selfloop flow, removed 6 redundant places. [2022-11-02 20:38:04,474 INFO L231 Difference]: Finished difference. Result has 113 places, 85 transitions, 291 flow [2022-11-02 20:38:04,474 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=93, PETRI_DIFFERENCE_MINUEND_FLOW=266, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=291, PETRI_PLACES=113, PETRI_TRANSITIONS=85} [2022-11-02 20:38:04,475 INFO L287 CegarLoopForPetriNet]: 96 programPoint places, 17 predicate places. [2022-11-02 20:38:04,475 INFO L495 AbstractCegarLoop]: Abstraction has has 113 places, 85 transitions, 291 flow [2022-11-02 20:38:04,476 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 75.0) internal successors, (450), 6 states have internal predecessors, (450), 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-02 20:38:04,476 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:38:04,476 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02 20:38:04,476 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-02 20:38:04,477 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-02 20:38:04,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:38:04,477 INFO L85 PathProgramCache]: Analyzing trace with hash 938958484, now seen corresponding path program 1 times [2022-11-02 20:38:04,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:38:04,478 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761162298] [2022-11-02 20:38:04,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:38:04,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:38:04,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:38:05,384 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-02 20:38:05,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:38:05,385 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1761162298] [2022-11-02 20:38:05,386 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1761162298] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:38:05,386 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:38:05,386 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-02 20:38:05,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497974555] [2022-11-02 20:38:05,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:38:05,388 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-02 20:38:05,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:38:05,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-02 20:38:05,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:38:05,391 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 93 [2022-11-02 20:38:05,392 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 85 transitions, 291 flow. Second operand has 8 states, 8 states have (on average 73.625) internal successors, (589), 8 states have internal predecessors, (589), 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-02 20:38:05,392 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:38:05,392 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 93 [2022-11-02 20:38:05,393 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:38:05,939 INFO L130 PetriNetUnfolder]: 146/459 cut-off events. [2022-11-02 20:38:05,939 INFO L131 PetriNetUnfolder]: For 1784/1841 co-relation queries the response was YES. [2022-11-02 20:38:05,941 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1589 conditions, 459 events. 146/459 cut-off events. For 1784/1841 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 2202 event pairs, 60 based on Foata normal form. 8/443 useless extension candidates. Maximal degree in co-relation 1517. Up to 199 conditions per place. [2022-11-02 20:38:05,944 INFO L137 encePairwiseOnDemand]: 84/93 looper letters, 25 selfloop transitions, 7 changer transitions 25/120 dead transitions. [2022-11-02 20:38:05,944 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 120 transitions, 667 flow [2022-11-02 20:38:05,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-02 20:38:05,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-11-02 20:38:05,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1063 transitions. [2022-11-02 20:38:05,949 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8164362519201229 [2022-11-02 20:38:05,949 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1063 transitions. [2022-11-02 20:38:05,950 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1063 transitions. [2022-11-02 20:38:05,950 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:38:05,950 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1063 transitions. [2022-11-02 20:38:05,953 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 75.92857142857143) internal successors, (1063), 14 states have internal predecessors, (1063), 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-02 20:38:05,955 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 93.0) internal successors, (1395), 15 states have internal predecessors, (1395), 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-02 20:38:05,956 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 93.0) internal successors, (1395), 15 states have internal predecessors, (1395), 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-02 20:38:05,956 INFO L175 Difference]: Start difference. First operand has 113 places, 85 transitions, 291 flow. Second operand 14 states and 1063 transitions. [2022-11-02 20:38:05,956 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 120 transitions, 667 flow [2022-11-02 20:38:05,962 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 120 transitions, 610 flow, removed 27 selfloop flow, removed 7 redundant places. [2022-11-02 20:38:05,964 INFO L231 Difference]: Finished difference. Result has 123 places, 87 transitions, 327 flow [2022-11-02 20:38:05,964 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=93, PETRI_DIFFERENCE_MINUEND_FLOW=270, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=327, PETRI_PLACES=123, PETRI_TRANSITIONS=87} [2022-11-02 20:38:05,965 INFO L287 CegarLoopForPetriNet]: 96 programPoint places, 27 predicate places. [2022-11-02 20:38:05,965 INFO L495 AbstractCegarLoop]: Abstraction has has 123 places, 87 transitions, 327 flow [2022-11-02 20:38:05,965 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 73.625) internal successors, (589), 8 states have internal predecessors, (589), 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-02 20:38:05,966 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:38:05,966 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02 20:38:05,966 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-02 20:38:05,966 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-02 20:38:05,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:38:05,967 INFO L85 PathProgramCache]: Analyzing trace with hash 1370138173, now seen corresponding path program 1 times [2022-11-02 20:38:05,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:38:05,967 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451158536] [2022-11-02 20:38:05,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:38:05,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:38:06,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:38:07,005 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-02 20:38:07,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:38:07,006 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [451158536] [2022-11-02 20:38:07,006 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [451158536] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:38:07,007 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:38:07,007 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-02 20:38:07,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142663748] [2022-11-02 20:38:07,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:38:07,008 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-02 20:38:07,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:38:07,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-02 20:38:07,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:38:07,012 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 70 out of 93 [2022-11-02 20:38:07,014 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 87 transitions, 327 flow. Second operand has 9 states, 9 states have (on average 71.66666666666667) internal successors, (645), 9 states have internal predecessors, (645), 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-02 20:38:07,014 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:38:07,014 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 70 of 93 [2022-11-02 20:38:07,014 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:38:07,625 INFO L130 PetriNetUnfolder]: 171/508 cut-off events. [2022-11-02 20:38:07,625 INFO L131 PetriNetUnfolder]: For 2904/2989 co-relation queries the response was YES. [2022-11-02 20:38:07,628 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2142 conditions, 508 events. 171/508 cut-off events. For 2904/2989 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 2598 event pairs, 47 based on Foata normal form. 23/503 useless extension candidates. Maximal degree in co-relation 2062. Up to 207 conditions per place. [2022-11-02 20:38:07,632 INFO L137 encePairwiseOnDemand]: 81/93 looper letters, 26 selfloop transitions, 12 changer transitions 32/131 dead transitions. [2022-11-02 20:38:07,632 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 131 transitions, 831 flow [2022-11-02 20:38:07,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-02 20:38:07,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-11-02 20:38:07,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1184 transitions. [2022-11-02 20:38:07,636 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7956989247311828 [2022-11-02 20:38:07,636 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1184 transitions. [2022-11-02 20:38:07,636 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1184 transitions. [2022-11-02 20:38:07,637 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:38:07,637 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1184 transitions. [2022-11-02 20:38:07,640 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 74.0) internal successors, (1184), 16 states have internal predecessors, (1184), 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-02 20:38:07,643 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 93.0) internal successors, (1581), 17 states have internal predecessors, (1581), 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-02 20:38:07,644 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 93.0) internal successors, (1581), 17 states have internal predecessors, (1581), 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-02 20:38:07,644 INFO L175 Difference]: Start difference. First operand has 123 places, 87 transitions, 327 flow. Second operand 16 states and 1184 transitions. [2022-11-02 20:38:07,645 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 131 transitions, 831 flow [2022-11-02 20:38:07,653 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 131 transitions, 780 flow, removed 22 selfloop flow, removed 8 redundant places. [2022-11-02 20:38:07,655 INFO L231 Difference]: Finished difference. Result has 133 places, 96 transitions, 451 flow [2022-11-02 20:38:07,656 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=93, PETRI_DIFFERENCE_MINUEND_FLOW=301, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=451, PETRI_PLACES=133, PETRI_TRANSITIONS=96} [2022-11-02 20:38:07,657 INFO L287 CegarLoopForPetriNet]: 96 programPoint places, 37 predicate places. [2022-11-02 20:38:07,657 INFO L495 AbstractCegarLoop]: Abstraction has has 133 places, 96 transitions, 451 flow [2022-11-02 20:38:07,657 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 71.66666666666667) internal successors, (645), 9 states have internal predecessors, (645), 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-02 20:38:07,658 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:38:07,658 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02 20:38:07,658 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-02 20:38:07,658 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-02 20:38:07,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:38:07,659 INFO L85 PathProgramCache]: Analyzing trace with hash -999123527, now seen corresponding path program 2 times [2022-11-02 20:38:07,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:38:07,659 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937636187] [2022-11-02 20:38:07,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:38:07,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:38:07,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:38:08,435 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-02 20:38:08,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:38:08,436 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937636187] [2022-11-02 20:38:08,439 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [937636187] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:38:08,439 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:38:08,439 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-02 20:38:08,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922244778] [2022-11-02 20:38:08,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:38:08,445 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-02 20:38:08,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:38:08,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-02 20:38:08,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-11-02 20:38:08,448 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 70 out of 93 [2022-11-02 20:38:08,450 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 96 transitions, 451 flow. Second operand has 10 states, 10 states have (on average 71.5) internal successors, (715), 10 states have internal predecessors, (715), 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-02 20:38:08,450 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:38:08,450 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 70 of 93 [2022-11-02 20:38:08,450 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:38:08,833 INFO L130 PetriNetUnfolder]: 141/451 cut-off events. [2022-11-02 20:38:08,833 INFO L131 PetriNetUnfolder]: For 4546/4664 co-relation queries the response was YES. [2022-11-02 20:38:08,836 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2325 conditions, 451 events. 141/451 cut-off events. For 4546/4664 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 2258 event pairs, 40 based on Foata normal form. 33/459 useless extension candidates. Maximal degree in co-relation 2237. Up to 168 conditions per place. [2022-11-02 20:38:08,839 INFO L137 encePairwiseOnDemand]: 82/93 looper letters, 22 selfloop transitions, 14 changer transitions 22/119 dead transitions. [2022-11-02 20:38:08,839 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 119 transitions, 841 flow [2022-11-02 20:38:08,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-02 20:38:08,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-11-02 20:38:08,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 960 transitions. [2022-11-02 20:38:08,843 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.794044665012407 [2022-11-02 20:38:08,843 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 960 transitions. [2022-11-02 20:38:08,843 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 960 transitions. [2022-11-02 20:38:08,844 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:38:08,844 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 960 transitions. [2022-11-02 20:38:08,846 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 73.84615384615384) internal successors, (960), 13 states have internal predecessors, (960), 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-02 20:38:08,848 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 93.0) internal successors, (1302), 14 states have internal predecessors, (1302), 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-02 20:38:08,849 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 93.0) internal successors, (1302), 14 states have internal predecessors, (1302), 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-02 20:38:08,849 INFO L175 Difference]: Start difference. First operand has 133 places, 96 transitions, 451 flow. Second operand 13 states and 960 transitions. [2022-11-02 20:38:08,849 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 119 transitions, 841 flow [2022-11-02 20:38:08,860 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 119 transitions, 763 flow, removed 37 selfloop flow, removed 8 redundant places. [2022-11-02 20:38:08,862 INFO L231 Difference]: Finished difference. Result has 134 places, 95 transitions, 450 flow [2022-11-02 20:38:08,862 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=93, PETRI_DIFFERENCE_MINUEND_FLOW=407, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=450, PETRI_PLACES=134, PETRI_TRANSITIONS=95} [2022-11-02 20:38:08,863 INFO L287 CegarLoopForPetriNet]: 96 programPoint places, 38 predicate places. [2022-11-02 20:38:08,863 INFO L495 AbstractCegarLoop]: Abstraction has has 134 places, 95 transitions, 450 flow [2022-11-02 20:38:08,864 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 71.5) internal successors, (715), 10 states have internal predecessors, (715), 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-02 20:38:08,864 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:38:08,864 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02 20:38:08,864 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-02 20:38:08,865 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-02 20:38:08,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:38:08,865 INFO L85 PathProgramCache]: Analyzing trace with hash 1330604476, now seen corresponding path program 1 times [2022-11-02 20:38:08,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:38:08,865 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293471477] [2022-11-02 20:38:08,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:38:08,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:38:08,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:38:10,092 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-02 20:38:10,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:38:10,092 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293471477] [2022-11-02 20:38:10,093 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [293471477] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:38:10,093 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:38:10,093 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-02 20:38:10,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998106659] [2022-11-02 20:38:10,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:38:10,094 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-02 20:38:10,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:38:10,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-02 20:38:10,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2022-11-02 20:38:10,096 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 70 out of 93 [2022-11-02 20:38:10,098 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 95 transitions, 450 flow. Second operand has 11 states, 11 states have (on average 71.45454545454545) internal successors, (786), 11 states have internal predecessors, (786), 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-02 20:38:10,098 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:38:10,098 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 70 of 93 [2022-11-02 20:38:10,098 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:38:10,708 INFO L130 PetriNetUnfolder]: 107/407 cut-off events. [2022-11-02 20:38:10,708 INFO L131 PetriNetUnfolder]: For 3990/4092 co-relation queries the response was YES. [2022-11-02 20:38:10,711 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1971 conditions, 407 events. 107/407 cut-off events. For 3990/4092 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 1999 event pairs, 15 based on Foata normal form. 26/408 useless extension candidates. Maximal degree in co-relation 1880. Up to 102 conditions per place. [2022-11-02 20:38:10,713 INFO L137 encePairwiseOnDemand]: 81/93 looper letters, 24 selfloop transitions, 17 changer transitions 28/130 dead transitions. [2022-11-02 20:38:10,714 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 130 transitions, 1031 flow [2022-11-02 20:38:10,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-02 20:38:10,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-11-02 20:38:10,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 1250 transitions. [2022-11-02 20:38:10,717 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7906388361796332 [2022-11-02 20:38:10,717 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 1250 transitions. [2022-11-02 20:38:10,717 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 1250 transitions. [2022-11-02 20:38:10,718 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:38:10,719 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 1250 transitions. [2022-11-02 20:38:10,721 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 73.52941176470588) internal successors, (1250), 17 states have internal predecessors, (1250), 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-02 20:38:10,726 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 18 states, 18 states have (on average 93.0) internal successors, (1674), 18 states have internal predecessors, (1674), 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-02 20:38:10,727 INFO L81 ComplementDD]: Finished complementDD. Result has 18 states, 18 states have (on average 93.0) internal successors, (1674), 18 states have internal predecessors, (1674), 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-02 20:38:10,727 INFO L175 Difference]: Start difference. First operand has 134 places, 95 transitions, 450 flow. Second operand 17 states and 1250 transitions. [2022-11-02 20:38:10,727 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 130 transitions, 1031 flow [2022-11-02 20:38:10,737 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 130 transitions, 877 flow, removed 67 selfloop flow, removed 14 redundant places. [2022-11-02 20:38:10,740 INFO L231 Difference]: Finished difference. Result has 141 places, 95 transitions, 492 flow [2022-11-02 20:38:10,740 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=93, PETRI_DIFFERENCE_MINUEND_FLOW=398, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=492, PETRI_PLACES=141, PETRI_TRANSITIONS=95} [2022-11-02 20:38:10,744 INFO L287 CegarLoopForPetriNet]: 96 programPoint places, 45 predicate places. [2022-11-02 20:38:10,744 INFO L495 AbstractCegarLoop]: Abstraction has has 141 places, 95 transitions, 492 flow [2022-11-02 20:38:10,744 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 71.45454545454545) internal successors, (786), 11 states have internal predecessors, (786), 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-02 20:38:10,745 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:38:10,745 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02 20:38:10,745 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-02 20:38:10,745 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-02 20:38:10,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:38:10,746 INFO L85 PathProgramCache]: Analyzing trace with hash 1847616746, now seen corresponding path program 1 times [2022-11-02 20:38:10,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:38:10,747 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646190583] [2022-11-02 20:38:10,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:38:10,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:38:10,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:38:10,989 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-02 20:38:10,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:38:10,990 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646190583] [2022-11-02 20:38:10,990 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1646190583] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:38:10,990 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:38:10,991 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 20:38:10,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598450159] [2022-11-02 20:38:10,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:38:10,991 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:38:10,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:38:10,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:38:10,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:38:10,993 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 93 [2022-11-02 20:38:10,994 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 95 transitions, 492 flow. Second operand has 6 states, 6 states have (on average 74.16666666666667) internal successors, (445), 6 states have internal predecessors, (445), 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-02 20:38:10,994 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:38:10,994 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 93 [2022-11-02 20:38:10,994 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:38:11,387 INFO L130 PetriNetUnfolder]: 278/750 cut-off events. [2022-11-02 20:38:11,388 INFO L131 PetriNetUnfolder]: For 7041/7137 co-relation queries the response was YES. [2022-11-02 20:38:11,392 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3122 conditions, 750 events. 278/750 cut-off events. For 7041/7137 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 4334 event pairs, 21 based on Foata normal form. 60/781 useless extension candidates. Maximal degree in co-relation 3033. Up to 174 conditions per place. [2022-11-02 20:38:11,395 INFO L137 encePairwiseOnDemand]: 84/93 looper letters, 27 selfloop transitions, 5 changer transitions 48/144 dead transitions. [2022-11-02 20:38:11,396 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 144 transitions, 1141 flow [2022-11-02 20:38:11,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-02 20:38:11,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-11-02 20:38:11,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 779 transitions. [2022-11-02 20:38:11,399 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8376344086021505 [2022-11-02 20:38:11,399 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 779 transitions. [2022-11-02 20:38:11,399 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 779 transitions. [2022-11-02 20:38:11,400 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:38:11,400 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 779 transitions. [2022-11-02 20:38:11,402 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 77.9) internal successors, (779), 10 states have internal predecessors, (779), 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-02 20:38:11,404 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 93.0) internal successors, (1023), 11 states have internal predecessors, (1023), 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-02 20:38:11,405 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 93.0) internal successors, (1023), 11 states have internal predecessors, (1023), 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-02 20:38:11,405 INFO L175 Difference]: Start difference. First operand has 141 places, 95 transitions, 492 flow. Second operand 10 states and 779 transitions. [2022-11-02 20:38:11,405 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 144 transitions, 1141 flow [2022-11-02 20:38:11,420 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 144 transitions, 1023 flow, removed 32 selfloop flow, removed 21 redundant places. [2022-11-02 20:38:11,423 INFO L231 Difference]: Finished difference. Result has 126 places, 87 transitions, 381 flow [2022-11-02 20:38:11,423 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=93, PETRI_DIFFERENCE_MINUEND_FLOW=354, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=381, PETRI_PLACES=126, PETRI_TRANSITIONS=87} [2022-11-02 20:38:11,424 INFO L287 CegarLoopForPetriNet]: 96 programPoint places, 30 predicate places. [2022-11-02 20:38:11,424 INFO L495 AbstractCegarLoop]: Abstraction has has 126 places, 87 transitions, 381 flow [2022-11-02 20:38:11,424 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 74.16666666666667) internal successors, (445), 6 states have internal predecessors, (445), 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-02 20:38:11,424 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:38:11,425 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02 20:38:11,425 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-02 20:38:11,425 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-02 20:38:11,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:38:11,426 INFO L85 PathProgramCache]: Analyzing trace with hash 638868166, now seen corresponding path program 1 times [2022-11-02 20:38:11,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:38:11,426 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485248714] [2022-11-02 20:38:11,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:38:11,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:38:11,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:38:11,655 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-02 20:38:11,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:38:11,656 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485248714] [2022-11-02 20:38:11,656 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1485248714] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:38:11,656 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:38:11,656 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 20:38:11,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046590982] [2022-11-02 20:38:11,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:38:11,657 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 20:38:11,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:38:11,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 20:38:11,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:38:11,659 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 93 [2022-11-02 20:38:11,660 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 87 transitions, 381 flow. Second operand has 7 states, 7 states have (on average 74.0) internal successors, (518), 7 states have internal predecessors, (518), 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-02 20:38:11,660 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:38:11,660 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 93 [2022-11-02 20:38:11,660 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:38:11,919 INFO L130 PetriNetUnfolder]: 54/262 cut-off events. [2022-11-02 20:38:11,919 INFO L131 PetriNetUnfolder]: For 1496/1504 co-relation queries the response was YES. [2022-11-02 20:38:11,921 INFO L83 FinitePrefix]: Finished finitePrefix Result has 995 conditions, 262 events. 54/262 cut-off events. For 1496/1504 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1063 event pairs, 2 based on Foata normal form. 20/280 useless extension candidates. Maximal degree in co-relation 923. Up to 46 conditions per place. [2022-11-02 20:38:11,922 INFO L137 encePairwiseOnDemand]: 85/93 looper letters, 19 selfloop transitions, 7 changer transitions 21/108 dead transitions. [2022-11-02 20:38:11,922 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 108 transitions, 691 flow [2022-11-02 20:38:11,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-02 20:38:11,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-11-02 20:38:11,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 758 transitions. [2022-11-02 20:38:11,925 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8150537634408602 [2022-11-02 20:38:11,925 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 758 transitions. [2022-11-02 20:38:11,925 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 758 transitions. [2022-11-02 20:38:11,926 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:38:11,926 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 758 transitions. [2022-11-02 20:38:11,927 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 75.8) internal successors, (758), 10 states have internal predecessors, (758), 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-02 20:38:11,929 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 93.0) internal successors, (1023), 11 states have internal predecessors, (1023), 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-02 20:38:11,930 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 93.0) internal successors, (1023), 11 states have internal predecessors, (1023), 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-02 20:38:11,930 INFO L175 Difference]: Start difference. First operand has 126 places, 87 transitions, 381 flow. Second operand 10 states and 758 transitions. [2022-11-02 20:38:11,930 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 108 transitions, 691 flow [2022-11-02 20:38:11,936 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 108 transitions, 488 flow, removed 97 selfloop flow, removed 17 redundant places. [2022-11-02 20:38:11,937 INFO L231 Difference]: Finished difference. Result has 118 places, 83 transitions, 296 flow [2022-11-02 20:38:11,938 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=93, PETRI_DIFFERENCE_MINUEND_FLOW=286, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=296, PETRI_PLACES=118, PETRI_TRANSITIONS=83} [2022-11-02 20:38:11,938 INFO L287 CegarLoopForPetriNet]: 96 programPoint places, 22 predicate places. [2022-11-02 20:38:11,939 INFO L495 AbstractCegarLoop]: Abstraction has has 118 places, 83 transitions, 296 flow [2022-11-02 20:38:11,939 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 74.0) internal successors, (518), 7 states have internal predecessors, (518), 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-02 20:38:11,939 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:38:11,939 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02 20:38:11,940 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-02 20:38:11,940 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-02 20:38:11,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:38:11,941 INFO L85 PathProgramCache]: Analyzing trace with hash 1596495984, now seen corresponding path program 1 times [2022-11-02 20:38:11,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:38:11,941 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365393290] [2022-11-02 20:38:11,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:38:11,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:38:11,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:38:13,137 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-02 20:38:13,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:38:13,137 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365393290] [2022-11-02 20:38:13,137 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [365393290] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:38:13,138 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:38:13,138 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-11-02 20:38:13,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169291714] [2022-11-02 20:38:13,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:38:13,139 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-02 20:38:13,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:38:13,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-02 20:38:13,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2022-11-02 20:38:13,141 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 68 out of 93 [2022-11-02 20:38:13,142 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 83 transitions, 296 flow. Second operand has 12 states, 12 states have (on average 69.66666666666667) internal successors, (836), 12 states have internal predecessors, (836), 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-02 20:38:13,142 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:38:13,142 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 68 of 93 [2022-11-02 20:38:13,143 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:38:13,454 INFO L130 PetriNetUnfolder]: 5/143 cut-off events. [2022-11-02 20:38:13,454 INFO L131 PetriNetUnfolder]: For 121/123 co-relation queries the response was YES. [2022-11-02 20:38:13,455 INFO L83 FinitePrefix]: Finished finitePrefix Result has 339 conditions, 143 events. 5/143 cut-off events. For 121/123 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 275 event pairs, 0 based on Foata normal form. 3/146 useless extension candidates. Maximal degree in co-relation 263. Up to 17 conditions per place. [2022-11-02 20:38:13,456 INFO L137 encePairwiseOnDemand]: 83/93 looper letters, 23 selfloop transitions, 6 changer transitions 9/96 dead transitions. [2022-11-02 20:38:13,456 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 96 transitions, 406 flow [2022-11-02 20:38:13,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-02 20:38:13,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-11-02 20:38:13,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 787 transitions. [2022-11-02 20:38:13,458 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7693059628543499 [2022-11-02 20:38:13,458 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 787 transitions. [2022-11-02 20:38:13,458 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 787 transitions. [2022-11-02 20:38:13,459 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:38:13,459 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 787 transitions. [2022-11-02 20:38:13,461 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 71.54545454545455) internal successors, (787), 11 states have internal predecessors, (787), 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-02 20:38:13,463 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 93.0) internal successors, (1116), 12 states have internal predecessors, (1116), 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-02 20:38:13,463 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 93.0) internal successors, (1116), 12 states have internal predecessors, (1116), 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-02 20:38:13,463 INFO L175 Difference]: Start difference. First operand has 118 places, 83 transitions, 296 flow. Second operand 11 states and 787 transitions. [2022-11-02 20:38:13,464 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 96 transitions, 406 flow [2022-11-02 20:38:13,465 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 96 transitions, 324 flow, removed 19 selfloop flow, removed 21 redundant places. [2022-11-02 20:38:13,467 INFO L231 Difference]: Finished difference. Result has 106 places, 80 transitions, 221 flow [2022-11-02 20:38:13,467 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=93, PETRI_DIFFERENCE_MINUEND_FLOW=218, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=221, PETRI_PLACES=106, PETRI_TRANSITIONS=80} [2022-11-02 20:38:13,468 INFO L287 CegarLoopForPetriNet]: 96 programPoint places, 10 predicate places. [2022-11-02 20:38:13,468 INFO L495 AbstractCegarLoop]: Abstraction has has 106 places, 80 transitions, 221 flow [2022-11-02 20:38:13,468 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 69.66666666666667) internal successors, (836), 12 states have internal predecessors, (836), 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-02 20:38:13,469 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:38:13,469 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02 20:38:13,469 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-02 20:38:13,469 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-02 20:38:13,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:38:13,470 INFO L85 PathProgramCache]: Analyzing trace with hash 832471714, now seen corresponding path program 2 times [2022-11-02 20:38:13,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:38:13,470 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085567241] [2022-11-02 20:38:13,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:38:13,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:38:13,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:38:13,515 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-02 20:38:13,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:38:13,604 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-02 20:38:13,605 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-02 20:38:13,606 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2022-11-02 20:38:13,608 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2022-11-02 20:38:13,609 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2022-11-02 20:38:13,610 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2022-11-02 20:38:13,610 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2022-11-02 20:38:13,610 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-02 20:38:13,611 INFO L444 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:38:13,617 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-02 20:38:13,618 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-02 20:38:13,730 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.11 08:38:13 BasicIcfg [2022-11-02 20:38:13,730 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-02 20:38:13,731 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-02 20:38:13,731 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-02 20:38:13,731 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-02 20:38:13,732 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:37:59" (3/4) ... [2022-11-02 20:38:13,734 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-11-02 20:38:13,875 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e4dbed5-a0dc-4eb0-a1a5-402c96fd873d/bin/uautomizer-Dbtcem3rbc/witness.graphml [2022-11-02 20:38:13,876 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-02 20:38:13,876 INFO L158 Benchmark]: Toolchain (without parser) took 16927.12ms. Allocated memory was 117.4MB in the beginning and 413.1MB in the end (delta: 295.7MB). Free memory was 85.0MB in the beginning and 366.9MB in the end (delta: -281.9MB). Peak memory consumption was 203.5MB. Max. memory is 16.1GB. [2022-11-02 20:38:13,877 INFO L158 Benchmark]: CDTParser took 0.33ms. Allocated memory is still 117.4MB. Free memory was 72.6MB in the beginning and 72.6MB in the end (delta: 53.5kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-02 20:38:13,877 INFO L158 Benchmark]: CACSL2BoogieTranslator took 785.32ms. Allocated memory is still 117.4MB. Free memory was 85.0MB in the beginning and 79.0MB in the end (delta: 6.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-11-02 20:38:13,878 INFO L158 Benchmark]: Boogie Procedure Inliner took 111.04ms. Allocated memory is still 117.4MB. Free memory was 79.0MB in the beginning and 75.8MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-02 20:38:13,878 INFO L158 Benchmark]: Boogie Preprocessor took 77.92ms. Allocated memory is still 117.4MB. Free memory was 75.8MB in the beginning and 73.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-02 20:38:13,879 INFO L158 Benchmark]: RCFGBuilder took 1591.27ms. Allocated memory was 117.4MB in the beginning and 144.7MB in the end (delta: 27.3MB). Free memory was 73.7MB in the beginning and 92.2MB in the end (delta: -18.4MB). Peak memory consumption was 39.7MB. Max. memory is 16.1GB. [2022-11-02 20:38:13,879 INFO L158 Benchmark]: TraceAbstraction took 14206.71ms. Allocated memory was 144.7MB in the beginning and 343.9MB in the end (delta: 199.2MB). Free memory was 91.7MB in the beginning and 113.1MB in the end (delta: -21.3MB). Peak memory consumption was 179.0MB. Max. memory is 16.1GB. [2022-11-02 20:38:13,879 INFO L158 Benchmark]: Witness Printer took 144.84ms. Allocated memory was 343.9MB in the beginning and 413.1MB in the end (delta: 69.2MB). Free memory was 113.1MB in the beginning and 366.9MB in the end (delta: -253.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-02 20:38:13,882 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.33ms. Allocated memory is still 117.4MB. Free memory was 72.6MB in the beginning and 72.6MB in the end (delta: 53.5kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 785.32ms. Allocated memory is still 117.4MB. Free memory was 85.0MB in the beginning and 79.0MB in the end (delta: 6.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 111.04ms. Allocated memory is still 117.4MB. Free memory was 79.0MB in the beginning and 75.8MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 77.92ms. Allocated memory is still 117.4MB. Free memory was 75.8MB in the beginning and 73.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1591.27ms. Allocated memory was 117.4MB in the beginning and 144.7MB in the end (delta: 27.3MB). Free memory was 73.7MB in the beginning and 92.2MB in the end (delta: -18.4MB). Peak memory consumption was 39.7MB. Max. memory is 16.1GB. * TraceAbstraction took 14206.71ms. Allocated memory was 144.7MB in the beginning and 343.9MB in the end (delta: 199.2MB). Free memory was 91.7MB in the beginning and 113.1MB in the end (delta: -21.3MB). Peak memory consumption was 179.0MB. Max. memory is 16.1GB. * Witness Printer took 144.84ms. Allocated memory was 343.9MB in the beginning and 413.1MB in the end (delta: 69.2MB). Free memory was 113.1MB in the beginning and 366.9MB in the end (delta: -253.8MB). Peak memory consumption was 4.2MB. 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: [L708] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L709] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0] [L710] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0] [L712] 0 int x = 0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L714] 0 int y = 0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L715] 0 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L716] 0 int y$mem_tmp; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L717] 0 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L718] 0 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L719] 0 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=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] [L720] 0 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=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] [L721] 0 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=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] [L722] 0 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=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] [L723] 0 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=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] [L724] 0 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=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}] [L725] 0 int y$w_buff0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=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] [L726] 0 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=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] [L727] 0 int y$w_buff1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=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] [L728] 0 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=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] [L729] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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] [L730] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=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] [L790] 0 pthread_t t2473; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, t2473={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] [L791] FCALL, FORK 0 pthread_create(&t2473, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2473, ((void *)0), P0, ((void *)0))=-1, t2473={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] [L734] 1 y$w_buff1 = y$w_buff0 [L735] 1 y$w_buff0 = 2 [L736] 1 y$w_buff1_used = y$w_buff0_used [L737] 1 y$w_buff0_used = (_Bool)1 [L738] CALL 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L738] RET 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L739] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L740] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L741] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L742] 1 y$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L792] 0 pthread_t t2474; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, t2473={5:0}, t2474={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=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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L793] FCALL, FORK 0 pthread_create(&t2474, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2474, ((void *)0), P1, ((void *)0))=0, t2473={5:0}, t2474={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=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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L745] 1 x = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L762] 2 x = 2 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L765] 2 y = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L768] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L768] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L768] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L768] 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) [L769] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L769] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L770] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L770] 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 [L771] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L771] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L772] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L772] 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 [L748] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L748] 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) [L749] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L749] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L750] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L750] 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 [L751] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L751] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L752] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L752] 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 [L755] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L775] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L795] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2473={5:0}, t2474={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L797] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=2, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L797] RET 0 assume_abort_if_not(main$tmp_guard0) [L799] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L799] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L799] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L799] 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) [L800] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L800] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L801] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L801] 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 [L802] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L802] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L803] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L803] 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 [L806] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L807] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L808] 0 y$flush_delayed = weak$$choice2 [L809] 0 y$mem_tmp = y [L810] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L810] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L811] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L811] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L812] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L812] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L813] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L813] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L814] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L814] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L815] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L815] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L816] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L816] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L817] 0 main$tmp_guard1 = !(x == 2 && y == 2) [L818] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L818] 0 y = y$flush_delayed ? y$mem_tmp : y [L819] 0 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2473={5:0}, t2474={3:0}, weak$$choice0=49, weak$$choice2=255, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L821] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=2, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, 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=2, 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, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, 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=2, 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: 791]: 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: 793]: 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, 111 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: 13.9s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 5.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 440 SdHoareTripleChecker+Valid, 1.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 440 mSDsluCounter, 491 SdHoareTripleChecker+Invalid, 1.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 659 mSDsCounter, 137 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1091 IncrementalHoareTripleChecker+Invalid, 1228 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 137 mSolverCounterUnsat, 101 mSDtfsCounter, 1091 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 157 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 291 ImplicationChecksByTransitivity, 1.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=492occurred in iteration=8, InterpolantAutomatonStates: 128, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 7.4s InterpolantComputationTime, 775 NumberOfCodeBlocks, 775 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 692 ConstructedInterpolants, 0 QuantifiedInterpolants, 4007 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 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-02 20:38:13,938 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e4dbed5-a0dc-4eb0-a1a5-402c96fd873d/bin/uautomizer-Dbtcem3rbc/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