./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/heap-data/packet_filter.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5e519f3a Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4732baf-1759-4940-9141-35ec0526b567/bin/uautomizer-Dbtcem3rbc/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4732baf-1759-4940-9141-35ec0526b567/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_b4732baf-1759-4940-9141-35ec0526b567/bin/uautomizer-Dbtcem3rbc/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4732baf-1759-4940-9141-35ec0526b567/bin/uautomizer-Dbtcem3rbc/config/AutomizerReach.xml -i ../../sv-benchmarks/c/heap-data/packet_filter.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4732baf-1759-4940-9141-35ec0526b567/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_b4732baf-1759-4940-9141-35ec0526b567/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 d604fdd8f7c4d34db0106d8a0ff422218ae80e9ee6eb03f691b84d2fcc8ad49f --- 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:54:07,366 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-02 20:54:07,369 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-02 20:54:07,417 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-02 20:54:07,418 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-02 20:54:07,422 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-02 20:54:07,425 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-02 20:54:07,429 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-02 20:54:07,432 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-02 20:54:07,437 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-02 20:54:07,438 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-02 20:54:07,440 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-02 20:54:07,440 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-02 20:54:07,441 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-02 20:54:07,442 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-02 20:54:07,443 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-02 20:54:07,444 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-02 20:54:07,445 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-02 20:54:07,449 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-02 20:54:07,462 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-02 20:54:07,465 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-02 20:54:07,466 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-02 20:54:07,470 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-02 20:54:07,471 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-02 20:54:07,480 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-02 20:54:07,480 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-02 20:54:07,480 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-02 20:54:07,481 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-02 20:54:07,482 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-02 20:54:07,483 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-02 20:54:07,483 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-02 20:54:07,484 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-02 20:54:07,485 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-02 20:54:07,486 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-02 20:54:07,487 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-02 20:54:07,487 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-02 20:54:07,488 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-02 20:54:07,488 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-02 20:54:07,489 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-02 20:54:07,490 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-02 20:54:07,493 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-02 20:54:07,495 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4732baf-1759-4940-9141-35ec0526b567/bin/uautomizer-Dbtcem3rbc/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-02 20:54:07,539 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-02 20:54:07,539 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-02 20:54:07,540 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-02 20:54:07,540 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-02 20:54:07,541 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-02 20:54:07,541 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-02 20:54:07,542 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-02 20:54:07,542 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-02 20:54:07,543 INFO L138 SettingsManager]: * Use SBE=true [2022-11-02 20:54:07,543 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-02 20:54:07,544 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-02 20:54:07,544 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-02 20:54:07,544 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-02 20:54:07,545 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-02 20:54:07,545 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-02 20:54:07,545 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-02 20:54:07,545 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-02 20:54:07,545 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-02 20:54:07,546 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-02 20:54:07,546 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-02 20:54:07,546 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-02 20:54:07,546 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-02 20:54:07,546 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-02 20:54:07,547 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-02 20:54:07,547 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:54:07,547 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-02 20:54:07,547 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-02 20:54:07,548 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-02 20:54:07,548 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-02 20:54:07,548 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-02 20:54:07,548 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-02 20:54:07,548 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-02 20:54:07,549 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-02 20:54:07,549 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_b4732baf-1759-4940-9141-35ec0526b567/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_b4732baf-1759-4940-9141-35ec0526b567/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 -> d604fdd8f7c4d34db0106d8a0ff422218ae80e9ee6eb03f691b84d2fcc8ad49f [2022-11-02 20:54:07,899 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-02 20:54:07,941 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-02 20:54:07,944 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-02 20:54:07,945 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-02 20:54:07,946 INFO L275 PluginConnector]: CDTParser initialized [2022-11-02 20:54:07,947 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4732baf-1759-4940-9141-35ec0526b567/bin/uautomizer-Dbtcem3rbc/../../sv-benchmarks/c/heap-data/packet_filter.i [2022-11-02 20:54:08,024 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4732baf-1759-4940-9141-35ec0526b567/bin/uautomizer-Dbtcem3rbc/data/d706388af/e7f8ea1335074d2dbb275891763847ec/FLAGe1892fd9d [2022-11-02 20:54:08,655 INFO L306 CDTParser]: Found 1 translation units. [2022-11-02 20:54:08,656 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4732baf-1759-4940-9141-35ec0526b567/sv-benchmarks/c/heap-data/packet_filter.i [2022-11-02 20:54:08,684 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4732baf-1759-4940-9141-35ec0526b567/bin/uautomizer-Dbtcem3rbc/data/d706388af/e7f8ea1335074d2dbb275891763847ec/FLAGe1892fd9d [2022-11-02 20:54:08,934 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4732baf-1759-4940-9141-35ec0526b567/bin/uautomizer-Dbtcem3rbc/data/d706388af/e7f8ea1335074d2dbb275891763847ec [2022-11-02 20:54:08,939 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-02 20:54:08,941 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-02 20:54:08,947 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-02 20:54:08,947 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-02 20:54:08,952 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-02 20:54:08,952 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:54:08" (1/1) ... [2022-11-02 20:54:08,959 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@56c528e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:54:08, skipping insertion in model container [2022-11-02 20:54:08,959 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:54:08" (1/1) ... [2022-11-02 20:54:08,967 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-02 20:54:08,996 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-02 20:54:09,362 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_b4732baf-1759-4940-9141-35ec0526b567/sv-benchmarks/c/heap-data/packet_filter.i[23925,23938] [2022-11-02 20:54:09,377 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_b4732baf-1759-4940-9141-35ec0526b567/sv-benchmarks/c/heap-data/packet_filter.i[24159,24172] [2022-11-02 20:54:09,395 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:54:09,408 INFO L203 MainTranslator]: Completed pre-run [2022-11-02 20:54:09,472 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_b4732baf-1759-4940-9141-35ec0526b567/sv-benchmarks/c/heap-data/packet_filter.i[23925,23938] [2022-11-02 20:54:09,480 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_b4732baf-1759-4940-9141-35ec0526b567/sv-benchmarks/c/heap-data/packet_filter.i[24159,24172] [2022-11-02 20:54:09,487 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:54:09,530 INFO L208 MainTranslator]: Completed translation [2022-11-02 20:54:09,531 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:54:09 WrapperNode [2022-11-02 20:54:09,531 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-02 20:54:09,532 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-02 20:54:09,533 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-02 20:54:09,533 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-02 20:54:09,540 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:54:09" (1/1) ... [2022-11-02 20:54:09,578 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:54:09" (1/1) ... [2022-11-02 20:54:09,618 INFO L138 Inliner]: procedures = 130, calls = 86, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 160 [2022-11-02 20:54:09,618 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-02 20:54:09,619 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-02 20:54:09,619 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-02 20:54:09,619 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-02 20:54:09,629 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:54:09" (1/1) ... [2022-11-02 20:54:09,630 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:54:09" (1/1) ... [2022-11-02 20:54:09,647 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:54:09" (1/1) ... [2022-11-02 20:54:09,648 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:54:09" (1/1) ... [2022-11-02 20:54:09,657 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:54:09" (1/1) ... [2022-11-02 20:54:09,680 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:54:09" (1/1) ... [2022-11-02 20:54:09,682 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:54:09" (1/1) ... [2022-11-02 20:54:09,683 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:54:09" (1/1) ... [2022-11-02 20:54:09,686 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-02 20:54:09,687 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-02 20:54:09,687 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-02 20:54:09,687 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-02 20:54:09,700 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:54:09" (1/1) ... [2022-11-02 20:54:09,707 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:54:09,719 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4732baf-1759-4940-9141-35ec0526b567/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:54:09,732 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4732baf-1759-4940-9141-35ec0526b567/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-02 20:54:09,759 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4732baf-1759-4940-9141-35ec0526b567/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-02 20:54:09,778 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-02 20:54:09,779 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-02 20:54:09,779 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-02 20:54:09,780 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-02 20:54:09,780 INFO L130 BoogieDeclarations]: Found specification of procedure append_to_queue [2022-11-02 20:54:09,781 INFO L138 BoogieDeclarations]: Found implementation of procedure append_to_queue [2022-11-02 20:54:09,781 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-02 20:54:09,781 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-02 20:54:09,782 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-02 20:54:09,782 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_charp [2022-11-02 20:54:09,782 INFO L130 BoogieDeclarations]: Found specification of procedure send [2022-11-02 20:54:09,782 INFO L138 BoogieDeclarations]: Found implementation of procedure send [2022-11-02 20:54:09,782 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-02 20:54:09,782 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-11-02 20:54:09,782 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-02 20:54:09,782 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-02 20:54:09,783 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-02 20:54:09,972 INFO L235 CfgBuilder]: Building ICFG [2022-11-02 20:54:09,974 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-02 20:54:10,476 INFO L276 CfgBuilder]: Performing block encoding [2022-11-02 20:54:10,488 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-02 20:54:10,491 INFO L300 CfgBuilder]: Removed 3 assume(true) statements. [2022-11-02 20:54:10,493 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:54:10 BoogieIcfgContainer [2022-11-02 20:54:10,493 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-02 20:54:10,497 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-02 20:54:10,497 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-02 20:54:10,501 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-02 20:54:10,502 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 08:54:08" (1/3) ... [2022-11-02 20:54:10,503 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5411a859 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:54:10, skipping insertion in model container [2022-11-02 20:54:10,503 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:54:09" (2/3) ... [2022-11-02 20:54:10,504 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5411a859 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:54:10, skipping insertion in model container [2022-11-02 20:54:10,504 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:54:10" (3/3) ... [2022-11-02 20:54:10,506 INFO L112 eAbstractionObserver]: Analyzing ICFG packet_filter.i [2022-11-02 20:54:10,526 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-02 20:54:10,527 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-11-02 20:54:10,600 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-02 20:54:10,611 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;@9dbcc4a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-02 20:54:10,616 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-11-02 20:54:10,620 INFO L276 IsEmpty]: Start isEmpty. Operand has 47 states, 37 states have (on average 1.4324324324324325) internal successors, (53), 39 states have internal predecessors, (53), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-11-02 20:54:10,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-02 20:54:10,628 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:54:10,628 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:54:10,629 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:54:10,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:54:10,635 INFO L85 PathProgramCache]: Analyzing trace with hash -1910004341, now seen corresponding path program 1 times [2022-11-02 20:54:10,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:54:10,646 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528058676] [2022-11-02 20:54:10,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:54:10,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:54:10,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:10,857 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:54:10,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:54:10,859 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528058676] [2022-11-02 20:54:10,860 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [528058676] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:54:10,860 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:54:10,862 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:54:10,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002300011] [2022-11-02 20:54:10,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:54:10,869 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-02 20:54:10,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:54:10,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-02 20:54:10,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-02 20:54:10,907 INFO L87 Difference]: Start difference. First operand has 47 states, 37 states have (on average 1.4324324324324325) internal successors, (53), 39 states have internal predecessors, (53), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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:54:10,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:54:10,938 INFO L93 Difference]: Finished difference Result 74 states and 98 transitions. [2022-11-02 20:54:10,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-02 20:54:10,941 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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) Word has length 8 [2022-11-02 20:54:10,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:54:10,953 INFO L225 Difference]: With dead ends: 74 [2022-11-02 20:54:10,953 INFO L226 Difference]: Without dead ends: 43 [2022-11-02 20:54:10,957 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-02 20:54:10,961 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:54:10,963 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:54:10,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-11-02 20:54:11,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2022-11-02 20:54:11,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 34 states have (on average 1.2941176470588236) internal successors, (44), 35 states have internal predecessors, (44), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-11-02 20:54:11,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 54 transitions. [2022-11-02 20:54:11,026 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 54 transitions. Word has length 8 [2022-11-02 20:54:11,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:54:11,026 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 54 transitions. [2022-11-02 20:54:11,027 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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:54:11,027 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 54 transitions. [2022-11-02 20:54:11,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-02 20:54:11,028 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:54:11,029 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:54:11,029 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-02 20:54:11,029 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:54:11,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:54:11,030 INFO L85 PathProgramCache]: Analyzing trace with hash -1345079117, now seen corresponding path program 1 times [2022-11-02 20:54:11,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:54:11,031 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487387969] [2022-11-02 20:54:11,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:54:11,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:54:11,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:11,340 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:54:11,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:54:11,341 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1487387969] [2022-11-02 20:54:11,341 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1487387969] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:54:11,341 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:54:11,341 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:54:11,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546950787] [2022-11-02 20:54:11,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:54:11,343 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:54:11,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:54:11,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:54:11,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:54:11,344 INFO L87 Difference]: Start difference. First operand 43 states and 54 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 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:54:11,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:54:11,459 INFO L93 Difference]: Finished difference Result 77 states and 96 transitions. [2022-11-02 20:54:11,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 20:54:11,460 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 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) Word has length 9 [2022-11-02 20:54:11,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:54:11,463 INFO L225 Difference]: With dead ends: 77 [2022-11-02 20:54:11,463 INFO L226 Difference]: Without dead ends: 55 [2022-11-02 20:54:11,463 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:54:11,465 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 29 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:54:11,466 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 122 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:54:11,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-11-02 20:54:11,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 47. [2022-11-02 20:54:11,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 38 states have (on average 1.2894736842105263) internal successors, (49), 39 states have internal predecessors, (49), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-11-02 20:54:11,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 59 transitions. [2022-11-02 20:54:11,476 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 59 transitions. Word has length 9 [2022-11-02 20:54:11,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:54:11,476 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 59 transitions. [2022-11-02 20:54:11,477 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 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:54:11,477 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 59 transitions. [2022-11-02 20:54:11,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-02 20:54:11,478 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:54:11,478 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:54:11,478 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-02 20:54:11,479 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:54:11,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:54:11,479 INFO L85 PathProgramCache]: Analyzing trace with hash 124171370, now seen corresponding path program 1 times [2022-11-02 20:54:11,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:54:11,480 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709622168] [2022-11-02 20:54:11,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:54:11,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:54:11,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:11,662 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:54:11,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:54:11,663 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709622168] [2022-11-02 20:54:11,663 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1709622168] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:54:11,663 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:54:11,663 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:54:11,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716829890] [2022-11-02 20:54:11,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:54:11,664 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:54:11,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:54:11,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:54:11,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:54:11,665 INFO L87 Difference]: Start difference. First operand 47 states and 59 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 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:54:11,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:54:11,794 INFO L93 Difference]: Finished difference Result 61 states and 74 transitions. [2022-11-02 20:54:11,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:54:11,794 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 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) Word has length 11 [2022-11-02 20:54:11,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:54:11,795 INFO L225 Difference]: With dead ends: 61 [2022-11-02 20:54:11,796 INFO L226 Difference]: Without dead ends: 45 [2022-11-02 20:54:11,796 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:54:11,797 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 1 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:54:11,798 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 136 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:54:11,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-11-02 20:54:11,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2022-11-02 20:54:11,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 36 states have (on average 1.2777777777777777) internal successors, (46), 37 states have internal predecessors, (46), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-11-02 20:54:11,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 56 transitions. [2022-11-02 20:54:11,808 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 56 transitions. Word has length 11 [2022-11-02 20:54:11,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:54:11,809 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 56 transitions. [2022-11-02 20:54:11,809 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 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:54:11,809 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 56 transitions. [2022-11-02 20:54:11,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-02 20:54:11,810 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:54:11,810 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:54:11,810 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-02 20:54:11,811 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:54:11,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:54:11,811 INFO L85 PathProgramCache]: Analyzing trace with hash 959773065, now seen corresponding path program 1 times [2022-11-02 20:54:11,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:54:11,812 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750345993] [2022-11-02 20:54:11,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:54:11,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:54:11,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:12,519 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:54:12,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:54:12,520 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750345993] [2022-11-02 20:54:12,520 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [750345993] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:54:12,520 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1135768579] [2022-11-02 20:54:12,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:54:12,521 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:54:12,521 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4732baf-1759-4940-9141-35ec0526b567/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:54:12,528 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4732baf-1759-4940-9141-35ec0526b567/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:54:12,531 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4732baf-1759-4940-9141-35ec0526b567/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-02 20:54:12,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:12,660 INFO L263 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 40 conjunts are in the unsatisfiable core [2022-11-02 20:54:12,678 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:54:12,779 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 20:54:12,781 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2022-11-02 20:54:12,854 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-02 20:54:12,854 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-11-02 20:54:12,869 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-02 20:54:12,893 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-02 20:54:12,894 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-11-02 20:54:12,903 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-02 20:54:12,926 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-02 20:54:12,927 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2022-11-02 20:54:12,968 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-02 20:54:12,982 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-02 20:54:13,065 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-02 20:54:13,071 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-02 20:54:13,075 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:54:13,075 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:54:13,155 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_84 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_receive_~#packet~0#1.base| v_ArrVal_84) |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|) 0)) (forall ((v_ArrVal_83 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_receive_~#packet~0#1.base| v_ArrVal_83) |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|) 0))) is different from false [2022-11-02 20:54:13,804 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:54:13,805 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1135768579] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:54:13,805 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:54:13,805 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 8 [2022-11-02 20:54:13,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329459569] [2022-11-02 20:54:13,806 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:54:13,806 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-02 20:54:13,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:54:13,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-02 20:54:13,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=29, Unknown=1, NotChecked=10, Total=56 [2022-11-02 20:54:13,807 INFO L87 Difference]: Start difference. First operand 45 states and 56 transitions. Second operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 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:54:14,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:54:14,108 INFO L93 Difference]: Finished difference Result 90 states and 116 transitions. [2022-11-02 20:54:14,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-02 20:54:14,110 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 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) Word has length 16 [2022-11-02 20:54:14,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:54:14,111 INFO L225 Difference]: With dead ends: 90 [2022-11-02 20:54:14,111 INFO L226 Difference]: Without dead ends: 68 [2022-11-02 20:54:14,112 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 1 IntricatePredicates, 1 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=34, Invalid=59, Unknown=1, NotChecked=16, Total=110 [2022-11-02 20:54:14,113 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 37 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 90 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:54:14,114 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 224 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 75 Invalid, 0 Unknown, 90 Unchecked, 0.2s Time] [2022-11-02 20:54:14,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2022-11-02 20:54:14,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 54. [2022-11-02 20:54:14,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 45 states have (on average 1.288888888888889) internal successors, (58), 46 states have internal predecessors, (58), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-11-02 20:54:14,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 68 transitions. [2022-11-02 20:54:14,124 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 68 transitions. Word has length 16 [2022-11-02 20:54:14,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:54:14,125 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 68 transitions. [2022-11-02 20:54:14,125 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 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:54:14,125 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 68 transitions. [2022-11-02 20:54:14,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-02 20:54:14,126 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:54:14,126 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:54:14,168 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4732baf-1759-4940-9141-35ec0526b567/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-02 20:54:14,351 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4732baf-1759-4940-9141-35ec0526b567/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:54:14,351 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:54:14,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:54:14,352 INFO L85 PathProgramCache]: Analyzing trace with hash -1116006464, now seen corresponding path program 1 times [2022-11-02 20:54:14,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:54:14,352 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369190282] [2022-11-02 20:54:14,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:54:14,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:54:14,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:14,732 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:54:14,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:54:14,732 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369190282] [2022-11-02 20:54:14,732 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [369190282] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:54:14,736 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [657440853] [2022-11-02 20:54:14,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:54:14,737 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:54:14,737 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4732baf-1759-4940-9141-35ec0526b567/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:54:14,738 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4732baf-1759-4940-9141-35ec0526b567/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:54:14,745 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4732baf-1759-4940-9141-35ec0526b567/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-02 20:54:14,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:14,870 INFO L263 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 36 conjunts are in the unsatisfiable core [2022-11-02 20:54:14,875 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:54:14,901 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-02 20:54:14,901 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 15 [2022-11-02 20:54:14,979 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-02 20:54:14,979 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-11-02 20:54:14,990 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-02 20:54:15,010 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-02 20:54:15,011 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2022-11-02 20:54:15,020 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-02 20:54:15,062 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-02 20:54:15,069 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-02 20:54:15,119 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-02 20:54:15,122 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-02 20:54:15,126 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:54:15,127 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:54:15,189 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_152 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_receive_~#packet~0#1.base| v_ArrVal_152) |c_ULTIMATE.start_main_~#normal_queue~0#1.base|) |c_ULTIMATE.start_main_~#normal_queue~0#1.offset|) 0)) (forall ((v_ArrVal_150 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_receive_~#packet~0#1.base| v_ArrVal_150) |c_ULTIMATE.start_main_~#normal_queue~0#1.base|) |c_ULTIMATE.start_main_~#normal_queue~0#1.offset|) 0))) is different from false [2022-11-02 20:54:16,335 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:54:16,336 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [657440853] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:54:16,336 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:54:16,336 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 10 [2022-11-02 20:54:16,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282634378] [2022-11-02 20:54:16,337 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:54:16,337 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-02 20:54:16,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:54:16,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-02 20:54:16,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=51, Unknown=1, NotChecked=14, Total=90 [2022-11-02 20:54:16,339 INFO L87 Difference]: Start difference. First operand 54 states and 68 transitions. Second operand has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 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:54:16,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:54:16,696 INFO L93 Difference]: Finished difference Result 74 states and 94 transitions. [2022-11-02 20:54:16,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-02 20:54:16,696 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 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) Word has length 18 [2022-11-02 20:54:16,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:54:16,697 INFO L225 Difference]: With dead ends: 74 [2022-11-02 20:54:16,697 INFO L226 Difference]: Without dead ends: 58 [2022-11-02 20:54:16,698 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 1 IntricatePredicates, 1 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=46, Invalid=89, Unknown=1, NotChecked=20, Total=156 [2022-11-02 20:54:16,699 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 12 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 281 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 53 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:54:16,699 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 281 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 113 Invalid, 0 Unknown, 53 Unchecked, 0.3s Time] [2022-11-02 20:54:16,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-11-02 20:54:16,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 52. [2022-11-02 20:54:16,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 43 states have (on average 1.2790697674418605) internal successors, (55), 44 states have internal predecessors, (55), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-11-02 20:54:16,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 65 transitions. [2022-11-02 20:54:16,707 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 65 transitions. Word has length 18 [2022-11-02 20:54:16,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:54:16,708 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 65 transitions. [2022-11-02 20:54:16,708 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 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:54:16,708 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 65 transitions. [2022-11-02 20:54:16,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-02 20:54:16,709 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:54:16,709 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:54:16,749 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4732baf-1759-4940-9141-35ec0526b567/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-02 20:54:16,935 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4732baf-1759-4940-9141-35ec0526b567/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:54:16,935 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:54:16,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:54:16,936 INFO L85 PathProgramCache]: Analyzing trace with hash -2078493544, now seen corresponding path program 1 times [2022-11-02 20:54:16,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:54:16,936 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096512678] [2022-11-02 20:54:16,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:54:16,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:54:16,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:17,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-11-02 20:54:17,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:17,239 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:54:17,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:54:17,239 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096512678] [2022-11-02 20:54:17,239 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2096512678] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:54:17,240 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:54:17,240 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 20:54:17,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364205819] [2022-11-02 20:54:17,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:54:17,241 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 20:54:17,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:54:17,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 20:54:17,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:54:17,243 INFO L87 Difference]: Start difference. First operand 52 states and 65 transitions. Second operand has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:54:17,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:54:17,582 INFO L93 Difference]: Finished difference Result 132 states and 168 transitions. [2022-11-02 20:54:17,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 20:54:17,583 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-11-02 20:54:17,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:54:17,584 INFO L225 Difference]: With dead ends: 132 [2022-11-02 20:54:17,584 INFO L226 Difference]: Without dead ends: 91 [2022-11-02 20:54:17,585 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:54:17,586 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 35 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:54:17,586 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 268 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-02 20:54:17,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2022-11-02 20:54:17,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 59. [2022-11-02 20:54:17,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 50 states have (on average 1.28) internal successors, (64), 51 states have internal predecessors, (64), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-11-02 20:54:17,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 74 transitions. [2022-11-02 20:54:17,595 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 74 transitions. Word has length 22 [2022-11-02 20:54:17,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:54:17,595 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 74 transitions. [2022-11-02 20:54:17,596 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:54:17,596 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 74 transitions. [2022-11-02 20:54:17,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-02 20:54:17,597 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:54:17,597 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:54:17,597 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-02 20:54:17,597 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:54:17,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:54:17,598 INFO L85 PathProgramCache]: Analyzing trace with hash 222329046, now seen corresponding path program 1 times [2022-11-02 20:54:17,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:54:17,598 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062687253] [2022-11-02 20:54:17,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:54:17,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:54:17,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:18,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-11-02 20:54:18,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:19,145 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:54:19,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:54:19,145 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062687253] [2022-11-02 20:54:19,145 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2062687253] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:54:19,146 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2092088295] [2022-11-02 20:54:19,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:54:19,152 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:54:19,152 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4732baf-1759-4940-9141-35ec0526b567/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:54:19,155 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4732baf-1759-4940-9141-35ec0526b567/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:54:19,176 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4732baf-1759-4940-9141-35ec0526b567/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-02 20:54:19,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:19,336 INFO L263 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 63 conjunts are in the unsatisfiable core [2022-11-02 20:54:19,341 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:54:19,458 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2022-11-02 20:54:19,583 INFO L356 Elim1Store]: treesize reduction 40, result has 42.9 percent of original size [2022-11-02 20:54:19,583 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 64 [2022-11-02 20:54:19,634 INFO L356 Elim1Store]: treesize reduction 26, result has 42.2 percent of original size [2022-11-02 20:54:19,634 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 74 [2022-11-02 20:54:19,680 INFO L356 Elim1Store]: treesize reduction 26, result has 42.2 percent of original size [2022-11-02 20:54:19,680 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 74 [2022-11-02 20:54:19,695 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-11-02 20:54:19,760 INFO L356 Elim1Store]: treesize reduction 28, result has 58.2 percent of original size [2022-11-02 20:54:19,760 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 55 treesize of output 80 [2022-11-02 20:54:19,800 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-11-02 20:54:19,820 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-11-02 20:54:19,840 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-11-02 20:54:19,909 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-02 20:54:19,979 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-02 20:54:19,989 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:54:19,990 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 5 [2022-11-02 20:54:19,996 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-02 20:54:20,097 INFO L356 Elim1Store]: treesize reduction 25, result has 3.8 percent of original size [2022-11-02 20:54:20,098 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 158 treesize of output 102 [2022-11-02 20:54:20,102 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 97 treesize of output 75 [2022-11-02 20:54:20,501 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-02 20:54:20,502 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 110 treesize of output 83 [2022-11-02 20:54:20,510 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 58 [2022-11-02 20:54:20,518 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:54:20,522 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:54:20,523 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2022-11-02 20:54:20,527 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-02 20:54:20,534 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2022-11-02 20:54:20,591 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:54:20,591 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:54:21,075 INFO L356 Elim1Store]: treesize reduction 41, result has 62.0 percent of original size [2022-11-02 20:54:21,075 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 7 case distinctions, treesize of input 57 treesize of output 79 [2022-11-02 20:54:21,098 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-02 20:54:21,100 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 68 treesize of output 48 [2022-11-02 20:54:21,108 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2022-11-02 20:54:21,269 INFO L356 Elim1Store]: treesize reduction 107, result has 0.9 percent of original size [2022-11-02 20:54:21,269 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 7 case distinctions, treesize of input 57 treesize of output 1 [2022-11-02 20:54:21,404 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:54:21,404 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2092088295] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:54:21,405 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:54:21,405 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 10] total 25 [2022-11-02 20:54:21,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896793686] [2022-11-02 20:54:21,406 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:54:21,407 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-11-02 20:54:21,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:54:21,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-11-02 20:54:21,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=514, Unknown=0, NotChecked=0, Total=600 [2022-11-02 20:54:21,409 INFO L87 Difference]: Start difference. First operand 59 states and 74 transitions. Second operand has 25 states, 22 states have (on average 2.3636363636363638) internal successors, (52), 24 states have internal predecessors, (52), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-02 20:54:22,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:54:22,849 INFO L93 Difference]: Finished difference Result 187 states and 244 transitions. [2022-11-02 20:54:22,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-02 20:54:22,850 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 22 states have (on average 2.3636363636363638) internal successors, (52), 24 states have internal predecessors, (52), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 22 [2022-11-02 20:54:22,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:54:22,851 INFO L225 Difference]: With dead ends: 187 [2022-11-02 20:54:22,851 INFO L226 Difference]: Without dead ends: 142 [2022-11-02 20:54:22,852 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 201 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=174, Invalid=1016, Unknown=0, NotChecked=0, Total=1190 [2022-11-02 20:54:22,853 INFO L413 NwaCegarLoop]: 103 mSDtfsCounter, 168 mSDsluCounter, 1014 mSDsCounter, 0 mSdLazyCounter, 716 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 1117 SdHoareTripleChecker+Invalid, 842 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 716 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 95 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:54:22,853 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 1117 Invalid, 842 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 716 Invalid, 0 Unknown, 95 Unchecked, 1.0s Time] [2022-11-02 20:54:22,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2022-11-02 20:54:22,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 79. [2022-11-02 20:54:22,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 69 states have (on average 1.289855072463768) internal successors, (89), 70 states have internal predecessors, (89), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-02 20:54:22,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 101 transitions. [2022-11-02 20:54:22,866 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 101 transitions. Word has length 22 [2022-11-02 20:54:22,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:54:22,866 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 101 transitions. [2022-11-02 20:54:22,866 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 22 states have (on average 2.3636363636363638) internal successors, (52), 24 states have internal predecessors, (52), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-02 20:54:22,867 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 101 transitions. [2022-11-02 20:54:22,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-02 20:54:22,868 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:54:22,868 INFO L195 NwaCegarLoop]: trace histogram [2, 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:54:22,911 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4732baf-1759-4940-9141-35ec0526b567/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-02 20:54:23,091 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4732baf-1759-4940-9141-35ec0526b567/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:54:23,092 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:54:23,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:54:23,092 INFO L85 PathProgramCache]: Analyzing trace with hash -749095909, now seen corresponding path program 1 times [2022-11-02 20:54:23,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:54:23,093 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351971761] [2022-11-02 20:54:23,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:54:23,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:54:23,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:23,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-02 20:54:24,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:24,294 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:54:24,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:54:24,295 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351971761] [2022-11-02 20:54:24,295 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1351971761] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:54:24,295 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2076158062] [2022-11-02 20:54:24,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:54:24,296 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:54:24,297 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4732baf-1759-4940-9141-35ec0526b567/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:54:24,298 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4732baf-1759-4940-9141-35ec0526b567/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:54:24,327 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4732baf-1759-4940-9141-35ec0526b567/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-02 20:54:24,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:24,489 INFO L263 TraceCheckSpWp]: Trace formula consists of 349 conjuncts, 66 conjunts are in the unsatisfiable core [2022-11-02 20:54:24,495 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:54:24,685 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-11-02 20:54:24,791 INFO L356 Elim1Store]: treesize reduction 40, result has 42.9 percent of original size [2022-11-02 20:54:24,792 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 64 [2022-11-02 20:54:24,835 INFO L356 Elim1Store]: treesize reduction 26, result has 42.2 percent of original size [2022-11-02 20:54:24,835 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 74 [2022-11-02 20:54:24,876 INFO L356 Elim1Store]: treesize reduction 26, result has 42.2 percent of original size [2022-11-02 20:54:24,876 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 74 [2022-11-02 20:54:24,889 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-11-02 20:54:24,943 INFO L356 Elim1Store]: treesize reduction 28, result has 58.2 percent of original size [2022-11-02 20:54:24,943 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 55 treesize of output 80 [2022-11-02 20:54:24,958 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-11-02 20:54:24,973 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-11-02 20:54:24,989 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-11-02 20:54:25,062 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-02 20:54:25,078 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 15 [2022-11-02 20:54:25,084 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-02 20:54:25,140 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:54:25,141 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:54:25,142 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 9 [2022-11-02 20:54:25,147 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2022-11-02 20:54:25,400 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 18 [2022-11-02 20:54:25,405 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-02 20:54:25,451 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:54:25,453 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:54:25,953 INFO L356 Elim1Store]: treesize reduction 41, result has 62.0 percent of original size [2022-11-02 20:54:25,953 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 7 case distinctions, treesize of input 57 treesize of output 79 [2022-11-02 20:54:25,975 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-02 20:54:25,976 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 68 treesize of output 48 [2022-11-02 20:54:25,986 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2022-11-02 20:54:26,166 INFO L356 Elim1Store]: treesize reduction 107, result has 0.9 percent of original size [2022-11-02 20:54:26,167 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 7 case distinctions, treesize of input 57 treesize of output 1 [2022-11-02 20:54:26,360 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:54:26,362 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2076158062] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:54:26,363 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:54:26,363 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 11] total 27 [2022-11-02 20:54:26,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231222776] [2022-11-02 20:54:26,364 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:54:26,364 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-11-02 20:54:26,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:54:26,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-11-02 20:54:26,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=596, Unknown=0, NotChecked=0, Total=702 [2022-11-02 20:54:26,368 INFO L87 Difference]: Start difference. First operand 79 states and 101 transitions. Second operand has 27 states, 24 states have (on average 2.375) internal successors, (57), 26 states have internal predecessors, (57), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-02 20:54:27,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:54:27,852 INFO L93 Difference]: Finished difference Result 100 states and 128 transitions. [2022-11-02 20:54:27,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-02 20:54:27,855 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 24 states have (on average 2.375) internal successors, (57), 26 states have internal predecessors, (57), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 23 [2022-11-02 20:54:27,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:54:27,856 INFO L225 Difference]: With dead ends: 100 [2022-11-02 20:54:27,857 INFO L226 Difference]: Without dead ends: 98 [2022-11-02 20:54:27,857 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 223 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=221, Invalid=1111, Unknown=0, NotChecked=0, Total=1332 [2022-11-02 20:54:27,858 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 119 mSDsluCounter, 462 mSDsCounter, 0 mSdLazyCounter, 586 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 512 SdHoareTripleChecker+Invalid, 671 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 586 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 47 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-02 20:54:27,859 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 512 Invalid, 671 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 586 Invalid, 0 Unknown, 47 Unchecked, 0.9s Time] [2022-11-02 20:54:27,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2022-11-02 20:54:27,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 85. [2022-11-02 20:54:27,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 75 states have (on average 1.3066666666666666) internal successors, (98), 76 states have internal predecessors, (98), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-02 20:54:27,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 110 transitions. [2022-11-02 20:54:27,882 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 110 transitions. Word has length 23 [2022-11-02 20:54:27,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:54:27,883 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 110 transitions. [2022-11-02 20:54:27,883 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 24 states have (on average 2.375) internal successors, (57), 26 states have internal predecessors, (57), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-02 20:54:27,883 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 110 transitions. [2022-11-02 20:54:27,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-02 20:54:27,891 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:54:27,891 INFO L195 NwaCegarLoop]: trace histogram [2, 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:54:27,926 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4732baf-1759-4940-9141-35ec0526b567/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-11-02 20:54:28,111 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4732baf-1759-4940-9141-35ec0526b567/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2022-11-02 20:54:28,111 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:54:28,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:54:28,112 INFO L85 PathProgramCache]: Analyzing trace with hash 1903920603, now seen corresponding path program 1 times [2022-11-02 20:54:28,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:54:28,112 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117041416] [2022-11-02 20:54:28,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:54:28,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:54:28,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:29,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-02 20:54:29,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:58,785 WARN L234 SmtUtils]: Spent 13.88s on a formula simplification that was a NOOP. DAG size: 152 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-02 20:55:14,463 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:55:14,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:55:14,463 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117041416] [2022-11-02 20:55:14,463 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1117041416] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:55:14,464 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1168342471] [2022-11-02 20:55:14,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:55:14,464 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:55:14,464 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4732baf-1759-4940-9141-35ec0526b567/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:55:14,466 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4732baf-1759-4940-9141-35ec0526b567/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:55:14,467 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4732baf-1759-4940-9141-35ec0526b567/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-02 20:55:14,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:14,710 INFO L263 TraceCheckSpWp]: Trace formula consists of 349 conjuncts, 68 conjunts are in the unsatisfiable core [2022-11-02 20:55:14,715 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:55:14,732 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 20:55:14,732 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2022-11-02 20:55:14,814 INFO L356 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2022-11-02 20:55:14,814 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 29 treesize of output 37 [2022-11-02 20:55:14,831 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-02 20:55:14,839 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-02 20:55:14,957 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-02 20:55:14,967 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-02 20:55:14,974 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2022-11-02 20:55:15,162 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-02 20:55:15,168 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-02 20:55:15,173 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-02 20:55:15,250 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_1219 (Array Int Int)) (v_ArrVal_1218 (Array Int Int)) (v_ArrVal_1215 (Array Int Int)) (v_ArrVal_1214 (Array Int Int)) (v_ArrVal_1213 (Array Int Int)) (v_ArrVal_1223 (Array Int Int)) (|v_append_to_queue_~#p.base_31| Int) (append_to_queue_~node~0.base Int)) (and (= (store (store (store |c_old(#memory_$Pointer$.base)| |v_append_to_queue_~#p.base_31| v_ArrVal_1218) append_to_queue_~node~0.base v_ArrVal_1213) |c_append_to_queue_#in~q.base| v_ArrVal_1219) |c_#memory_$Pointer$.base|) (< append_to_queue_~node~0.base |c_#StackHeapBarrier|) (= (store (store (store |c_old(#memory_$Pointer$.offset)| |v_append_to_queue_~#p.base_31| v_ArrVal_1215) append_to_queue_~node~0.base v_ArrVal_1223) |c_append_to_queue_#in~q.base| v_ArrVal_1214) |c_#memory_$Pointer$.offset|) (= (select |c_old(#valid)| |v_append_to_queue_~#p.base_31|) 0))) is different from true [2022-11-02 20:55:15,294 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:55:15,295 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:55:15,331 INFO L356 Elim1Store]: treesize reduction 33, result has 40.0 percent of original size [2022-11-02 20:55:15,332 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 37 [2022-11-02 20:55:15,345 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:55:15,346 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:55:15,380 INFO L356 Elim1Store]: treesize reduction 33, result has 40.0 percent of original size [2022-11-02 20:55:15,381 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 37 [2022-11-02 20:55:15,409 INFO L356 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-11-02 20:55:15,410 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2022-11-02 20:55:15,460 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-02 20:55:15,464 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-02 20:55:15,467 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:55:15,468 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:55:21,688 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1168342471] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:55:21,688 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-02 20:55:21,688 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 14 [2022-11-02 20:55:21,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537750617] [2022-11-02 20:55:21,689 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-02 20:55:21,689 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-02 20:55:21,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:55:21,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-02 20:55:21,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=135, Unknown=2, NotChecked=24, Total=210 [2022-11-02 20:55:21,690 INFO L87 Difference]: Start difference. First operand 85 states and 110 transitions. Second operand has 14 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 12 states have internal predecessors, (32), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-02 20:55:24,248 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse4 (@diff |c_old(#memory_$Pointer$.offset)| |c_#memory_$Pointer$.offset|)) (.cse13 (@diff |c_old(#memory_$Pointer$.base)| |c_#memory_$Pointer$.base|))) (let ((.cse6 (store |c_old(#memory_$Pointer$.base)| .cse13 (select |c_#memory_$Pointer$.base| .cse13))) (.cse25 (store |c_old(#memory_$Pointer$.offset)| .cse4 (select |c_#memory_$Pointer$.offset| .cse4)))) (let ((.cse24 (@diff .cse25 |c_#memory_$Pointer$.offset|)) (.cse5 (@diff .cse6 |c_#memory_$Pointer$.base|))) (let ((.cse7 (store .cse6 .cse5 (select |c_#memory_$Pointer$.base| .cse5))) (.cse3 (store .cse25 .cse24 (select |c_#memory_$Pointer$.offset| .cse24)))) (let ((.cse2 (@diff .cse3 |c_#memory_$Pointer$.offset|)) (.cse8 (@diff .cse7 |c_#memory_$Pointer$.base|))) (let ((.cse15 (store .cse7 .cse8 (select |c_#memory_$Pointer$.base| .cse8))) (.cse23 (store .cse3 .cse2 (select |c_#memory_$Pointer$.offset| .cse2)))) (let ((.cse22 (@diff .cse23 |c_#memory_$Pointer$.offset|)) (.cse14 (@diff .cse15 |c_#memory_$Pointer$.base|))) (let ((.cse1 (store .cse15 .cse14 (select |c_#memory_$Pointer$.base| .cse14))) (.cse21 (store .cse23 .cse22 (select |c_#memory_$Pointer$.offset| .cse22)))) (let ((.cse20 (@diff .cse21 |c_#memory_$Pointer$.offset|)) (.cse0 (@diff .cse1 |c_#memory_$Pointer$.base|))) (let ((.cse10 (store .cse1 .cse0 (select |c_#memory_$Pointer$.base| .cse0))) (.cse11 (store .cse21 .cse20 (select |c_#memory_$Pointer$.offset| .cse20)))) (let ((.cse12 (@diff .cse11 |c_#memory_$Pointer$.offset|)) (.cse9 (@diff .cse10 |c_#memory_$Pointer$.base|))) (let ((.cse18 (store .cse10 .cse9 (select |c_#memory_$Pointer$.base| .cse9))) (.cse16 (store .cse11 .cse12 (select |c_#memory_$Pointer$.offset| .cse12)))) (let ((.cse17 (@diff .cse16 |c_#memory_$Pointer$.offset|)) (.cse19 (@diff .cse18 |c_#memory_$Pointer$.base|))) (and (exists ((v_ArrVal_1219 (Array Int Int)) (v_ArrVal_1218 (Array Int Int)) (v_ArrVal_1215 (Array Int Int)) (v_ArrVal_1214 (Array Int Int)) (v_ArrVal_1213 (Array Int Int)) (v_ArrVal_1223 (Array Int Int)) (|v_append_to_queue_~#p.base_31| Int) (append_to_queue_~node~0.base Int)) (and (= (store (store (store |c_old(#memory_$Pointer$.base)| |v_append_to_queue_~#p.base_31| v_ArrVal_1218) append_to_queue_~node~0.base v_ArrVal_1213) |c_append_to_queue_#in~q.base| v_ArrVal_1219) |c_#memory_$Pointer$.base|) (< append_to_queue_~node~0.base |c_#StackHeapBarrier|) (= (store (store (store |c_old(#memory_$Pointer$.offset)| |v_append_to_queue_~#p.base_31| v_ArrVal_1215) append_to_queue_~node~0.base v_ArrVal_1223) |c_append_to_queue_#in~q.base| v_ArrVal_1214) |c_#memory_$Pointer$.offset|) (= (select |c_old(#valid)| |v_append_to_queue_~#p.base_31|) 0))) (or (= (select |c_old(#valid)| .cse0) 0) (= .cse0 |c_append_to_queue_#in~q.base|) (= |c_#memory_$Pointer$.base| .cse1) (<= (+ .cse0 1) |c_#StackHeapBarrier|)) (or (<= (+ .cse2 1) |c_#StackHeapBarrier|) (= .cse2 |c_append_to_queue_#in~q.base|) (= |c_#memory_$Pointer$.offset| .cse3) (= (select |c_old(#valid)| .cse2) 0)) (or (= (select |c_old(#valid)| .cse4) 0) (= .cse4 |c_append_to_queue_#in~q.base|) (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|) (<= (+ .cse4 1) |c_#StackHeapBarrier|)) (or (= (select |c_old(#valid)| .cse5) 0) (= |c_#memory_$Pointer$.base| .cse6) (= .cse5 |c_append_to_queue_#in~q.base|) (<= (+ .cse5 1) |c_#StackHeapBarrier|)) (or (= |c_#memory_$Pointer$.base| .cse7) (<= (+ .cse8 1) |c_#StackHeapBarrier|) (= (select |c_old(#valid)| .cse8) 0) (= .cse8 |c_append_to_queue_#in~q.base|)) (or (= (select |c_old(#valid)| .cse9) 0) (= .cse10 |c_#memory_$Pointer$.base|) (<= (+ .cse9 1) |c_#StackHeapBarrier|) (= .cse9 |c_append_to_queue_#in~q.base|)) (or (= .cse11 |c_#memory_$Pointer$.offset|) (= (select |c_old(#valid)| .cse12) 0) (<= (+ .cse12 1) |c_#StackHeapBarrier|) (= .cse12 |c_append_to_queue_#in~q.base|)) (or (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|) (= (select |c_old(#valid)| .cse13) 0) (= .cse13 |c_append_to_queue_#in~q.base|) (<= (+ .cse13 1) |c_#StackHeapBarrier|)) (or (= (select |c_old(#valid)| .cse14) 0) (= |c_#memory_$Pointer$.base| .cse15) (= .cse14 |c_append_to_queue_#in~q.base|) (<= (+ .cse14 1) |c_#StackHeapBarrier|)) (= |c_#memory_$Pointer$.offset| (store .cse16 .cse17 (select |c_#memory_$Pointer$.offset| .cse17))) (or (= (select |c_old(#valid)| .cse17) 0) (= .cse17 |c_append_to_queue_#in~q.base|) (<= (+ .cse17 1) |c_#StackHeapBarrier|) (= .cse16 |c_#memory_$Pointer$.offset|)) (= |c_#memory_$Pointer$.base| (store .cse18 .cse19 (select |c_#memory_$Pointer$.base| .cse19))) (or (= (select |c_old(#valid)| .cse20) 0) (<= (+ .cse20 1) |c_#StackHeapBarrier|) (= .cse21 |c_#memory_$Pointer$.offset|) (= .cse20 |c_append_to_queue_#in~q.base|)) (or (= .cse22 |c_append_to_queue_#in~q.base|) (= |c_#memory_$Pointer$.offset| .cse23) (= (select |c_old(#valid)| .cse22) 0) (<= (+ .cse22 1) |c_#StackHeapBarrier|)) (or (= |c_#memory_$Pointer$.base| .cse18) (<= (+ .cse19 1) |c_#StackHeapBarrier|) (= (select |c_old(#valid)| .cse19) 0) (= |c_append_to_queue_#in~q.base| .cse19)) (or (= .cse24 |c_append_to_queue_#in~q.base|) (= |c_#memory_$Pointer$.offset| .cse25) (= (select |c_old(#valid)| .cse24) 0) (<= (+ .cse24 1) |c_#StackHeapBarrier|)))))))))))))))) is different from true [2022-11-02 20:55:28,224 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 20:55:30,566 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 20:55:30,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:55:30,614 INFO L93 Difference]: Finished difference Result 126 states and 161 transitions. [2022-11-02 20:55:30,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-02 20:55:30,619 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 12 states have internal predecessors, (32), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 23 [2022-11-02 20:55:30,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:55:30,620 INFO L225 Difference]: With dead ends: 126 [2022-11-02 20:55:30,620 INFO L226 Difference]: Without dead ends: 103 [2022-11-02 20:55:30,620 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 22.9s TimeCoverageRelationStatistics Valid=74, Invalid=203, Unknown=3, NotChecked=62, Total=342 [2022-11-02 20:55:30,621 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 31 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 17 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 85 IncrementalHoareTripleChecker+Unchecked, 6.7s IncrementalHoareTripleChecker+Time [2022-11-02 20:55:30,621 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 216 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 87 Invalid, 2 Unknown, 85 Unchecked, 6.7s Time] [2022-11-02 20:55:30,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2022-11-02 20:55:30,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 94. [2022-11-02 20:55:30,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 83 states have (on average 1.3012048192771084) internal successors, (108), 84 states have internal predecessors, (108), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-11-02 20:55:30,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 122 transitions. [2022-11-02 20:55:30,635 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 122 transitions. Word has length 23 [2022-11-02 20:55:30,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:55:30,636 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 122 transitions. [2022-11-02 20:55:30,636 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 12 states have internal predecessors, (32), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-02 20:55:30,636 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 122 transitions. [2022-11-02 20:55:30,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-02 20:55:30,637 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:55:30,638 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:55:30,678 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4732baf-1759-4940-9141-35ec0526b567/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-02 20:55:30,862 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4732baf-1759-4940-9141-35ec0526b567/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:55:30,862 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:55:30,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:55:30,863 INFO L85 PathProgramCache]: Analyzing trace with hash -1306051597, now seen corresponding path program 2 times [2022-11-02 20:55:30,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:55:30,863 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531774466] [2022-11-02 20:55:30,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:55:30,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:55:30,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:31,387 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-02 20:55:31,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:55:31,388 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531774466] [2022-11-02 20:55:31,388 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [531774466] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:55:31,388 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1946192143] [2022-11-02 20:55:31,388 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-02 20:55:31,388 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:55:31,388 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4732baf-1759-4940-9141-35ec0526b567/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:55:31,391 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4732baf-1759-4940-9141-35ec0526b567/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:55:31,419 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4732baf-1759-4940-9141-35ec0526b567/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-02 20:55:31,605 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-02 20:55:31,605 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-02 20:55:31,607 INFO L263 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 59 conjunts are in the unsatisfiable core [2022-11-02 20:55:31,616 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:55:31,636 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 20:55:31,636 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2022-11-02 20:55:31,694 INFO L356 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2022-11-02 20:55:31,694 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 29 treesize of output 37 [2022-11-02 20:55:31,710 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-02 20:55:31,717 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-02 20:55:31,777 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2022-11-02 20:55:31,788 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-02 20:55:31,796 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-02 20:55:31,857 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 17 [2022-11-02 20:55:31,892 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-02 20:55:31,892 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-11-02 20:55:31,902 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-02 20:55:31,923 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-02 20:55:31,924 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-11-02 20:55:31,934 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-02 20:55:31,956 INFO L356 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-11-02 20:55:31,957 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2022-11-02 20:55:31,977 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-02 20:55:31,985 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-02 20:55:32,021 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-02 20:55:32,025 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-02 20:55:32,029 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-02 20:55:32,029 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:55:32,071 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1378 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_receive_~#packet~0#1.base| v_ArrVal_1378) |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|) 0)) (forall ((v_ArrVal_1376 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_receive_~#packet~0#1.base| v_ArrVal_1376) |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|) 0))) is different from false [2022-11-02 20:55:34,885 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 2 not checked. [2022-11-02 20:55:34,886 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1946192143] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:55:34,886 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:55:34,886 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 14 [2022-11-02 20:55:34,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91935437] [2022-11-02 20:55:34,887 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:55:34,887 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-02 20:55:34,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:55:34,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-02 20:55:34,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=102, Unknown=4, NotChecked=22, Total=182 [2022-11-02 20:55:34,888 INFO L87 Difference]: Start difference. First operand 94 states and 122 transitions. Second operand has 14 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 14 states have internal predecessors, (39), 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:55:35,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:55:35,034 INFO L93 Difference]: Finished difference Result 131 states and 169 transitions. [2022-11-02 20:55:35,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 20:55:35,034 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 14 states have internal predecessors, (39), 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) Word has length 23 [2022-11-02 20:55:35,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:55:35,035 INFO L225 Difference]: With dead ends: 131 [2022-11-02 20:55:35,036 INFO L226 Difference]: Without dead ends: 108 [2022-11-02 20:55:35,036 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 40 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=4, NotChecked=24, Total=210 [2022-11-02 20:55:35,037 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 58 mSDsluCounter, 210 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 91 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:55:35,037 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 267 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 76 Invalid, 0 Unknown, 91 Unchecked, 0.1s Time] [2022-11-02 20:55:35,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2022-11-02 20:55:35,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 94. [2022-11-02 20:55:35,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 83 states have (on average 1.3012048192771084) internal successors, (108), 84 states have internal predecessors, (108), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-11-02 20:55:35,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 122 transitions. [2022-11-02 20:55:35,052 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 122 transitions. Word has length 23 [2022-11-02 20:55:35,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:55:35,052 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 122 transitions. [2022-11-02 20:55:35,053 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 14 states have internal predecessors, (39), 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:55:35,053 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 122 transitions. [2022-11-02 20:55:35,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-02 20:55:35,054 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:55:35,054 INFO L195 NwaCegarLoop]: trace histogram [2, 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:55:35,099 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4732baf-1759-4940-9141-35ec0526b567/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-02 20:55:35,271 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4732baf-1759-4940-9141-35ec0526b567/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-11-02 20:55:35,271 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:55:35,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:55:35,272 INFO L85 PathProgramCache]: Analyzing trace with hash -1130104883, now seen corresponding path program 1 times [2022-11-02 20:55:35,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:55:35,272 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198235024] [2022-11-02 20:55:35,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:55:35,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:55:35,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:35,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-11-02 20:55:35,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:35,588 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:55:35,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:55:35,588 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198235024] [2022-11-02 20:55:35,589 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [198235024] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:55:35,589 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:55:35,589 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 20:55:35,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253868221] [2022-11-02 20:55:35,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:55:35,592 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:55:35,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:55:35,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:55:35,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:55:35,593 INFO L87 Difference]: Start difference. First operand 94 states and 122 transitions. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:55:35,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:55:35,899 INFO L93 Difference]: Finished difference Result 121 states and 154 transitions. [2022-11-02 20:55:35,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 20:55:35,899 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2022-11-02 20:55:35,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:55:35,900 INFO L225 Difference]: With dead ends: 121 [2022-11-02 20:55:35,900 INFO L226 Difference]: Without dead ends: 108 [2022-11-02 20:55:35,901 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:55:35,901 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 17 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:55:35,901 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 186 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-02 20:55:35,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2022-11-02 20:55:35,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 99. [2022-11-02 20:55:35,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 88 states have (on average 1.2727272727272727) internal successors, (112), 89 states have internal predecessors, (112), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-11-02 20:55:35,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 126 transitions. [2022-11-02 20:55:35,921 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 126 transitions. Word has length 24 [2022-11-02 20:55:35,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:55:35,921 INFO L495 AbstractCegarLoop]: Abstraction has 99 states and 126 transitions. [2022-11-02 20:55:35,921 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:55:35,922 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 126 transitions. [2022-11-02 20:55:35,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-02 20:55:35,924 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:55:35,924 INFO L195 NwaCegarLoop]: trace histogram [2, 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:55:35,924 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-02 20:55:35,925 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:55:35,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:55:35,925 INFO L85 PathProgramCache]: Analyzing trace with hash -28321902, now seen corresponding path program 1 times [2022-11-02 20:55:35,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:55:35,926 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379194854] [2022-11-02 20:55:35,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:55:35,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:55:35,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:36,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-02 20:55:36,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:36,941 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:55:36,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:55:36,942 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379194854] [2022-11-02 20:55:36,942 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1379194854] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:55:36,942 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1770579198] [2022-11-02 20:55:36,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:55:36,942 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:55:36,943 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4732baf-1759-4940-9141-35ec0526b567/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:55:36,944 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4732baf-1759-4940-9141-35ec0526b567/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:55:36,959 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4732baf-1759-4940-9141-35ec0526b567/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-02 20:55:37,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:37,190 INFO L263 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 66 conjunts are in the unsatisfiable core [2022-11-02 20:55:37,195 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:55:37,361 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2022-11-02 20:55:37,473 INFO L356 Elim1Store]: treesize reduction 40, result has 42.9 percent of original size [2022-11-02 20:55:37,474 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 64 [2022-11-02 20:55:37,522 INFO L356 Elim1Store]: treesize reduction 26, result has 42.2 percent of original size [2022-11-02 20:55:37,522 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 74 [2022-11-02 20:55:37,568 INFO L356 Elim1Store]: treesize reduction 26, result has 42.2 percent of original size [2022-11-02 20:55:37,569 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 74 [2022-11-02 20:55:37,626 INFO L356 Elim1Store]: treesize reduction 20, result has 57.4 percent of original size [2022-11-02 20:55:37,627 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 60 [2022-11-02 20:55:37,643 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-11-02 20:55:37,658 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-11-02 20:55:37,677 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-11-02 20:55:37,692 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-11-02 20:55:37,772 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-02 20:55:37,820 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 15 [2022-11-02 20:55:37,826 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-02 20:55:37,896 INFO L356 Elim1Store]: treesize reduction 33, result has 2.9 percent of original size [2022-11-02 20:55:37,896 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 158 treesize of output 98 [2022-11-02 20:55:37,901 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 68 [2022-11-02 20:55:38,224 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 26 [2022-11-02 20:55:38,233 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-02 20:55:38,334 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 27 [2022-11-02 20:55:38,343 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:55:38,343 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:55:38,776 INFO L356 Elim1Store]: treesize reduction 41, result has 62.0 percent of original size [2022-11-02 20:55:38,777 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 7 case distinctions, treesize of input 115 treesize of output 92 [2022-11-02 20:55:38,805 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-02 20:55:38,806 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 86 treesize of output 62 [2022-11-02 20:55:38,815 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2022-11-02 20:55:38,997 INFO L356 Elim1Store]: treesize reduction 107, result has 0.9 percent of original size [2022-11-02 20:55:38,997 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 7 case distinctions, treesize of input 115 treesize of output 1 [2022-11-02 20:55:39,195 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:55:39,195 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1770579198] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:55:39,195 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:55:39,195 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 11] total 24 [2022-11-02 20:55:39,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965485632] [2022-11-02 20:55:39,196 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:55:39,196 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-11-02 20:55:39,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:55:39,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-11-02 20:55:39,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=457, Unknown=0, NotChecked=0, Total=552 [2022-11-02 20:55:39,197 INFO L87 Difference]: Start difference. First operand 99 states and 126 transitions. Second operand has 24 states, 21 states have (on average 2.5714285714285716) internal successors, (54), 23 states have internal predecessors, (54), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-02 20:55:40,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:55:40,433 INFO L93 Difference]: Finished difference Result 124 states and 157 transitions. [2022-11-02 20:55:40,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-02 20:55:40,433 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 21 states have (on average 2.5714285714285716) internal successors, (54), 23 states have internal predecessors, (54), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Word has length 25 [2022-11-02 20:55:40,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:55:40,434 INFO L225 Difference]: With dead ends: 124 [2022-11-02 20:55:40,435 INFO L226 Difference]: Without dead ends: 122 [2022-11-02 20:55:40,435 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 36 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 174 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=162, Invalid=708, Unknown=0, NotChecked=0, Total=870 [2022-11-02 20:55:40,436 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 121 mSDsluCounter, 434 mSDsCounter, 0 mSdLazyCounter, 470 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 482 SdHoareTripleChecker+Invalid, 539 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 470 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 40 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:55:40,436 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 482 Invalid, 539 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 470 Invalid, 0 Unknown, 40 Unchecked, 1.0s Time] [2022-11-02 20:55:40,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2022-11-02 20:55:40,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 110. [2022-11-02 20:55:40,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 99 states have (on average 1.2727272727272727) internal successors, (126), 100 states have internal predecessors, (126), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-11-02 20:55:40,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 140 transitions. [2022-11-02 20:55:40,453 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 140 transitions. Word has length 25 [2022-11-02 20:55:40,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:55:40,453 INFO L495 AbstractCegarLoop]: Abstraction has 110 states and 140 transitions. [2022-11-02 20:55:40,453 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 21 states have (on average 2.5714285714285716) internal successors, (54), 23 states have internal predecessors, (54), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-02 20:55:40,454 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 140 transitions. [2022-11-02 20:55:40,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-02 20:55:40,454 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:55:40,454 INFO L195 NwaCegarLoop]: trace histogram [2, 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:55:40,499 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4732baf-1759-4940-9141-35ec0526b567/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-11-02 20:55:40,690 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4732baf-1759-4940-9141-35ec0526b567/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-11-02 20:55:40,690 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:55:40,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:55:40,691 INFO L85 PathProgramCache]: Analyzing trace with hash -28319980, now seen corresponding path program 1 times [2022-11-02 20:55:40,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:55:40,692 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667238324] [2022-11-02 20:55:40,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:55:40,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:55:40,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:41,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-02 20:55:41,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:41,772 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:55:41,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:55:41,772 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667238324] [2022-11-02 20:55:41,772 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [667238324] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:55:41,773 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [869143274] [2022-11-02 20:55:41,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:55:41,773 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:55:41,773 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4732baf-1759-4940-9141-35ec0526b567/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:55:41,775 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4732baf-1759-4940-9141-35ec0526b567/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:55:41,799 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4732baf-1759-4940-9141-35ec0526b567/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-02 20:55:42,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:42,062 INFO L263 TraceCheckSpWp]: Trace formula consists of 366 conjuncts, 72 conjunts are in the unsatisfiable core [2022-11-02 20:55:42,069 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:55:42,179 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 15 [2022-11-02 20:55:42,380 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-02 20:55:42,380 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 10 [2022-11-02 20:55:42,505 INFO L356 Elim1Store]: treesize reduction 40, result has 42.9 percent of original size [2022-11-02 20:55:42,505 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 64 [2022-11-02 20:55:42,554 INFO L356 Elim1Store]: treesize reduction 26, result has 42.2 percent of original size [2022-11-02 20:55:42,554 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 74 [2022-11-02 20:55:42,600 INFO L356 Elim1Store]: treesize reduction 26, result has 42.2 percent of original size [2022-11-02 20:55:42,600 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 74 [2022-11-02 20:55:42,654 INFO L356 Elim1Store]: treesize reduction 20, result has 57.4 percent of original size [2022-11-02 20:55:42,655 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 60 [2022-11-02 20:55:42,670 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-11-02 20:55:42,684 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-11-02 20:55:42,700 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-11-02 20:55:42,717 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-11-02 20:55:42,790 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-02 20:55:42,821 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:55:42,824 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 5 [2022-11-02 20:55:42,830 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-02 20:55:42,884 INFO L356 Elim1Store]: treesize reduction 33, result has 2.9 percent of original size [2022-11-02 20:55:42,884 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 92 treesize of output 42 [2022-11-02 20:55:42,889 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2022-11-02 20:55:43,128 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-11-02 20:55:43,134 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-02 20:55:43,170 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 21 [2022-11-02 20:55:43,173 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:55:43,173 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:55:43,724 INFO L356 Elim1Store]: treesize reduction 41, result has 62.0 percent of original size [2022-11-02 20:55:43,724 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 7 case distinctions, treesize of input 57 treesize of output 79 [2022-11-02 20:55:43,735 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-02 20:55:43,736 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 68 treesize of output 48 [2022-11-02 20:55:43,743 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2022-11-02 20:55:43,896 INFO L356 Elim1Store]: treesize reduction 107, result has 0.9 percent of original size [2022-11-02 20:55:43,897 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 7 case distinctions, treesize of input 57 treesize of output 1 [2022-11-02 20:55:44,170 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 553 treesize of output 517 [2022-11-02 20:55:44,668 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 364 treesize of output 340 [2022-11-02 20:55:44,951 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:55:44,952 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [869143274] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:55:44,952 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:55:44,952 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 13] total 32 [2022-11-02 20:55:44,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263376963] [2022-11-02 20:55:44,953 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:55:44,953 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-11-02 20:55:44,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:55:44,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-11-02 20:55:44,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=867, Unknown=0, NotChecked=0, Total=992 [2022-11-02 20:55:44,954 INFO L87 Difference]: Start difference. First operand 110 states and 140 transitions. Second operand has 32 states, 29 states have (on average 2.103448275862069) internal successors, (61), 31 states have internal predecessors, (61), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-02 20:55:46,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:55:46,380 INFO L93 Difference]: Finished difference Result 152 states and 193 transitions. [2022-11-02 20:55:46,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-11-02 20:55:46,380 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 29 states have (on average 2.103448275862069) internal successors, (61), 31 states have internal predecessors, (61), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 25 [2022-11-02 20:55:46,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:55:46,382 INFO L225 Difference]: With dead ends: 152 [2022-11-02 20:55:46,382 INFO L226 Difference]: Without dead ends: 140 [2022-11-02 20:55:46,382 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 420 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=204, Invalid=1518, Unknown=0, NotChecked=0, Total=1722 [2022-11-02 20:55:46,384 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 37 mSDsluCounter, 660 mSDsCounter, 0 mSdLazyCounter, 489 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 706 SdHoareTripleChecker+Invalid, 551 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 489 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 44 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:55:46,384 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 706 Invalid, 551 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 489 Invalid, 0 Unknown, 44 Unchecked, 1.0s Time] [2022-11-02 20:55:46,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2022-11-02 20:55:46,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 121. [2022-11-02 20:55:46,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 109 states have (on average 1.275229357798165) internal successors, (139), 110 states have internal predecessors, (139), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-11-02 20:55:46,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 155 transitions. [2022-11-02 20:55:46,405 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 155 transitions. Word has length 25 [2022-11-02 20:55:46,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:55:46,406 INFO L495 AbstractCegarLoop]: Abstraction has 121 states and 155 transitions. [2022-11-02 20:55:46,406 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 29 states have (on average 2.103448275862069) internal successors, (61), 31 states have internal predecessors, (61), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-02 20:55:46,406 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 155 transitions. [2022-11-02 20:55:46,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-02 20:55:46,408 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:55:46,408 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:55:46,448 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4732baf-1759-4940-9141-35ec0526b567/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-02 20:55:46,623 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4732baf-1759-4940-9141-35ec0526b567/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-11-02 20:55:46,623 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:55:46,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:55:46,623 INFO L85 PathProgramCache]: Analyzing trace with hash -1025087574, now seen corresponding path program 2 times [2022-11-02 20:55:46,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:55:46,624 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155994056] [2022-11-02 20:55:46,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:55:46,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:55:46,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:47,094 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:55:47,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:55:47,095 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155994056] [2022-11-02 20:55:47,095 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1155994056] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:55:47,095 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1917439678] [2022-11-02 20:55:47,095 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-02 20:55:47,095 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:55:47,096 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4732baf-1759-4940-9141-35ec0526b567/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:55:47,097 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4732baf-1759-4940-9141-35ec0526b567/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:55:47,115 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4732baf-1759-4940-9141-35ec0526b567/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-02 20:55:47,368 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-02 20:55:47,369 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-02 20:55:47,371 INFO L263 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 55 conjunts are in the unsatisfiable core [2022-11-02 20:55:47,375 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:55:47,393 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-02 20:55:47,393 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 15 [2022-11-02 20:55:47,444 INFO L356 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2022-11-02 20:55:47,444 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 29 treesize of output 37 [2022-11-02 20:55:47,459 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-02 20:55:47,466 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-02 20:55:47,527 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2022-11-02 20:55:47,537 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-02 20:55:47,544 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-02 20:55:47,603 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 17 [2022-11-02 20:55:47,635 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-02 20:55:47,636 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-11-02 20:55:47,644 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-02 20:55:47,664 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-02 20:55:47,664 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-11-02 20:55:47,671 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-02 20:55:47,691 INFO L356 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-11-02 20:55:47,691 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2022-11-02 20:55:47,709 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-02 20:55:47,712 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-02 20:55:47,753 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-02 20:55:47,755 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-02 20:55:47,759 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-02 20:55:47,760 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:55:47,806 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2297 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_receive_~#packet~0#1.base| v_ArrVal_2297) |c_ULTIMATE.start_main_~#normal_queue~0#1.base|) |c_ULTIMATE.start_main_~#normal_queue~0#1.offset|) 0)) (forall ((v_ArrVal_2294 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_receive_~#packet~0#1.base| v_ArrVal_2294) |c_ULTIMATE.start_main_~#normal_queue~0#1.base|) |c_ULTIMATE.start_main_~#normal_queue~0#1.offset|) 0))) is different from false [2022-11-02 20:55:50,658 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 7 refuted. 2 times theorem prover too weak. 0 trivial. 2 not checked. [2022-11-02 20:55:50,660 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1917439678] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:55:50,660 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:55:50,660 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 9] total 16 [2022-11-02 20:55:50,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567213158] [2022-11-02 20:55:50,661 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:55:50,661 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-11-02 20:55:50,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:55:50,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-11-02 20:55:50,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=137, Unknown=8, NotChecked=26, Total=240 [2022-11-02 20:55:50,662 INFO L87 Difference]: Start difference. First operand 121 states and 155 transitions. Second operand has 16 states, 16 states have (on average 2.75) internal successors, (44), 16 states have internal predecessors, (44), 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:55:50,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:55:50,901 INFO L93 Difference]: Finished difference Result 139 states and 177 transitions. [2022-11-02 20:55:50,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:55:50,902 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.75) internal successors, (44), 16 states have internal predecessors, (44), 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) Word has length 25 [2022-11-02 20:55:50,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:55:50,903 INFO L225 Difference]: With dead ends: 139 [2022-11-02 20:55:50,903 INFO L226 Difference]: Without dead ends: 123 [2022-11-02 20:55:50,903 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=77, Invalid=159, Unknown=8, NotChecked=28, Total=272 [2022-11-02 20:55:50,904 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 27 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 305 SdHoareTripleChecker+Invalid, 211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 113 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:55:50,905 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 305 Invalid, 211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 92 Invalid, 0 Unknown, 113 Unchecked, 0.2s Time] [2022-11-02 20:55:50,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2022-11-02 20:55:50,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 113. [2022-11-02 20:55:50,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 101 states have (on average 1.2772277227722773) internal successors, (129), 102 states have internal predecessors, (129), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-11-02 20:55:50,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 145 transitions. [2022-11-02 20:55:50,925 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 145 transitions. Word has length 25 [2022-11-02 20:55:50,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:55:50,925 INFO L495 AbstractCegarLoop]: Abstraction has 113 states and 145 transitions. [2022-11-02 20:55:50,925 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.75) internal successors, (44), 16 states have internal predecessors, (44), 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:55:50,926 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 145 transitions. [2022-11-02 20:55:50,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-02 20:55:50,927 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:55:50,928 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:55:50,966 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4732baf-1759-4940-9141-35ec0526b567/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-02 20:55:51,143 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4732baf-1759-4940-9141-35ec0526b567/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-11-02 20:55:51,143 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:55:51,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:55:51,143 INFO L85 PathProgramCache]: Analyzing trace with hash 1069112326, now seen corresponding path program 1 times [2022-11-02 20:55:51,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:55:51,144 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043971212] [2022-11-02 20:55:51,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:55:51,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:55:51,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:52,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-11-02 20:55:52,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:53,478 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:55:53,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:55:53,478 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043971212] [2022-11-02 20:55:53,478 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2043971212] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:55:53,478 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [186286225] [2022-11-02 20:55:53,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:55:53,479 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:55:53,479 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4732baf-1759-4940-9141-35ec0526b567/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:55:53,480 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4732baf-1759-4940-9141-35ec0526b567/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:55:53,510 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4732baf-1759-4940-9141-35ec0526b567/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-02 20:55:53,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:53,826 INFO L263 TraceCheckSpWp]: Trace formula consists of 439 conjuncts, 101 conjunts are in the unsatisfiable core [2022-11-02 20:55:53,833 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:55:53,854 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 20:55:53,854 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2022-11-02 20:55:53,943 INFO L356 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2022-11-02 20:55:53,943 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 29 treesize of output 37 [2022-11-02 20:55:54,029 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2022-11-02 20:55:54,155 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2022-11-02 20:55:54,212 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-02 20:55:54,298 INFO L356 Elim1Store]: treesize reduction 40, result has 42.9 percent of original size [2022-11-02 20:55:54,298 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 64 [2022-11-02 20:55:54,359 INFO L356 Elim1Store]: treesize reduction 26, result has 42.2 percent of original size [2022-11-02 20:55:54,360 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 74 [2022-11-02 20:55:54,411 INFO L356 Elim1Store]: treesize reduction 20, result has 57.4 percent of original size [2022-11-02 20:55:54,412 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 60 [2022-11-02 20:55:54,430 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-11-02 20:55:54,474 INFO L356 Elim1Store]: treesize reduction 42, result has 45.5 percent of original size [2022-11-02 20:55:54,475 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 52 treesize of output 114 [2022-11-02 20:55:54,492 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-11-02 20:55:54,510 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-11-02 20:55:54,534 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-11-02 20:55:54,630 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-02 20:55:54,664 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 19 [2022-11-02 20:55:54,672 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2022-11-02 20:55:54,742 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:55:54,743 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 5 [2022-11-02 20:55:54,750 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-02 20:56:02,573 WARN L234 SmtUtils]: Spent 7.52s on a formula simplification that was a NOOP. DAG size: 89 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-02 20:56:02,978 INFO L356 Elim1Store]: treesize reduction 232, result has 33.5 percent of original size [2022-11-02 20:56:02,978 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 13 case distinctions, treesize of input 202 treesize of output 341 [2022-11-02 20:56:03,156 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 170 treesize of output 154 [2022-11-02 20:56:18,302 WARN L234 SmtUtils]: Spent 14.38s on a formula simplification. DAG size of input: 161 DAG size of output: 88 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-02 20:56:18,437 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:56:18,444 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 3721 treesize of output 3713 [2022-11-02 20:56:21,017 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-02 20:56:21,017 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 77 treesize of output 71 [2022-11-02 20:56:21,023 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:56:21,027 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:56:21,028 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:56:21,043 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-02 20:56:21,044 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 30 [2022-11-02 20:56:21,047 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-02 20:56:21,054 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-02 20:56:21,063 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:56:21,065 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-11-02 20:56:21,079 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 24 [2022-11-02 20:56:21,109 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-02 20:56:21,109 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2022-11-02 20:56:21,236 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-02 20:56:21,243 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 40 [2022-11-02 20:56:21,251 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:56:21,251 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2022-11-02 20:56:21,375 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 22 [2022-11-02 20:56:21,382 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-02 20:56:21,442 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 27 [2022-11-02 20:56:21,482 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:56:21,482 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:56:21,605 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2637 (Array Int Int)) (v_ArrVal_2640 (Array Int Int)) (v_ArrVal_2639 (Array Int Int))) (= (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_receive_~#packet~0#1.base| v_ArrVal_2637) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_receive_~#packet~0#1.base| v_ArrVal_2639) |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|)) (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_receive_~#packet~0#1.base| v_ArrVal_2640) |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|) 4)) 4294967296) 1)) is different from false [2022-11-02 20:56:21,633 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2637 (Array Int Int)) (|v_ULTIMATE.start_main_~#new_packet~0#1.base_32| Int) (|v_ULTIMATE.start_receive_~#packet~0#1.base_27| Int) (v_ArrVal_2640 (Array Int Int)) (v_ArrVal_2639 (Array Int Int))) (or (not (< |c_#StackHeapBarrier| |v_ULTIMATE.start_receive_~#packet~0#1.base_27|)) (not (= (select (store |c_#valid| |v_ULTIMATE.start_main_~#new_packet~0#1.base_32| 1) |v_ULTIMATE.start_receive_~#packet~0#1.base_27|) 0)) (= (mod (select (select (store |c_#memory_int| |v_ULTIMATE.start_receive_~#packet~0#1.base_27| v_ArrVal_2637) (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_receive_~#packet~0#1.base_27| v_ArrVal_2639) |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|)) (+ (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_receive_~#packet~0#1.base_27| v_ArrVal_2640) |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|) 4)) 4294967296) 1))) is different from false [2022-11-02 20:56:21,667 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2637 (Array Int Int)) (|v_ULTIMATE.start_main_~#new_packet~0#1.base_32| Int) (|v_ULTIMATE.start_receive_~#packet~0#1.base_27| Int) (v_ArrVal_2640 (Array Int Int)) (v_ArrVal_2631 Int) (v_ArrVal_2639 (Array Int Int))) (or (not (< |c_#StackHeapBarrier| |v_ULTIMATE.start_receive_~#packet~0#1.base_27|)) (not (= (select (store (store |c_#valid| |c_ULTIMATE.start_main_~#new_packet~0#1.base| v_ArrVal_2631) |v_ULTIMATE.start_main_~#new_packet~0#1.base_32| 1) |v_ULTIMATE.start_receive_~#packet~0#1.base_27|) 0)) (= (mod (select (select (store |c_#memory_int| |v_ULTIMATE.start_receive_~#packet~0#1.base_27| v_ArrVal_2637) (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_receive_~#packet~0#1.base_27| v_ArrVal_2639) |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|)) (+ (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_receive_~#packet~0#1.base_27| v_ArrVal_2640) |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|) 4)) 4294967296) 1))) is different from false [2022-11-02 20:56:22,311 INFO L356 Elim1Store]: treesize reduction 41, result has 62.0 percent of original size [2022-11-02 20:56:22,312 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 7 case distinctions, treesize of input 104 treesize of output 126 [2022-11-02 20:56:22,337 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:56:22,552 INFO L356 Elim1Store]: treesize reduction 66, result has 62.7 percent of original size [2022-11-02 20:56:22,553 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 3 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 18 case distinctions, treesize of input 296 treesize of output 362 [2022-11-02 20:56:22,577 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 225 treesize of output 191 [2022-11-02 20:56:22,593 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 278 treesize of output 258 [2022-11-02 20:56:22,624 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:56:22,625 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 132 treesize of output 129 [2022-11-02 20:56:22,670 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:56:22,671 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 182 treesize of output 178 [2022-11-02 20:56:23,100 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [186286225] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:56:23,100 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-02 20:56:23,100 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15] total 29 [2022-11-02 20:56:23,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327102673] [2022-11-02 20:56:23,100 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-02 20:56:23,101 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-11-02 20:56:23,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:56:23,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-11-02 20:56:23,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=888, Unknown=3, NotChecked=186, Total=1190 [2022-11-02 20:56:23,102 INFO L87 Difference]: Start difference. First operand 113 states and 145 transitions. Second operand has 29 states, 27 states have (on average 1.8888888888888888) internal successors, (51), 27 states have internal predecessors, (51), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-02 20:56:40,026 WARN L234 SmtUtils]: Spent 15.91s on a formula simplification. DAG size of input: 119 DAG size of output: 104 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-02 20:56:41,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:56:41,939 INFO L93 Difference]: Finished difference Result 256 states and 336 transitions. [2022-11-02 20:56:41,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-11-02 20:56:41,939 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 27 states have (on average 1.8888888888888888) internal successors, (51), 27 states have internal predecessors, (51), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 29 [2022-11-02 20:56:41,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:56:41,941 INFO L225 Difference]: With dead ends: 256 [2022-11-02 20:56:41,941 INFO L226 Difference]: Without dead ends: 179 [2022-11-02 20:56:41,942 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 446 ImplicationChecksByTransitivity, 41.0s TimeCoverageRelationStatistics Valid=334, Invalid=2225, Unknown=3, NotChecked=300, Total=2862 [2022-11-02 20:56:41,943 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 123 mSDsluCounter, 624 mSDsCounter, 0 mSdLazyCounter, 870 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 679 SdHoareTripleChecker+Invalid, 1064 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 870 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 163 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:56:41,943 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 679 Invalid, 1064 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 870 Invalid, 0 Unknown, 163 Unchecked, 1.2s Time] [2022-11-02 20:56:41,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2022-11-02 20:56:41,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 135. [2022-11-02 20:56:41,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 123 states have (on average 1.3008130081300813) internal successors, (160), 124 states have internal predecessors, (160), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-11-02 20:56:41,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 176 transitions. [2022-11-02 20:56:41,966 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 176 transitions. Word has length 29 [2022-11-02 20:56:41,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:56:41,966 INFO L495 AbstractCegarLoop]: Abstraction has 135 states and 176 transitions. [2022-11-02 20:56:41,967 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 27 states have (on average 1.8888888888888888) internal successors, (51), 27 states have internal predecessors, (51), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-02 20:56:41,967 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 176 transitions. [2022-11-02 20:56:41,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-02 20:56:41,968 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:56:41,968 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:56:41,996 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4732baf-1759-4940-9141-35ec0526b567/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-02 20:56:42,176 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4732baf-1759-4940-9141-35ec0526b567/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-11-02 20:56:42,176 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:56:42,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:56:42,177 INFO L85 PathProgramCache]: Analyzing trace with hash 8968481, now seen corresponding path program 1 times [2022-11-02 20:56:42,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:56:42,177 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035522634] [2022-11-02 20:56:42,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:56:42,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:56:42,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:56:43,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-02 20:56:43,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:56:44,204 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:56:44,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:56:44,204 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035522634] [2022-11-02 20:56:44,205 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2035522634] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:56:44,205 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [839008070] [2022-11-02 20:56:44,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:56:44,205 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:56:44,205 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4732baf-1759-4940-9141-35ec0526b567/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:56:44,206 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4732baf-1759-4940-9141-35ec0526b567/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:56:44,211 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4732baf-1759-4940-9141-35ec0526b567/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-02 20:56:44,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:56:44,524 INFO L263 TraceCheckSpWp]: Trace formula consists of 440 conjuncts, 104 conjunts are in the unsatisfiable core [2022-11-02 20:56:44,532 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:56:44,551 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 20:56:44,551 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2022-11-02 20:56:44,627 INFO L356 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2022-11-02 20:56:44,627 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 29 treesize of output 37 [2022-11-02 20:56:44,715 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2022-11-02 20:56:44,999 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 12 [2022-11-02 20:56:45,072 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-02 20:56:45,167 INFO L356 Elim1Store]: treesize reduction 40, result has 42.9 percent of original size [2022-11-02 20:56:45,167 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 64 [2022-11-02 20:56:45,226 INFO L356 Elim1Store]: treesize reduction 20, result has 57.4 percent of original size [2022-11-02 20:56:45,226 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 60 [2022-11-02 20:56:45,271 INFO L356 Elim1Store]: treesize reduction 26, result has 42.2 percent of original size [2022-11-02 20:56:45,272 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 74 [2022-11-02 20:56:45,285 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-11-02 20:56:45,326 INFO L356 Elim1Store]: treesize reduction 26, result has 42.2 percent of original size [2022-11-02 20:56:45,327 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 74 [2022-11-02 20:56:45,345 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-11-02 20:56:45,361 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-11-02 20:56:45,393 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-11-02 20:56:45,453 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-02 20:56:45,486 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-02 20:56:45,525 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-02 20:56:45,561 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 19 [2022-11-02 20:56:45,569 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2022-11-02 20:56:45,627 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:56:45,628 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 5 [2022-11-02 20:56:45,634 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-02 20:56:46,215 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:56:46,270 INFO L356 Elim1Store]: treesize reduction 70, result has 38.6 percent of original size [2022-11-02 20:56:46,271 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 32 treesize of output 58 [2022-11-02 20:56:46,484 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-11-02 20:56:46,641 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-02 20:56:46,642 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2022-11-02 20:56:46,651 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 65 [2022-11-02 20:56:46,659 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:56:46,662 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:56:46,663 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:56:46,664 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 28 [2022-11-02 20:56:46,681 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-02 20:56:46,708 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:56:46,740 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-11-02 20:56:46,740 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 38 [2022-11-02 20:56:46,758 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2022-11-02 20:56:46,889 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 36 [2022-11-02 20:56:46,896 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:56:46,897 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2022-11-02 20:56:46,902 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-02 20:56:47,037 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 18 [2022-11-02 20:56:47,042 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-02 20:56:47,107 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:56:47,107 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:56:47,231 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3032 (Array Int Int)) (v_ArrVal_3033 (Array Int Int)) (v_ArrVal_3029 (Array Int Int))) (< (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_receive_~#packet~0#1.base| v_ArrVal_3029) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_receive_~#packet~0#1.base| v_ArrVal_3032) |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|)) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_receive_~#packet~0#1.base| v_ArrVal_3033) |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|)) 4294967296) 500)) is different from false [2022-11-02 20:56:47,262 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~#new_packet~0#1.base_34| Int) (v_ArrVal_3032 (Array Int Int)) (v_ArrVal_3033 (Array Int Int)) (v_ArrVal_3029 (Array Int Int)) (|v_ULTIMATE.start_receive_~#packet~0#1.base_30| Int)) (or (not (< |c_#StackHeapBarrier| |v_ULTIMATE.start_receive_~#packet~0#1.base_30|)) (not (= (select (store |c_#valid| |v_ULTIMATE.start_main_~#new_packet~0#1.base_34| 1) |v_ULTIMATE.start_receive_~#packet~0#1.base_30|) 0)) (< (mod (select (select (store |c_#memory_int| |v_ULTIMATE.start_receive_~#packet~0#1.base_30| v_ArrVal_3029) (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_receive_~#packet~0#1.base_30| v_ArrVal_3032) |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|)) (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_receive_~#packet~0#1.base_30| v_ArrVal_3033) |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|)) 4294967296) 500))) is different from false [2022-11-02 20:56:47,301 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~#new_packet~0#1.base_34| Int) (v_ArrVal_3032 (Array Int Int)) (v_ArrVal_3033 (Array Int Int)) (v_ArrVal_3029 (Array Int Int)) (v_ArrVal_3023 Int) (|v_ULTIMATE.start_receive_~#packet~0#1.base_30| Int)) (or (not (< |c_#StackHeapBarrier| |v_ULTIMATE.start_receive_~#packet~0#1.base_30|)) (not (= (select (store (store |c_#valid| |c_ULTIMATE.start_main_~#new_packet~0#1.base| v_ArrVal_3023) |v_ULTIMATE.start_main_~#new_packet~0#1.base_34| 1) |v_ULTIMATE.start_receive_~#packet~0#1.base_30|) 0)) (< (mod (select (select (store |c_#memory_int| |v_ULTIMATE.start_receive_~#packet~0#1.base_30| v_ArrVal_3029) (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_receive_~#packet~0#1.base_30| v_ArrVal_3032) |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|)) (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_receive_~#packet~0#1.base_30| v_ArrVal_3033) |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|)) 4294967296) 500))) is different from false [2022-11-02 20:56:47,786 INFO L356 Elim1Store]: treesize reduction 41, result has 62.0 percent of original size [2022-11-02 20:56:47,786 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 7 case distinctions, treesize of input 102 treesize of output 124 [2022-11-02 20:56:47,810 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:56:48,024 INFO L356 Elim1Store]: treesize reduction 66, result has 61.8 percent of original size [2022-11-02 20:56:48,024 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 3 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 18 case distinctions, treesize of input 284 treesize of output 350 [2022-11-02 20:56:48,042 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 294 treesize of output 274 [2022-11-02 20:56:48,059 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 207 treesize of output 173 [2022-11-02 20:56:48,091 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:56:48,091 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 186 treesize of output 186 [2022-11-02 20:56:48,136 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:56:48,136 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 122 treesize of output 123 [2022-11-02 20:56:48,495 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [839008070] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:56:48,495 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-02 20:56:48,495 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16] total 30 [2022-11-02 20:56:48,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407707322] [2022-11-02 20:56:48,495 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-02 20:56:48,497 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-11-02 20:56:48,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:56:48,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-11-02 20:56:48,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=940, Unknown=3, NotChecked=192, Total=1260 [2022-11-02 20:56:48,498 INFO L87 Difference]: Start difference. First operand 135 states and 176 transitions. Second operand has 30 states, 28 states have (on average 1.8928571428571428) internal successors, (53), 28 states have internal predecessors, (53), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-02 20:56:50,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:56:50,490 INFO L93 Difference]: Finished difference Result 179 states and 236 transitions. [2022-11-02 20:56:50,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-02 20:56:50,491 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 28 states have (on average 1.8928571428571428) internal successors, (53), 28 states have internal predecessors, (53), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 30 [2022-11-02 20:56:50,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:56:50,493 INFO L225 Difference]: With dead ends: 179 [2022-11-02 20:56:50,493 INFO L226 Difference]: Without dead ends: 177 [2022-11-02 20:56:50,494 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 429 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=237, Invalid=1842, Unknown=3, NotChecked=270, Total=2352 [2022-11-02 20:56:50,494 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 40 mSDsluCounter, 652 mSDsCounter, 0 mSdLazyCounter, 337 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 700 SdHoareTripleChecker+Invalid, 583 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 337 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 224 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-02 20:56:50,495 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 700 Invalid, 583 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 337 Invalid, 0 Unknown, 224 Unchecked, 0.7s Time] [2022-11-02 20:56:50,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2022-11-02 20:56:50,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 156. [2022-11-02 20:56:50,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 143 states have (on average 1.3216783216783217) internal successors, (189), 144 states have internal predecessors, (189), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-11-02 20:56:50,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 207 transitions. [2022-11-02 20:56:50,518 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 207 transitions. Word has length 30 [2022-11-02 20:56:50,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:56:50,518 INFO L495 AbstractCegarLoop]: Abstraction has 156 states and 207 transitions. [2022-11-02 20:56:50,518 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 28 states have (on average 1.8928571428571428) internal successors, (53), 28 states have internal predecessors, (53), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-02 20:56:50,519 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 207 transitions. [2022-11-02 20:56:50,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-02 20:56:50,519 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:56:50,520 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:56:50,553 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4732baf-1759-4940-9141-35ec0526b567/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-11-02 20:56:50,735 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4732baf-1759-4940-9141-35ec0526b567/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:56:50,735 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:56:50,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:56:50,735 INFO L85 PathProgramCache]: Analyzing trace with hash 701206369, now seen corresponding path program 1 times [2022-11-02 20:56:50,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:56:50,736 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032363208] [2022-11-02 20:56:50,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:56:50,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:56:50,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:56:52,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-02 20:56:52,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:57:40,317 WARN L234 SmtUtils]: Spent 22.54s on a formula simplification that was a NOOP. DAG size: 181 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-02 20:57:40,320 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:57:40,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:57:40,320 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032363208] [2022-11-02 20:57:40,320 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1032363208] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:57:40,321 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2124473926] [2022-11-02 20:57:40,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:57:40,321 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:57:40,321 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4732baf-1759-4940-9141-35ec0526b567/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:57:40,323 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4732baf-1759-4940-9141-35ec0526b567/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:57:40,343 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4732baf-1759-4940-9141-35ec0526b567/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-11-02 20:57:40,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:57:40,705 INFO L263 TraceCheckSpWp]: Trace formula consists of 440 conjuncts, 99 conjunts are in the unsatisfiable core [2022-11-02 20:57:40,712 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:57:40,732 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 20:57:40,733 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2022-11-02 20:57:40,813 INFO L356 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2022-11-02 20:57:40,813 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 29 treesize of output 37 [2022-11-02 20:57:40,834 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-02 20:57:40,842 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-02 20:57:40,953 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 25 [2022-11-02 20:57:40,969 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-02 20:57:40,977 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-02 20:57:41,451 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2022-11-02 20:57:41,457 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-02 20:57:41,462 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-02 20:57:41,752 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2022-11-02 20:57:41,777 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_3409 (Array Int Int)) (v_arrayElimArr_43 (Array Int Int)) (v_ArrVal_3410 Int) (v_ArrVal_3411 Int) (v_ArrVal_3400 Int) (|v_append_to_queue_~#p.base_85| Int) (v_ArrVal_3404 (Array Int Int)) (append_to_queue_~node~0.base Int) (v_ArrVal_3405 (Array Int Int)) (v_ArrVal_3406 (Array Int Int)) (v_ArrVal_3418 (Array Int Int))) (and (= |c_#valid| (store (store (store |c_old(#valid)| |v_append_to_queue_~#p.base_85| v_ArrVal_3411) append_to_queue_~node~0.base v_ArrVal_3410) |v_append_to_queue_~#p.base_85| v_ArrVal_3400)) (= |c_#memory_$Pointer$.base| (store (store (store |c_old(#memory_$Pointer$.base)| |v_append_to_queue_~#p.base_85| v_ArrVal_3404) append_to_queue_~node~0.base v_ArrVal_3405) |c_append_to_queue_#in~q.base| v_ArrVal_3409)) (< append_to_queue_~node~0.base |c_#StackHeapBarrier|) (= (select |c_old(#valid)| |v_append_to_queue_~#p.base_85|) 0) (= (store (store (store |c_old(#memory_$Pointer$.offset)| |v_append_to_queue_~#p.base_85| v_arrayElimArr_43) append_to_queue_~node~0.base v_ArrVal_3418) |c_append_to_queue_#in~q.base| v_ArrVal_3406) |c_#memory_$Pointer$.offset|) (= |c_append_to_queue_#in~p.payload.offset| (select v_arrayElimArr_43 8)))) is different from true [2022-11-02 20:57:41,833 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:57:41,835 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:57:41,878 INFO L356 Elim1Store]: treesize reduction 33, result has 40.0 percent of original size [2022-11-02 20:57:41,878 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 37 [2022-11-02 20:57:41,897 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:57:41,898 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:57:41,900 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:57:41,987 INFO L356 Elim1Store]: treesize reduction 95, result has 34.0 percent of original size [2022-11-02 20:57:41,987 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 46 treesize of output 84 [2022-11-02 20:57:42,003 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:57:42,053 INFO L356 Elim1Store]: treesize reduction 58, result has 35.6 percent of original size [2022-11-02 20:57:42,054 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 28 treesize of output 46 [2022-11-02 20:57:42,115 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2022-11-02 20:57:42,123 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2022-11-02 20:57:42,136 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-02 20:57:42,147 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-02 20:57:42,157 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-02 20:57:42,321 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-02 20:57:42,329 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-02 20:57:42,347 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-02 20:57:42,361 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-02 20:57:42,369 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-02 20:57:42,379 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2022-11-02 20:57:42,397 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-02 20:57:42,403 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-02 20:57:42,413 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-02 20:57:42,419 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-02 20:57:42,426 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-02 20:57:42,436 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2022-11-02 20:57:42,679 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2022-11-02 20:57:42,762 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-02 20:57:42,763 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2022-11-02 20:57:42,767 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-02 20:57:42,772 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-02 20:57:42,796 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-02 20:57:42,817 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-02 20:57:42,846 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-02 20:57:42,850 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-02 20:57:42,852 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:57:42,853 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:57:42,891 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3424 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_receive_~#packet~0#1.base| v_ArrVal_3424) |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|) 0)) (forall ((v_ArrVal_3426 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_receive_~#packet~0#1.base| v_ArrVal_3426) |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|) 0))) is different from false [2022-11-02 20:57:48,202 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:57:48,203 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 94 treesize of output 98 [2022-11-02 20:57:48,256 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-11-02 20:57:58,471 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2124473926] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:57:58,471 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-02 20:57:58,471 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14] total 20 [2022-11-02 20:57:58,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897209837] [2022-11-02 20:57:58,471 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-02 20:57:58,472 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-11-02 20:57:58,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:57:58,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-11-02 20:57:58,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=334, Unknown=7, NotChecked=82, Total=552 [2022-11-02 20:57:58,473 INFO L87 Difference]: Start difference. First operand 156 states and 207 transitions. Second operand has 20 states, 19 states have (on average 2.1578947368421053) internal successors, (41), 18 states have internal predecessors, (41), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-02 20:58:00,979 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse6 (@diff |c_old(#memory_$Pointer$.offset)| |c_#memory_$Pointer$.offset|)) (.cse17 (@diff |c_old(#memory_$Pointer$.base)| |c_#memory_$Pointer$.base|))) (let ((.cse8 (store |c_old(#memory_$Pointer$.base)| .cse17 (select |c_#memory_$Pointer$.base| .cse17))) (.cse30 (store |c_old(#memory_$Pointer$.offset)| .cse6 (select |c_#memory_$Pointer$.offset| .cse6)))) (let ((.cse29 (@diff .cse30 |c_#memory_$Pointer$.offset|)) (.cse7 (@diff .cse8 |c_#memory_$Pointer$.base|))) (let ((.cse9 (store .cse8 .cse7 (select |c_#memory_$Pointer$.base| .cse7))) (.cse5 (store .cse30 .cse29 (select |c_#memory_$Pointer$.offset| .cse29)))) (let ((.cse4 (@diff .cse5 |c_#memory_$Pointer$.offset|)) (.cse10 (@diff .cse9 |c_#memory_$Pointer$.base|))) (let ((.cse19 (store .cse9 .cse10 (select |c_#memory_$Pointer$.base| .cse10))) (.cse28 (store .cse5 .cse4 (select |c_#memory_$Pointer$.offset| .cse4)))) (let ((.cse27 (@diff .cse28 |c_#memory_$Pointer$.offset|)) (.cse18 (@diff .cse19 |c_#memory_$Pointer$.base|))) (let ((.cse3 (store .cse19 .cse18 (select |c_#memory_$Pointer$.base| .cse18))) (.cse26 (store .cse28 .cse27 (select |c_#memory_$Pointer$.offset| .cse27)))) (let ((.cse25 (@diff .cse26 |c_#memory_$Pointer$.offset|)) (.cse24 (@diff |c_old(#valid)| |c_#valid|)) (.cse2 (@diff .cse3 |c_#memory_$Pointer$.base|))) (let ((.cse14 (store .cse3 .cse2 (select |c_#memory_$Pointer$.base| .cse2))) (.cse1 (store |c_old(#valid)| .cse24 (select |c_#valid| .cse24))) (.cse15 (store .cse26 .cse25 (select |c_#memory_$Pointer$.offset| .cse25)))) (let ((.cse16 (@diff .cse15 |c_#memory_$Pointer$.offset|)) (.cse0 (@diff .cse1 |c_#valid|)) (.cse13 (@diff .cse14 |c_#memory_$Pointer$.base|))) (let ((.cse22 (store .cse14 .cse13 (select |c_#memory_$Pointer$.base| .cse13))) (.cse11 (store .cse1 .cse0 (select |c_#valid| .cse0))) (.cse20 (store .cse15 .cse16 (select |c_#memory_$Pointer$.offset| .cse16)))) (let ((.cse21 (@diff .cse20 |c_#memory_$Pointer$.offset|)) (.cse12 (@diff .cse11 |c_#valid|)) (.cse23 (@diff .cse22 |c_#memory_$Pointer$.base|))) (and (or (<= (+ .cse0 1) |c_#StackHeapBarrier|) (= (select |c_old(#valid)| .cse0) 0) (= |c_#valid| .cse1)) (or (= (select |c_old(#valid)| .cse2) 0) (= .cse2 |c_append_to_queue_#in~q.base|) (= |c_#memory_$Pointer$.base| .cse3) (<= (+ .cse2 1) |c_#StackHeapBarrier|)) (or (<= (+ .cse4 1) |c_#StackHeapBarrier|) (= .cse4 |c_append_to_queue_#in~q.base|) (= |c_#memory_$Pointer$.offset| .cse5) (= (select |c_old(#valid)| .cse4) 0)) (or (= (select |c_old(#valid)| .cse6) 0) (= .cse6 |c_append_to_queue_#in~q.base|) (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|) (<= (+ .cse6 1) |c_#StackHeapBarrier|)) (or (= (select |c_old(#valid)| .cse7) 0) (= |c_#memory_$Pointer$.base| .cse8) (= .cse7 |c_append_to_queue_#in~q.base|) (<= (+ .cse7 1) |c_#StackHeapBarrier|)) (or (= |c_#memory_$Pointer$.base| .cse9) (<= (+ .cse10 1) |c_#StackHeapBarrier|) (= (select |c_old(#valid)| .cse10) 0) (= .cse10 |c_append_to_queue_#in~q.base|)) (= |c_#valid| (store .cse11 .cse12 (select |c_#valid| .cse12))) (or (= (select |c_old(#valid)| .cse13) 0) (= .cse14 |c_#memory_$Pointer$.base|) (<= (+ .cse13 1) |c_#StackHeapBarrier|) (= .cse13 |c_append_to_queue_#in~q.base|)) (or (= .cse15 |c_#memory_$Pointer$.offset|) (= (select |c_old(#valid)| .cse16) 0) (<= (+ .cse16 1) |c_#StackHeapBarrier|) (= .cse16 |c_append_to_queue_#in~q.base|)) (or (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|) (= (select |c_old(#valid)| .cse17) 0) (= .cse17 |c_append_to_queue_#in~q.base|) (<= (+ .cse17 1) |c_#StackHeapBarrier|)) (or (= (select |c_old(#valid)| .cse18) 0) (= |c_#memory_$Pointer$.base| .cse19) (= .cse18 |c_append_to_queue_#in~q.base|) (<= (+ .cse18 1) |c_#StackHeapBarrier|)) (= |c_#memory_$Pointer$.offset| (store .cse20 .cse21 (select |c_#memory_$Pointer$.offset| .cse21))) (or (= (select |c_old(#valid)| .cse21) 0) (= .cse21 |c_append_to_queue_#in~q.base|) (<= (+ .cse21 1) |c_#StackHeapBarrier|) (= .cse20 |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3409 (Array Int Int)) (v_arrayElimArr_43 (Array Int Int)) (v_ArrVal_3410 Int) (v_ArrVal_3411 Int) (v_ArrVal_3400 Int) (|v_append_to_queue_~#p.base_85| Int) (v_ArrVal_3404 (Array Int Int)) (append_to_queue_~node~0.base Int) (v_ArrVal_3405 (Array Int Int)) (v_ArrVal_3406 (Array Int Int)) (v_ArrVal_3418 (Array Int Int))) (and (= |c_#valid| (store (store (store |c_old(#valid)| |v_append_to_queue_~#p.base_85| v_ArrVal_3411) append_to_queue_~node~0.base v_ArrVal_3410) |v_append_to_queue_~#p.base_85| v_ArrVal_3400)) (= |c_#memory_$Pointer$.base| (store (store (store |c_old(#memory_$Pointer$.base)| |v_append_to_queue_~#p.base_85| v_ArrVal_3404) append_to_queue_~node~0.base v_ArrVal_3405) |c_append_to_queue_#in~q.base| v_ArrVal_3409)) (< append_to_queue_~node~0.base |c_#StackHeapBarrier|) (= (select |c_old(#valid)| |v_append_to_queue_~#p.base_85|) 0) (= (store (store (store |c_old(#memory_$Pointer$.offset)| |v_append_to_queue_~#p.base_85| v_arrayElimArr_43) append_to_queue_~node~0.base v_ArrVal_3418) |c_append_to_queue_#in~q.base| v_ArrVal_3406) |c_#memory_$Pointer$.offset|) (= |c_append_to_queue_#in~p.payload.offset| (select v_arrayElimArr_43 8)))) (= |c_#memory_$Pointer$.base| (store .cse22 .cse23 (select |c_#memory_$Pointer$.base| .cse23))) (or (= |c_#valid| |c_old(#valid)|) (= (select |c_old(#valid)| .cse24) 0) (<= (+ .cse24 1) |c_#StackHeapBarrier|)) (or (= (select |c_old(#valid)| .cse25) 0) (<= (+ .cse25 1) |c_#StackHeapBarrier|) (= .cse26 |c_#memory_$Pointer$.offset|) (= .cse25 |c_append_to_queue_#in~q.base|)) (or (= .cse27 |c_append_to_queue_#in~q.base|) (= |c_#memory_$Pointer$.offset| .cse28) (= (select |c_old(#valid)| .cse27) 0) (<= (+ .cse27 1) |c_#StackHeapBarrier|)) (or (<= (+ .cse12 1) |c_#StackHeapBarrier|) (= (select |c_old(#valid)| .cse12) 0) (= |c_#valid| .cse11)) (or (= |c_#memory_$Pointer$.base| .cse22) (<= (+ .cse23 1) |c_#StackHeapBarrier|) (= (select |c_old(#valid)| .cse23) 0) (= |c_append_to_queue_#in~q.base| .cse23)) (or (= .cse29 |c_append_to_queue_#in~q.base|) (= |c_#memory_$Pointer$.offset| .cse30) (= (select |c_old(#valid)| .cse29) 0) (<= (+ .cse29 1) |c_#StackHeapBarrier|)))))))))))))))) is different from true [2022-11-02 20:58:03,980 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 20:58:07,589 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers []