./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/heap-data/process_queue.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8393723b 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_fc17367b-de9e-4227-b775-08ac5289bbc4/bin/uautomizer-TMbwUNV5ro/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc17367b-de9e-4227-b775-08ac5289bbc4/bin/uautomizer-TMbwUNV5ro/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc17367b-de9e-4227-b775-08ac5289bbc4/bin/uautomizer-TMbwUNV5ro/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc17367b-de9e-4227-b775-08ac5289bbc4/bin/uautomizer-TMbwUNV5ro/config/AutomizerReach.xml -i ../../sv-benchmarks/c/heap-data/process_queue.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc17367b-de9e-4227-b775-08ac5289bbc4/bin/uautomizer-TMbwUNV5ro/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc17367b-de9e-4227-b775-08ac5289bbc4/bin/uautomizer-TMbwUNV5ro --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1ad9f94c1d10f7bc5f4235ca7c5dc51413b43a0e6c48b9e48da5d2e3e751252c --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-8393723 [2022-11-18 18:23:40,461 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-18 18:23:40,463 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-18 18:23:40,485 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-18 18:23:40,485 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-18 18:23:40,486 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-18 18:23:40,488 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-18 18:23:40,490 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-18 18:23:40,492 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-18 18:23:40,493 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-18 18:23:40,494 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-18 18:23:40,495 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-18 18:23:40,496 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-18 18:23:40,497 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-18 18:23:40,498 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-18 18:23:40,500 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-18 18:23:40,501 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-18 18:23:40,502 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-18 18:23:40,504 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-18 18:23:40,506 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-18 18:23:40,507 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-18 18:23:40,513 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-18 18:23:40,514 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-18 18:23:40,515 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-18 18:23:40,519 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-18 18:23:40,519 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-18 18:23:40,520 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-18 18:23:40,521 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-18 18:23:40,521 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-18 18:23:40,522 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-18 18:23:40,523 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-18 18:23:40,534 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-18 18:23:40,535 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-18 18:23:40,536 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-18 18:23:40,537 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-18 18:23:40,537 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-18 18:23:40,538 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-18 18:23:40,538 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-18 18:23:40,539 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-18 18:23:40,540 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-18 18:23:40,540 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-18 18:23:40,545 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc17367b-de9e-4227-b775-08ac5289bbc4/bin/uautomizer-TMbwUNV5ro/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-18 18:23:40,589 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-18 18:23:40,590 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-18 18:23:40,591 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-18 18:23:40,591 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-18 18:23:40,592 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-18 18:23:40,592 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-18 18:23:40,593 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-18 18:23:40,593 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-18 18:23:40,594 INFO L138 SettingsManager]: * Use SBE=true [2022-11-18 18:23:40,594 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-18 18:23:40,595 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-18 18:23:40,595 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-18 18:23:40,596 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-18 18:23:40,596 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-18 18:23:40,596 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-18 18:23:40,596 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-18 18:23:40,597 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-18 18:23:40,597 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-18 18:23:40,597 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-18 18:23:40,597 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-18 18:23:40,597 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-18 18:23:40,598 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-18 18:23:40,598 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-18 18:23:40,598 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-18 18:23:40,598 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-18 18:23:40,599 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-18 18:23:40,600 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-18 18:23:40,601 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-18 18:23:40,601 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-18 18:23:40,601 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-18 18:23:40,601 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-18 18:23:40,602 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-18 18:23:40,602 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-18 18:23:40,602 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_fc17367b-de9e-4227-b775-08ac5289bbc4/bin/uautomizer-TMbwUNV5ro/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc17367b-de9e-4227-b775-08ac5289bbc4/bin/uautomizer-TMbwUNV5ro Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 1ad9f94c1d10f7bc5f4235ca7c5dc51413b43a0e6c48b9e48da5d2e3e751252c [2022-11-18 18:23:40,915 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-18 18:23:40,956 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-18 18:23:40,959 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-18 18:23:40,960 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-18 18:23:40,961 INFO L275 PluginConnector]: CDTParser initialized [2022-11-18 18:23:40,963 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc17367b-de9e-4227-b775-08ac5289bbc4/bin/uautomizer-TMbwUNV5ro/../../sv-benchmarks/c/heap-data/process_queue.i [2022-11-18 18:23:41,048 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc17367b-de9e-4227-b775-08ac5289bbc4/bin/uautomizer-TMbwUNV5ro/data/a3c26cee4/6826f29b19ba4a0f8fc397d6cee37d7f/FLAG03aab39e8 [2022-11-18 18:23:41,590 INFO L306 CDTParser]: Found 1 translation units. [2022-11-18 18:23:41,590 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc17367b-de9e-4227-b775-08ac5289bbc4/sv-benchmarks/c/heap-data/process_queue.i [2022-11-18 18:23:41,608 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc17367b-de9e-4227-b775-08ac5289bbc4/bin/uautomizer-TMbwUNV5ro/data/a3c26cee4/6826f29b19ba4a0f8fc397d6cee37d7f/FLAG03aab39e8 [2022-11-18 18:23:41,888 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc17367b-de9e-4227-b775-08ac5289bbc4/bin/uautomizer-TMbwUNV5ro/data/a3c26cee4/6826f29b19ba4a0f8fc397d6cee37d7f [2022-11-18 18:23:41,891 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-18 18:23:41,892 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-18 18:23:41,894 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-18 18:23:41,894 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-18 18:23:41,897 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-18 18:23:41,898 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 06:23:41" (1/1) ... [2022-11-18 18:23:41,899 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5e6b2d06 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:23:41, skipping insertion in model container [2022-11-18 18:23:41,900 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 06:23:41" (1/1) ... [2022-11-18 18:23:41,907 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-18 18:23:41,937 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-18 18:23:42,342 WARN L234 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc17367b-de9e-4227-b775-08ac5289bbc4/sv-benchmarks/c/heap-data/process_queue.i[23979,23992] [2022-11-18 18:23:42,360 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-18 18:23:42,373 INFO L203 MainTranslator]: Completed pre-run [2022-11-18 18:23:42,427 WARN L234 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc17367b-de9e-4227-b775-08ac5289bbc4/sv-benchmarks/c/heap-data/process_queue.i[23979,23992] [2022-11-18 18:23:42,440 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-18 18:23:42,469 INFO L208 MainTranslator]: Completed translation [2022-11-18 18:23:42,470 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:23:42 WrapperNode [2022-11-18 18:23:42,470 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-18 18:23:42,471 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-18 18:23:42,471 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-18 18:23:42,472 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-18 18:23:42,480 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:23:42" (1/1) ... [2022-11-18 18:23:42,515 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:23:42" (1/1) ... [2022-11-18 18:23:42,550 INFO L138 Inliner]: procedures = 127, calls = 32, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 111 [2022-11-18 18:23:42,550 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-18 18:23:42,551 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-18 18:23:42,551 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-18 18:23:42,552 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-18 18:23:42,561 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:23:42" (1/1) ... [2022-11-18 18:23:42,561 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:23:42" (1/1) ... [2022-11-18 18:23:42,570 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:23:42" (1/1) ... [2022-11-18 18:23:42,571 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:23:42" (1/1) ... [2022-11-18 18:23:42,587 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:23:42" (1/1) ... [2022-11-18 18:23:42,596 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:23:42" (1/1) ... [2022-11-18 18:23:42,599 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:23:42" (1/1) ... [2022-11-18 18:23:42,605 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:23:42" (1/1) ... [2022-11-18 18:23:42,609 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-18 18:23:42,615 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-18 18:23:42,615 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-18 18:23:42,616 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-18 18:23:42,617 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:23:42" (1/1) ... [2022-11-18 18:23:42,624 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-18 18:23:42,636 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc17367b-de9e-4227-b775-08ac5289bbc4/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 18:23:42,650 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc17367b-de9e-4227-b775-08ac5289bbc4/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-18 18:23:42,676 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc17367b-de9e-4227-b775-08ac5289bbc4/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-18 18:23:42,699 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-18 18:23:42,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-18 18:23:42,700 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-18 18:23:42,700 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-18 18:23:42,701 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-18 18:23:42,701 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-18 18:23:42,701 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-18 18:23:42,702 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-18 18:23:42,702 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-11-18 18:23:42,702 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-18 18:23:42,702 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-18 18:23:42,702 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-18 18:23:42,895 INFO L235 CfgBuilder]: Building ICFG [2022-11-18 18:23:42,910 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-18 18:23:43,190 INFO L276 CfgBuilder]: Performing block encoding [2022-11-18 18:23:43,200 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-18 18:23:43,200 INFO L300 CfgBuilder]: Removed 3 assume(true) statements. [2022-11-18 18:23:43,202 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 06:23:43 BoogieIcfgContainer [2022-11-18 18:23:43,203 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-18 18:23:43,205 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-18 18:23:43,205 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-18 18:23:43,209 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-18 18:23:43,209 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 06:23:41" (1/3) ... [2022-11-18 18:23:43,210 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e34c507 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 06:23:43, skipping insertion in model container [2022-11-18 18:23:43,210 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:23:42" (2/3) ... [2022-11-18 18:23:43,211 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e34c507 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 06:23:43, skipping insertion in model container [2022-11-18 18:23:43,211 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 06:23:43" (3/3) ... [2022-11-18 18:23:43,213 INFO L112 eAbstractionObserver]: Analyzing ICFG process_queue.i [2022-11-18 18:23:43,233 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-18 18:23:43,233 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-18 18:23:43,300 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-18 18:23:43,307 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;@3d9fb59, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-18 18:23:43,307 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-18 18:23:43,312 INFO L276 IsEmpty]: Start isEmpty. Operand has 26 states, 24 states have (on average 1.5416666666666667) internal successors, (37), 25 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:23:43,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-18 18:23:43,319 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 18:23:43,321 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 18:23:43,322 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 18:23:43,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 18:23:43,331 INFO L85 PathProgramCache]: Analyzing trace with hash -2060272908, now seen corresponding path program 1 times [2022-11-18 18:23:43,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 18:23:43,343 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193775202] [2022-11-18 18:23:43,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 18:23:43,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 18:23:43,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:23:43,741 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 18:23:43,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 18:23:43,742 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193775202] [2022-11-18 18:23:43,743 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1193775202] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 18:23:43,743 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 18:23:43,744 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-18 18:23:43,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250911358] [2022-11-18 18:23:43,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 18:23:43,751 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 18:23:43,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 18:23:43,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 18:23:43,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 18:23:43,792 INFO L87 Difference]: Start difference. First operand has 26 states, 24 states have (on average 1.5416666666666667) internal successors, (37), 25 states have internal predecessors, (37), 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) Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 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-18 18:23:43,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 18:23:43,850 INFO L93 Difference]: Finished difference Result 51 states and 74 transitions. [2022-11-18 18:23:43,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 18:23:43,854 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 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-18 18:23:43,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 18:23:43,863 INFO L225 Difference]: With dead ends: 51 [2022-11-18 18:23:43,864 INFO L226 Difference]: Without dead ends: 23 [2022-11-18 18:23:43,867 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 18:23:43,872 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 0 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-18 18:23:43,876 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 59 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-18 18:23:43,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-11-18 18:23:43,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2022-11-18 18:23:43,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 22 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:23:43,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 30 transitions. [2022-11-18 18:23:43,912 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 30 transitions. Word has length 11 [2022-11-18 18:23:43,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 18:23:43,913 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 30 transitions. [2022-11-18 18:23:43,914 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 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-18 18:23:43,914 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 30 transitions. [2022-11-18 18:23:43,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-18 18:23:43,915 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 18:23:43,915 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 18:23:43,915 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-18 18:23:43,916 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 18:23:43,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 18:23:43,917 INFO L85 PathProgramCache]: Analyzing trace with hash -1911586027, now seen corresponding path program 1 times [2022-11-18 18:23:43,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 18:23:43,917 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527717962] [2022-11-18 18:23:43,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 18:23:43,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 18:23:43,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:23:44,066 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 18:23:44,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 18:23:44,070 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [527717962] [2022-11-18 18:23:44,070 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [527717962] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 18:23:44,070 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 18:23:44,071 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-18 18:23:44,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136323367] [2022-11-18 18:23:44,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 18:23:44,074 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-18 18:23:44,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 18:23:44,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-18 18:23:44,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-18 18:23:44,077 INFO L87 Difference]: Start difference. First operand 23 states and 30 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-18 18:23:44,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 18:23:44,158 INFO L93 Difference]: Finished difference Result 56 states and 74 transitions. [2022-11-18 18:23:44,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-18 18:23:44,159 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-18 18:23:44,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 18:23:44,160 INFO L225 Difference]: With dead ends: 56 [2022-11-18 18:23:44,160 INFO L226 Difference]: Without dead ends: 35 [2022-11-18 18:23:44,161 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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-18 18:23:44,162 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 12 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-18 18:23:44,163 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 86 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-18 18:23:44,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-11-18 18:23:44,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 33. [2022-11-18 18:23:44,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 32 states have (on average 1.34375) internal successors, (43), 32 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:23:44,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 43 transitions. [2022-11-18 18:23:44,169 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 43 transitions. Word has length 11 [2022-11-18 18:23:44,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 18:23:44,170 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 43 transitions. [2022-11-18 18:23:44,170 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-18 18:23:44,170 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 43 transitions. [2022-11-18 18:23:44,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-18 18:23:44,171 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 18:23:44,171 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 18:23:44,171 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-18 18:23:44,172 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 18:23:44,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 18:23:44,173 INFO L85 PathProgramCache]: Analyzing trace with hash 459687026, now seen corresponding path program 1 times [2022-11-18 18:23:44,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 18:23:44,173 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136843508] [2022-11-18 18:23:44,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 18:23:44,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 18:23:44,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:23:45,213 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 18:23:45,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 18:23:45,214 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136843508] [2022-11-18 18:23:45,214 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [136843508] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 18:23:45,214 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 18:23:45,215 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-18 18:23:45,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499891354] [2022-11-18 18:23:45,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 18:23:45,215 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-18 18:23:45,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 18:23:45,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-18 18:23:45,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-18 18:23:45,217 INFO L87 Difference]: Start difference. First operand 33 states and 43 transitions. Second operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 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-18 18:23:45,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 18:23:45,414 INFO L93 Difference]: Finished difference Result 74 states and 97 transitions. [2022-11-18 18:23:45,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-18 18:23:45,415 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 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-18 18:23:45,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 18:23:45,417 INFO L225 Difference]: With dead ends: 74 [2022-11-18 18:23:45,418 INFO L226 Difference]: Without dead ends: 72 [2022-11-18 18:23:45,418 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-11-18 18:23:45,419 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 66 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-18 18:23:45,420 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 105 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-18 18:23:45,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-11-18 18:23:45,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 51. [2022-11-18 18:23:45,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 50 states have (on average 1.36) internal successors, (68), 50 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:23:45,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 68 transitions. [2022-11-18 18:23:45,434 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 68 transitions. Word has length 11 [2022-11-18 18:23:45,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 18:23:45,435 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 68 transitions. [2022-11-18 18:23:45,435 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 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-18 18:23:45,437 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 68 transitions. [2022-11-18 18:23:45,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-18 18:23:45,437 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 18:23:45,438 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 18:23:45,438 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-18 18:23:45,438 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 18:23:45,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 18:23:45,443 INFO L85 PathProgramCache]: Analyzing trace with hash 608373907, now seen corresponding path program 1 times [2022-11-18 18:23:45,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 18:23:45,443 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218595156] [2022-11-18 18:23:45,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 18:23:45,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 18:23:45,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:23:45,519 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 18:23:45,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 18:23:45,519 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218595156] [2022-11-18 18:23:45,519 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1218595156] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 18:23:45,520 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 18:23:45,520 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-18 18:23:45,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526734201] [2022-11-18 18:23:45,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 18:23:45,521 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-18 18:23:45,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 18:23:45,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-18 18:23:45,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-18 18:23:45,522 INFO L87 Difference]: Start difference. First operand 51 states and 68 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-18 18:23:45,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 18:23:45,605 INFO L93 Difference]: Finished difference Result 106 states and 140 transitions. [2022-11-18 18:23:45,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-18 18:23:45,606 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-18 18:23:45,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 18:23:45,607 INFO L225 Difference]: With dead ends: 106 [2022-11-18 18:23:45,607 INFO L226 Difference]: Without dead ends: 57 [2022-11-18 18:23:45,607 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-18 18:23:45,609 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 23 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-18 18:23:45,609 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 74 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-18 18:23:45,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-11-18 18:23:45,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 49. [2022-11-18 18:23:45,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 48 states have (on average 1.3333333333333333) internal successors, (64), 48 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:23:45,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 64 transitions. [2022-11-18 18:23:45,618 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 64 transitions. Word has length 11 [2022-11-18 18:23:45,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 18:23:45,619 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 64 transitions. [2022-11-18 18:23:45,619 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-18 18:23:45,619 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 64 transitions. [2022-11-18 18:23:45,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-18 18:23:45,620 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 18:23:45,620 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 18:23:45,620 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-18 18:23:45,621 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 18:23:45,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 18:23:45,621 INFO L85 PathProgramCache]: Analyzing trace with hash -2110602732, now seen corresponding path program 1 times [2022-11-18 18:23:45,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 18:23:45,622 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918769198] [2022-11-18 18:23:45,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 18:23:45,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 18:23:45,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:23:46,307 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 18:23:46,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 18:23:46,308 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918769198] [2022-11-18 18:23:46,308 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1918769198] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 18:23:46,308 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [952666975] [2022-11-18 18:23:46,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 18:23:46,310 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 18:23:46,310 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc17367b-de9e-4227-b775-08ac5289bbc4/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 18:23:46,316 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc17367b-de9e-4227-b775-08ac5289bbc4/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 18:23:46,340 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc17367b-de9e-4227-b775-08ac5289bbc4/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-18 18:23:46,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:23:46,469 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 68 conjunts are in the unsatisfiable core [2022-11-18 18:23:46,480 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 18:23:46,549 INFO L350 Elim1Store]: Elim1 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 6 treesize of output 5 [2022-11-18 18:23:46,721 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 18:23:46,727 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 18:23:46,731 INFO L350 Elim1Store]: Elim1 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 31 treesize of output 26 [2022-11-18 18:23:46,739 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 18:23:46,745 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 18:23:46,748 INFO L350 Elim1Store]: Elim1 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 31 treesize of output 26 [2022-11-18 18:23:46,762 INFO L350 Elim1Store]: Elim1 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 0 case distinctions, treesize of input 26 treesize of output 21 [2022-11-18 18:23:46,778 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-11-18 18:23:46,780 INFO L350 Elim1Store]: Elim1 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-18 18:23:46,795 INFO L350 Elim1Store]: Elim1 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 0 case distinctions, treesize of input 30 treesize of output 25 [2022-11-18 18:23:46,802 INFO L350 Elim1Store]: Elim1 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 18 treesize of output 17 [2022-11-18 18:23:46,812 INFO L350 Elim1Store]: Elim1 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 18 treesize of output 17 [2022-11-18 18:23:47,019 INFO L321 Elim1Store]: treesize reduction 17, result has 5.6 percent of original size [2022-11-18 18:23:47,020 INFO L350 Elim1Store]: Elim1 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 77 treesize of output 40 [2022-11-18 18:23:47,033 INFO L350 Elim1Store]: Elim1 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 12 [2022-11-18 18:23:47,042 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 18:23:47,042 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 18:23:47,380 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 18:23:47,381 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [952666975] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 18:23:47,381 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 18:23:47,381 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2022-11-18 18:23:47,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582303081] [2022-11-18 18:23:47,381 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 18:23:47,382 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-18 18:23:47,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 18:23:47,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-18 18:23:47,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-11-18 18:23:47,383 INFO L87 Difference]: Start difference. First operand 49 states and 64 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-18 18:23:47,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 18:23:47,671 INFO L93 Difference]: Finished difference Result 121 states and 160 transitions. [2022-11-18 18:23:47,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-18 18:23:47,672 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 14 [2022-11-18 18:23:47,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 18:23:47,672 INFO L225 Difference]: With dead ends: 121 [2022-11-18 18:23:47,672 INFO L226 Difference]: Without dead ends: 83 [2022-11-18 18:23:47,673 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2022-11-18 18:23:47,674 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 41 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 22 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-18 18:23:47,674 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 225 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 74 Invalid, 0 Unknown, 22 Unchecked, 0.2s Time] [2022-11-18 18:23:47,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2022-11-18 18:23:47,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 54. [2022-11-18 18:23:47,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 53 states have (on average 1.320754716981132) internal successors, (70), 53 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:23:47,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 70 transitions. [2022-11-18 18:23:47,683 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 70 transitions. Word has length 14 [2022-11-18 18:23:47,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 18:23:47,683 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 70 transitions. [2022-11-18 18:23:47,684 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-18 18:23:47,684 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 70 transitions. [2022-11-18 18:23:47,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-18 18:23:47,684 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 18:23:47,685 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 18:23:47,701 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc17367b-de9e-4227-b775-08ac5289bbc4/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-18 18:23:47,892 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc17367b-de9e-4227-b775-08ac5289bbc4/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 18:23:47,892 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 18:23:47,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 18:23:47,893 INFO L85 PathProgramCache]: Analyzing trace with hash 969563825, now seen corresponding path program 1 times [2022-11-18 18:23:47,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 18:23:47,893 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177122793] [2022-11-18 18:23:47,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 18:23:47,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 18:23:47,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:23:48,151 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 18:23:48,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 18:23:48,152 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177122793] [2022-11-18 18:23:48,152 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1177122793] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 18:23:48,152 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 18:23:48,152 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-18 18:23:48,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880939951] [2022-11-18 18:23:48,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 18:23:48,153 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-18 18:23:48,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 18:23:48,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-18 18:23:48,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-18 18:23:48,154 INFO L87 Difference]: Start difference. First operand 54 states and 70 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:23:48,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 18:23:48,220 INFO L93 Difference]: Finished difference Result 117 states and 155 transitions. [2022-11-18 18:23:48,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-18 18:23:48,221 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 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 19 [2022-11-18 18:23:48,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 18:23:48,225 INFO L225 Difference]: With dead ends: 117 [2022-11-18 18:23:48,225 INFO L226 Difference]: Without dead ends: 79 [2022-11-18 18:23:48,225 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-18 18:23:48,230 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 30 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-18 18:23:48,232 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 75 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-18 18:23:48,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2022-11-18 18:23:48,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 70. [2022-11-18 18:23:48,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 69 states have (on average 1.3043478260869565) internal successors, (90), 69 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:23:48,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 90 transitions. [2022-11-18 18:23:48,251 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 90 transitions. Word has length 19 [2022-11-18 18:23:48,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 18:23:48,251 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 90 transitions. [2022-11-18 18:23:48,251 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:23:48,251 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 90 transitions. [2022-11-18 18:23:48,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-18 18:23:48,252 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 18:23:48,252 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 18:23:48,253 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-18 18:23:48,253 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 18:23:48,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 18:23:48,253 INFO L85 PathProgramCache]: Analyzing trace with hash 1377311315, now seen corresponding path program 1 times [2022-11-18 18:23:48,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 18:23:48,254 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316607303] [2022-11-18 18:23:48,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 18:23:48,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 18:23:48,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:23:49,019 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-18 18:23:49,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 18:23:49,020 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316607303] [2022-11-18 18:23:49,020 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1316607303] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 18:23:49,020 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1802115456] [2022-11-18 18:23:49,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 18:23:49,021 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 18:23:49,021 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc17367b-de9e-4227-b775-08ac5289bbc4/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 18:23:49,024 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc17367b-de9e-4227-b775-08ac5289bbc4/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 18:23:49,047 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc17367b-de9e-4227-b775-08ac5289bbc4/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-18 18:23:49,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:23:49,201 INFO L263 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 62 conjunts are in the unsatisfiable core [2022-11-18 18:23:49,207 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 18:23:49,400 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 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 20 treesize of output 28 [2022-11-18 18:23:49,407 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 18:23:49,412 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 18:23:49,414 INFO L350 Elim1Store]: Elim1 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 14 [2022-11-18 18:23:49,421 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 18:23:49,425 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 18:23:49,427 INFO L350 Elim1Store]: Elim1 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 14 [2022-11-18 18:23:49,433 INFO L350 Elim1Store]: Elim1 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-18 18:23:49,438 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 18:23:49,440 INFO L350 Elim1Store]: Elim1 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 18 treesize of output 20 [2022-11-18 18:23:49,449 INFO L350 Elim1Store]: Elim1 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-18 18:23:49,496 INFO L350 Elim1Store]: Elim1 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-18 18:23:49,502 INFO L350 Elim1Store]: Elim1 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-18 18:23:49,526 INFO L350 Elim1Store]: Elim1 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-18 18:23:49,541 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-18 18:23:49,542 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 18:23:49,633 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 18:23:49,634 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 24 treesize of output 35 [2022-11-18 18:23:49,639 INFO L350 Elim1Store]: Elim1 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 29 treesize of output 21 [2022-11-18 18:23:49,644 INFO L350 Elim1Store]: Elim1 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-18 18:23:49,762 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-18 18:23:49,763 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1802115456] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 18:23:49,763 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 18:23:49,763 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 17 [2022-11-18 18:23:49,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874695181] [2022-11-18 18:23:49,763 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 18:23:49,764 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-11-18 18:23:49,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 18:23:49,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-11-18 18:23:49,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=224, Unknown=0, NotChecked=0, Total=272 [2022-11-18 18:23:49,765 INFO L87 Difference]: Start difference. First operand 70 states and 90 transitions. Second operand has 17 states, 17 states have (on average 3.6470588235294117) internal successors, (62), 17 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:23:51,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 18:23:51,941 INFO L93 Difference]: Finished difference Result 323 states and 428 transitions. [2022-11-18 18:23:51,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-11-18 18:23:51,942 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.6470588235294117) internal successors, (62), 17 states have internal predecessors, (62), 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 22 [2022-11-18 18:23:51,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 18:23:51,943 INFO L225 Difference]: With dead ends: 323 [2022-11-18 18:23:51,943 INFO L226 Difference]: Without dead ends: 269 [2022-11-18 18:23:51,944 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 520 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=529, Invalid=1823, Unknown=0, NotChecked=0, Total=2352 [2022-11-18 18:23:51,945 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 549 mSDsluCounter, 365 mSDsCounter, 0 mSdLazyCounter, 414 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 549 SdHoareTripleChecker+Valid, 415 SdHoareTripleChecker+Invalid, 445 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 414 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-18 18:23:51,946 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [549 Valid, 415 Invalid, 445 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 414 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-11-18 18:23:51,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2022-11-18 18:23:51,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 116. [2022-11-18 18:23:51,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 115 states have (on average 1.3043478260869565) internal successors, (150), 115 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:23:51,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 150 transitions. [2022-11-18 18:23:51,962 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 150 transitions. Word has length 22 [2022-11-18 18:23:51,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 18:23:51,962 INFO L495 AbstractCegarLoop]: Abstraction has 116 states and 150 transitions. [2022-11-18 18:23:51,963 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.6470588235294117) internal successors, (62), 17 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:23:51,963 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 150 transitions. [2022-11-18 18:23:51,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-18 18:23:51,964 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 18:23:51,964 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2022-11-18 18:23:51,976 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc17367b-de9e-4227-b775-08ac5289bbc4/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-18 18:23:52,170 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc17367b-de9e-4227-b775-08ac5289bbc4/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 18:23:52,171 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 18:23:52,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 18:23:52,171 INFO L85 PathProgramCache]: Analyzing trace with hash 1662719123, now seen corresponding path program 2 times [2022-11-18 18:23:52,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 18:23:52,172 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907436893] [2022-11-18 18:23:52,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 18:23:52,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 18:23:52,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:23:54,336 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 18:23:54,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 18:23:54,336 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907436893] [2022-11-18 18:23:54,337 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [907436893] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 18:23:54,337 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [430278028] [2022-11-18 18:23:54,337 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-18 18:23:54,337 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 18:23:54,337 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc17367b-de9e-4227-b775-08ac5289bbc4/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 18:23:54,348 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc17367b-de9e-4227-b775-08ac5289bbc4/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 18:23:54,372 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc17367b-de9e-4227-b775-08ac5289bbc4/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-18 18:23:54,534 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-18 18:23:54,534 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 18:23:54,539 INFO L263 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 120 conjunts are in the unsatisfiable core [2022-11-18 18:23:54,545 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 18:23:54,566 INFO L350 Elim1Store]: Elim1 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 6 treesize of output 5 [2022-11-18 18:23:54,632 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 18:23:54,636 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 18:23:54,638 INFO L350 Elim1Store]: Elim1 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 14 [2022-11-18 18:23:54,641 INFO L350 Elim1Store]: Elim1 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-18 18:23:54,648 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 18:23:54,653 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 18:23:54,654 INFO L350 Elim1Store]: Elim1 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 14 [2022-11-18 18:23:54,659 INFO L350 Elim1Store]: Elim1 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-18 18:23:54,678 INFO L321 Elim1Store]: treesize reduction 26, result has 35.0 percent of original size [2022-11-18 18:23:54,678 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 25 treesize of output 29 [2022-11-18 18:23:55,110 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 18:23:55,115 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 18:23:55,116 INFO L350 Elim1Store]: Elim1 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 46 treesize of output 39 [2022-11-18 18:23:55,122 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 18:23:55,126 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 18:23:55,127 INFO L350 Elim1Store]: Elim1 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 54 treesize of output 45 [2022-11-18 18:23:55,136 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 18:23:55,138 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 18:23:55,139 INFO L350 Elim1Store]: Elim1 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 23 treesize of output 27 [2022-11-18 18:23:55,148 INFO L350 Elim1Store]: Elim1 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 0 case distinctions, treesize of input 45 treesize of output 36 [2022-11-18 18:23:55,158 INFO L350 Elim1Store]: Elim1 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 0 case distinctions, treesize of input 39 treesize of output 32 [2022-11-18 18:23:55,168 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 12 treesize of output 11 [2022-11-18 18:23:55,187 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 18:23:55,196 INFO L321 Elim1Store]: treesize reduction 4, result has 80.0 percent of original size [2022-11-18 18:23:55,196 INFO L350 Elim1Store]: Elim1 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 1 case distinctions, treesize of input 28 treesize of output 26 [2022-11-18 18:23:55,209 INFO L350 Elim1Store]: Elim1 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-18 18:23:55,452 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 18:23:55,453 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 18:23:55,456 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 18:23:55,457 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 98 treesize of output 50 [2022-11-18 18:23:55,466 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 18:23:55,471 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-18 18:23:55,472 INFO L350 Elim1Store]: Elim1 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 4 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 18 [2022-11-18 18:23:55,495 INFO L350 Elim1Store]: Elim1 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-18 18:23:55,498 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 18:23:55,498 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 18:23:55,641 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_513 (Array Int Int)) (v_ArrVal_514 (Array Int Int)) (v_ArrVal_517 (Array Int Int)) (v_ArrVal_518 (Array Int Int)) (v_ArrVal_520 (Array Int Int)) (v_ArrVal_524 Int) (v_ArrVal_522 (Array Int Int))) (or (not (< v_ArrVal_524 |c_#StackHeapBarrier|)) (not (= (select |c_#valid| v_ArrVal_524) 0)) (< 0 (select (select (store (store |c_#memory_int| v_ArrVal_524 v_ArrVal_514) |c_ULTIMATE.start_main_~#queue~0#1.base| v_ArrVal_518) (select (select (store (store |c_#memory_$Pointer$.base| v_ArrVal_524 (store v_ArrVal_517 8 (select (select (store |c_#memory_$Pointer$.base| v_ArrVal_524 v_ArrVal_517) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset|))) |c_ULTIMATE.start_main_~#queue~0#1.base| (store (select (store |c_#memory_$Pointer$.base| v_ArrVal_524 v_ArrVal_522) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset| v_ArrVal_524)) v_ArrVal_524) 8)) (+ (select (select (store (store |c_#memory_$Pointer$.offset| v_ArrVal_524 (store v_ArrVal_520 8 (select (select (store |c_#memory_$Pointer$.offset| v_ArrVal_524 v_ArrVal_520) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset|))) |c_ULTIMATE.start_main_~#queue~0#1.base| (store (select (store |c_#memory_$Pointer$.offset| v_ArrVal_524 v_ArrVal_513) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset| 0)) v_ArrVal_524) 8) 4))))) is different from false [2022-11-18 18:23:55,888 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 18:23:55,889 INFO L350 Elim1Store]: Elim1 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 811 treesize of output 748 [2022-11-18 18:23:55,908 INFO L350 Elim1Store]: Elim1 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 339 treesize of output 275 [2022-11-18 18:23:55,924 INFO L350 Elim1Store]: Elim1 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 614 treesize of output 486 [2022-11-18 18:23:58,645 INFO L350 Elim1Store]: Elim1 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 479 treesize of output 473 [2022-11-18 18:23:58,668 INFO L350 Elim1Store]: Elim1 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 461 treesize of output 459 [2022-11-18 18:23:58,701 INFO L350 Elim1Store]: Elim1 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 431 treesize of output 425 [2022-11-18 18:23:58,725 INFO L350 Elim1Store]: Elim1 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 448 treesize of output 442 [2022-11-18 18:23:58,748 INFO L350 Elim1Store]: Elim1 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 448 treesize of output 446 [2022-11-18 18:23:58,759 INFO L350 Elim1Store]: Elim1 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 446 treesize of output 442 [2022-11-18 18:23:58,771 INFO L350 Elim1Store]: Elim1 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 464 treesize of output 460 [2022-11-18 18:23:58,781 INFO L350 Elim1Store]: Elim1 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 460 treesize of output 456 [2022-11-18 18:23:58,794 INFO L350 Elim1Store]: Elim1 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 461 treesize of output 459 [2022-11-18 18:23:58,816 INFO L350 Elim1Store]: Elim1 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 466 treesize of output 462 [2022-11-18 18:23:58,843 INFO L350 Elim1Store]: Elim1 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 454 treesize of output 450 [2022-11-18 18:23:59,130 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 8 not checked. [2022-11-18 18:23:59,131 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [430278028] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 18:23:59,131 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 18:23:59,131 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 27 [2022-11-18 18:23:59,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104093884] [2022-11-18 18:23:59,131 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 18:23:59,132 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-11-18 18:23:59,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 18:23:59,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-11-18 18:23:59,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=553, Unknown=3, NotChecked=48, Total=702 [2022-11-18 18:23:59,133 INFO L87 Difference]: Start difference. First operand 116 states and 150 transitions. Second operand has 27 states, 27 states have (on average 2.5185185185185186) internal successors, (68), 27 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:24:14,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 18:24:14,129 INFO L93 Difference]: Finished difference Result 747 states and 999 transitions. [2022-11-18 18:24:14,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2022-11-18 18:24:14,129 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 2.5185185185185186) internal successors, (68), 27 states have internal predecessors, (68), 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-18 18:24:14,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 18:24:14,132 INFO L225 Difference]: With dead ends: 747 [2022-11-18 18:24:14,132 INFO L226 Difference]: Without dead ends: 745 [2022-11-18 18:24:14,135 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 48 SyntacticMatches, 20 SemanticMatches, 85 ConstructedPredicates, 1 IntricatePredicates, 1 DeprecatedPredicates, 2834 ImplicationChecksByTransitivity, 16.3s TimeCoverageRelationStatistics Valid=1381, Invalid=5925, Unknown=8, NotChecked=168, Total=7482 [2022-11-18 18:24:14,136 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 451 mSDsluCounter, 977 mSDsCounter, 0 mSdLazyCounter, 712 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 451 SdHoareTripleChecker+Valid, 1043 SdHoareTripleChecker+Invalid, 1281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 712 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 541 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-11-18 18:24:14,136 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [451 Valid, 1043 Invalid, 1281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 712 Invalid, 0 Unknown, 541 Unchecked, 1.4s Time] [2022-11-18 18:24:14,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 745 states. [2022-11-18 18:24:14,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 745 to 545. [2022-11-18 18:24:14,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 545 states, 544 states have (on average 1.3143382352941178) internal successors, (715), 544 states have internal predecessors, (715), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:24:14,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 545 states to 545 states and 715 transitions. [2022-11-18 18:24:14,239 INFO L78 Accepts]: Start accepts. Automaton has 545 states and 715 transitions. Word has length 25 [2022-11-18 18:24:14,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 18:24:14,239 INFO L495 AbstractCegarLoop]: Abstraction has 545 states and 715 transitions. [2022-11-18 18:24:14,239 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 2.5185185185185186) internal successors, (68), 27 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:24:14,239 INFO L276 IsEmpty]: Start isEmpty. Operand 545 states and 715 transitions. [2022-11-18 18:24:14,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-18 18:24:14,240 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 18:24:14,240 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2022-11-18 18:24:14,247 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc17367b-de9e-4227-b775-08ac5289bbc4/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-18 18:24:14,446 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc17367b-de9e-4227-b775-08ac5289bbc4/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 18:24:14,446 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 18:24:14,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 18:24:14,447 INFO L85 PathProgramCache]: Analyzing trace with hash 211481171, now seen corresponding path program 3 times [2022-11-18 18:24:14,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 18:24:14,447 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867718033] [2022-11-18 18:24:14,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 18:24:14,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 18:24:14,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:24:16,406 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 3 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 18:24:16,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 18:24:16,406 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867718033] [2022-11-18 18:24:16,406 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [867718033] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 18:24:16,406 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1333456956] [2022-11-18 18:24:16,406 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-18 18:24:16,407 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 18:24:16,407 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc17367b-de9e-4227-b775-08ac5289bbc4/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 18:24:16,408 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc17367b-de9e-4227-b775-08ac5289bbc4/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 18:24:16,432 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc17367b-de9e-4227-b775-08ac5289bbc4/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-18 18:24:17,186 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-18 18:24:17,186 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 18:24:17,191 INFO L263 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 128 conjunts are in the unsatisfiable core [2022-11-18 18:24:17,198 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 18:24:17,210 INFO L350 Elim1Store]: Elim1 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 6 treesize of output 5 [2022-11-18 18:24:17,306 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 18:24:17,310 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 18:24:17,311 INFO L350 Elim1Store]: Elim1 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 29 treesize of output 24 [2022-11-18 18:24:17,316 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 18:24:17,319 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 18:24:17,323 INFO L350 Elim1Store]: Elim1 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 29 treesize of output 24 [2022-11-18 18:24:17,331 INFO L350 Elim1Store]: Elim1 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 0 case distinctions, treesize of input 24 treesize of output 19 [2022-11-18 18:24:17,336 INFO L350 Elim1Store]: Elim1 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-18 18:24:17,356 INFO L321 Elim1Store]: treesize reduction 26, result has 35.0 percent of original size [2022-11-18 18:24:17,356 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 25 treesize of output 29 [2022-11-18 18:24:17,368 INFO L350 Elim1Store]: Elim1 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 0 case distinctions, treesize of input 28 treesize of output 23 [2022-11-18 18:24:17,377 INFO L350 Elim1Store]: Elim1 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-18 18:24:17,728 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 18:24:17,735 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 18:24:17,736 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 18:24:17,740 INFO L350 Elim1Store]: Elim1 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 40 treesize of output 38 [2022-11-18 18:24:17,746 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 18:24:17,750 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 18:24:17,765 INFO L321 Elim1Store]: treesize reduction 47, result has 9.6 percent of original size [2022-11-18 18:24:17,765 INFO L350 Elim1Store]: Elim1 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 61 treesize of output 56 [2022-11-18 18:24:17,776 INFO L350 Elim1Store]: Elim1 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 0 case distinctions, treesize of input 50 treesize of output 39 [2022-11-18 18:24:17,783 INFO L350 Elim1Store]: Elim1 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 0 case distinctions, treesize of input 28 treesize of output 23 [2022-11-18 18:24:17,790 INFO L350 Elim1Store]: Elim1 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-18 18:24:17,798 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 12 treesize of output 11 [2022-11-18 18:24:17,806 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 18:24:17,814 INFO L321 Elim1Store]: treesize reduction 4, result has 80.0 percent of original size [2022-11-18 18:24:17,814 INFO L350 Elim1Store]: Elim1 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 1 case distinctions, treesize of input 28 treesize of output 26 [2022-11-18 18:24:18,189 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 18:24:18,209 INFO L321 Elim1Store]: treesize reduction 67, result has 9.5 percent of original size [2022-11-18 18:24:18,210 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 9 new quantified variables, introduced 10 case distinctions, treesize of input 153 treesize of output 83 [2022-11-18 18:24:18,219 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 18:24:18,229 INFO L321 Elim1Store]: treesize reduction 10, result has 41.2 percent of original size [2022-11-18 18:24:18,229 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 29 [2022-11-18 18:24:18,240 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 3 proven. 21 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-18 18:24:18,241 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 18:24:23,937 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 3 proven. 21 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-18 18:24:23,937 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1333456956] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 18:24:23,938 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 18:24:23,938 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 8] total 21 [2022-11-18 18:24:23,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536958802] [2022-11-18 18:24:23,938 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 18:24:23,939 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-11-18 18:24:23,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 18:24:23,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-11-18 18:24:23,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=362, Unknown=0, NotChecked=0, Total=420 [2022-11-18 18:24:23,940 INFO L87 Difference]: Start difference. First operand 545 states and 715 transitions. Second operand has 21 states, 21 states have (on average 3.619047619047619) internal successors, (76), 21 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:24:29,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 18:24:29,782 INFO L93 Difference]: Finished difference Result 2191 states and 2897 transitions. [2022-11-18 18:24:29,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-11-18 18:24:29,783 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 3.619047619047619) internal successors, (76), 21 states have internal predecessors, (76), 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 28 [2022-11-18 18:24:29,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 18:24:29,788 INFO L225 Difference]: With dead ends: 2191 [2022-11-18 18:24:29,789 INFO L226 Difference]: Without dead ends: 1703 [2022-11-18 18:24:29,791 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 48 SyntacticMatches, 3 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 533 ImplicationChecksByTransitivity, 9.8s TimeCoverageRelationStatistics Valid=357, Invalid=1899, Unknown=0, NotChecked=0, Total=2256 [2022-11-18 18:24:29,792 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 473 mSDsluCounter, 572 mSDsCounter, 0 mSdLazyCounter, 286 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 473 SdHoareTripleChecker+Valid, 633 SdHoareTripleChecker+Invalid, 444 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 286 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 129 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-18 18:24:29,792 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [473 Valid, 633 Invalid, 444 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 286 Invalid, 0 Unknown, 129 Unchecked, 0.9s Time] [2022-11-18 18:24:29,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1703 states. [2022-11-18 18:24:29,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1703 to 1280. [2022-11-18 18:24:29,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1280 states, 1279 states have (on average 1.2978889757623142) internal successors, (1660), 1279 states have internal predecessors, (1660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:24:29,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1280 states to 1280 states and 1660 transitions. [2022-11-18 18:24:29,989 INFO L78 Accepts]: Start accepts. Automaton has 1280 states and 1660 transitions. Word has length 28 [2022-11-18 18:24:29,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 18:24:29,989 INFO L495 AbstractCegarLoop]: Abstraction has 1280 states and 1660 transitions. [2022-11-18 18:24:29,989 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 3.619047619047619) internal successors, (76), 21 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:24:29,990 INFO L276 IsEmpty]: Start isEmpty. Operand 1280 states and 1660 transitions. [2022-11-18 18:24:29,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-18 18:24:29,991 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 18:24:29,991 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 18:24:30,005 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc17367b-de9e-4227-b775-08ac5289bbc4/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-18 18:24:30,205 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc17367b-de9e-4227-b775-08ac5289bbc4/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2022-11-18 18:24:30,206 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 18:24:30,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 18:24:30,206 INFO L85 PathProgramCache]: Analyzing trace with hash -1324510600, now seen corresponding path program 1 times [2022-11-18 18:24:30,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 18:24:30,207 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894104125] [2022-11-18 18:24:30,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 18:24:30,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 18:24:30,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:24:30,311 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-18 18:24:30,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 18:24:30,312 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894104125] [2022-11-18 18:24:30,312 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [894104125] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 18:24:30,312 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1035187592] [2022-11-18 18:24:30,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 18:24:30,313 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 18:24:30,313 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc17367b-de9e-4227-b775-08ac5289bbc4/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 18:24:30,314 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc17367b-de9e-4227-b775-08ac5289bbc4/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 18:24:30,332 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc17367b-de9e-4227-b775-08ac5289bbc4/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-18 18:24:30,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:24:30,475 INFO L263 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-18 18:24:30,477 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 18:24:30,520 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-18 18:24:30,520 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 18:24:30,569 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-18 18:24:30,570 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1035187592] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 18:24:30,570 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 18:24:30,570 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2022-11-18 18:24:30,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674068428] [2022-11-18 18:24:30,570 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 18:24:30,571 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-18 18:24:30,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 18:24:30,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-18 18:24:30,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-11-18 18:24:30,572 INFO L87 Difference]: Start difference. First operand 1280 states and 1660 transitions. Second operand has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:24:31,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 18:24:31,077 INFO L93 Difference]: Finished difference Result 3325 states and 4355 transitions. [2022-11-18 18:24:31,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-18 18:24:31,078 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 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 29 [2022-11-18 18:24:31,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 18:24:31,085 INFO L225 Difference]: With dead ends: 3325 [2022-11-18 18:24:31,085 INFO L226 Difference]: Without dead ends: 2088 [2022-11-18 18:24:31,087 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2022-11-18 18:24:31,088 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 99 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-18 18:24:31,089 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 145 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-18 18:24:31,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2088 states. [2022-11-18 18:24:31,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2088 to 2000. [2022-11-18 18:24:31,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2000 states, 1999 states have (on average 1.2676338169084542) internal successors, (2534), 1999 states have internal predecessors, (2534), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:24:31,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2000 states to 2000 states and 2534 transitions. [2022-11-18 18:24:31,426 INFO L78 Accepts]: Start accepts. Automaton has 2000 states and 2534 transitions. Word has length 29 [2022-11-18 18:24:31,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 18:24:31,426 INFO L495 AbstractCegarLoop]: Abstraction has 2000 states and 2534 transitions. [2022-11-18 18:24:31,426 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:24:31,426 INFO L276 IsEmpty]: Start isEmpty. Operand 2000 states and 2534 transitions. [2022-11-18 18:24:31,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-18 18:24:31,427 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 18:24:31,428 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 18:24:31,438 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc17367b-de9e-4227-b775-08ac5289bbc4/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-18 18:24:31,639 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc17367b-de9e-4227-b775-08ac5289bbc4/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-11-18 18:24:31,639 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 18:24:31,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 18:24:31,640 INFO L85 PathProgramCache]: Analyzing trace with hash -313393350, now seen corresponding path program 1 times [2022-11-18 18:24:31,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 18:24:31,640 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836891456] [2022-11-18 18:24:31,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 18:24:31,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 18:24:31,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:24:32,325 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 18:24:32,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 18:24:32,326 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1836891456] [2022-11-18 18:24:32,326 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1836891456] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 18:24:32,326 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [587746494] [2022-11-18 18:24:32,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 18:24:32,326 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 18:24:32,326 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc17367b-de9e-4227-b775-08ac5289bbc4/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 18:24:32,327 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc17367b-de9e-4227-b775-08ac5289bbc4/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 18:24:32,351 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc17367b-de9e-4227-b775-08ac5289bbc4/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-18 18:24:32,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:24:32,504 INFO L263 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 66 conjunts are in the unsatisfiable core [2022-11-18 18:24:32,511 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 18:24:32,517 INFO L350 Elim1Store]: Elim1 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 6 treesize of output 5 [2022-11-18 18:24:32,575 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 18:24:32,579 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 18:24:32,581 INFO L350 Elim1Store]: Elim1 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 14 [2022-11-18 18:24:32,585 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 18:24:32,589 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 18:24:32,590 INFO L350 Elim1Store]: Elim1 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 14 [2022-11-18 18:24:32,600 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 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 20 treesize of output 28 [2022-11-18 18:24:32,606 INFO L350 Elim1Store]: Elim1 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-18 18:24:32,614 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-11-18 18:24:32,615 INFO L350 Elim1Store]: Elim1 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-18 18:24:32,621 INFO L350 Elim1Store]: Elim1 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 18 treesize of output 20 [2022-11-18 18:24:32,628 INFO L350 Elim1Store]: Elim1 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-18 18:24:32,797 INFO L350 Elim1Store]: Elim1 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-18 18:24:32,803 INFO L350 Elim1Store]: Elim1 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 27 treesize of output 15 [2022-11-18 18:24:32,829 INFO L350 Elim1Store]: Elim1 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-18 18:24:32,833 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-18 18:24:32,834 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 18:24:32,925 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 18:24:32,926 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 24 treesize of output 35 [2022-11-18 18:24:32,931 INFO L350 Elim1Store]: Elim1 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 22 [2022-11-18 18:24:32,937 INFO L350 Elim1Store]: Elim1 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-18 18:24:33,002 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-18 18:24:33,003 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [587746494] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 18:24:33,003 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 18:24:33,003 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 12 [2022-11-18 18:24:33,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619415768] [2022-11-18 18:24:33,006 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 18:24:33,007 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-18 18:24:33,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 18:24:33,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-18 18:24:33,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2022-11-18 18:24:33,008 INFO L87 Difference]: Start difference. First operand 2000 states and 2534 transitions. Second operand has 12 states, 12 states have (on average 5.333333333333333) internal successors, (64), 12 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:24:33,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 18:24:33,734 INFO L93 Difference]: Finished difference Result 3278 states and 4145 transitions. [2022-11-18 18:24:33,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-18 18:24:33,734 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.333333333333333) internal successors, (64), 12 states have internal predecessors, (64), 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 29 [2022-11-18 18:24:33,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 18:24:33,743 INFO L225 Difference]: With dead ends: 3278 [2022-11-18 18:24:33,743 INFO L226 Difference]: Without dead ends: 2280 [2022-11-18 18:24:33,745 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2022-11-18 18:24:33,746 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 99 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 32 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-18 18:24:33,747 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 164 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 124 Invalid, 0 Unknown, 32 Unchecked, 0.3s Time] [2022-11-18 18:24:33,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2280 states. [2022-11-18 18:24:34,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2280 to 2002. [2022-11-18 18:24:34,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2002 states, 2001 states have (on average 1.2673663168415792) internal successors, (2536), 2001 states have internal predecessors, (2536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:24:34,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2002 states to 2002 states and 2536 transitions. [2022-11-18 18:24:34,109 INFO L78 Accepts]: Start accepts. Automaton has 2002 states and 2536 transitions. Word has length 29 [2022-11-18 18:24:34,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 18:24:34,109 INFO L495 AbstractCegarLoop]: Abstraction has 2002 states and 2536 transitions. [2022-11-18 18:24:34,110 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.333333333333333) internal successors, (64), 12 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:24:34,110 INFO L276 IsEmpty]: Start isEmpty. Operand 2002 states and 2536 transitions. [2022-11-18 18:24:34,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-18 18:24:34,113 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 18:24:34,113 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 18:24:34,119 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc17367b-de9e-4227-b775-08ac5289bbc4/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-18 18:24:34,318 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc17367b-de9e-4227-b775-08ac5289bbc4/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 18:24:34,318 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 18:24:34,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 18:24:34,319 INFO L85 PathProgramCache]: Analyzing trace with hash -190827821, now seen corresponding path program 1 times [2022-11-18 18:24:34,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 18:24:34,319 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065785586] [2022-11-18 18:24:34,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 18:24:34,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 18:24:34,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:24:34,887 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 18:24:34,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 18:24:34,887 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065785586] [2022-11-18 18:24:34,887 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2065785586] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 18:24:34,887 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1236270250] [2022-11-18 18:24:34,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 18:24:34,888 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 18:24:34,888 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc17367b-de9e-4227-b775-08ac5289bbc4/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 18:24:34,892 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc17367b-de9e-4227-b775-08ac5289bbc4/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 18:24:34,920 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc17367b-de9e-4227-b775-08ac5289bbc4/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-18 18:24:35,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:24:35,076 INFO L263 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 75 conjunts are in the unsatisfiable core [2022-11-18 18:24:35,079 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 18:24:35,141 INFO L321 Elim1Store]: treesize reduction 26, result has 42.2 percent of original size [2022-11-18 18:24:35,141 INFO L350 Elim1Store]: Elim1 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-18 18:24:35,181 INFO L321 Elim1Store]: treesize reduction 26, result has 42.2 percent of original size [2022-11-18 18:24:35,182 INFO L350 Elim1Store]: Elim1 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-18 18:24:35,193 INFO L350 Elim1Store]: Elim1 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-18 18:24:35,204 INFO L350 Elim1Store]: Elim1 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-18 18:24:35,215 INFO L350 Elim1Store]: Elim1 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-18 18:24:35,225 INFO L350 Elim1Store]: Elim1 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-18 18:24:35,258 INFO L350 Elim1Store]: Elim1 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 42 treesize of output 15 [2022-11-18 18:24:35,263 INFO L350 Elim1Store]: Elim1 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-18 18:24:35,296 INFO L350 Elim1Store]: Elim1 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 42 treesize of output 15 [2022-11-18 18:24:35,299 INFO L350 Elim1Store]: Elim1 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-18 18:24:35,592 INFO L321 Elim1Store]: treesize reduction 61, result has 17.6 percent of original size [2022-11-18 18:24:35,593 INFO L350 Elim1Store]: Elim1 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 2 case distinctions, treesize of input 85 treesize of output 61 [2022-11-18 18:24:35,622 INFO L321 Elim1Store]: treesize reduction 27, result has 38.6 percent of original size [2022-11-18 18:24:35,622 INFO L350 Elim1Store]: Elim1 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 2 case distinctions, treesize of input 52 treesize of output 45 [2022-11-18 18:24:35,961 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 18:24:35,961 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 77 treesize of output 85 [2022-11-18 18:24:35,999 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 18:24:35,999 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 60 treesize of output 72 [2022-11-18 18:24:36,146 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 18:24:36,146 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 18:24:36,419 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 18:24:36,419 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1236270250] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 18:24:36,419 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 18:24:36,420 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 8] total 20 [2022-11-18 18:24:36,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286477046] [2022-11-18 18:24:36,420 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 18:24:36,421 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-11-18 18:24:36,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 18:24:36,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-11-18 18:24:36,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=323, Unknown=0, NotChecked=0, Total=380 [2022-11-18 18:24:36,422 INFO L87 Difference]: Start difference. First operand 2002 states and 2536 transitions. Second operand has 20 states, 20 states have (on average 3.9) internal successors, (78), 20 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:24:44,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 18:24:44,678 INFO L93 Difference]: Finished difference Result 6891 states and 8985 transitions. [2022-11-18 18:24:44,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 113 states. [2022-11-18 18:24:44,679 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 3.9) internal successors, (78), 20 states have internal predecessors, (78), 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 30 [2022-11-18 18:24:44,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 18:24:44,697 INFO L225 Difference]: With dead ends: 6891 [2022-11-18 18:24:44,697 INFO L226 Difference]: Without dead ends: 4518 [2022-11-18 18:24:44,706 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 80 SyntacticMatches, 7 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6211 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=2178, Invalid=13074, Unknown=0, NotChecked=0, Total=15252 [2022-11-18 18:24:44,707 INFO L413 NwaCegarLoop]: 106 mSDtfsCounter, 1048 mSDsluCounter, 1395 mSDsCounter, 0 mSdLazyCounter, 982 mSolverCounterSat, 109 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1048 SdHoareTripleChecker+Valid, 1501 SdHoareTripleChecker+Invalid, 1198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 109 IncrementalHoareTripleChecker+Valid, 982 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 107 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-11-18 18:24:44,707 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1048 Valid, 1501 Invalid, 1198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [109 Valid, 982 Invalid, 0 Unknown, 107 Unchecked, 2.6s Time] [2022-11-18 18:24:44,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4518 states. [2022-11-18 18:24:45,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4518 to 2508. [2022-11-18 18:24:45,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2508 states, 2507 states have (on average 1.3067411248504188) internal successors, (3276), 2507 states have internal predecessors, (3276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:24:45,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2508 states to 2508 states and 3276 transitions. [2022-11-18 18:24:45,064 INFO L78 Accepts]: Start accepts. Automaton has 2508 states and 3276 transitions. Word has length 30 [2022-11-18 18:24:45,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 18:24:45,065 INFO L495 AbstractCegarLoop]: Abstraction has 2508 states and 3276 transitions. [2022-11-18 18:24:45,065 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 3.9) internal successors, (78), 20 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:24:45,065 INFO L276 IsEmpty]: Start isEmpty. Operand 2508 states and 3276 transitions. [2022-11-18 18:24:45,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-18 18:24:45,066 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 18:24:45,066 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 18:24:45,077 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc17367b-de9e-4227-b775-08ac5289bbc4/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-11-18 18:24:45,272 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc17367b-de9e-4227-b775-08ac5289bbc4/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-11-18 18:24:45,272 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 18:24:45,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 18:24:45,273 INFO L85 PathProgramCache]: Analyzing trace with hash -583854831, now seen corresponding path program 1 times [2022-11-18 18:24:45,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 18:24:45,273 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890605567] [2022-11-18 18:24:45,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 18:24:45,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 18:24:45,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:24:45,322 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-18 18:24:45,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 18:24:45,323 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890605567] [2022-11-18 18:24:45,323 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [890605567] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 18:24:45,323 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 18:24:45,323 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-18 18:24:45,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452692330] [2022-11-18 18:24:45,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 18:24:45,345 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 18:24:45,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 18:24:45,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 18:24:45,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 18:24:45,346 INFO L87 Difference]: Start difference. First operand 2508 states and 3276 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:24:45,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 18:24:45,668 INFO L93 Difference]: Finished difference Result 6274 states and 8159 transitions. [2022-11-18 18:24:45,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 18:24:45,669 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 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 30 [2022-11-18 18:24:45,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 18:24:45,682 INFO L225 Difference]: With dead ends: 6274 [2022-11-18 18:24:45,682 INFO L226 Difference]: Without dead ends: 3908 [2022-11-18 18:24:45,685 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 18:24:45,686 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 22 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-18 18:24:45,687 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 75 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-18 18:24:45,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3908 states. [2022-11-18 18:24:46,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3908 to 2566. [2022-11-18 18:24:46,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2566 states, 2565 states have (on average 1.3001949317738792) internal successors, (3335), 2565 states have internal predecessors, (3335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:24:46,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2566 states to 2566 states and 3335 transitions. [2022-11-18 18:24:46,065 INFO L78 Accepts]: Start accepts. Automaton has 2566 states and 3335 transitions. Word has length 30 [2022-11-18 18:24:46,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 18:24:46,065 INFO L495 AbstractCegarLoop]: Abstraction has 2566 states and 3335 transitions. [2022-11-18 18:24:46,065 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:24:46,065 INFO L276 IsEmpty]: Start isEmpty. Operand 2566 states and 3335 transitions. [2022-11-18 18:24:46,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-11-18 18:24:46,066 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 18:24:46,066 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 18:24:46,066 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-18 18:24:46,067 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 18:24:46,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 18:24:46,067 INFO L85 PathProgramCache]: Analyzing trace with hash 1070079280, now seen corresponding path program 1 times [2022-11-18 18:24:46,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 18:24:46,068 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557543472] [2022-11-18 18:24:46,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 18:24:46,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 18:24:46,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:24:46,736 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 18:24:46,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 18:24:46,736 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557543472] [2022-11-18 18:24:46,736 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1557543472] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 18:24:46,736 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [3717099] [2022-11-18 18:24:46,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 18:24:46,737 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 18:24:46,737 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc17367b-de9e-4227-b775-08ac5289bbc4/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 18:24:46,738 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc17367b-de9e-4227-b775-08ac5289bbc4/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 18:24:46,760 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc17367b-de9e-4227-b775-08ac5289bbc4/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-18 18:24:46,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:24:46,939 INFO L263 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 88 conjunts are in the unsatisfiable core [2022-11-18 18:24:46,942 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 18:24:46,946 INFO L350 Elim1Store]: Elim1 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 6 treesize of output 5 [2022-11-18 18:24:46,994 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 18:24:46,995 INFO L350 Elim1Store]: Elim1 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 35 treesize of output 15 [2022-11-18 18:24:46,999 INFO L350 Elim1Store]: Elim1 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 51 treesize of output 19 [2022-11-18 18:24:47,009 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-11-18 18:24:47,010 INFO L350 Elim1Store]: Elim1 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-18 18:24:47,379 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-18 18:24:47,379 INFO L350 Elim1Store]: Elim1 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 2 case distinctions, treesize of input 56 treesize of output 53 [2022-11-18 18:24:47,385 INFO L350 Elim1Store]: Elim1 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 42 treesize of output 34 [2022-11-18 18:24:47,390 INFO L350 Elim1Store]: Elim1 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 47 treesize of output 41 [2022-11-18 18:24:47,393 INFO L350 Elim1Store]: Elim1 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 33 treesize of output 25 [2022-11-18 18:24:47,428 INFO L350 Elim1Store]: Elim1 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-18 18:24:47,430 INFO L350 Elim1Store]: Elim1 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-18 18:24:47,435 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 18:24:47,435 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 18:24:47,551 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset|)) (.cse1 (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset|) 8))) (and (forall ((v_ArrVal_1108 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#queue~0#1.base| v_ArrVal_1108) .cse0) .cse1) 0)) (forall ((v_ArrVal_1109 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#queue~0#1.base| v_ArrVal_1109) .cse0) .cse1) 0)))) is different from false [2022-11-18 18:24:47,895 INFO L321 Elim1Store]: treesize reduction 25, result has 40.5 percent of original size [2022-11-18 18:24:47,896 INFO L350 Elim1Store]: Elim1 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 2 case distinctions, treesize of input 49 treesize of output 49 [2022-11-18 18:24:47,912 INFO L321 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2022-11-18 18:24:47,913 INFO L350 Elim1Store]: Elim1 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 60 treesize of output 44 [2022-11-18 18:24:47,922 INFO L350 Elim1Store]: Elim1 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-18 18:24:47,928 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 18:24:47,933 INFO L350 Elim1Store]: Elim1 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 22 treesize of output 18 [2022-11-18 18:24:48,018 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2022-11-18 18:24:48,019 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [3717099] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 18:24:48,019 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 18:24:48,019 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 23 [2022-11-18 18:24:48,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416135093] [2022-11-18 18:24:48,020 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 18:24:48,020 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-11-18 18:24:48,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 18:24:48,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-11-18 18:24:48,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=374, Unknown=11, NotChecked=40, Total=506 [2022-11-18 18:24:48,022 INFO L87 Difference]: Start difference. First operand 2566 states and 3335 transitions. Second operand has 23 states, 23 states have (on average 3.217391304347826) internal successors, (74), 23 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:24:48,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 18:24:48,880 INFO L93 Difference]: Finished difference Result 3811 states and 4946 transitions. [2022-11-18 18:24:48,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-18 18:24:48,880 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 3.217391304347826) internal successors, (74), 23 states have internal predecessors, (74), 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 33 [2022-11-18 18:24:48,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 18:24:48,889 INFO L225 Difference]: With dead ends: 3811 [2022-11-18 18:24:48,890 INFO L226 Difference]: Without dead ends: 2732 [2022-11-18 18:24:48,892 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 1 IntricatePredicates, 1 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=154, Invalid=594, Unknown=12, NotChecked=52, Total=812 [2022-11-18 18:24:48,893 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 139 mSDsluCounter, 341 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 389 SdHoareTripleChecker+Invalid, 329 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 161 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-18 18:24:48,894 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 389 Invalid, 329 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 159 Invalid, 0 Unknown, 161 Unchecked, 0.3s Time] [2022-11-18 18:24:48,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2732 states. [2022-11-18 18:24:49,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2732 to 2712. [2022-11-18 18:24:49,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2712 states, 2711 states have (on average 1.2969383991147179) internal successors, (3516), 2711 states have internal predecessors, (3516), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:24:49,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2712 states to 2712 states and 3516 transitions. [2022-11-18 18:24:49,304 INFO L78 Accepts]: Start accepts. Automaton has 2712 states and 3516 transitions. Word has length 33 [2022-11-18 18:24:49,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 18:24:49,305 INFO L495 AbstractCegarLoop]: Abstraction has 2712 states and 3516 transitions. [2022-11-18 18:24:49,305 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 3.217391304347826) internal successors, (74), 23 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:24:49,305 INFO L276 IsEmpty]: Start isEmpty. Operand 2712 states and 3516 transitions. [2022-11-18 18:24:49,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-11-18 18:24:49,306 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 18:24:49,306 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 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-18 18:24:49,317 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc17367b-de9e-4227-b775-08ac5289bbc4/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-18 18:24:49,517 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc17367b-de9e-4227-b775-08ac5289bbc4/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-11-18 18:24:49,518 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 18:24:49,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 18:24:49,518 INFO L85 PathProgramCache]: Analyzing trace with hash -1610537933, now seen corresponding path program 1 times [2022-11-18 18:24:49,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 18:24:49,518 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995082356] [2022-11-18 18:24:49,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 18:24:49,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 18:24:49,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:24:49,688 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 17 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-18 18:24:49,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 18:24:49,688 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995082356] [2022-11-18 18:24:49,689 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [995082356] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 18:24:49,689 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [380935814] [2022-11-18 18:24:49,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 18:24:49,689 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 18:24:49,689 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc17367b-de9e-4227-b775-08ac5289bbc4/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 18:24:49,690 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc17367b-de9e-4227-b775-08ac5289bbc4/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 18:24:49,708 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc17367b-de9e-4227-b775-08ac5289bbc4/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-18 18:24:49,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:24:49,884 INFO L263 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 37 conjunts are in the unsatisfiable core [2022-11-18 18:24:49,887 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 18:24:49,933 INFO L350 Elim1Store]: Elim1 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-18 18:24:49,936 INFO L350 Elim1Store]: Elim1 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-18 18:24:49,940 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 17 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-18 18:24:49,941 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 18:24:50,008 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 17 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-18 18:24:50,009 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [380935814] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 18:24:50,009 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 18:24:50,009 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 6 [2022-11-18 18:24:50,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205897378] [2022-11-18 18:24:50,011 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 18:24:50,011 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-18 18:24:50,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 18:24:50,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-18 18:24:50,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-18 18:24:50,013 INFO L87 Difference]: Start difference. First operand 2712 states and 3516 transitions. Second operand has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:24:50,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 18:24:50,463 INFO L93 Difference]: Finished difference Result 3902 states and 5067 transitions. [2022-11-18 18:24:50,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-18 18:24:50,464 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 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 38 [2022-11-18 18:24:50,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 18:24:50,474 INFO L225 Difference]: With dead ends: 3902 [2022-11-18 18:24:50,475 INFO L226 Difference]: Without dead ends: 2988 [2022-11-18 18:24:50,477 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-18 18:24:50,478 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 72 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-18 18:24:50,478 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 94 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-18 18:24:50,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2988 states. [2022-11-18 18:24:50,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2988 to 2642. [2022-11-18 18:24:50,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2642 states, 2641 states have (on average 1.3014009844755774) internal successors, (3437), 2641 states have internal predecessors, (3437), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:24:50,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2642 states to 2642 states and 3437 transitions. [2022-11-18 18:24:50,802 INFO L78 Accepts]: Start accepts. Automaton has 2642 states and 3437 transitions. Word has length 38 [2022-11-18 18:24:50,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 18:24:50,804 INFO L495 AbstractCegarLoop]: Abstraction has 2642 states and 3437 transitions. [2022-11-18 18:24:50,804 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:24:50,804 INFO L276 IsEmpty]: Start isEmpty. Operand 2642 states and 3437 transitions. [2022-11-18 18:24:50,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-11-18 18:24:50,805 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 18:24:50,805 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 18:24:50,817 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc17367b-de9e-4227-b775-08ac5289bbc4/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-18 18:24:51,017 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc17367b-de9e-4227-b775-08ac5289bbc4/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-11-18 18:24:51,017 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 18:24:51,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 18:24:51,018 INFO L85 PathProgramCache]: Analyzing trace with hash -1076330789, now seen corresponding path program 2 times [2022-11-18 18:24:51,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 18:24:51,018 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035055222] [2022-11-18 18:24:51,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 18:24:51,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 18:24:51,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:24:52,363 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-18 18:24:52,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 18:24:52,364 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035055222] [2022-11-18 18:24:52,364 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1035055222] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 18:24:52,364 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1845071642] [2022-11-18 18:24:52,364 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-18 18:24:52,364 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 18:24:52,364 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc17367b-de9e-4227-b775-08ac5289bbc4/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 18:24:52,366 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc17367b-de9e-4227-b775-08ac5289bbc4/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 18:24:52,396 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc17367b-de9e-4227-b775-08ac5289bbc4/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-18 18:24:52,588 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-18 18:24:52,588 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 18:24:52,592 INFO L263 TraceCheckSpWp]: Trace formula consists of 393 conjuncts, 93 conjunts are in the unsatisfiable core [2022-11-18 18:24:52,597 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 18:24:52,668 INFO L321 Elim1Store]: treesize reduction 26, result has 42.2 percent of original size [2022-11-18 18:24:52,668 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 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-18 18:24:52,676 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 8 treesize of output 7 [2022-11-18 18:24:52,683 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 12 treesize of output 11 [2022-11-18 18:24:52,709 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 18:24:52,710 INFO L350 Elim1Store]: Elim1 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 51 treesize of output 9 [2022-11-18 18:24:52,714 INFO L350 Elim1Store]: Elim1 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-18 18:24:52,839 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 18:24:52,842 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 18:24:52,843 INFO L350 Elim1Store]: Elim1 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 14 [2022-11-18 18:24:52,847 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 18:24:52,850 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 18:24:52,851 INFO L350 Elim1Store]: Elim1 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 30 treesize of output 25 [2022-11-18 18:24:52,855 INFO L350 Elim1Store]: Elim1 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 0 case distinctions, treesize of input 25 treesize of output 20 [2022-11-18 18:24:52,864 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 12 treesize of output 11 [2022-11-18 18:24:52,871 INFO L350 Elim1Store]: Elim1 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-18 18:24:53,051 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 21 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-18 18:24:53,052 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 18:24:53,149 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1348 (Array Int Int)) (v_ArrVal_1341 (Array Int Int)) (v_ArrVal_1346 Int)) (or (not (= (select (select (store (store |c_#memory_$Pointer$.base| v_ArrVal_1346 (store v_ArrVal_1348 8 (select (select (store |c_#memory_$Pointer$.base| v_ArrVal_1346 v_ArrVal_1348) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset|))) |c_ULTIMATE.start_main_~#queue~0#1.base| (store (select (store |c_#memory_$Pointer$.base| v_ArrVal_1346 v_ArrVal_1341) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset| v_ArrVal_1346)) v_ArrVal_1346) 8) 0)) (not (< v_ArrVal_1346 |c_#StackHeapBarrier|)))) is different from false [2022-11-18 18:24:53,261 INFO L350 Elim1Store]: Elim1 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 109 treesize of output 107 [2022-11-18 18:24:53,267 INFO L350 Elim1Store]: Elim1 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 118 treesize of output 116 [2022-11-18 18:24:53,274 INFO L350 Elim1Store]: Elim1 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 127 treesize of output 125 [2022-11-18 18:24:53,282 INFO L350 Elim1Store]: Elim1 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 136 treesize of output 134 [2022-11-18 18:24:53,288 INFO L350 Elim1Store]: Elim1 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 134 treesize of output 130 [2022-11-18 18:24:53,401 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 17 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 12 not checked. [2022-11-18 18:24:53,402 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1845071642] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 18:24:53,402 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 18:24:53,402 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7, 7] total 21 [2022-11-18 18:24:53,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437717302] [2022-11-18 18:24:53,403 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 18:24:53,404 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-11-18 18:24:53,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 18:24:53,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-11-18 18:24:53,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=324, Unknown=1, NotChecked=36, Total=420 [2022-11-18 18:24:53,405 INFO L87 Difference]: Start difference. First operand 2642 states and 3437 transitions. Second operand has 21 states, 21 states have (on average 4.761904761904762) internal successors, (100), 21 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:24:55,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 18:24:55,898 INFO L93 Difference]: Finished difference Result 5712 states and 7479 transitions. [2022-11-18 18:24:55,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-11-18 18:24:55,899 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 4.761904761904762) internal successors, (100), 21 states have internal predecessors, (100), 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 40 [2022-11-18 18:24:55,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 18:24:55,908 INFO L225 Difference]: With dead ends: 5712 [2022-11-18 18:24:55,908 INFO L226 Difference]: Without dead ends: 3130 [2022-11-18 18:24:55,911 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 72 SyntacticMatches, 5 SemanticMatches, 38 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 381 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=293, Invalid=1192, Unknown=1, NotChecked=74, Total=1560 [2022-11-18 18:24:55,912 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 367 mSDsluCounter, 527 mSDsCounter, 0 mSdLazyCounter, 494 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 367 SdHoareTripleChecker+Valid, 576 SdHoareTripleChecker+Invalid, 628 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 494 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 114 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-11-18 18:24:55,912 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [367 Valid, 576 Invalid, 628 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 494 Invalid, 0 Unknown, 114 Unchecked, 1.0s Time] [2022-11-18 18:24:55,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3130 states. [2022-11-18 18:24:56,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3130 to 2753. [2022-11-18 18:24:56,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2753 states, 2752 states have (on average 1.284156976744186) internal successors, (3534), 2752 states have internal predecessors, (3534), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:24:56,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2753 states to 2753 states and 3534 transitions. [2022-11-18 18:24:56,191 INFO L78 Accepts]: Start accepts. Automaton has 2753 states and 3534 transitions. Word has length 40 [2022-11-18 18:24:56,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 18:24:56,191 INFO L495 AbstractCegarLoop]: Abstraction has 2753 states and 3534 transitions. [2022-11-18 18:24:56,191 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 4.761904761904762) internal successors, (100), 21 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:24:56,191 INFO L276 IsEmpty]: Start isEmpty. Operand 2753 states and 3534 transitions. [2022-11-18 18:24:56,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-11-18 18:24:56,192 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 18:24:56,192 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 18:24:56,197 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc17367b-de9e-4227-b775-08ac5289bbc4/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-18 18:24:56,393 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc17367b-de9e-4227-b775-08ac5289bbc4/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-11-18 18:24:56,393 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 18:24:56,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 18:24:56,394 INFO L85 PathProgramCache]: Analyzing trace with hash -1871575436, now seen corresponding path program 2 times [2022-11-18 18:24:56,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 18:24:56,394 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005317345] [2022-11-18 18:24:56,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 18:24:56,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 18:24:56,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:24:57,428 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 13 proven. 13 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-18 18:24:57,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 18:24:57,428 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005317345] [2022-11-18 18:24:57,428 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1005317345] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 18:24:57,428 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [347227439] [2022-11-18 18:24:57,429 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-18 18:24:57,429 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 18:24:57,429 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc17367b-de9e-4227-b775-08ac5289bbc4/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 18:24:57,430 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc17367b-de9e-4227-b775-08ac5289bbc4/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 18:24:57,432 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc17367b-de9e-4227-b775-08ac5289bbc4/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-18 18:24:57,654 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-18 18:24:57,654 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 18:24:57,658 INFO L263 TraceCheckSpWp]: Trace formula consists of 402 conjuncts, 83 conjunts are in the unsatisfiable core [2022-11-18 18:24:57,663 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 18:24:57,890 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 18:24:57,894 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 18:24:57,895 INFO L350 Elim1Store]: Elim1 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 29 treesize of output 24 [2022-11-18 18:24:57,899 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 18:24:57,902 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 18:24:57,903 INFO L350 Elim1Store]: Elim1 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 29 treesize of output 24 [2022-11-18 18:24:57,908 INFO L350 Elim1Store]: Elim1 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 0 case distinctions, treesize of input 24 treesize of output 19 [2022-11-18 18:24:57,915 INFO L350 Elim1Store]: Elim1 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-18 18:24:57,922 INFO L350 Elim1Store]: Elim1 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 0 case distinctions, treesize of input 28 treesize of output 23 [2022-11-18 18:24:57,929 INFO L350 Elim1Store]: Elim1 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-18 18:24:58,069 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 18:24:58,071 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 18:24:58,074 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 18:24:58,074 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 66 treesize of output 38 [2022-11-18 18:24:58,081 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 18:24:58,087 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-18 18:24:58,087 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 18 [2022-11-18 18:24:58,091 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 13 proven. 12 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-18 18:24:58,091 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 18:25:02,611 INFO L350 Elim1Store]: Elim1 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 110 treesize of output 104 [2022-11-18 18:25:02,618 INFO L350 Elim1Store]: Elim1 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 134 treesize of output 128 [2022-11-18 18:25:02,623 INFO L350 Elim1Store]: Elim1 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 121 treesize of output 119 [2022-11-18 18:25:02,638 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 18:25:02,638 INFO L350 Elim1Store]: Elim1 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 134 [2022-11-18 18:25:02,657 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 18:25:02,657 INFO L350 Elim1Store]: Elim1 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 95 treesize of output 97 [2022-11-18 18:25:02,664 INFO L350 Elim1Store]: Elim1 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 14 treesize of output 12 [2022-11-18 18:25:02,676 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 18:25:04,938 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 2 proven. 14 refuted. 9 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-18 18:25:04,938 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [347227439] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 18:25:04,939 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 18:25:04,939 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 18 [2022-11-18 18:25:04,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258523777] [2022-11-18 18:25:04,939 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 18:25:04,939 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-11-18 18:25:04,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 18:25:04,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-11-18 18:25:04,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=242, Unknown=3, NotChecked=0, Total=306 [2022-11-18 18:25:04,941 INFO L87 Difference]: Start difference. First operand 2753 states and 3534 transitions. Second operand has 18 states, 18 states have (on average 5.722222222222222) internal successors, (103), 18 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:25:05,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 18:25:05,973 INFO L93 Difference]: Finished difference Result 5004 states and 6391 transitions. [2022-11-18 18:25:05,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-18 18:25:05,973 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 5.722222222222222) internal successors, (103), 18 states have internal predecessors, (103), 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 41 [2022-11-18 18:25:05,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 18:25:05,983 INFO L225 Difference]: With dead ends: 5004 [2022-11-18 18:25:05,983 INFO L226 Difference]: Without dead ends: 2899 [2022-11-18 18:25:05,986 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=187, Invalid=622, Unknown=3, NotChecked=0, Total=812 [2022-11-18 18:25:05,987 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 108 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 281 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 38 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-18 18:25:05,987 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 281 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 117 Invalid, 0 Unknown, 38 Unchecked, 0.3s Time] [2022-11-18 18:25:05,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2899 states. [2022-11-18 18:25:06,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2899 to 2566. [2022-11-18 18:25:06,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2566 states, 2565 states have (on average 1.2717348927875243) internal successors, (3262), 2565 states have internal predecessors, (3262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:25:06,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2566 states to 2566 states and 3262 transitions. [2022-11-18 18:25:06,381 INFO L78 Accepts]: Start accepts. Automaton has 2566 states and 3262 transitions. Word has length 41 [2022-11-18 18:25:06,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 18:25:06,382 INFO L495 AbstractCegarLoop]: Abstraction has 2566 states and 3262 transitions. [2022-11-18 18:25:06,382 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 5.722222222222222) internal successors, (103), 18 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:25:06,382 INFO L276 IsEmpty]: Start isEmpty. Operand 2566 states and 3262 transitions. [2022-11-18 18:25:06,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-11-18 18:25:06,383 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 18:25:06,383 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1] [2022-11-18 18:25:06,390 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc17367b-de9e-4227-b775-08ac5289bbc4/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-11-18 18:25:06,589 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc17367b-de9e-4227-b775-08ac5289bbc4/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 18:25:06,590 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 18:25:06,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 18:25:06,590 INFO L85 PathProgramCache]: Analyzing trace with hash -2115090350, now seen corresponding path program 4 times [2022-11-18 18:25:06,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 18:25:06,590 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267734332] [2022-11-18 18:25:06,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 18:25:06,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 18:25:06,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:25:10,420 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 18:25:10,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 18:25:10,420 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267734332] [2022-11-18 18:25:10,420 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [267734332] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 18:25:10,421 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [829457458] [2022-11-18 18:25:10,421 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-18 18:25:10,421 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 18:25:10,421 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc17367b-de9e-4227-b775-08ac5289bbc4/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 18:25:10,424 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc17367b-de9e-4227-b775-08ac5289bbc4/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 18:25:10,426 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc17367b-de9e-4227-b775-08ac5289bbc4/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-11-18 18:25:10,662 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-18 18:25:10,662 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 18:25:10,667 INFO L263 TraceCheckSpWp]: Trace formula consists of 442 conjuncts, 188 conjunts are in the unsatisfiable core [2022-11-18 18:25:10,674 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 18:25:10,682 INFO L350 Elim1Store]: Elim1 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 6 treesize of output 5 [2022-11-18 18:25:10,760 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 18:25:10,763 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 18:25:10,764 INFO L350 Elim1Store]: Elim1 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 14 [2022-11-18 18:25:10,768 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 18:25:10,771 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 18:25:10,775 INFO L350 Elim1Store]: Elim1 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 14 [2022-11-18 18:25:10,779 INFO L350 Elim1Store]: Elim1 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-18 18:25:10,801 INFO L321 Elim1Store]: treesize reduction 26, result has 35.0 percent of original size [2022-11-18 18:25:10,802 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 25 treesize of output 29 [2022-11-18 18:25:10,813 INFO L350 Elim1Store]: Elim1 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-18 18:25:11,061 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 18:25:11,066 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 18:25:11,068 INFO L350 Elim1Store]: Elim1 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 39 treesize of output 32 [2022-11-18 18:25:11,072 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 18:25:11,076 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 18:25:11,079 INFO L350 Elim1Store]: Elim1 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 29 treesize of output 24 [2022-11-18 18:25:11,087 INFO L350 Elim1Store]: Elim1 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 0 case distinctions, treesize of input 32 treesize of output 25 [2022-11-18 18:25:11,097 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 18:25:11,106 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-18 18:25:11,107 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 26 [2022-11-18 18:25:11,121 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 12 treesize of output 11 [2022-11-18 18:25:11,135 INFO L350 Elim1Store]: Elim1 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 0 case distinctions, treesize of input 28 treesize of output 23 [2022-11-18 18:25:11,144 INFO L350 Elim1Store]: Elim1 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-18 18:25:12,051 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 18:25:12,057 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 18:25:12,058 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 18:25:12,062 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 18:25:12,063 INFO L350 Elim1Store]: Elim1 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 79 treesize of output 67 [2022-11-18 18:25:12,073 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 18:25:12,078 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 18:25:12,098 INFO L321 Elim1Store]: treesize reduction 49, result has 9.3 percent of original size [2022-11-18 18:25:12,099 INFO L350 Elim1Store]: Elim1 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 111 treesize of output 92 [2022-11-18 18:25:12,109 INFO L350 Elim1Store]: Elim1 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 0 case distinctions, treesize of input 94 treesize of output 77 [2022-11-18 18:25:12,124 INFO L350 Elim1Store]: Elim1 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 0 case distinctions, treesize of input 55 treesize of output 46 [2022-11-18 18:25:12,135 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 18:25:12,136 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 18:25:12,137 INFO L350 Elim1Store]: Elim1 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 31 treesize of output 35 [2022-11-18 18:25:12,148 INFO L350 Elim1Store]: Elim1 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 18 treesize of output 17 [2022-11-18 18:25:12,170 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 18:25:12,172 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 18:25:12,205 INFO L321 Elim1Store]: treesize reduction 48, result has 50.5 percent of original size [2022-11-18 18:25:12,205 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 3 case distinctions, treesize of input 57 treesize of output 61 [2022-11-18 18:25:12,223 INFO L350 Elim1Store]: Elim1 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 18 treesize of output 17 [2022-11-18 18:25:12,819 INFO L321 Elim1Store]: treesize reduction 70, result has 4.1 percent of original size [2022-11-18 18:25:12,819 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 6 case distinctions, treesize of input 256 treesize of output 102 [2022-11-18 18:25:12,828 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 18:25:12,829 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 18:25:12,836 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-18 18:25:12,837 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 32 [2022-11-18 18:25:12,890 INFO L350 Elim1Store]: Elim1 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-18 18:25:12,931 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 71 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-18 18:25:12,931 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 18:25:13,217 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1746 (Array Int Int)) (v_ArrVal_1744 (Array Int Int)) (v_ArrVal_1733 (Array Int Int)) (|v_ULTIMATE.start_append_to_queue_~n#1.offset_17| Int) (v_ArrVal_1731 (Array Int Int)) (v_ArrVal_1742 (Array Int Int)) (v_ArrVal_1750 Int)) (or (not (= (select |c_#valid| v_ArrVal_1750) 0)) (< 0 (let ((.cse4 (+ |v_ULTIMATE.start_append_to_queue_~n#1.offset_17| 8))) (let ((.cse3 (store (store |c_#memory_$Pointer$.offset| v_ArrVal_1750 (store v_ArrVal_1731 .cse4 (select (select (store |c_#memory_$Pointer$.offset| v_ArrVal_1750 v_ArrVal_1731) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset|))) |c_ULTIMATE.start_main_~#queue~0#1.base| (store (select (store |c_#memory_$Pointer$.offset| v_ArrVal_1750 v_ArrVal_1744) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset| |v_ULTIMATE.start_append_to_queue_~n#1.offset_17|))) (.cse0 (let ((.cse5 (store |c_#memory_$Pointer$.base| v_ArrVal_1750 (store v_ArrVal_1742 .cse4 (select (select (store |c_#memory_$Pointer$.base| v_ArrVal_1750 v_ArrVal_1742) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset|))))) (store .cse5 |c_ULTIMATE.start_main_~#queue~0#1.base| (store (select .cse5 |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset| v_ArrVal_1750))))) (let ((.cse1 (select (select .cse0 v_ArrVal_1750) .cse4)) (.cse2 (+ (select (select .cse3 v_ArrVal_1750) .cse4) 8))) (select (select (store (store |c_#memory_int| v_ArrVal_1750 v_ArrVal_1746) |c_ULTIMATE.start_main_~#queue~0#1.base| v_ArrVal_1733) (select (select .cse0 .cse1) .cse2)) (+ (select (select .cse3 .cse1) .cse2) 4)))))) (not (< v_ArrVal_1750 |c_#StackHeapBarrier|)))) is different from false [2022-11-18 18:25:13,674 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 18:25:13,674 INFO L350 Elim1Store]: Elim1 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 1341 treesize of output 1340 [2022-11-18 18:25:13,694 INFO L350 Elim1Store]: Elim1 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 604 treesize of output 492 [2022-11-18 18:25:13,711 INFO L350 Elim1Store]: Elim1 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 986 treesize of output 762 [2022-11-18 18:26:13,634 WARN L233 SmtUtils]: Spent 35.38s on a formula simplification. DAG size of input: 90 DAG size of output: 79 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-18 18:26:55,764 WARN L233 SmtUtils]: Spent 29.87s on a formula simplification. DAG size of input: 84 DAG size of output: 80 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-18 18:27:24,675 WARN L233 SmtUtils]: Spent 14.25s on a formula simplification that was a NOOP. DAG size: 82 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-18 18:27:27,956 WARN L859 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1724 Int)) (or (not (< v_ArrVal_1724 |c_#StackHeapBarrier|)) (forall ((v_ArrVal_1723 (Array Int Int)) (v_ArrVal_1750 Int) (v_ArrVal_1719 (Array Int Int)) (v_ArrVal_1716 (Array Int Int))) (or (not (= (select (store |c_#valid| v_ArrVal_1724 1) v_ArrVal_1750) 0)) (forall ((v_ArrVal_1744 (Array Int Int)) (|v_ULTIMATE.start_append_to_queue_~n#1.offset_17| Int) (v_ArrVal_1731 (Array Int Int)) (v_ArrVal_1742 (Array Int Int))) (not (= (let ((.cse1 (+ |v_ULTIMATE.start_append_to_queue_~n#1.offset_17| 8))) (select (let ((.cse0 (let ((.cse2 (let ((.cse3 (store (store |c_#memory_$Pointer$.base| v_ArrVal_1724 (store v_ArrVal_1719 8 (select (select (store |c_#memory_$Pointer$.base| v_ArrVal_1724 v_ArrVal_1719) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset|))) |c_ULTIMATE.start_main_~#queue~0#1.base| (store (select (store |c_#memory_$Pointer$.base| v_ArrVal_1724 v_ArrVal_1723) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset| v_ArrVal_1724)))) (store .cse3 v_ArrVal_1750 (store v_ArrVal_1742 .cse1 (select (select (store .cse3 v_ArrVal_1750 v_ArrVal_1742) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset|)))))) (store .cse2 |c_ULTIMATE.start_main_~#queue~0#1.base| (store (select .cse2 |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset| v_ArrVal_1750))))) (select .cse0 (select (select .cse0 v_ArrVal_1750) .cse1))) (+ (select (select (let ((.cse4 (let ((.cse5 (store |c_#memory_$Pointer$.offset| v_ArrVal_1724 (store v_ArrVal_1716 8 (select (select (store |c_#memory_$Pointer$.offset| v_ArrVal_1724 v_ArrVal_1716) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset|))))) (store .cse5 |c_ULTIMATE.start_main_~#queue~0#1.base| (store (select .cse5 |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset| 0))))) (store (store .cse4 v_ArrVal_1750 (store v_ArrVal_1731 .cse1 (select (select (store .cse4 v_ArrVal_1750 v_ArrVal_1731) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset|))) |c_ULTIMATE.start_main_~#queue~0#1.base| (store (select (store .cse4 v_ArrVal_1750 v_ArrVal_1744) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset| |v_ULTIMATE.start_append_to_queue_~n#1.offset_17|))) v_ArrVal_1750) .cse1) 8))) |c_ULTIMATE.start_main_~#queue~0#1.base|))) (not (< v_ArrVal_1750 |c_#StackHeapBarrier|)))))) (forall ((v_ArrVal_1724 Int)) (or (forall ((v_ArrVal_1723 (Array Int Int)) (v_ArrVal_1750 Int) (v_ArrVal_1719 (Array Int Int)) (v_ArrVal_1716 (Array Int Int))) (or (not (= (select (store |c_#valid| v_ArrVal_1724 1) v_ArrVal_1750) 0)) (not (< v_ArrVal_1750 |c_#StackHeapBarrier|)) (forall ((v_ArrVal_1744 (Array Int Int)) (|v_ULTIMATE.start_append_to_queue_~n#1.offset_17| Int) (v_ArrVal_1731 (Array Int Int)) (v_ArrVal_1742 (Array Int Int))) (let ((.cse9 (store (store |c_#memory_$Pointer$.base| v_ArrVal_1724 (store v_ArrVal_1719 8 (select (select (store |c_#memory_$Pointer$.base| v_ArrVal_1724 v_ArrVal_1719) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset|))) |c_ULTIMATE.start_main_~#queue~0#1.base| (store (select (store |c_#memory_$Pointer$.base| v_ArrVal_1724 v_ArrVal_1723) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset| v_ArrVal_1724)))) (= (let ((.cse7 (+ |v_ULTIMATE.start_append_to_queue_~n#1.offset_17| 8))) (select (let ((.cse6 (let ((.cse8 (store .cse9 v_ArrVal_1750 (store v_ArrVal_1742 .cse7 (select (select (store .cse9 v_ArrVal_1750 v_ArrVal_1742) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset|))))) (store .cse8 |c_ULTIMATE.start_main_~#queue~0#1.base| (store (select .cse8 |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset| v_ArrVal_1750))))) (select .cse6 (select (select .cse6 v_ArrVal_1750) .cse7))) (+ (select (select (let ((.cse10 (let ((.cse11 (store |c_#memory_$Pointer$.offset| v_ArrVal_1724 (store v_ArrVal_1716 8 (select (select (store |c_#memory_$Pointer$.offset| v_ArrVal_1724 v_ArrVal_1716) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset|))))) (store .cse11 |c_ULTIMATE.start_main_~#queue~0#1.base| (store (select .cse11 |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset| 0))))) (store (store .cse10 v_ArrVal_1750 (store v_ArrVal_1731 .cse7 (select (select (store .cse10 v_ArrVal_1750 v_ArrVal_1731) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset|))) |c_ULTIMATE.start_main_~#queue~0#1.base| (store (select (store .cse10 v_ArrVal_1750 v_ArrVal_1744) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset| |v_ULTIMATE.start_append_to_queue_~n#1.offset_17|))) v_ArrVal_1750) .cse7) 8))) (select (select .cse9 v_ArrVal_1724) 8)))))) (not (< v_ArrVal_1724 |c_#StackHeapBarrier|)))) (forall ((v_ArrVal_1724 Int)) (or (not (< v_ArrVal_1724 |c_#StackHeapBarrier|)) (forall ((v_ArrVal_1723 (Array Int Int)) (v_ArrVal_1750 Int) (v_ArrVal_1719 (Array Int Int)) (v_ArrVal_1716 (Array Int Int))) (or (not (= (select (store |c_#valid| v_ArrVal_1724 1) v_ArrVal_1750) 0)) (forall ((v_ArrVal_1744 (Array Int Int)) (|v_ULTIMATE.start_append_to_queue_~n#1.offset_17| Int) (v_ArrVal_1731 (Array Int Int)) (v_ArrVal_1742 (Array Int Int))) (let ((.cse17 (+ |v_ULTIMATE.start_append_to_queue_~n#1.offset_17| 8)) (.cse12 (let ((.cse20 (store |c_#memory_$Pointer$.offset| v_ArrVal_1724 (store v_ArrVal_1716 8 (select (select (store |c_#memory_$Pointer$.offset| v_ArrVal_1724 v_ArrVal_1716) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset|))))) (store .cse20 |c_ULTIMATE.start_main_~#queue~0#1.base| (store (select .cse20 |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset| 0))))) (let ((.cse13 (store (store .cse12 v_ArrVal_1750 (store v_ArrVal_1731 .cse17 (select (select (store .cse12 v_ArrVal_1750 v_ArrVal_1731) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset|))) |c_ULTIMATE.start_main_~#queue~0#1.base| (store (select (store .cse12 v_ArrVal_1750 v_ArrVal_1744) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset| |v_ULTIMATE.start_append_to_queue_~n#1.offset_17|))) (.cse16 (let ((.cse18 (let ((.cse19 (store (store |c_#memory_$Pointer$.base| v_ArrVal_1724 (store v_ArrVal_1719 8 (select (select (store |c_#memory_$Pointer$.base| v_ArrVal_1724 v_ArrVal_1719) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset|))) |c_ULTIMATE.start_main_~#queue~0#1.base| (store (select (store |c_#memory_$Pointer$.base| v_ArrVal_1724 v_ArrVal_1723) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset| v_ArrVal_1724)))) (store .cse19 v_ArrVal_1750 (store v_ArrVal_1742 .cse17 (select (select (store .cse19 v_ArrVal_1750 v_ArrVal_1742) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset|)))))) (store .cse18 |c_ULTIMATE.start_main_~#queue~0#1.base| (store (select .cse18 |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset| v_ArrVal_1750))))) (let ((.cse14 (select (select .cse16 v_ArrVal_1750) .cse17)) (.cse15 (+ (select (select .cse13 v_ArrVal_1750) .cse17) 8))) (or (= (select (select .cse12 v_ArrVal_1724) 8) (select (select .cse13 .cse14) .cse15)) (= (select (select .cse16 .cse14) .cse15) v_ArrVal_1750)))))) (not (< v_ArrVal_1750 |c_#StackHeapBarrier|)))))) (forall ((v_ArrVal_1724 Int)) (or (forall ((v_ArrVal_1723 (Array Int Int)) (v_ArrVal_1750 Int) (v_ArrVal_1719 (Array Int Int)) (v_ArrVal_1716 (Array Int Int))) (or (not (= (select (store |c_#valid| v_ArrVal_1724 1) v_ArrVal_1750) 0)) (forall ((v_ArrVal_1744 (Array Int Int)) (|v_ULTIMATE.start_append_to_queue_~n#1.offset_17| Int) (v_ArrVal_1731 (Array Int Int)) (v_ArrVal_1742 (Array Int Int))) (let ((.cse22 (store (store |c_#memory_$Pointer$.base| v_ArrVal_1724 (store v_ArrVal_1719 8 (select (select (store |c_#memory_$Pointer$.base| v_ArrVal_1724 v_ArrVal_1719) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset|))) |c_ULTIMATE.start_main_~#queue~0#1.base| (store (select (store |c_#memory_$Pointer$.base| v_ArrVal_1724 v_ArrVal_1723) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset| v_ArrVal_1724)))) (let ((.cse21 (let ((.cse24 (+ |v_ULTIMATE.start_append_to_queue_~n#1.offset_17| 8))) (select (let ((.cse23 (let ((.cse25 (store .cse22 v_ArrVal_1750 (store v_ArrVal_1742 .cse24 (select (select (store .cse22 v_ArrVal_1750 v_ArrVal_1742) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset|))))) (store .cse25 |c_ULTIMATE.start_main_~#queue~0#1.base| (store (select .cse25 |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset| v_ArrVal_1750))))) (select .cse23 (select (select .cse23 v_ArrVal_1750) .cse24))) (+ (select (select (let ((.cse26 (let ((.cse27 (store |c_#memory_$Pointer$.offset| v_ArrVal_1724 (store v_ArrVal_1716 8 (select (select (store |c_#memory_$Pointer$.offset| v_ArrVal_1724 v_ArrVal_1716) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset|))))) (store .cse27 |c_ULTIMATE.start_main_~#queue~0#1.base| (store (select .cse27 |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset| 0))))) (store (store .cse26 v_ArrVal_1750 (store v_ArrVal_1731 .cse24 (select (select (store .cse26 v_ArrVal_1750 v_ArrVal_1731) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset|))) |c_ULTIMATE.start_main_~#queue~0#1.base| (store (select (store .cse26 v_ArrVal_1750 v_ArrVal_1744) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset| |v_ULTIMATE.start_append_to_queue_~n#1.offset_17|))) v_ArrVal_1750) .cse24) 8))))) (or (= .cse21 (select (select .cse22 v_ArrVal_1724) 8)) (= .cse21 v_ArrVal_1750))))) (not (< v_ArrVal_1750 |c_#StackHeapBarrier|)))) (not (< v_ArrVal_1724 |c_#StackHeapBarrier|)))) (forall ((v_ArrVal_1724 Int)) (or (not (< v_ArrVal_1724 |c_#StackHeapBarrier|)) (forall ((v_ArrVal_1723 (Array Int Int)) (v_ArrVal_1750 Int) (v_ArrVal_1719 (Array Int Int)) (v_ArrVal_1716 (Array Int Int))) (or (not (= (select (store |c_#valid| v_ArrVal_1724 1) v_ArrVal_1750) 0)) (forall ((v_ArrVal_1744 (Array Int Int)) (|v_ULTIMATE.start_append_to_queue_~n#1.offset_17| Int) (v_ArrVal_1731 (Array Int Int)) (v_ArrVal_1742 (Array Int Int))) (let ((.cse29 (store (store |c_#memory_$Pointer$.base| v_ArrVal_1724 (store v_ArrVal_1719 8 (select (select (store |c_#memory_$Pointer$.base| v_ArrVal_1724 v_ArrVal_1719) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset|))) |c_ULTIMATE.start_main_~#queue~0#1.base| (store (select (store |c_#memory_$Pointer$.base| v_ArrVal_1724 v_ArrVal_1723) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset| v_ArrVal_1724)))) (let ((.cse28 (let ((.cse31 (+ |v_ULTIMATE.start_append_to_queue_~n#1.offset_17| 8))) (select (let ((.cse30 (let ((.cse32 (store .cse29 v_ArrVal_1750 (store v_ArrVal_1742 .cse31 (select (select (store .cse29 v_ArrVal_1750 v_ArrVal_1742) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset|))))) (store .cse32 |c_ULTIMATE.start_main_~#queue~0#1.base| (store (select .cse32 |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset| v_ArrVal_1750))))) (select .cse30 (select (select .cse30 v_ArrVal_1750) .cse31))) (+ (select (select (let ((.cse33 (let ((.cse34 (store |c_#memory_$Pointer$.offset| v_ArrVal_1724 (store v_ArrVal_1716 8 (select (select (store |c_#memory_$Pointer$.offset| v_ArrVal_1724 v_ArrVal_1716) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset|))))) (store .cse34 |c_ULTIMATE.start_main_~#queue~0#1.base| (store (select .cse34 |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset| 0))))) (store (store .cse33 v_ArrVal_1750 (store v_ArrVal_1731 .cse31 (select (select (store .cse33 v_ArrVal_1750 v_ArrVal_1731) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset|))) |c_ULTIMATE.start_main_~#queue~0#1.base| (store (select (store .cse33 v_ArrVal_1750 v_ArrVal_1744) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset| |v_ULTIMATE.start_append_to_queue_~n#1.offset_17|))) v_ArrVal_1750) .cse31) 8))))) (or (= .cse28 (select (select .cse29 v_ArrVal_1724) 8)) (= .cse28 |c_ULTIMATE.start_main_~#queue~0#1.base|))))) (not (< v_ArrVal_1750 |c_#StackHeapBarrier|)))))) (forall ((v_ArrVal_1724 Int)) (or (not (< v_ArrVal_1724 |c_#StackHeapBarrier|)) (forall ((v_ArrVal_1723 (Array Int Int)) (v_ArrVal_1750 Int) (v_ArrVal_1719 (Array Int Int)) (v_ArrVal_1716 (Array Int Int))) (or (not (= (select (store |c_#valid| v_ArrVal_1724 1) v_ArrVal_1750) 0)) (forall ((v_ArrVal_1744 (Array Int Int)) (|v_ULTIMATE.start_append_to_queue_~n#1.offset_17| Int) (v_ArrVal_1731 (Array Int Int)) (v_ArrVal_1742 (Array Int Int))) (not (= (let ((.cse36 (+ |v_ULTIMATE.start_append_to_queue_~n#1.offset_17| 8))) (select (let ((.cse35 (let ((.cse37 (let ((.cse38 (store (store |c_#memory_$Pointer$.base| v_ArrVal_1724 (store v_ArrVal_1719 8 (select (select (store |c_#memory_$Pointer$.base| v_ArrVal_1724 v_ArrVal_1719) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset|))) |c_ULTIMATE.start_main_~#queue~0#1.base| (store (select (store |c_#memory_$Pointer$.base| v_ArrVal_1724 v_ArrVal_1723) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset| v_ArrVal_1724)))) (store .cse38 v_ArrVal_1750 (store v_ArrVal_1742 .cse36 (select (select (store .cse38 v_ArrVal_1750 v_ArrVal_1742) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset|)))))) (store .cse37 |c_ULTIMATE.start_main_~#queue~0#1.base| (store (select .cse37 |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset| v_ArrVal_1750))))) (select .cse35 (select (select .cse35 v_ArrVal_1750) .cse36))) (+ (select (select (let ((.cse39 (let ((.cse40 (store |c_#memory_$Pointer$.offset| v_ArrVal_1724 (store v_ArrVal_1716 8 (select (select (store |c_#memory_$Pointer$.offset| v_ArrVal_1724 v_ArrVal_1716) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset|))))) (store .cse40 |c_ULTIMATE.start_main_~#queue~0#1.base| (store (select .cse40 |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset| 0))))) (store (store .cse39 v_ArrVal_1750 (store v_ArrVal_1731 .cse36 (select (select (store .cse39 v_ArrVal_1750 v_ArrVal_1731) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset|))) |c_ULTIMATE.start_main_~#queue~0#1.base| (store (select (store .cse39 v_ArrVal_1750 v_ArrVal_1744) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset| |v_ULTIMATE.start_append_to_queue_~n#1.offset_17|))) v_ArrVal_1750) .cse36) 8))) v_ArrVal_1750))) (not (< v_ArrVal_1750 |c_#StackHeapBarrier|))))))) is different from true