./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 6b4ec56b Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dcfdd55-4246-4c8a-94b8-ddda31df9702/bin/uautomizer-ug76WZFUDN/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dcfdd55-4246-4c8a-94b8-ddda31df9702/bin/uautomizer-ug76WZFUDN/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dcfdd55-4246-4c8a-94b8-ddda31df9702/bin/uautomizer-ug76WZFUDN/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dcfdd55-4246-4c8a-94b8-ddda31df9702/bin/uautomizer-ug76WZFUDN/config/AutomizerReach.xml -i ../../sv-benchmarks/c/heap-data/process_queue.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dcfdd55-4246-4c8a-94b8-ddda31df9702/bin/uautomizer-ug76WZFUDN/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dcfdd55-4246-4c8a-94b8-ddda31df9702/bin/uautomizer-ug76WZFUDN --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-6b4ec56 [2022-11-20 11:00:03,268 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-20 11:00:03,271 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-20 11:00:03,315 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-20 11:00:03,316 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-20 11:00:03,320 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-20 11:00:03,322 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-20 11:00:03,325 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-20 11:00:03,331 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-20 11:00:03,336 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-20 11:00:03,338 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-20 11:00:03,341 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-20 11:00:03,341 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-20 11:00:03,344 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-20 11:00:03,345 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-20 11:00:03,347 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-20 11:00:03,349 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-20 11:00:03,350 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-20 11:00:03,351 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-20 11:00:03,358 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-20 11:00:03,360 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-20 11:00:03,362 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-20 11:00:03,363 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-20 11:00:03,364 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-20 11:00:03,374 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-20 11:00:03,375 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-20 11:00:03,375 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-20 11:00:03,377 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-20 11:00:03,377 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-20 11:00:03,379 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-20 11:00:03,379 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-20 11:00:03,380 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-20 11:00:03,382 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-20 11:00:03,383 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-20 11:00:03,385 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-20 11:00:03,386 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-20 11:00:03,386 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-20 11:00:03,387 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-20 11:00:03,387 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-20 11:00:03,389 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-20 11:00:03,389 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-20 11:00:03,390 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dcfdd55-4246-4c8a-94b8-ddda31df9702/bin/uautomizer-ug76WZFUDN/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-20 11:00:03,427 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-20 11:00:03,427 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-20 11:00:03,428 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-20 11:00:03,428 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-20 11:00:03,429 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-20 11:00:03,429 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-20 11:00:03,430 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-20 11:00:03,430 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-20 11:00:03,431 INFO L138 SettingsManager]: * Use SBE=true [2022-11-20 11:00:03,431 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-20 11:00:03,432 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-20 11:00:03,432 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-20 11:00:03,433 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-20 11:00:03,433 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-20 11:00:03,433 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-20 11:00:03,433 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-20 11:00:03,434 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-20 11:00:03,434 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-20 11:00:03,434 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-20 11:00:03,434 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-20 11:00:03,435 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-20 11:00:03,435 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-20 11:00:03,435 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-20 11:00:03,435 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-20 11:00:03,436 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 11:00:03,436 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-20 11:00:03,436 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-20 11:00:03,436 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-20 11:00:03,436 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-20 11:00:03,437 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-20 11:00:03,437 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-20 11:00:03,437 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-20 11:00:03,437 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-20 11:00:03,437 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_4dcfdd55-4246-4c8a-94b8-ddda31df9702/bin/uautomizer-ug76WZFUDN/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_4dcfdd55-4246-4c8a-94b8-ddda31df9702/bin/uautomizer-ug76WZFUDN 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-20 11:00:03,715 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-20 11:00:03,746 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-20 11:00:03,749 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-20 11:00:03,751 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-20 11:00:03,751 INFO L275 PluginConnector]: CDTParser initialized [2022-11-20 11:00:03,753 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dcfdd55-4246-4c8a-94b8-ddda31df9702/bin/uautomizer-ug76WZFUDN/../../sv-benchmarks/c/heap-data/process_queue.i [2022-11-20 11:00:06,830 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-20 11:00:07,070 INFO L351 CDTParser]: Found 1 translation units. [2022-11-20 11:00:07,071 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dcfdd55-4246-4c8a-94b8-ddda31df9702/sv-benchmarks/c/heap-data/process_queue.i [2022-11-20 11:00:07,090 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dcfdd55-4246-4c8a-94b8-ddda31df9702/bin/uautomizer-ug76WZFUDN/data/f6e774d37/9f37c58daa1149568b9d5621a3b9ebf7/FLAG39560ae5c [2022-11-20 11:00:07,103 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dcfdd55-4246-4c8a-94b8-ddda31df9702/bin/uautomizer-ug76WZFUDN/data/f6e774d37/9f37c58daa1149568b9d5621a3b9ebf7 [2022-11-20 11:00:07,105 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-20 11:00:07,107 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-20 11:00:07,108 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-20 11:00:07,108 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-20 11:00:07,117 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-20 11:00:07,118 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 11:00:07" (1/1) ... [2022-11-20 11:00:07,119 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@326439bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:00:07, skipping insertion in model container [2022-11-20 11:00:07,120 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 11:00:07" (1/1) ... [2022-11-20 11:00:07,128 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-20 11:00:07,177 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-20 11:00:07,487 WARN L237 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_4dcfdd55-4246-4c8a-94b8-ddda31df9702/sv-benchmarks/c/heap-data/process_queue.i[23979,23992] [2022-11-20 11:00:07,509 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 11:00:07,526 INFO L203 MainTranslator]: Completed pre-run [2022-11-20 11:00:07,583 WARN L237 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_4dcfdd55-4246-4c8a-94b8-ddda31df9702/sv-benchmarks/c/heap-data/process_queue.i[23979,23992] [2022-11-20 11:00:07,603 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 11:00:07,634 INFO L208 MainTranslator]: Completed translation [2022-11-20 11:00:07,634 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:00:07 WrapperNode [2022-11-20 11:00:07,635 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-20 11:00:07,636 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-20 11:00:07,636 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-20 11:00:07,636 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-20 11:00:07,644 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:00:07" (1/1) ... [2022-11-20 11:00:07,681 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:00:07" (1/1) ... [2022-11-20 11:00:07,722 INFO L138 Inliner]: procedures = 127, calls = 32, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 111 [2022-11-20 11:00:07,722 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-20 11:00:07,723 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-20 11:00:07,723 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-20 11:00:07,723 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-20 11:00:07,734 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:00:07" (1/1) ... [2022-11-20 11:00:07,734 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:00:07" (1/1) ... [2022-11-20 11:00:07,737 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:00:07" (1/1) ... [2022-11-20 11:00:07,738 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:00:07" (1/1) ... [2022-11-20 11:00:07,745 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:00:07" (1/1) ... [2022-11-20 11:00:07,750 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:00:07" (1/1) ... [2022-11-20 11:00:07,751 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:00:07" (1/1) ... [2022-11-20 11:00:07,753 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:00:07" (1/1) ... [2022-11-20 11:00:07,756 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-20 11:00:07,757 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-20 11:00:07,757 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-20 11:00:07,757 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-20 11:00:07,758 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:00:07" (1/1) ... [2022-11-20 11:00:07,766 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 11:00:07,778 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dcfdd55-4246-4c8a-94b8-ddda31df9702/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:00:07,793 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dcfdd55-4246-4c8a-94b8-ddda31df9702/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-20 11:00:07,810 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dcfdd55-4246-4c8a-94b8-ddda31df9702/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-20 11:00:07,845 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-20 11:00:07,845 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-20 11:00:07,846 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-20 11:00:07,846 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-20 11:00:07,846 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-20 11:00:07,846 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-20 11:00:07,847 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-20 11:00:07,847 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-20 11:00:07,847 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-11-20 11:00:07,848 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-20 11:00:07,848 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-20 11:00:07,848 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-20 11:00:07,983 INFO L235 CfgBuilder]: Building ICFG [2022-11-20 11:00:07,985 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-20 11:00:08,335 INFO L276 CfgBuilder]: Performing block encoding [2022-11-20 11:00:08,364 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-20 11:00:08,364 INFO L300 CfgBuilder]: Removed 3 assume(true) statements. [2022-11-20 11:00:08,366 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 11:00:08 BoogieIcfgContainer [2022-11-20 11:00:08,366 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-20 11:00:08,368 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-20 11:00:08,368 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-20 11:00:08,372 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-20 11:00:08,372 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 11:00:07" (1/3) ... [2022-11-20 11:00:08,373 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@dacdab3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 11:00:08, skipping insertion in model container [2022-11-20 11:00:08,373 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:00:07" (2/3) ... [2022-11-20 11:00:08,374 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@dacdab3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 11:00:08, skipping insertion in model container [2022-11-20 11:00:08,374 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 11:00:08" (3/3) ... [2022-11-20 11:00:08,375 INFO L112 eAbstractionObserver]: Analyzing ICFG process_queue.i [2022-11-20 11:00:08,396 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-20 11:00:08,397 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-20 11:00:08,454 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-20 11:00:08,460 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;@39f406ec, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-20 11:00:08,460 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-20 11:00:08,466 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-20 11:00:08,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-20 11:00:08,474 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:00:08,475 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:00:08,476 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 11:00:08,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:00:08,485 INFO L85 PathProgramCache]: Analyzing trace with hash -2060272908, now seen corresponding path program 1 times [2022-11-20 11:00:08,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:00:08,497 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602218762] [2022-11-20 11:00:08,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:00:08,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:00:08,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:00:08,809 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-20 11:00:08,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:00:08,810 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602218762] [2022-11-20 11:00:08,811 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [602218762] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:00:08,811 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:00:08,812 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 11:00:08,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928756271] [2022-11-20 11:00:08,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:00:08,819 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 11:00:08,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:00:08,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 11:00:08,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 11:00:08,852 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-20 11:00:08,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:00:08,912 INFO L93 Difference]: Finished difference Result 51 states and 74 transitions. [2022-11-20 11:00:08,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 11:00:08,916 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-20 11:00:08,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:00:08,925 INFO L225 Difference]: With dead ends: 51 [2022-11-20 11:00:08,925 INFO L226 Difference]: Without dead ends: 23 [2022-11-20 11:00:08,927 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-20 11:00:08,932 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-20 11:00:08,933 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-20 11:00:08,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-11-20 11:00:08,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2022-11-20 11:00:08,966 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-20 11:00:08,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 30 transitions. [2022-11-20 11:00:08,969 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 30 transitions. Word has length 11 [2022-11-20 11:00:08,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:00:08,969 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 30 transitions. [2022-11-20 11:00:08,970 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-20 11:00:08,970 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 30 transitions. [2022-11-20 11:00:08,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-20 11:00:08,971 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:00:08,972 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:00:08,972 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-20 11:00:08,972 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 11:00:08,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:00:08,975 INFO L85 PathProgramCache]: Analyzing trace with hash -1911586027, now seen corresponding path program 1 times [2022-11-20 11:00:08,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:00:08,976 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327936118] [2022-11-20 11:00:08,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:00:08,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:00:09,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:00:09,114 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-20 11:00:09,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:00:09,115 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327936118] [2022-11-20 11:00:09,117 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [327936118] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:00:09,117 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:00:09,117 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-20 11:00:09,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595251518] [2022-11-20 11:00:09,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:00:09,119 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 11:00:09,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:00:09,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 11:00:09,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 11:00:09,122 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-20 11:00:09,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:00:09,194 INFO L93 Difference]: Finished difference Result 56 states and 74 transitions. [2022-11-20 11:00:09,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 11:00:09,195 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-20 11:00:09,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:00:09,196 INFO L225 Difference]: With dead ends: 56 [2022-11-20 11:00:09,196 INFO L226 Difference]: Without dead ends: 35 [2022-11-20 11:00:09,197 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-20 11:00:09,198 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.0s IncrementalHoareTripleChecker+Time [2022-11-20 11:00:09,199 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.0s Time] [2022-11-20 11:00:09,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-11-20 11:00:09,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 33. [2022-11-20 11:00:09,205 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-20 11:00:09,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 43 transitions. [2022-11-20 11:00:09,207 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 43 transitions. Word has length 11 [2022-11-20 11:00:09,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:00:09,207 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 43 transitions. [2022-11-20 11:00:09,207 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-20 11:00:09,208 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 43 transitions. [2022-11-20 11:00:09,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-20 11:00:09,208 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:00:09,208 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:00:09,209 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-20 11:00:09,209 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 11:00:09,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:00:09,210 INFO L85 PathProgramCache]: Analyzing trace with hash 459687026, now seen corresponding path program 1 times [2022-11-20 11:00:09,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:00:09,210 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344916032] [2022-11-20 11:00:09,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:00:09,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:00:09,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:00:10,110 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:00:10,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:00:10,111 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344916032] [2022-11-20 11:00:10,111 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [344916032] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:00:10,112 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:00:10,112 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-20 11:00:10,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952078227] [2022-11-20 11:00:10,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:00:10,113 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 11:00:10,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:00:10,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 11:00:10,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-20 11:00:10,114 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-20 11:00:10,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:00:10,325 INFO L93 Difference]: Finished difference Result 74 states and 97 transitions. [2022-11-20 11:00:10,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-20 11:00:10,326 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-20 11:00:10,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:00:10,328 INFO L225 Difference]: With dead ends: 74 [2022-11-20 11:00:10,328 INFO L226 Difference]: Without dead ends: 72 [2022-11-20 11:00:10,329 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-11-20 11:00:10,330 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-20 11:00:10,331 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-20 11:00:10,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-11-20 11:00:10,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 51. [2022-11-20 11:00:10,341 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-20 11:00:10,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 68 transitions. [2022-11-20 11:00:10,342 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 68 transitions. Word has length 11 [2022-11-20 11:00:10,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:00:10,343 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 68 transitions. [2022-11-20 11:00:10,343 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-20 11:00:10,343 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 68 transitions. [2022-11-20 11:00:10,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-20 11:00:10,344 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:00:10,344 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:00:10,345 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-20 11:00:10,345 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 11:00:10,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:00:10,346 INFO L85 PathProgramCache]: Analyzing trace with hash 608373907, now seen corresponding path program 1 times [2022-11-20 11:00:10,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:00:10,346 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429727265] [2022-11-20 11:00:10,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:00:10,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:00:10,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:00:10,408 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-20 11:00:10,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:00:10,408 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429727265] [2022-11-20 11:00:10,409 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1429727265] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:00:10,409 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:00:10,409 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-20 11:00:10,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220820816] [2022-11-20 11:00:10,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:00:10,410 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 11:00:10,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:00:10,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 11:00:10,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 11:00:10,411 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-20 11:00:10,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:00:10,511 INFO L93 Difference]: Finished difference Result 106 states and 140 transitions. [2022-11-20 11:00:10,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 11:00:10,512 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-20 11:00:10,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:00:10,513 INFO L225 Difference]: With dead ends: 106 [2022-11-20 11:00:10,513 INFO L226 Difference]: Without dead ends: 57 [2022-11-20 11:00:10,514 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-20 11:00:10,515 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-20 11:00:10,520 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-20 11:00:10,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-11-20 11:00:10,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 49. [2022-11-20 11:00:10,536 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-20 11:00:10,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 64 transitions. [2022-11-20 11:00:10,539 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 64 transitions. Word has length 11 [2022-11-20 11:00:10,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:00:10,540 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 64 transitions. [2022-11-20 11:00:10,540 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-20 11:00:10,540 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 64 transitions. [2022-11-20 11:00:10,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-20 11:00:10,541 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:00:10,542 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:00:10,542 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-20 11:00:10,542 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 11:00:10,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:00:10,544 INFO L85 PathProgramCache]: Analyzing trace with hash -2110602732, now seen corresponding path program 1 times [2022-11-20 11:00:10,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:00:10,545 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127637141] [2022-11-20 11:00:10,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:00:10,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:00:10,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:00:11,230 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-20 11:00:11,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:00:11,231 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1127637141] [2022-11-20 11:00:11,232 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1127637141] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:00:11,233 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1123664460] [2022-11-20 11:00:11,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:00:11,234 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:00:11,235 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dcfdd55-4246-4c8a-94b8-ddda31df9702/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:00:11,241 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dcfdd55-4246-4c8a-94b8-ddda31df9702/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 11:00:11,264 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dcfdd55-4246-4c8a-94b8-ddda31df9702/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-20 11:00:11,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:00:11,378 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 68 conjunts are in the unsatisfiable core [2022-11-20 11:00:11,389 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:00:11,455 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-20 11:00:11,616 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:00:11,622 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:00:11,624 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-20 11:00:11,631 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:00:11,636 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:00:11,639 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-20 11:00:11,651 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-20 11:00:11,663 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-11-20 11:00:11,664 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-20 11:00:11,678 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-20 11:00:11,684 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-20 11:00:11,693 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-20 11:00:11,875 INFO L321 Elim1Store]: treesize reduction 17, result has 5.6 percent of original size [2022-11-20 11:00:11,875 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-20 11:00:11,895 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-20 11:00:11,905 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-20 11:00:11,905 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 11:00:12,264 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-20 11:00:12,264 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1123664460] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 11:00:12,264 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 11:00:12,265 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2022-11-20 11:00:12,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135782779] [2022-11-20 11:00:12,265 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 11:00:12,266 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-20 11:00:12,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:00:12,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-20 11:00:12,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-11-20 11:00:12,267 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-20 11:00:12,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:00:12,564 INFO L93 Difference]: Finished difference Result 121 states and 160 transitions. [2022-11-20 11:00:12,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-20 11:00:12,566 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-20 11:00:12,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:00:12,566 INFO L225 Difference]: With dead ends: 121 [2022-11-20 11:00:12,566 INFO L226 Difference]: Without dead ends: 83 [2022-11-20 11:00:12,567 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-20 11:00:12,568 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-20 11:00:12,568 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-20 11:00:12,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2022-11-20 11:00:12,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 54. [2022-11-20 11:00:12,577 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-20 11:00:12,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 70 transitions. [2022-11-20 11:00:12,578 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 70 transitions. Word has length 14 [2022-11-20 11:00:12,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:00:12,579 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 70 transitions. [2022-11-20 11:00:12,579 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-20 11:00:12,579 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 70 transitions. [2022-11-20 11:00:12,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-20 11:00:12,580 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:00:12,581 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:00:12,602 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dcfdd55-4246-4c8a-94b8-ddda31df9702/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-20 11:00:12,787 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dcfdd55-4246-4c8a-94b8-ddda31df9702/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:00:12,787 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 11:00:12,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:00:12,788 INFO L85 PathProgramCache]: Analyzing trace with hash 969563825, now seen corresponding path program 1 times [2022-11-20 11:00:12,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:00:12,788 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037008303] [2022-11-20 11:00:12,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:00:12,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:00:12,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:00:13,024 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-20 11:00:13,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:00:13,025 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037008303] [2022-11-20 11:00:13,025 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1037008303] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:00:13,025 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:00:13,025 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-20 11:00:13,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299049258] [2022-11-20 11:00:13,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:00:13,026 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 11:00:13,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:00:13,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 11:00:13,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 11:00:13,027 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-20 11:00:13,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:00:13,092 INFO L93 Difference]: Finished difference Result 117 states and 155 transitions. [2022-11-20 11:00:13,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 11:00:13,092 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-20 11:00:13,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:00:13,093 INFO L225 Difference]: With dead ends: 117 [2022-11-20 11:00:13,093 INFO L226 Difference]: Without dead ends: 79 [2022-11-20 11:00:13,094 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-20 11:00:13,094 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-20 11:00:13,095 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-20 11:00:13,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2022-11-20 11:00:13,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 70. [2022-11-20 11:00:13,104 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-20 11:00:13,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 90 transitions. [2022-11-20 11:00:13,108 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 90 transitions. Word has length 19 [2022-11-20 11:00:13,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:00:13,109 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 90 transitions. [2022-11-20 11:00:13,109 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-20 11:00:13,109 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 90 transitions. [2022-11-20 11:00:13,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-20 11:00:13,111 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:00:13,111 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:00:13,111 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-20 11:00:13,112 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 11:00:13,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:00:13,112 INFO L85 PathProgramCache]: Analyzing trace with hash 1377311315, now seen corresponding path program 1 times [2022-11-20 11:00:13,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:00:13,113 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720599171] [2022-11-20 11:00:13,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:00:13,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:00:13,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:00:14,004 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-20 11:00:14,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:00:14,005 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1720599171] [2022-11-20 11:00:14,005 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1720599171] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:00:14,005 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1742186725] [2022-11-20 11:00:14,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:00:14,006 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:00:14,006 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dcfdd55-4246-4c8a-94b8-ddda31df9702/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:00:14,007 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dcfdd55-4246-4c8a-94b8-ddda31df9702/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 11:00:14,015 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dcfdd55-4246-4c8a-94b8-ddda31df9702/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-20 11:00:14,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:00:14,184 INFO L263 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 62 conjunts are in the unsatisfiable core [2022-11-20 11:00:14,190 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:00:14,379 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-20 11:00:14,386 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:00:14,392 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:00:14,393 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-20 11:00:14,400 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:00:14,404 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:00:14,405 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-20 11:00:14,412 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-20 11:00:14,418 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:00:14,419 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-20 11:00:14,432 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-20 11:00:14,479 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-20 11:00:14,484 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-20 11:00:14,510 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-20 11:00:14,526 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-20 11:00:14,526 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 11:00:14,623 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 11:00:14,624 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-20 11:00:14,633 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-20 11:00:14,641 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-20 11:00:14,776 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-20 11:00:14,777 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1742186725] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 11:00:14,777 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 11:00:14,777 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 17 [2022-11-20 11:00:14,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970237617] [2022-11-20 11:00:14,778 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 11:00:14,779 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-11-20 11:00:14,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:00:14,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-11-20 11:00:14,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=224, Unknown=0, NotChecked=0, Total=272 [2022-11-20 11:00:14,783 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-20 11:00:16,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:00:16,755 INFO L93 Difference]: Finished difference Result 323 states and 428 transitions. [2022-11-20 11:00:16,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-11-20 11:00:16,756 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-20 11:00:16,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:00:16,758 INFO L225 Difference]: With dead ends: 323 [2022-11-20 11:00:16,758 INFO L226 Difference]: Without dead ends: 269 [2022-11-20 11:00:16,759 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 520 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=529, Invalid=1823, Unknown=0, NotChecked=0, Total=2352 [2022-11-20 11:00:16,760 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-20 11:00:16,760 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-20 11:00:16,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2022-11-20 11:00:16,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 116. [2022-11-20 11:00:16,789 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-20 11:00:16,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 150 transitions. [2022-11-20 11:00:16,791 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 150 transitions. Word has length 22 [2022-11-20 11:00:16,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:00:16,791 INFO L495 AbstractCegarLoop]: Abstraction has 116 states and 150 transitions. [2022-11-20 11:00:16,792 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-20 11:00:16,792 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 150 transitions. [2022-11-20 11:00:16,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-20 11:00:16,793 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:00:16,793 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2022-11-20 11:00:16,804 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dcfdd55-4246-4c8a-94b8-ddda31df9702/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-20 11:00:16,994 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dcfdd55-4246-4c8a-94b8-ddda31df9702/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2022-11-20 11:00:16,995 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 11:00:16,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:00:16,996 INFO L85 PathProgramCache]: Analyzing trace with hash 1662719123, now seen corresponding path program 2 times [2022-11-20 11:00:16,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:00:16,996 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643083331] [2022-11-20 11:00:16,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:00:16,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:00:17,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:00:19,086 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-20 11:00:19,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:00:19,086 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [643083331] [2022-11-20 11:00:19,086 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [643083331] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:00:19,086 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [529043336] [2022-11-20 11:00:19,087 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-20 11:00:19,087 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:00:19,087 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dcfdd55-4246-4c8a-94b8-ddda31df9702/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:00:19,091 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dcfdd55-4246-4c8a-94b8-ddda31df9702/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 11:00:19,099 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dcfdd55-4246-4c8a-94b8-ddda31df9702/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-20 11:00:19,271 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-20 11:00:19,271 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 11:00:19,275 INFO L263 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 120 conjunts are in the unsatisfiable core [2022-11-20 11:00:19,282 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:00:19,301 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-20 11:00:19,360 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:00:19,363 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:00:19,365 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-20 11:00:19,368 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-20 11:00:19,374 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:00:19,378 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:00:19,380 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-20 11:00:19,385 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-20 11:00:19,403 INFO L321 Elim1Store]: treesize reduction 26, result has 35.0 percent of original size [2022-11-20 11:00:19,403 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-20 11:00:19,852 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:00:19,857 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:00:19,860 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-20 11:00:19,867 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:00:19,871 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:00:19,874 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-20 11:00:19,883 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:00:19,884 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:00:19,886 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-20 11:00:19,897 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-20 11:00:19,907 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-20 11:00:19,919 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-20 11:00:19,932 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:00:19,939 INFO L321 Elim1Store]: treesize reduction 4, result has 80.0 percent of original size [2022-11-20 11:00:19,939 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-20 11:00:19,952 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-20 11:00:20,163 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 11:00:20,164 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:00:20,167 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 11:00:20,168 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-20 11:00:20,199 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:00:20,210 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-20 11:00:20,211 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-20 11:00:20,232 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-20 11:00:20,235 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-20 11:00:20,236 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 11:00:20,403 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-20 11:00:20,642 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 11:00:20,643 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-20 11:00:20,659 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-20 11:00:20,685 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-20 11:00:23,414 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-20 11:00:23,440 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-20 11:00:23,465 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-20 11:00:23,487 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-20 11:00:23,509 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-20 11:00:23,519 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-20 11:00:23,530 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-20 11:00:23,541 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-20 11:00:23,553 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-20 11:00:23,572 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-20 11:00:23,595 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-20 11:00:23,850 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-20 11:00:23,850 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [529043336] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 11:00:23,850 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 11:00:23,850 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 27 [2022-11-20 11:00:23,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334385904] [2022-11-20 11:00:23,850 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 11:00:23,851 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-11-20 11:00:23,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:00:23,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-11-20 11:00:23,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=553, Unknown=3, NotChecked=48, Total=702 [2022-11-20 11:00:23,852 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-20 11:00:38,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:00:38,512 INFO L93 Difference]: Finished difference Result 747 states and 999 transitions. [2022-11-20 11:00:38,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2022-11-20 11:00:38,512 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-20 11:00:38,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:00:38,516 INFO L225 Difference]: With dead ends: 747 [2022-11-20 11:00:38,516 INFO L226 Difference]: Without dead ends: 745 [2022-11-20 11:00:38,519 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 48 SyntacticMatches, 20 SemanticMatches, 85 ConstructedPredicates, 1 IntricatePredicates, 1 DeprecatedPredicates, 2834 ImplicationChecksByTransitivity, 16.0s TimeCoverageRelationStatistics Valid=1381, Invalid=5926, Unknown=7, NotChecked=168, Total=7482 [2022-11-20 11:00:38,520 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-20 11:00:38,520 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-20 11:00:38,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 745 states. [2022-11-20 11:00:38,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 745 to 545. [2022-11-20 11:00:38,598 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-20 11:00:38,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 545 states to 545 states and 715 transitions. [2022-11-20 11:00:38,602 INFO L78 Accepts]: Start accepts. Automaton has 545 states and 715 transitions. Word has length 25 [2022-11-20 11:00:38,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:00:38,602 INFO L495 AbstractCegarLoop]: Abstraction has 545 states and 715 transitions. [2022-11-20 11:00:38,602 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-20 11:00:38,602 INFO L276 IsEmpty]: Start isEmpty. Operand 545 states and 715 transitions. [2022-11-20 11:00:38,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-20 11:00:38,603 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:00:38,603 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2022-11-20 11:00:38,615 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dcfdd55-4246-4c8a-94b8-ddda31df9702/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-11-20 11:00:38,809 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dcfdd55-4246-4c8a-94b8-ddda31df9702/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2022-11-20 11:00:38,810 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 11:00:38,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:00:38,810 INFO L85 PathProgramCache]: Analyzing trace with hash 211481171, now seen corresponding path program 3 times [2022-11-20 11:00:38,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:00:38,810 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196968070] [2022-11-20 11:00:38,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:00:38,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:00:38,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:00:40,561 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-20 11:00:40,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:00:40,561 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196968070] [2022-11-20 11:00:40,561 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [196968070] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:00:40,562 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [778913909] [2022-11-20 11:00:40,562 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-20 11:00:40,562 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:00:40,562 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dcfdd55-4246-4c8a-94b8-ddda31df9702/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:00:40,563 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dcfdd55-4246-4c8a-94b8-ddda31df9702/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 11:00:40,590 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dcfdd55-4246-4c8a-94b8-ddda31df9702/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-20 11:00:41,173 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-20 11:00:41,173 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 11:00:41,178 INFO L263 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 128 conjunts are in the unsatisfiable core [2022-11-20 11:00:41,185 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:00:41,196 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-20 11:00:41,289 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:00:41,293 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:00:41,294 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-20 11:00:41,298 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:00:41,302 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:00:41,303 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-20 11:00:41,309 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-20 11:00:41,313 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-20 11:00:41,333 INFO L321 Elim1Store]: treesize reduction 26, result has 35.0 percent of original size [2022-11-20 11:00:41,334 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-20 11:00:41,345 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-20 11:00:41,353 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-20 11:00:41,652 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:00:41,657 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:00:41,658 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:00:41,660 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-20 11:00:41,666 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:00:41,669 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:00:41,683 INFO L321 Elim1Store]: treesize reduction 47, result has 9.6 percent of original size [2022-11-20 11:00:41,684 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-20 11:00:41,692 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-20 11:00:41,699 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-20 11:00:41,706 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-20 11:00:41,715 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-20 11:00:41,723 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:00:41,731 INFO L321 Elim1Store]: treesize reduction 4, result has 80.0 percent of original size [2022-11-20 11:00:41,731 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-20 11:00:42,109 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 11:00:42,132 INFO L321 Elim1Store]: treesize reduction 67, result has 9.5 percent of original size [2022-11-20 11:00:42,132 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-20 11:00:42,141 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:00:42,155 INFO L321 Elim1Store]: treesize reduction 10, result has 41.2 percent of original size [2022-11-20 11:00:42,156 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-20 11:00:42,163 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-20 11:00:42,163 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 11:00:46,696 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-20 11:00:46,696 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [778913909] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 11:00:46,696 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 11:00:46,697 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 8] total 21 [2022-11-20 11:00:46,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265419016] [2022-11-20 11:00:46,697 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 11:00:46,697 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-11-20 11:00:46,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:00:46,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-11-20 11:00:46,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=362, Unknown=0, NotChecked=0, Total=420 [2022-11-20 11:00:46,699 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-20 11:00:52,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:00:52,481 INFO L93 Difference]: Finished difference Result 2191 states and 2897 transitions. [2022-11-20 11:00:52,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-11-20 11:00:52,482 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-20 11:00:52,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:00:52,488 INFO L225 Difference]: With dead ends: 2191 [2022-11-20 11:00:52,489 INFO L226 Difference]: Without dead ends: 1703 [2022-11-20 11:00:52,492 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 48 SyntacticMatches, 3 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 533 ImplicationChecksByTransitivity, 8.6s TimeCoverageRelationStatistics Valid=357, Invalid=1899, Unknown=0, NotChecked=0, Total=2256 [2022-11-20 11:00:52,499 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 473 mSDsluCounter, 572 mSDsCounter, 0 mSdLazyCounter, 286 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s 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-20 11:00:52,499 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-20 11:00:52,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1703 states. [2022-11-20 11:00:52,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1703 to 1280. [2022-11-20 11:00:52,675 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-20 11:00:52,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1280 states to 1280 states and 1660 transitions. [2022-11-20 11:00:52,679 INFO L78 Accepts]: Start accepts. Automaton has 1280 states and 1660 transitions. Word has length 28 [2022-11-20 11:00:52,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:00:52,680 INFO L495 AbstractCegarLoop]: Abstraction has 1280 states and 1660 transitions. [2022-11-20 11:00:52,680 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-20 11:00:52,680 INFO L276 IsEmpty]: Start isEmpty. Operand 1280 states and 1660 transitions. [2022-11-20 11:00:52,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-20 11:00:52,681 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:00:52,681 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-20 11:00:52,690 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dcfdd55-4246-4c8a-94b8-ddda31df9702/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-20 11:00:52,886 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dcfdd55-4246-4c8a-94b8-ddda31df9702/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:00:52,887 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 11:00:52,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:00:52,887 INFO L85 PathProgramCache]: Analyzing trace with hash -1324510600, now seen corresponding path program 1 times [2022-11-20 11:00:52,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:00:52,887 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426506057] [2022-11-20 11:00:52,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:00:52,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:00:52,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:00:52,956 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-20 11:00:52,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:00:52,956 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1426506057] [2022-11-20 11:00:52,957 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1426506057] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:00:52,957 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1939669575] [2022-11-20 11:00:52,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:00:52,957 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:00:52,957 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dcfdd55-4246-4c8a-94b8-ddda31df9702/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:00:52,958 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dcfdd55-4246-4c8a-94b8-ddda31df9702/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 11:00:52,962 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dcfdd55-4246-4c8a-94b8-ddda31df9702/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-20 11:00:53,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:00:53,110 INFO L263 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-20 11:00:53,112 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:00:53,143 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-20 11:00:53,144 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 11:00:53,186 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-20 11:00:53,186 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1939669575] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 11:00:53,187 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 11:00:53,187 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2022-11-20 11:00:53,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542729552] [2022-11-20 11:00:53,187 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 11:00:53,188 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-20 11:00:53,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:00:53,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-20 11:00:53,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-11-20 11:00:53,189 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-20 11:00:53,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:00:53,645 INFO L93 Difference]: Finished difference Result 3325 states and 4355 transitions. [2022-11-20 11:00:53,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-20 11:00:53,646 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-20 11:00:53,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:00:53,653 INFO L225 Difference]: With dead ends: 3325 [2022-11-20 11:00:53,654 INFO L226 Difference]: Without dead ends: 2088 [2022-11-20 11:00:53,656 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-20 11:00:53,657 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-20 11:00:53,658 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-20 11:00:53,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2088 states. [2022-11-20 11:00:53,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2088 to 2000. [2022-11-20 11:00:53,979 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-20 11:00:53,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2000 states to 2000 states and 2534 transitions. [2022-11-20 11:00:53,985 INFO L78 Accepts]: Start accepts. Automaton has 2000 states and 2534 transitions. Word has length 29 [2022-11-20 11:00:53,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:00:53,986 INFO L495 AbstractCegarLoop]: Abstraction has 2000 states and 2534 transitions. [2022-11-20 11:00:53,987 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-20 11:00:53,987 INFO L276 IsEmpty]: Start isEmpty. Operand 2000 states and 2534 transitions. [2022-11-20 11:00:53,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-20 11:00:53,994 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:00:53,994 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-20 11:00:54,007 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dcfdd55-4246-4c8a-94b8-ddda31df9702/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-20 11:00:54,200 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dcfdd55-4246-4c8a-94b8-ddda31df9702/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-11-20 11:00:54,200 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 11:00:54,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:00:54,201 INFO L85 PathProgramCache]: Analyzing trace with hash -313393350, now seen corresponding path program 1 times [2022-11-20 11:00:54,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:00:54,201 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317622039] [2022-11-20 11:00:54,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:00:54,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:00:54,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:00:54,800 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-20 11:00:54,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:00:54,800 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317622039] [2022-11-20 11:00:54,801 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1317622039] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:00:54,801 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [104275809] [2022-11-20 11:00:54,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:00:54,801 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:00:54,801 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dcfdd55-4246-4c8a-94b8-ddda31df9702/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:00:54,802 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dcfdd55-4246-4c8a-94b8-ddda31df9702/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 11:00:54,806 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dcfdd55-4246-4c8a-94b8-ddda31df9702/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-20 11:00:54,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:00:54,981 INFO L263 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 66 conjunts are in the unsatisfiable core [2022-11-20 11:00:54,988 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:00:54,993 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-20 11:00:55,042 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:00:55,046 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:00:55,047 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-20 11:00:55,051 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:00:55,054 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:00:55,055 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-20 11:00:55,064 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-20 11:00:55,069 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-20 11:00:55,077 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-11-20 11:00:55,078 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-20 11:00:55,083 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-20 11:00:55,089 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-20 11:00:55,235 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-20 11:00:55,241 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-20 11:00:55,262 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-20 11:00:55,265 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-20 11:00:55,266 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 11:00:55,336 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 11:00:55,337 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-20 11:00:55,341 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-20 11:00:55,345 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-20 11:00:55,399 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-20 11:00:55,399 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [104275809] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 11:00:55,399 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 11:00:55,399 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 12 [2022-11-20 11:00:55,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223974746] [2022-11-20 11:00:55,402 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 11:00:55,402 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-20 11:00:55,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:00:55,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-20 11:00:55,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2022-11-20 11:00:55,404 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-20 11:00:56,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:00:56,172 INFO L93 Difference]: Finished difference Result 3278 states and 4145 transitions. [2022-11-20 11:00:56,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-20 11:00:56,173 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-20 11:00:56,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:00:56,181 INFO L225 Difference]: With dead ends: 3278 [2022-11-20 11:00:56,181 INFO L226 Difference]: Without dead ends: 2280 [2022-11-20 11:00:56,183 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-20 11:00:56,184 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-20 11:00:56,184 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-20 11:00:56,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2280 states. [2022-11-20 11:00:56,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2280 to 2002. [2022-11-20 11:00:56,529 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-20 11:00:56,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2002 states to 2002 states and 2536 transitions. [2022-11-20 11:00:56,536 INFO L78 Accepts]: Start accepts. Automaton has 2002 states and 2536 transitions. Word has length 29 [2022-11-20 11:00:56,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:00:56,536 INFO L495 AbstractCegarLoop]: Abstraction has 2002 states and 2536 transitions. [2022-11-20 11:00:56,536 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-20 11:00:56,536 INFO L276 IsEmpty]: Start isEmpty. Operand 2002 states and 2536 transitions. [2022-11-20 11:00:56,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-20 11:00:56,539 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:00:56,539 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-20 11:00:56,555 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dcfdd55-4246-4c8a-94b8-ddda31df9702/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-20 11:00:56,756 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dcfdd55-4246-4c8a-94b8-ddda31df9702/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-11-20 11:00:56,756 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 11:00:56,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:00:56,757 INFO L85 PathProgramCache]: Analyzing trace with hash -190827821, now seen corresponding path program 1 times [2022-11-20 11:00:56,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:00:56,757 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602274107] [2022-11-20 11:00:56,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:00:56,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:00:56,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:00:57,318 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-20 11:00:57,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:00:57,318 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602274107] [2022-11-20 11:00:57,318 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [602274107] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:00:57,318 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1924273771] [2022-11-20 11:00:57,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:00:57,318 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:00:57,319 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dcfdd55-4246-4c8a-94b8-ddda31df9702/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:00:57,320 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dcfdd55-4246-4c8a-94b8-ddda31df9702/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 11:00:57,346 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dcfdd55-4246-4c8a-94b8-ddda31df9702/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-20 11:00:57,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:00:57,495 INFO L263 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 75 conjunts are in the unsatisfiable core [2022-11-20 11:00:57,499 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:00:57,564 INFO L321 Elim1Store]: treesize reduction 26, result has 42.2 percent of original size [2022-11-20 11:00:57,565 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-20 11:00:57,604 INFO L321 Elim1Store]: treesize reduction 26, result has 42.2 percent of original size [2022-11-20 11:00:57,604 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-20 11:00:57,630 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-20 11:00:57,642 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-20 11:00:57,655 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-20 11:00:57,666 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-20 11:00:57,702 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-20 11:00:57,708 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-20 11:00:57,743 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-20 11:00:57,746 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-20 11:00:58,044 INFO L321 Elim1Store]: treesize reduction 61, result has 17.6 percent of original size [2022-11-20 11:00:58,045 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-20 11:00:58,072 INFO L321 Elim1Store]: treesize reduction 27, result has 38.6 percent of original size [2022-11-20 11:00:58,072 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-20 11:00:58,364 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 11:00:58,364 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-20 11:00:58,395 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 11:00:58,395 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-20 11:00:58,525 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-20 11:00:58,525 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 11:00:58,819 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-20 11:00:58,820 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1924273771] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 11:00:58,820 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 11:00:58,820 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 8] total 20 [2022-11-20 11:00:58,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470624296] [2022-11-20 11:00:58,821 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 11:00:58,821 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-11-20 11:00:58,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:00:58,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-11-20 11:00:58,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=323, Unknown=0, NotChecked=0, Total=380 [2022-11-20 11:00:58,822 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-20 11:01:07,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:01:07,220 INFO L93 Difference]: Finished difference Result 6891 states and 8985 transitions. [2022-11-20 11:01:07,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 113 states. [2022-11-20 11:01:07,221 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-20 11:01:07,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:01:07,238 INFO L225 Difference]: With dead ends: 6891 [2022-11-20 11:01:07,238 INFO L226 Difference]: Without dead ends: 4518 [2022-11-20 11:01:07,245 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 80 SyntacticMatches, 7 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6211 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=2178, Invalid=13074, Unknown=0, NotChecked=0, Total=15252 [2022-11-20 11:01:07,246 INFO L413 NwaCegarLoop]: 106 mSDtfsCounter, 1048 mSDsluCounter, 1395 mSDsCounter, 0 mSdLazyCounter, 982 mSolverCounterSat, 109 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s 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.8s IncrementalHoareTripleChecker+Time [2022-11-20 11:01:07,246 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.8s Time] [2022-11-20 11:01:07,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4518 states. [2022-11-20 11:01:07,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4518 to 2508. [2022-11-20 11:01:07,606 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-20 11:01:07,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2508 states to 2508 states and 3276 transitions. [2022-11-20 11:01:07,613 INFO L78 Accepts]: Start accepts. Automaton has 2508 states and 3276 transitions. Word has length 30 [2022-11-20 11:01:07,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:01:07,614 INFO L495 AbstractCegarLoop]: Abstraction has 2508 states and 3276 transitions. [2022-11-20 11:01:07,615 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-20 11:01:07,615 INFO L276 IsEmpty]: Start isEmpty. Operand 2508 states and 3276 transitions. [2022-11-20 11:01:07,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-20 11:01:07,616 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:01:07,616 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-20 11:01:07,627 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dcfdd55-4246-4c8a-94b8-ddda31df9702/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-20 11:01:07,827 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dcfdd55-4246-4c8a-94b8-ddda31df9702/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-11-20 11:01:07,827 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 11:01:07,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:01:07,828 INFO L85 PathProgramCache]: Analyzing trace with hash -583854831, now seen corresponding path program 1 times [2022-11-20 11:01:07,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:01:07,828 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442102035] [2022-11-20 11:01:07,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:01:07,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:01:07,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:01:07,901 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-20 11:01:07,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:01:07,902 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442102035] [2022-11-20 11:01:07,902 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1442102035] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:01:07,902 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:01:07,902 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 11:01:07,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507471357] [2022-11-20 11:01:07,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:01:07,903 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 11:01:07,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:01:07,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 11:01:07,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 11:01:07,904 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-20 11:01:08,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:01:08,219 INFO L93 Difference]: Finished difference Result 6274 states and 8159 transitions. [2022-11-20 11:01:08,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 11:01:08,220 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-20 11:01:08,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:01:08,232 INFO L225 Difference]: With dead ends: 6274 [2022-11-20 11:01:08,233 INFO L226 Difference]: Without dead ends: 3908 [2022-11-20 11:01:08,236 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-20 11:01:08,236 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-20 11:01:08,237 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-20 11:01:08,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3908 states. [2022-11-20 11:01:08,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3908 to 2566. [2022-11-20 11:01:08,577 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-20 11:01:08,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2566 states to 2566 states and 3335 transitions. [2022-11-20 11:01:08,583 INFO L78 Accepts]: Start accepts. Automaton has 2566 states and 3335 transitions. Word has length 30 [2022-11-20 11:01:08,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:01:08,584 INFO L495 AbstractCegarLoop]: Abstraction has 2566 states and 3335 transitions. [2022-11-20 11:01:08,584 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-20 11:01:08,584 INFO L276 IsEmpty]: Start isEmpty. Operand 2566 states and 3335 transitions. [2022-11-20 11:01:08,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-11-20 11:01:08,585 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:01:08,585 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-20 11:01:08,585 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-20 11:01:08,585 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 11:01:08,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:01:08,586 INFO L85 PathProgramCache]: Analyzing trace with hash 1070079280, now seen corresponding path program 1 times [2022-11-20 11:01:08,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:01:08,586 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664971372] [2022-11-20 11:01:08,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:01:08,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:01:08,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:01:09,219 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-20 11:01:09,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:01:09,220 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664971372] [2022-11-20 11:01:09,220 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1664971372] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:01:09,220 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [524188850] [2022-11-20 11:01:09,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:01:09,220 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:01:09,220 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dcfdd55-4246-4c8a-94b8-ddda31df9702/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:01:09,223 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dcfdd55-4246-4c8a-94b8-ddda31df9702/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 11:01:09,233 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dcfdd55-4246-4c8a-94b8-ddda31df9702/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-20 11:01:09,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:01:09,416 INFO L263 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 88 conjunts are in the unsatisfiable core [2022-11-20 11:01:09,426 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:01:09,431 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-20 11:01:09,472 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:01:09,473 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-20 11:01:09,477 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-20 11:01:09,486 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-11-20 11:01:09,486 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-20 11:01:09,819 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-20 11:01:09,819 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-20 11:01:09,825 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-20 11:01:09,830 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-20 11:01:09,833 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-20 11:01:09,870 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-20 11:01:09,872 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-20 11:01:09,879 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-20 11:01:09,880 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 11:01:09,897 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_choose_next_~node~0#1.offset| 8))) (and (forall ((v_ArrVal_1109 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_choose_next_~q#1.base| v_ArrVal_1109) |c_ULTIMATE.start_choose_next_~node~0#1.base|) .cse0) 0)) (forall ((v_ArrVal_1108 (Array Int Int))) (= 0 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_choose_next_~q#1.base| v_ArrVal_1108) |c_ULTIMATE.start_choose_next_~node~0#1.base|) .cse0))))) is different from false [2022-11-20 11:01:09,918 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-20 11:01:10,215 INFO L321 Elim1Store]: treesize reduction 25, result has 40.5 percent of original size [2022-11-20 11:01:10,215 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 53 treesize of output 53 [2022-11-20 11:01:10,220 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:01:10,224 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 17 treesize of output 13 [2022-11-20 11:01:10,232 INFO L321 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2022-11-20 11:01:10,233 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 64 treesize of output 48 [2022-11-20 11:01:10,238 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-20 11:01:10,341 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2022-11-20 11:01:10,341 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [524188850] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 11:01:10,341 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 11:01:10,342 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 23 [2022-11-20 11:01:10,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891154089] [2022-11-20 11:01:10,342 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 11:01:10,342 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-11-20 11:01:10,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:01:10,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-11-20 11:01:10,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=347, Unknown=2, NotChecked=78, Total=506 [2022-11-20 11:01:10,344 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-20 11:01:11,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:01:11,203 INFO L93 Difference]: Finished difference Result 3809 states and 4942 transitions. [2022-11-20 11:01:11,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-20 11:01:11,204 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-20 11:01:11,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:01:11,212 INFO L225 Difference]: With dead ends: 3809 [2022-11-20 11:01:11,212 INFO L226 Difference]: Without dead ends: 2730 [2022-11-20 11:01:11,214 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 2 IntricatePredicates, 2 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=159, Invalid=603, Unknown=2, NotChecked=106, Total=870 [2022-11-20 11:01:11,215 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 137 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 338 SdHoareTripleChecker+Invalid, 293 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 167 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 11:01:11,215 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 338 Invalid, 293 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 120 Invalid, 0 Unknown, 167 Unchecked, 0.2s Time] [2022-11-20 11:01:11,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2730 states. [2022-11-20 11:01:11,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2730 to 2704. [2022-11-20 11:01:11,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2704 states, 2703 states have (on average 1.2978172401035886) internal successors, (3508), 2703 states have internal predecessors, (3508), 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-20 11:01:11,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2704 states to 2704 states and 3508 transitions. [2022-11-20 11:01:11,535 INFO L78 Accepts]: Start accepts. Automaton has 2704 states and 3508 transitions. Word has length 33 [2022-11-20 11:01:11,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:01:11,536 INFO L495 AbstractCegarLoop]: Abstraction has 2704 states and 3508 transitions. [2022-11-20 11:01:11,536 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-20 11:01:11,536 INFO L276 IsEmpty]: Start isEmpty. Operand 2704 states and 3508 transitions. [2022-11-20 11:01:11,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-11-20 11:01:11,537 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:01:11,537 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-20 11:01:11,552 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dcfdd55-4246-4c8a-94b8-ddda31df9702/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-20 11:01:11,742 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dcfdd55-4246-4c8a-94b8-ddda31df9702/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-11-20 11:01:11,743 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 11:01:11,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:01:11,743 INFO L85 PathProgramCache]: Analyzing trace with hash -1610537933, now seen corresponding path program 1 times [2022-11-20 11:01:11,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:01:11,743 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643178957] [2022-11-20 11:01:11,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:01:11,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:01:11,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:01:11,877 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-20 11:01:11,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:01:11,877 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1643178957] [2022-11-20 11:01:11,877 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1643178957] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:01:11,878 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1480852475] [2022-11-20 11:01:11,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:01:11,878 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:01:11,878 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dcfdd55-4246-4c8a-94b8-ddda31df9702/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:01:11,879 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dcfdd55-4246-4c8a-94b8-ddda31df9702/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 11:01:11,903 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dcfdd55-4246-4c8a-94b8-ddda31df9702/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-20 11:01:12,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:01:12,083 INFO L263 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 37 conjunts are in the unsatisfiable core [2022-11-20 11:01:12,085 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:01:12,131 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-20 11:01:12,133 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-20 11:01:12,136 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-20 11:01:12,137 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 11:01:12,192 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-20 11:01:12,192 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1480852475] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 11:01:12,192 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 11:01:12,192 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 6 [2022-11-20 11:01:12,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239746145] [2022-11-20 11:01:12,193 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 11:01:12,193 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 11:01:12,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:01:12,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 11:01:12,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-20 11:01:12,194 INFO L87 Difference]: Start difference. First operand 2704 states and 3508 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-20 11:01:12,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:01:12,536 INFO L93 Difference]: Finished difference Result 3894 states and 5059 transitions. [2022-11-20 11:01:12,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-20 11:01:12,536 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-20 11:01:12,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:01:12,543 INFO L225 Difference]: With dead ends: 3894 [2022-11-20 11:01:12,543 INFO L226 Difference]: Without dead ends: 2980 [2022-11-20 11:01:12,545 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-20 11:01:12,546 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 80 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 11:01:12,546 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 77 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 11:01:12,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2980 states. [2022-11-20 11:01:12,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2980 to 2634. [2022-11-20 11:01:12,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2634 states, 2633 states have (on average 1.302316748955564) internal successors, (3429), 2633 states have internal predecessors, (3429), 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-20 11:01:12,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2634 states to 2634 states and 3429 transitions. [2022-11-20 11:01:12,851 INFO L78 Accepts]: Start accepts. Automaton has 2634 states and 3429 transitions. Word has length 38 [2022-11-20 11:01:12,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:01:12,851 INFO L495 AbstractCegarLoop]: Abstraction has 2634 states and 3429 transitions. [2022-11-20 11:01:12,851 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-20 11:01:12,852 INFO L276 IsEmpty]: Start isEmpty. Operand 2634 states and 3429 transitions. [2022-11-20 11:01:12,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-11-20 11:01:12,852 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:01:12,853 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-20 11:01:12,862 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dcfdd55-4246-4c8a-94b8-ddda31df9702/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-20 11:01:13,058 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dcfdd55-4246-4c8a-94b8-ddda31df9702/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-11-20 11:01:13,059 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 11:01:13,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:01:13,059 INFO L85 PathProgramCache]: Analyzing trace with hash -1076330789, now seen corresponding path program 2 times [2022-11-20 11:01:13,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:01:13,059 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848951128] [2022-11-20 11:01:13,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:01:13,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:01:13,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:01:14,216 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-20 11:01:14,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:01:14,217 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848951128] [2022-11-20 11:01:14,217 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1848951128] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:01:14,217 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1725346981] [2022-11-20 11:01:14,217 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-20 11:01:14,217 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:01:14,218 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dcfdd55-4246-4c8a-94b8-ddda31df9702/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:01:14,219 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dcfdd55-4246-4c8a-94b8-ddda31df9702/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 11:01:14,251 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dcfdd55-4246-4c8a-94b8-ddda31df9702/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-20 11:01:14,446 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-20 11:01:14,447 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 11:01:14,450 INFO L263 TraceCheckSpWp]: Trace formula consists of 393 conjuncts, 93 conjunts are in the unsatisfiable core [2022-11-20 11:01:14,455 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:01:14,519 INFO L321 Elim1Store]: treesize reduction 26, result has 42.2 percent of original size [2022-11-20 11:01:14,520 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-20 11:01:14,530 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-20 11:01:14,537 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-20 11:01:14,566 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 11:01:14,567 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-20 11:01:14,571 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-20 11:01:14,697 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:01:14,701 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:01:14,702 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-20 11:01:14,706 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:01:14,709 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:01:14,709 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-20 11:01:14,714 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-20 11:01:14,721 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-20 11:01:14,729 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-20 11:01:14,898 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-20 11:01:14,898 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 11:01:14,986 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-20 11:01:15,080 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-20 11:01:15,086 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-20 11:01:15,091 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-20 11:01:15,096 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-20 11:01:15,101 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-20 11:01:15,170 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-20 11:01:15,170 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1725346981] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 11:01:15,170 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 11:01:15,170 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7, 7] total 21 [2022-11-20 11:01:15,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617626601] [2022-11-20 11:01:15,171 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 11:01:15,171 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-11-20 11:01:15,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:01:15,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-11-20 11:01:15,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=324, Unknown=1, NotChecked=36, Total=420 [2022-11-20 11:01:15,172 INFO L87 Difference]: Start difference. First operand 2634 states and 3429 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-20 11:01:17,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:01:17,698 INFO L93 Difference]: Finished difference Result 5704 states and 7471 transitions. [2022-11-20 11:01:17,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-11-20 11:01:17,699 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-20 11:01:17,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:01:17,707 INFO L225 Difference]: With dead ends: 5704 [2022-11-20 11:01:17,707 INFO L226 Difference]: Without dead ends: 3130 [2022-11-20 11:01:17,711 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-20 11:01:17,712 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 453 mSDsluCounter, 526 mSDsCounter, 0 mSdLazyCounter, 486 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 453 SdHoareTripleChecker+Valid, 575 SdHoareTripleChecker+Invalid, 586 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 486 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 80 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-20 11:01:17,712 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [453 Valid, 575 Invalid, 586 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 486 Invalid, 0 Unknown, 80 Unchecked, 0.9s Time] [2022-11-20 11:01:17,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3130 states. [2022-11-20 11:01:18,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3130 to 2753. [2022-11-20 11:01:18,045 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-20 11:01:18,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2753 states to 2753 states and 3534 transitions. [2022-11-20 11:01:18,048 INFO L78 Accepts]: Start accepts. Automaton has 2753 states and 3534 transitions. Word has length 40 [2022-11-20 11:01:18,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:01:18,048 INFO L495 AbstractCegarLoop]: Abstraction has 2753 states and 3534 transitions. [2022-11-20 11:01:18,049 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-20 11:01:18,049 INFO L276 IsEmpty]: Start isEmpty. Operand 2753 states and 3534 transitions. [2022-11-20 11:01:18,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-11-20 11:01:18,049 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:01:18,050 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-20 11:01:18,059 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dcfdd55-4246-4c8a-94b8-ddda31df9702/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-20 11:01:18,256 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dcfdd55-4246-4c8a-94b8-ddda31df9702/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-11-20 11:01:18,256 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 11:01:18,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:01:18,256 INFO L85 PathProgramCache]: Analyzing trace with hash -1871575436, now seen corresponding path program 2 times [2022-11-20 11:01:18,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:01:18,257 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829785744] [2022-11-20 11:01:18,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:01:18,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:01:18,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:01:19,306 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-20 11:01:19,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:01:19,307 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829785744] [2022-11-20 11:01:19,307 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1829785744] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:01:19,307 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1416444269] [2022-11-20 11:01:19,307 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-20 11:01:19,307 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:01:19,308 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dcfdd55-4246-4c8a-94b8-ddda31df9702/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:01:19,311 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dcfdd55-4246-4c8a-94b8-ddda31df9702/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 11:01:19,342 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dcfdd55-4246-4c8a-94b8-ddda31df9702/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-20 11:01:19,582 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-20 11:01:19,582 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 11:01:19,586 INFO L263 TraceCheckSpWp]: Trace formula consists of 402 conjuncts, 83 conjunts are in the unsatisfiable core [2022-11-20 11:01:19,592 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:01:19,819 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:01:19,823 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:01:19,824 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-20 11:01:19,828 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:01:19,831 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:01:19,832 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-20 11:01:19,837 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-20 11:01:19,846 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-20 11:01:19,852 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-20 11:01:19,860 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-20 11:01:19,990 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 11:01:19,991 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:01:19,994 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 11:01:19,995 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-20 11:01:20,002 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:01:20,009 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-20 11:01:20,009 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-20 11:01:20,013 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-20 11:01:20,013 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 11:01:23,269 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-20 11:01:23,274 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-20 11:01:23,279 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-20 11:01:23,307 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 11:01:23,308 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-20 11:01:23,327 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 11:01:23,327 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-20 11:01:23,334 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-20 11:01:23,343 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:01:25,600 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-20 11:01:25,600 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1416444269] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 11:01:25,600 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 11:01:25,601 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 18 [2022-11-20 11:01:25,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347598309] [2022-11-20 11:01:25,601 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 11:01:25,601 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-11-20 11:01:25,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:01:25,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-11-20 11:01:25,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=244, Unknown=1, NotChecked=0, Total=306 [2022-11-20 11:01:25,603 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-20 11:01:26,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:01:26,590 INFO L93 Difference]: Finished difference Result 5004 states and 6391 transitions. [2022-11-20 11:01:26,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-20 11:01:26,590 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-20 11:01:26,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:01:26,601 INFO L225 Difference]: With dead ends: 5004 [2022-11-20 11:01:26,602 INFO L226 Difference]: Without dead ends: 2899 [2022-11-20 11:01:26,605 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=187, Invalid=624, Unknown=1, NotChecked=0, Total=812 [2022-11-20 11:01:26,605 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 112 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 283 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 53 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-20 11:01:26,606 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 283 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 115 Invalid, 0 Unknown, 53 Unchecked, 0.3s Time] [2022-11-20 11:01:26,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2899 states. [2022-11-20 11:01:26,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2899 to 2566. [2022-11-20 11:01:26,912 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-20 11:01:26,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2566 states to 2566 states and 3262 transitions. [2022-11-20 11:01:26,916 INFO L78 Accepts]: Start accepts. Automaton has 2566 states and 3262 transitions. Word has length 41 [2022-11-20 11:01:26,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:01:26,917 INFO L495 AbstractCegarLoop]: Abstraction has 2566 states and 3262 transitions. [2022-11-20 11:01:26,917 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-20 11:01:26,917 INFO L276 IsEmpty]: Start isEmpty. Operand 2566 states and 3262 transitions. [2022-11-20 11:01:26,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-11-20 11:01:26,918 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:01:26,918 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1] [2022-11-20 11:01:26,923 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dcfdd55-4246-4c8a-94b8-ddda31df9702/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-11-20 11:01:27,123 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dcfdd55-4246-4c8a-94b8-ddda31df9702/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-11-20 11:01:27,123 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 11:01:27,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:01:27,124 INFO L85 PathProgramCache]: Analyzing trace with hash -2115090350, now seen corresponding path program 4 times [2022-11-20 11:01:27,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:01:27,124 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088438386] [2022-11-20 11:01:27,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:01:27,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:01:27,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:01:30,743 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-20 11:01:30,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:01:30,743 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088438386] [2022-11-20 11:01:30,743 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2088438386] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:01:30,743 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1612657632] [2022-11-20 11:01:30,744 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-20 11:01:30,744 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:01:30,744 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dcfdd55-4246-4c8a-94b8-ddda31df9702/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:01:30,747 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dcfdd55-4246-4c8a-94b8-ddda31df9702/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 11:01:30,774 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dcfdd55-4246-4c8a-94b8-ddda31df9702/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-11-20 11:01:31,036 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-20 11:01:31,036 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 11:01:31,041 INFO L263 TraceCheckSpWp]: Trace formula consists of 442 conjuncts, 188 conjunts are in the unsatisfiable core [2022-11-20 11:01:31,048 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:01:31,056 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-20 11:01:31,127 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:01:31,131 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:01:31,132 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-20 11:01:31,136 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:01:31,140 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:01:31,141 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-20 11:01:31,146 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-20 11:01:31,167 INFO L321 Elim1Store]: treesize reduction 26, result has 35.0 percent of original size [2022-11-20 11:01:31,167 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-20 11:01:31,178 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-20 11:01:31,417 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:01:31,422 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:01:31,422 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-20 11:01:31,427 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:01:31,430 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:01:31,431 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-20 11:01:31,438 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-20 11:01:31,449 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:01:31,459 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-20 11:01:31,459 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-20 11:01:31,470 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-20 11:01:31,481 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-20 11:01:31,489 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-20 11:01:32,395 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:01:32,400 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:01:32,401 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:01:32,403 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:01:32,404 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-20 11:01:32,413 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:01:32,417 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:01:32,439 INFO L321 Elim1Store]: treesize reduction 49, result has 9.3 percent of original size [2022-11-20 11:01:32,439 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-20 11:01:32,451 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-20 11:01:32,465 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-20 11:01:32,474 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:01:32,475 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:01:32,476 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-20 11:01:32,487 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-20 11:01:32,506 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:01:32,507 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:01:32,532 INFO L321 Elim1Store]: treesize reduction 48, result has 50.5 percent of original size [2022-11-20 11:01:32,532 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-20 11:01:32,546 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-20 11:01:33,064 INFO L321 Elim1Store]: treesize reduction 70, result has 4.1 percent of original size [2022-11-20 11:01:33,064 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-20 11:01:33,073 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:01:33,074 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:01:33,080 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-20 11:01:33,080 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-20 11:01:33,125 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-20 11:01:33,159 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-20 11:01:33,159 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 11:01:33,400 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-20 11:01:33,762 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 11:01:33,762 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-20 11:01:33,778 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-20 11:01:33,791 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-20 11:02:43,168 WARN L233 SmtUtils]: Spent 39.91s on a formula simplification. DAG size of input: 90 DAG size of output: 83 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 11:03:49,264 WARN L233 SmtUtils]: Spent 48.06s on a formula simplification. DAG size of input: 88 DAG size of output: 80 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 11:04:18,096 WARN L233 SmtUtils]: Spent 14.72s 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-20 11:04:21,443 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