./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-simple/sll2n_update_all_reverse.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version e04fb08f Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1477d683-49c0-4268-80c5-f632f093d93d/bin/uautomizer-tPACEb0tL8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1477d683-49c0-4268-80c5-f632f093d93d/bin/uautomizer-tPACEb0tL8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1477d683-49c0-4268-80c5-f632f093d93d/bin/uautomizer-tPACEb0tL8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1477d683-49c0-4268-80c5-f632f093d93d/bin/uautomizer-tPACEb0tL8/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-simple/sll2n_update_all_reverse.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1477d683-49c0-4268-80c5-f632f093d93d/bin/uautomizer-tPACEb0tL8/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1477d683-49c0-4268-80c5-f632f093d93d/bin/uautomizer-tPACEb0tL8 --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 60a477b5dcc7be77af17ce3cc379f1876781ed95f896fb2ca2dbb7ba91ecb849 --- 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-e04fb08 [2022-11-16 11:12:53,725 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-16 11:12:53,727 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-16 11:12:53,748 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-16 11:12:53,749 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-16 11:12:53,750 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-16 11:12:53,751 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-16 11:12:53,753 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-16 11:12:53,755 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-16 11:12:53,757 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-16 11:12:53,758 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-16 11:12:53,759 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-16 11:12:53,760 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-16 11:12:53,761 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-16 11:12:53,763 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-16 11:12:53,764 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-16 11:12:53,765 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-16 11:12:53,767 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-16 11:12:53,769 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-16 11:12:53,774 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-16 11:12:53,776 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-16 11:12:53,783 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-16 11:12:53,784 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-16 11:12:53,785 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-16 11:12:53,789 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-16 11:12:53,799 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-16 11:12:53,799 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-16 11:12:53,800 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-16 11:12:53,801 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-16 11:12:53,802 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-16 11:12:53,802 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-16 11:12:53,803 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-16 11:12:53,804 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-16 11:12:53,805 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-16 11:12:53,808 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-16 11:12:53,809 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-16 11:12:53,811 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-16 11:12:53,811 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-16 11:12:53,812 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-16 11:12:53,813 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-16 11:12:53,814 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-16 11:12:53,815 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1477d683-49c0-4268-80c5-f632f093d93d/bin/uautomizer-tPACEb0tL8/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-11-16 11:12:53,860 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-16 11:12:53,860 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-16 11:12:53,861 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-16 11:12:53,861 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-16 11:12:53,862 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-16 11:12:53,862 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-16 11:12:53,863 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-16 11:12:53,863 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-16 11:12:53,864 INFO L138 SettingsManager]: * Use SBE=true [2022-11-16 11:12:53,864 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-16 11:12:53,865 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-16 11:12:53,865 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-16 11:12:53,866 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-16 11:12:53,866 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-16 11:12:53,866 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-16 11:12:53,866 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-16 11:12:53,867 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-16 11:12:53,867 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-16 11:12:53,867 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-16 11:12:53,867 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-16 11:12:53,867 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-16 11:12:53,868 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-16 11:12:53,868 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-16 11:12:53,868 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-16 11:12:53,868 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-16 11:12:53,869 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 11:12:53,869 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-16 11:12:53,869 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-16 11:12:53,869 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-16 11:12:53,870 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-16 11:12:53,870 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_1477d683-49c0-4268-80c5-f632f093d93d/bin/uautomizer-tPACEb0tL8/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_1477d683-49c0-4268-80c5-f632f093d93d/bin/uautomizer-tPACEb0tL8 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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) 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 -> 60a477b5dcc7be77af17ce3cc379f1876781ed95f896fb2ca2dbb7ba91ecb849 [2022-11-16 11:12:54,237 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-16 11:12:54,275 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-16 11:12:54,279 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-16 11:12:54,281 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-16 11:12:54,282 INFO L275 PluginConnector]: CDTParser initialized [2022-11-16 11:12:54,284 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1477d683-49c0-4268-80c5-f632f093d93d/bin/uautomizer-tPACEb0tL8/../../sv-benchmarks/c/list-simple/sll2n_update_all_reverse.i [2022-11-16 11:12:54,379 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1477d683-49c0-4268-80c5-f632f093d93d/bin/uautomizer-tPACEb0tL8/data/d7cddf4d1/359462b451f846b2b679d3fe4d46a2fe/FLAG03ac7564c [2022-11-16 11:12:55,113 INFO L306 CDTParser]: Found 1 translation units. [2022-11-16 11:12:55,113 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1477d683-49c0-4268-80c5-f632f093d93d/sv-benchmarks/c/list-simple/sll2n_update_all_reverse.i [2022-11-16 11:12:55,135 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1477d683-49c0-4268-80c5-f632f093d93d/bin/uautomizer-tPACEb0tL8/data/d7cddf4d1/359462b451f846b2b679d3fe4d46a2fe/FLAG03ac7564c [2022-11-16 11:12:55,367 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1477d683-49c0-4268-80c5-f632f093d93d/bin/uautomizer-tPACEb0tL8/data/d7cddf4d1/359462b451f846b2b679d3fe4d46a2fe [2022-11-16 11:12:55,371 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-16 11:12:55,373 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-16 11:12:55,375 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-16 11:12:55,375 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-16 11:12:55,379 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-16 11:12:55,380 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 11:12:55" (1/1) ... [2022-11-16 11:12:55,381 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@25ce0976 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:12:55, skipping insertion in model container [2022-11-16 11:12:55,381 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 11:12:55" (1/1) ... [2022-11-16 11:12:55,390 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-16 11:12:55,434 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-16 11:12:55,826 WARN L229 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_1477d683-49c0-4268-80c5-f632f093d93d/sv-benchmarks/c/list-simple/sll2n_update_all_reverse.i[24236,24249] [2022-11-16 11:12:55,829 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 11:12:55,838 INFO L203 MainTranslator]: Completed pre-run [2022-11-16 11:12:55,908 WARN L229 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_1477d683-49c0-4268-80c5-f632f093d93d/sv-benchmarks/c/list-simple/sll2n_update_all_reverse.i[24236,24249] [2022-11-16 11:12:55,911 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 11:12:55,947 INFO L208 MainTranslator]: Completed translation [2022-11-16 11:12:55,948 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:12:55 WrapperNode [2022-11-16 11:12:55,950 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-16 11:12:55,952 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-16 11:12:55,952 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-16 11:12:55,953 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-16 11:12:55,961 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:12:55" (1/1) ... [2022-11-16 11:12:55,999 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:12:55" (1/1) ... [2022-11-16 11:12:56,034 INFO L138 Inliner]: procedures = 126, calls = 22, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 121 [2022-11-16 11:12:56,035 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-16 11:12:56,036 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-16 11:12:56,037 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-16 11:12:56,038 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-16 11:12:56,047 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:12:55" (1/1) ... [2022-11-16 11:12:56,048 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:12:55" (1/1) ... [2022-11-16 11:12:56,060 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:12:55" (1/1) ... [2022-11-16 11:12:56,061 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:12:55" (1/1) ... [2022-11-16 11:12:56,074 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:12:55" (1/1) ... [2022-11-16 11:12:56,084 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:12:55" (1/1) ... [2022-11-16 11:12:56,088 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:12:55" (1/1) ... [2022-11-16 11:12:56,100 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:12:55" (1/1) ... [2022-11-16 11:12:56,102 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-16 11:12:56,103 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-16 11:12:56,104 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-16 11:12:56,104 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-16 11:12:56,105 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:12:55" (1/1) ... [2022-11-16 11:12:56,112 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 11:12:56,123 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1477d683-49c0-4268-80c5-f632f093d93d/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:12:56,138 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1477d683-49c0-4268-80c5-f632f093d93d/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-16 11:12:56,159 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1477d683-49c0-4268-80c5-f632f093d93d/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-16 11:12:56,190 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-16 11:12:56,190 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-16 11:12:56,190 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-16 11:12:56,190 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-16 11:12:56,190 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-16 11:12:56,190 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-16 11:12:56,191 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-16 11:12:56,191 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-16 11:12:56,191 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-16 11:12:56,191 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-16 11:12:56,319 INFO L235 CfgBuilder]: Building ICFG [2022-11-16 11:12:56,322 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-16 11:12:56,743 INFO L276 CfgBuilder]: Performing block encoding [2022-11-16 11:12:56,750 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-16 11:12:56,750 INFO L300 CfgBuilder]: Removed 6 assume(true) statements. [2022-11-16 11:12:56,752 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 11:12:56 BoogieIcfgContainer [2022-11-16 11:12:56,752 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-16 11:12:56,755 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-16 11:12:56,755 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-16 11:12:56,764 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-16 11:12:56,765 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 11:12:55" (1/3) ... [2022-11-16 11:12:56,790 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c93b81b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 11:12:56, skipping insertion in model container [2022-11-16 11:12:56,790 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:12:55" (2/3) ... [2022-11-16 11:12:56,791 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c93b81b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 11:12:56, skipping insertion in model container [2022-11-16 11:12:56,791 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 11:12:56" (3/3) ... [2022-11-16 11:12:56,793 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2n_update_all_reverse.i [2022-11-16 11:12:56,819 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-16 11:12:56,820 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 21 error locations. [2022-11-16 11:12:56,903 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-16 11:12:56,912 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=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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;@4a4f1746, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-16 11:12:56,912 INFO L358 AbstractCegarLoop]: Starting to check reachability of 21 error locations. [2022-11-16 11:12:56,917 INFO L276 IsEmpty]: Start isEmpty. Operand has 64 states, 42 states have (on average 1.8333333333333333) internal successors, (77), 63 states have internal predecessors, (77), 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-16 11:12:56,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-16 11:12:56,925 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:12:56,925 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-16 11:12:56,926 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-11-16 11:12:56,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:12:56,936 INFO L85 PathProgramCache]: Analyzing trace with hash 28698858, now seen corresponding path program 1 times [2022-11-16 11:12:56,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:12:56,948 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074778117] [2022-11-16 11:12:56,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:12:56,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:12:57,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:12:57,250 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-16 11:12:57,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:12:57,251 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074778117] [2022-11-16 11:12:57,252 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2074778117] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:12:57,252 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:12:57,253 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 11:12:57,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324069651] [2022-11-16 11:12:57,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:12:57,261 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 11:12:57,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:12:57,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 11:12:57,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:12:57,312 INFO L87 Difference]: Start difference. First operand has 64 states, 42 states have (on average 1.8333333333333333) internal successors, (77), 63 states have internal predecessors, (77), 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, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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-16 11:12:57,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:12:57,499 INFO L93 Difference]: Finished difference Result 109 states and 120 transitions. [2022-11-16 11:12:57,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:12:57,502 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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 5 [2022-11-16 11:12:57,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:12:57,513 INFO L225 Difference]: With dead ends: 109 [2022-11-16 11:12:57,514 INFO L226 Difference]: Without dead ends: 104 [2022-11-16 11:12:57,516 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-16 11:12:57,522 INFO L413 NwaCegarLoop]: 96 mSDtfsCounter, 63 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 11:12:57,523 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 133 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-16 11:12:57,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2022-11-16 11:12:57,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 59. [2022-11-16 11:12:57,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 40 states have (on average 1.6) internal successors, (64), 58 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-16 11:12:57,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 64 transitions. [2022-11-16 11:12:57,571 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 64 transitions. Word has length 5 [2022-11-16 11:12:57,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:12:57,571 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 64 transitions. [2022-11-16 11:12:57,571 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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-16 11:12:57,572 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 64 transitions. [2022-11-16 11:12:57,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-16 11:12:57,572 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:12:57,572 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-16 11:12:57,572 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-16 11:12:57,573 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-11-16 11:12:57,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:12:57,573 INFO L85 PathProgramCache]: Analyzing trace with hash 28698859, now seen corresponding path program 1 times [2022-11-16 11:12:57,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:12:57,574 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165424388] [2022-11-16 11:12:57,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:12:57,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:12:57,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:12:57,714 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-16 11:12:57,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:12:57,715 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165424388] [2022-11-16 11:12:57,715 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1165424388] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:12:57,715 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:12:57,715 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 11:12:57,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447811112] [2022-11-16 11:12:57,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:12:57,717 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 11:12:57,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:12:57,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 11:12:57,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:12:57,718 INFO L87 Difference]: Start difference. First operand 59 states and 64 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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-16 11:12:57,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:12:57,784 INFO L93 Difference]: Finished difference Result 102 states and 112 transitions. [2022-11-16 11:12:57,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:12:57,785 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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 5 [2022-11-16 11:12:57,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:12:57,786 INFO L225 Difference]: With dead ends: 102 [2022-11-16 11:12:57,787 INFO L226 Difference]: Without dead ends: 102 [2022-11-16 11:12:57,787 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-16 11:12:57,789 INFO L413 NwaCegarLoop]: 95 mSDtfsCounter, 58 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 11:12:57,790 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 135 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 11:12:57,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2022-11-16 11:12:57,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 57. [2022-11-16 11:12:57,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 40 states have (on average 1.55) internal successors, (62), 56 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-16 11:12:57,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 62 transitions. [2022-11-16 11:12:57,797 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 62 transitions. Word has length 5 [2022-11-16 11:12:57,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:12:57,798 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 62 transitions. [2022-11-16 11:12:57,798 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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-16 11:12:57,798 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 62 transitions. [2022-11-16 11:12:57,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-16 11:12:57,799 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:12:57,799 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:12:57,799 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-16 11:12:57,800 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-11-16 11:12:57,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:12:57,800 INFO L85 PathProgramCache]: Analyzing trace with hash 231010834, now seen corresponding path program 1 times [2022-11-16 11:12:57,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:12:57,801 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11861419] [2022-11-16 11:12:57,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:12:57,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:12:57,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:12:57,867 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-16 11:12:57,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:12:57,868 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11861419] [2022-11-16 11:12:57,868 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [11861419] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:12:57,869 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:12:57,869 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 11:12:57,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637432237] [2022-11-16 11:12:57,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:12:57,870 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 11:12:57,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:12:57,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 11:12:57,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:12:57,871 INFO L87 Difference]: Start difference. First operand 57 states and 62 transitions. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:12:57,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:12:57,883 INFO L93 Difference]: Finished difference Result 68 states and 73 transitions. [2022-11-16 11:12:57,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:12:57,884 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-11-16 11:12:57,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:12:57,885 INFO L225 Difference]: With dead ends: 68 [2022-11-16 11:12:57,899 INFO L226 Difference]: Without dead ends: 68 [2022-11-16 11:12:57,900 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-16 11:12:57,901 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 10 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-16 11:12:57,902 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 118 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-16 11:12:57,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2022-11-16 11:12:57,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 58. [2022-11-16 11:12:57,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 41 states have (on average 1.5365853658536586) internal successors, (63), 57 states have internal predecessors, (63), 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-16 11:12:57,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 63 transitions. [2022-11-16 11:12:57,908 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 63 transitions. Word has length 8 [2022-11-16 11:12:57,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:12:57,908 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 63 transitions. [2022-11-16 11:12:57,909 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:12:57,909 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 63 transitions. [2022-11-16 11:12:57,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-16 11:12:57,909 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:12:57,909 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:12:57,910 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-16 11:12:57,910 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-11-16 11:12:57,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:12:57,911 INFO L85 PathProgramCache]: Analyzing trace with hash -245418610, now seen corresponding path program 1 times [2022-11-16 11:12:57,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:12:57,911 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101391203] [2022-11-16 11:12:57,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:12:57,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:12:57,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:12:58,088 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-16 11:12:58,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:12:58,089 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101391203] [2022-11-16 11:12:58,089 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2101391203] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:12:58,089 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:12:58,089 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-16 11:12:58,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340910258] [2022-11-16 11:12:58,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:12:58,090 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-16 11:12:58,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:12:58,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 11:12:58,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-16 11:12:58,091 INFO L87 Difference]: Start difference. First operand 58 states and 63 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:12:58,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:12:58,247 INFO L93 Difference]: Finished difference Result 76 states and 81 transitions. [2022-11-16 11:12:58,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-16 11:12:58,248 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-11-16 11:12:58,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:12:58,248 INFO L225 Difference]: With dead ends: 76 [2022-11-16 11:12:58,249 INFO L226 Difference]: Without dead ends: 76 [2022-11-16 11:12:58,249 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-11-16 11:12:58,250 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 164 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 11:12:58,255 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 67 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 11:12:58,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-11-16 11:12:58,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 57. [2022-11-16 11:12:58,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 41 states have (on average 1.5121951219512195) internal successors, (62), 56 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-16 11:12:58,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 62 transitions. [2022-11-16 11:12:58,265 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 62 transitions. Word has length 9 [2022-11-16 11:12:58,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:12:58,265 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 62 transitions. [2022-11-16 11:12:58,267 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:12:58,268 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 62 transitions. [2022-11-16 11:12:58,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-16 11:12:58,268 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:12:58,268 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:12:58,269 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-16 11:12:58,269 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-11-16 11:12:58,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:12:58,270 INFO L85 PathProgramCache]: Analyzing trace with hash -245418609, now seen corresponding path program 1 times [2022-11-16 11:12:58,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:12:58,271 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250690942] [2022-11-16 11:12:58,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:12:58,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:12:58,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:12:58,534 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-16 11:12:58,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:12:58,535 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [250690942] [2022-11-16 11:12:58,535 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [250690942] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:12:58,535 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:12:58,535 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-16 11:12:58,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246194204] [2022-11-16 11:12:58,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:12:58,539 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-16 11:12:58,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:12:58,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 11:12:58,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-16 11:12:58,541 INFO L87 Difference]: Start difference. First operand 57 states and 62 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:12:58,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:12:58,665 INFO L93 Difference]: Finished difference Result 61 states and 66 transitions. [2022-11-16 11:12:58,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-16 11:12:58,666 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-11-16 11:12:58,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:12:58,671 INFO L225 Difference]: With dead ends: 61 [2022-11-16 11:12:58,672 INFO L226 Difference]: Without dead ends: 61 [2022-11-16 11:12:58,672 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-11-16 11:12:58,674 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 163 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 11:12:58,680 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 45 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 11:12:58,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-11-16 11:12:58,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 56. [2022-11-16 11:12:58,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 41 states have (on average 1.4878048780487805) internal successors, (61), 55 states have internal predecessors, (61), 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-16 11:12:58,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 61 transitions. [2022-11-16 11:12:58,692 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 61 transitions. Word has length 9 [2022-11-16 11:12:58,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:12:58,693 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 61 transitions. [2022-11-16 11:12:58,693 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:12:58,693 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 61 transitions. [2022-11-16 11:12:58,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-16 11:12:58,694 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:12:58,694 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:12:58,694 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-16 11:12:58,695 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-11-16 11:12:58,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:12:58,698 INFO L85 PathProgramCache]: Analyzing trace with hash -806744226, now seen corresponding path program 1 times [2022-11-16 11:12:58,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:12:58,698 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106611424] [2022-11-16 11:12:58,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:12:58,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:12:58,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:12:58,795 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:12:58,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:12:58,796 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106611424] [2022-11-16 11:12:58,796 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [106611424] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:12:58,797 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [209647976] [2022-11-16 11:12:58,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:12:58,797 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:12:58,797 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1477d683-49c0-4268-80c5-f632f093d93d/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:12:58,801 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1477d683-49c0-4268-80c5-f632f093d93d/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:12:58,835 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1477d683-49c0-4268-80c5-f632f093d93d/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-16 11:12:58,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:12:58,941 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-16 11:12:58,947 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:12:59,039 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:12:59,039 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:12:59,076 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:12:59,077 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [209647976] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 11:12:59,077 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 11:12:59,077 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2022-11-16 11:12:59,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049614147] [2022-11-16 11:12:59,078 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 11:12:59,078 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-16 11:12:59,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:12:59,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 11:12:59,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-16 11:12:59,079 INFO L87 Difference]: Start difference. First operand 56 states and 61 transitions. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 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-16 11:12:59,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:12:59,094 INFO L93 Difference]: Finished difference Result 65 states and 70 transitions. [2022-11-16 11:12:59,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 11:12:59,095 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 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 17 [2022-11-16 11:12:59,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:12:59,095 INFO L225 Difference]: With dead ends: 65 [2022-11-16 11:12:59,095 INFO L226 Difference]: Without dead ends: 65 [2022-11-16 11:12:59,096 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 31 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-16 11:12:59,097 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 16 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-16 11:12:59,097 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 163 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-16 11:12:59,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-11-16 11:12:59,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2022-11-16 11:12:59,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 50 states have (on average 1.4) internal successors, (70), 64 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-16 11:12:59,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 70 transitions. [2022-11-16 11:12:59,102 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 70 transitions. Word has length 17 [2022-11-16 11:12:59,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:12:59,102 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 70 transitions. [2022-11-16 11:12:59,102 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 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-16 11:12:59,103 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 70 transitions. [2022-11-16 11:12:59,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-16 11:12:59,103 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:12:59,104 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:12:59,112 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1477d683-49c0-4268-80c5-f632f093d93d/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-16 11:12:59,309 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1477d683-49c0-4268-80c5-f632f093d93d/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-11-16 11:12:59,310 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-11-16 11:12:59,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:12:59,310 INFO L85 PathProgramCache]: Analyzing trace with hash 2130913170, now seen corresponding path program 2 times [2022-11-16 11:12:59,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:12:59,311 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327712855] [2022-11-16 11:12:59,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:12:59,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:12:59,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:12:59,497 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-16 11:12:59,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:12:59,497 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327712855] [2022-11-16 11:12:59,498 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [327712855] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:12:59,498 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:12:59,498 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-16 11:12:59,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922526229] [2022-11-16 11:12:59,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:12:59,499 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-16 11:12:59,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:12:59,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-16 11:12:59,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-11-16 11:12:59,500 INFO L87 Difference]: Start difference. First operand 65 states and 70 transitions. Second operand has 9 states, 8 states have (on average 3.0) internal successors, (24), 9 states have internal predecessors, (24), 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-16 11:12:59,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:12:59,831 INFO L93 Difference]: Finished difference Result 116 states and 125 transitions. [2022-11-16 11:12:59,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-16 11:12:59,831 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.0) internal successors, (24), 9 states have internal predecessors, (24), 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 26 [2022-11-16 11:12:59,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:12:59,832 INFO L225 Difference]: With dead ends: 116 [2022-11-16 11:12:59,833 INFO L226 Difference]: Without dead ends: 116 [2022-11-16 11:12:59,833 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2022-11-16 11:12:59,834 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 380 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 380 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 11:12:59,834 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [380 Valid, 141 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-16 11:12:59,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2022-11-16 11:12:59,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 68. [2022-11-16 11:12:59,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 53 states have (on average 1.4339622641509433) internal successors, (76), 67 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-16 11:12:59,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 76 transitions. [2022-11-16 11:12:59,841 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 76 transitions. Word has length 26 [2022-11-16 11:12:59,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:12:59,841 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 76 transitions. [2022-11-16 11:12:59,841 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.0) internal successors, (24), 9 states have internal predecessors, (24), 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-16 11:12:59,842 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 76 transitions. [2022-11-16 11:12:59,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-16 11:12:59,843 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:12:59,843 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:12:59,843 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-16 11:12:59,843 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-11-16 11:12:59,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:12:59,844 INFO L85 PathProgramCache]: Analyzing trace with hash 2130913171, now seen corresponding path program 1 times [2022-11-16 11:12:59,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:12:59,845 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722863140] [2022-11-16 11:12:59,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:12:59,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:12:59,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:13:00,051 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-16 11:13:00,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:13:00,052 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722863140] [2022-11-16 11:13:00,052 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [722863140] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:13:00,052 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [989187161] [2022-11-16 11:13:00,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:13:00,053 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:13:00,053 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1477d683-49c0-4268-80c5-f632f093d93d/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:13:00,054 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1477d683-49c0-4268-80c5-f632f093d93d/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:13:00,083 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1477d683-49c0-4268-80c5-f632f093d93d/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-16 11:13:00,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:13:00,225 INFO L263 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-16 11:13:00,231 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:13:00,297 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-11-16 11:13:00,298 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 11:13:00,298 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [989187161] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:13:00,298 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-16 11:13:00,298 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 6 [2022-11-16 11:13:00,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318857423] [2022-11-16 11:13:00,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:13:00,299 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-16 11:13:00,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:13:00,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 11:13:00,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-16 11:13:00,300 INFO L87 Difference]: Start difference. First operand 68 states and 76 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 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-16 11:13:00,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:13:00,351 INFO L93 Difference]: Finished difference Result 96 states and 107 transitions. [2022-11-16 11:13:00,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-16 11:13:00,352 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 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 26 [2022-11-16 11:13:00,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:13:00,352 INFO L225 Difference]: With dead ends: 96 [2022-11-16 11:13:00,353 INFO L226 Difference]: Without dead ends: 96 [2022-11-16 11:13:00,353 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2022-11-16 11:13:00,354 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 110 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-16 11:13:00,354 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 151 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-16 11:13:00,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2022-11-16 11:13:00,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 71. [2022-11-16 11:13:00,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 56 states have (on average 1.4107142857142858) internal successors, (79), 70 states have internal predecessors, (79), 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-16 11:13:00,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 79 transitions. [2022-11-16 11:13:00,359 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 79 transitions. Word has length 26 [2022-11-16 11:13:00,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:13:00,359 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 79 transitions. [2022-11-16 11:13:00,359 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 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-16 11:13:00,359 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 79 transitions. [2022-11-16 11:13:00,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-16 11:13:00,360 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:13:00,360 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:13:00,370 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1477d683-49c0-4268-80c5-f632f093d93d/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-11-16 11:13:00,565 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1477d683-49c0-4268-80c5-f632f093d93d/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:13:00,565 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-11-16 11:13:00,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:13:00,566 INFO L85 PathProgramCache]: Analyzing trace with hash 2130913226, now seen corresponding path program 1 times [2022-11-16 11:13:00,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:13:00,567 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591905010] [2022-11-16 11:13:00,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:13:00,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:13:00,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:13:00,918 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-16 11:13:00,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:13:00,918 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [591905010] [2022-11-16 11:13:00,918 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [591905010] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:13:00,919 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:13:00,919 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-16 11:13:00,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107527521] [2022-11-16 11:13:00,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:13:00,919 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-16 11:13:00,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:13:00,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-16 11:13:00,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-11-16 11:13:00,920 INFO L87 Difference]: Start difference. First operand 71 states and 79 transitions. Second operand has 9 states, 8 states have (on average 3.25) internal successors, (26), 9 states have internal predecessors, (26), 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-16 11:13:01,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:13:01,240 INFO L93 Difference]: Finished difference Result 107 states and 116 transitions. [2022-11-16 11:13:01,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-16 11:13:01,241 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.25) internal successors, (26), 9 states have internal predecessors, (26), 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 26 [2022-11-16 11:13:01,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:13:01,242 INFO L225 Difference]: With dead ends: 107 [2022-11-16 11:13:01,243 INFO L226 Difference]: Without dead ends: 107 [2022-11-16 11:13:01,243 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2022-11-16 11:13:01,245 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 366 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 366 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 11:13:01,246 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [366 Valid, 106 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 11:13:01,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2022-11-16 11:13:01,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 71. [2022-11-16 11:13:01,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 56 states have (on average 1.375) internal successors, (77), 70 states have internal predecessors, (77), 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-16 11:13:01,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 77 transitions. [2022-11-16 11:13:01,263 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 77 transitions. Word has length 26 [2022-11-16 11:13:01,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:13:01,264 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 77 transitions. [2022-11-16 11:13:01,264 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.25) internal successors, (26), 9 states have internal predecessors, (26), 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-16 11:13:01,264 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 77 transitions. [2022-11-16 11:13:01,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-16 11:13:01,265 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:13:01,265 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:13:01,266 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-16 11:13:01,266 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-11-16 11:13:01,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:13:01,266 INFO L85 PathProgramCache]: Analyzing trace with hash -1875687586, now seen corresponding path program 1 times [2022-11-16 11:13:01,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:13:01,267 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046732434] [2022-11-16 11:13:01,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:13:01,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:13:01,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:13:02,146 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:13:02,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:13:02,146 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046732434] [2022-11-16 11:13:02,146 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1046732434] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:13:02,146 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1943637545] [2022-11-16 11:13:02,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:13:02,147 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:13:02,147 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1477d683-49c0-4268-80c5-f632f093d93d/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:13:02,151 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1477d683-49c0-4268-80c5-f632f093d93d/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:13:02,180 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1477d683-49c0-4268-80c5-f632f093d93d/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-16 11:13:02,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:13:02,282 INFO L263 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 45 conjunts are in the unsatisfiable core [2022-11-16 11:13:02,290 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:13:02,320 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-16 11:13:02,378 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-16 11:13:02,379 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 1 case distinctions, treesize of input 12 treesize of output 18 [2022-11-16 11:13:02,500 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 13 treesize of output 9 [2022-11-16 11:13:02,705 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 21 treesize of output 9 [2022-11-16 11:13:02,757 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:13:02,757 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:13:03,115 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:13:03,116 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1943637545] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 11:13:03,116 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 11:13:03,116 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 15] total 32 [2022-11-16 11:13:03,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435667891] [2022-11-16 11:13:03,116 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 11:13:03,116 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-11-16 11:13:03,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:13:03,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-11-16 11:13:03,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=941, Unknown=0, NotChecked=0, Total=1056 [2022-11-16 11:13:03,118 INFO L87 Difference]: Start difference. First operand 71 states and 77 transitions. Second operand has 33 states, 32 states have (on average 1.9375) internal successors, (62), 33 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-16 11:13:04,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:13:04,518 INFO L93 Difference]: Finished difference Result 105 states and 113 transitions. [2022-11-16 11:13:04,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-16 11:13:04,518 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 1.9375) internal successors, (62), 33 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 29 [2022-11-16 11:13:04,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:13:04,520 INFO L225 Difference]: With dead ends: 105 [2022-11-16 11:13:04,521 INFO L226 Difference]: Without dead ends: 105 [2022-11-16 11:13:04,521 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 39 SyntacticMatches, 2 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 288 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=538, Invalid=1814, Unknown=0, NotChecked=0, Total=2352 [2022-11-16 11:13:04,522 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 833 mSDsluCounter, 455 mSDsCounter, 0 mSdLazyCounter, 608 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 833 SdHoareTripleChecker+Valid, 491 SdHoareTripleChecker+Invalid, 631 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 608 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-16 11:13:04,522 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [833 Valid, 491 Invalid, 631 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 608 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-16 11:13:04,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2022-11-16 11:13:04,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 76. [2022-11-16 11:13:04,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 61 states have (on average 1.3934426229508197) internal successors, (85), 75 states have internal predecessors, (85), 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-16 11:13:04,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 85 transitions. [2022-11-16 11:13:04,526 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 85 transitions. Word has length 29 [2022-11-16 11:13:04,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:13:04,536 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 85 transitions. [2022-11-16 11:13:04,536 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 1.9375) internal successors, (62), 33 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-16 11:13:04,537 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 85 transitions. [2022-11-16 11:13:04,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-16 11:13:04,537 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:13:04,537 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:13:04,552 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1477d683-49c0-4268-80c5-f632f093d93d/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-16 11:13:04,745 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1477d683-49c0-4268-80c5-f632f093d93d/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-11-16 11:13:04,746 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-11-16 11:13:04,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:13:04,746 INFO L85 PathProgramCache]: Analyzing trace with hash -1875687585, now seen corresponding path program 1 times [2022-11-16 11:13:04,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:13:04,747 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146867132] [2022-11-16 11:13:04,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:13:04,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:13:04,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:13:05,723 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:13:05,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:13:05,723 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1146867132] [2022-11-16 11:13:05,724 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1146867132] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:13:05,724 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2088831626] [2022-11-16 11:13:05,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:13:05,724 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:13:05,724 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1477d683-49c0-4268-80c5-f632f093d93d/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:13:05,727 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1477d683-49c0-4268-80c5-f632f093d93d/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:13:05,743 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1477d683-49c0-4268-80c5-f632f093d93d/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-16 11:13:05,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:13:05,881 INFO L263 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 61 conjunts are in the unsatisfiable core [2022-11-16 11:13:05,886 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:13:05,891 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-16 11:13:06,104 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-16 11:13:06,105 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 11 treesize of output 11 [2022-11-16 11:13:06,112 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-16 11:13:06,268 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-16 11:13:06,277 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 13 treesize of output 9 [2022-11-16 11:13:06,584 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 39 treesize of output 21 [2022-11-16 11:13:06,591 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 14 [2022-11-16 11:13:06,693 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:13:06,693 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:13:07,966 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 48 treesize of output 44 [2022-11-16 11:13:08,111 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:13:08,111 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2088831626] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 11:13:08,111 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 11:13:08,112 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16, 14] total 43 [2022-11-16 11:13:08,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853853342] [2022-11-16 11:13:08,112 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 11:13:08,113 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2022-11-16 11:13:08,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:13:08,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2022-11-16 11:13:08,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=1772, Unknown=0, NotChecked=0, Total=1892 [2022-11-16 11:13:08,115 INFO L87 Difference]: Start difference. First operand 76 states and 85 transitions. Second operand has 44 states, 43 states have (on average 1.930232558139535) internal successors, (83), 44 states have internal predecessors, (83), 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-16 11:13:13,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:13:13,341 INFO L93 Difference]: Finished difference Result 213 states and 229 transitions. [2022-11-16 11:13:13,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-11-16 11:13:13,341 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 43 states have (on average 1.930232558139535) internal successors, (83), 44 states have internal predecessors, (83), 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-16 11:13:13,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:13:13,343 INFO L225 Difference]: With dead ends: 213 [2022-11-16 11:13:13,343 INFO L226 Difference]: Without dead ends: 213 [2022-11-16 11:13:13,346 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 29 SyntacticMatches, 3 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 435 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=818, Invalid=3738, Unknown=0, NotChecked=0, Total=4556 [2022-11-16 11:13:13,346 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 2932 mSDsluCounter, 849 mSDsCounter, 0 mSdLazyCounter, 1109 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2932 SdHoareTripleChecker+Valid, 904 SdHoareTripleChecker+Invalid, 1255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 1109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 102 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-11-16 11:13:13,347 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2932 Valid, 904 Invalid, 1255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 1109 Invalid, 0 Unknown, 102 Unchecked, 1.1s Time] [2022-11-16 11:13:13,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2022-11-16 11:13:13,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 84. [2022-11-16 11:13:13,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 69 states have (on average 1.391304347826087) internal successors, (96), 83 states have internal predecessors, (96), 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-16 11:13:13,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 96 transitions. [2022-11-16 11:13:13,351 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 96 transitions. Word has length 29 [2022-11-16 11:13:13,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:13:13,352 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 96 transitions. [2022-11-16 11:13:13,352 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 43 states have (on average 1.930232558139535) internal successors, (83), 44 states have internal predecessors, (83), 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-16 11:13:13,352 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 96 transitions. [2022-11-16 11:13:13,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-11-16 11:13:13,359 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:13:13,359 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:13:13,366 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1477d683-49c0-4268-80c5-f632f093d93d/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-16 11:13:13,565 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1477d683-49c0-4268-80c5-f632f093d93d/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:13:13,565 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-11-16 11:13:13,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:13:13,566 INFO L85 PathProgramCache]: Analyzing trace with hash -1082686446, now seen corresponding path program 2 times [2022-11-16 11:13:13,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:13:13,566 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490025176] [2022-11-16 11:13:13,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:13:13,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:13:13,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:13:13,714 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-16 11:13:13,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:13:13,714 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490025176] [2022-11-16 11:13:13,714 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1490025176] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:13:13,715 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [998377611] [2022-11-16 11:13:13,715 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-16 11:13:13,715 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:13:13,715 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1477d683-49c0-4268-80c5-f632f093d93d/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:13:13,719 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1477d683-49c0-4268-80c5-f632f093d93d/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:13:13,743 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1477d683-49c0-4268-80c5-f632f093d93d/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-16 11:13:13,864 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-16 11:13:13,865 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 11:13:13,866 INFO L263 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-16 11:13:13,869 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:13:13,917 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-11-16 11:13:13,918 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 11:13:13,918 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [998377611] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:13:13,918 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-16 11:13:13,918 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 7 [2022-11-16 11:13:13,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289219997] [2022-11-16 11:13:13,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:13:13,922 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-16 11:13:13,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:13:13,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-16 11:13:13,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-16 11:13:13,923 INFO L87 Difference]: Start difference. First operand 84 states and 96 transitions. Second operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 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-16 11:13:13,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:13:13,967 INFO L93 Difference]: Finished difference Result 70 states and 75 transitions. [2022-11-16 11:13:13,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-16 11:13:13,968 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 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 32 [2022-11-16 11:13:13,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:13:13,969 INFO L225 Difference]: With dead ends: 70 [2022-11-16 11:13:13,969 INFO L226 Difference]: Without dead ends: 70 [2022-11-16 11:13:13,969 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2022-11-16 11:13:13,970 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 125 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-16 11:13:13,971 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 86 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-16 11:13:13,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-11-16 11:13:13,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2022-11-16 11:13:13,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 58 states have (on average 1.293103448275862) internal successors, (75), 69 states have internal predecessors, (75), 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-16 11:13:13,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 75 transitions. [2022-11-16 11:13:13,979 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 75 transitions. Word has length 32 [2022-11-16 11:13:13,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:13:13,980 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 75 transitions. [2022-11-16 11:13:13,980 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 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-16 11:13:13,985 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 75 transitions. [2022-11-16 11:13:13,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-11-16 11:13:13,987 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:13:13,988 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 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] [2022-11-16 11:13:13,999 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1477d683-49c0-4268-80c5-f632f093d93d/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-16 11:13:14,194 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1477d683-49c0-4268-80c5-f632f093d93d/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:13:14,194 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-11-16 11:13:14,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:13:14,195 INFO L85 PathProgramCache]: Analyzing trace with hash -516260032, now seen corresponding path program 1 times [2022-11-16 11:13:14,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:13:14,195 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033642467] [2022-11-16 11:13:14,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:13:14,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:13:14,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:13:14,339 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-16 11:13:14,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:13:14,340 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033642467] [2022-11-16 11:13:14,340 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1033642467] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:13:14,340 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:13:14,340 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-16 11:13:14,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237949621] [2022-11-16 11:13:14,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:13:14,340 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-16 11:13:14,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:13:14,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-16 11:13:14,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-11-16 11:13:14,341 INFO L87 Difference]: Start difference. First operand 70 states and 75 transitions. Second operand has 9 states, 8 states have (on average 4.25) internal successors, (34), 9 states have internal predecessors, (34), 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-16 11:13:14,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:13:14,550 INFO L93 Difference]: Finished difference Result 89 states and 95 transitions. [2022-11-16 11:13:14,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-16 11:13:14,551 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.25) internal successors, (34), 9 states have internal predecessors, (34), 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 36 [2022-11-16 11:13:14,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:13:14,552 INFO L225 Difference]: With dead ends: 89 [2022-11-16 11:13:14,552 INFO L226 Difference]: Without dead ends: 89 [2022-11-16 11:13:14,552 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2022-11-16 11:13:14,552 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 338 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 338 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 11:13:14,553 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [338 Valid, 109 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 11:13:14,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-11-16 11:13:14,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 73. [2022-11-16 11:13:14,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 61 states have (on average 1.3278688524590163) internal successors, (81), 72 states have internal predecessors, (81), 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-16 11:13:14,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 81 transitions. [2022-11-16 11:13:14,555 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 81 transitions. Word has length 36 [2022-11-16 11:13:14,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:13:14,555 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 81 transitions. [2022-11-16 11:13:14,555 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.25) internal successors, (34), 9 states have internal predecessors, (34), 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-16 11:13:14,555 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 81 transitions. [2022-11-16 11:13:14,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-11-16 11:13:14,556 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:13:14,556 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 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] [2022-11-16 11:13:14,556 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-16 11:13:14,556 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-11-16 11:13:14,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:13:14,557 INFO L85 PathProgramCache]: Analyzing trace with hash -516260031, now seen corresponding path program 1 times [2022-11-16 11:13:14,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:13:14,557 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488845004] [2022-11-16 11:13:14,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:13:14,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:13:14,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:13:14,683 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-16 11:13:14,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:13:14,684 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488845004] [2022-11-16 11:13:14,684 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [488845004] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:13:14,684 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [140007691] [2022-11-16 11:13:14,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:13:14,684 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:13:14,685 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1477d683-49c0-4268-80c5-f632f093d93d/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:13:14,686 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1477d683-49c0-4268-80c5-f632f093d93d/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:13:14,703 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1477d683-49c0-4268-80c5-f632f093d93d/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-16 11:13:14,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:13:14,834 INFO L263 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-16 11:13:14,836 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:13:14,889 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-16 11:13:14,889 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:13:14,953 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-16 11:13:14,953 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [140007691] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 11:13:14,953 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 11:13:14,953 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 6 [2022-11-16 11:13:14,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332590388] [2022-11-16 11:13:14,954 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 11:13:14,954 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-16 11:13:14,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:13:14,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-16 11:13:14,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-16 11:13:14,955 INFO L87 Difference]: Start difference. First operand 73 states and 81 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-16 11:13:15,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:13:15,007 INFO L93 Difference]: Finished difference Result 95 states and 107 transitions. [2022-11-16 11:13:15,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-16 11:13:15,007 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 36 [2022-11-16 11:13:15,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:13:15,009 INFO L225 Difference]: With dead ends: 95 [2022-11-16 11:13:15,009 INFO L226 Difference]: Without dead ends: 95 [2022-11-16 11:13:15,009 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 70 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-11-16 11:13:15,010 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 130 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-16 11:13:15,010 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 143 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-16 11:13:15,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2022-11-16 11:13:15,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 89. [2022-11-16 11:13:15,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 77 states have (on average 1.3766233766233766) internal successors, (106), 88 states have internal predecessors, (106), 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-16 11:13:15,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 106 transitions. [2022-11-16 11:13:15,014 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 106 transitions. Word has length 36 [2022-11-16 11:13:15,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:13:15,015 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 106 transitions. [2022-11-16 11:13:15,015 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-16 11:13:15,015 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 106 transitions. [2022-11-16 11:13:15,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-11-16 11:13:15,017 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:13:15,017 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:13:15,032 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1477d683-49c0-4268-80c5-f632f093d93d/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-16 11:13:15,232 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1477d683-49c0-4268-80c5-f632f093d93d/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:13:15,233 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-11-16 11:13:15,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:13:15,233 INFO L85 PathProgramCache]: Analyzing trace with hash 1215669110, now seen corresponding path program 1 times [2022-11-16 11:13:15,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:13:15,233 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906643240] [2022-11-16 11:13:15,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:13:15,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:13:15,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:13:15,390 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 7 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-16 11:13:15,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:13:15,391 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906643240] [2022-11-16 11:13:15,391 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1906643240] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:13:15,391 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1198857583] [2022-11-16 11:13:15,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:13:15,391 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:13:15,391 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1477d683-49c0-4268-80c5-f632f093d93d/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:13:15,392 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1477d683-49c0-4268-80c5-f632f093d93d/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:13:15,419 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1477d683-49c0-4268-80c5-f632f093d93d/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-16 11:13:15,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:13:15,555 INFO L263 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-16 11:13:15,556 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:13:15,602 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-16 11:13:15,602 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:13:15,657 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-16 11:13:15,657 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1198857583] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 11:13:15,657 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 11:13:15,657 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 7 [2022-11-16 11:13:15,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835084364] [2022-11-16 11:13:15,658 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 11:13:15,658 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-16 11:13:15,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:13:15,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-16 11:13:15,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-16 11:13:15,659 INFO L87 Difference]: Start difference. First operand 89 states and 106 transitions. Second operand has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 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-16 11:13:15,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:13:15,721 INFO L93 Difference]: Finished difference Result 90 states and 101 transitions. [2022-11-16 11:13:15,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 11:13:15,721 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 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 37 [2022-11-16 11:13:15,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:13:15,722 INFO L225 Difference]: With dead ends: 90 [2022-11-16 11:13:15,722 INFO L226 Difference]: Without dead ends: 90 [2022-11-16 11:13:15,722 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 70 SyntacticMatches, 4 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2022-11-16 11:13:15,723 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 148 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-16 11:13:15,723 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 164 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-16 11:13:15,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2022-11-16 11:13:15,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 84. [2022-11-16 11:13:15,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 73 states have (on average 1.36986301369863) internal successors, (100), 83 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-16 11:13:15,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 100 transitions. [2022-11-16 11:13:15,726 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 100 transitions. Word has length 37 [2022-11-16 11:13:15,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:13:15,726 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 100 transitions. [2022-11-16 11:13:15,726 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 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-16 11:13:15,726 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 100 transitions. [2022-11-16 11:13:15,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-11-16 11:13:15,727 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:13:15,727 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:13:15,734 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1477d683-49c0-4268-80c5-f632f093d93d/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-16 11:13:15,927 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1477d683-49c0-4268-80c5-f632f093d93d/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-11-16 11:13:15,928 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-11-16 11:13:15,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:13:15,928 INFO L85 PathProgramCache]: Analyzing trace with hash 1972522149, now seen corresponding path program 2 times [2022-11-16 11:13:15,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:13:15,928 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231826889] [2022-11-16 11:13:15,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:13:15,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:13:15,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:13:16,085 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-16 11:13:16,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:13:16,085 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231826889] [2022-11-16 11:13:16,085 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [231826889] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:13:16,085 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [372133245] [2022-11-16 11:13:16,085 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-16 11:13:16,086 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:13:16,087 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1477d683-49c0-4268-80c5-f632f093d93d/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:13:16,088 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1477d683-49c0-4268-80c5-f632f093d93d/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:13:16,107 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1477d683-49c0-4268-80c5-f632f093d93d/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-16 11:13:16,213 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-11-16 11:13:16,213 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 11:13:16,214 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-16 11:13:16,218 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:13:16,269 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-11-16 11:13:16,269 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 11:13:16,269 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [372133245] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:13:16,269 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-16 11:13:16,269 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 6 [2022-11-16 11:13:16,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270574414] [2022-11-16 11:13:16,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:13:16,270 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-16 11:13:16,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:13:16,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 11:13:16,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-16 11:13:16,271 INFO L87 Difference]: Start difference. First operand 84 states and 100 transitions. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 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-16 11:13:16,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:13:16,315 INFO L93 Difference]: Finished difference Result 89 states and 98 transitions. [2022-11-16 11:13:16,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-16 11:13:16,316 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 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 41 [2022-11-16 11:13:16,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:13:16,316 INFO L225 Difference]: With dead ends: 89 [2022-11-16 11:13:16,316 INFO L226 Difference]: Without dead ends: 89 [2022-11-16 11:13:16,317 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2022-11-16 11:13:16,317 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 80 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-16 11:13:16,317 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 136 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-16 11:13:16,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-11-16 11:13:16,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 83. [2022-11-16 11:13:16,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 72 states have (on average 1.3472222222222223) internal successors, (97), 82 states have internal predecessors, (97), 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-16 11:13:16,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 97 transitions. [2022-11-16 11:13:16,320 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 97 transitions. Word has length 41 [2022-11-16 11:13:16,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:13:16,320 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 97 transitions. [2022-11-16 11:13:16,321 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 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-16 11:13:16,321 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 97 transitions. [2022-11-16 11:13:16,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-11-16 11:13:16,321 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:13:16,321 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:13:16,342 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1477d683-49c0-4268-80c5-f632f093d93d/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-16 11:13:16,537 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1477d683-49c0-4268-80c5-f632f093d93d/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-11-16 11:13:16,537 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-11-16 11:13:16,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:13:16,538 INFO L85 PathProgramCache]: Analyzing trace with hash 1972522204, now seen corresponding path program 1 times [2022-11-16 11:13:16,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:13:16,538 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623278489] [2022-11-16 11:13:16,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:13:16,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:13:16,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:13:16,819 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-16 11:13:16,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:13:16,819 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1623278489] [2022-11-16 11:13:16,819 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1623278489] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:13:16,820 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:13:16,820 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-16 11:13:16,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765134662] [2022-11-16 11:13:16,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:13:16,820 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-16 11:13:16,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:13:16,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-16 11:13:16,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-11-16 11:13:16,821 INFO L87 Difference]: Start difference. First operand 83 states and 97 transitions. Second operand has 9 states, 8 states have (on average 4.5) internal successors, (36), 9 states have internal predecessors, (36), 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-16 11:13:17,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:13:17,100 INFO L93 Difference]: Finished difference Result 107 states and 119 transitions. [2022-11-16 11:13:17,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-16 11:13:17,101 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.5) internal successors, (36), 9 states have internal predecessors, (36), 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-16 11:13:17,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:13:17,101 INFO L225 Difference]: With dead ends: 107 [2022-11-16 11:13:17,101 INFO L226 Difference]: Without dead ends: 107 [2022-11-16 11:13:17,102 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2022-11-16 11:13:17,102 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 414 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 414 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 11:13:17,103 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [414 Valid, 80 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 11:13:17,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2022-11-16 11:13:17,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 83. [2022-11-16 11:13:17,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 72 states have (on average 1.3055555555555556) internal successors, (94), 82 states have internal predecessors, (94), 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-16 11:13:17,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 94 transitions. [2022-11-16 11:13:17,106 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 94 transitions. Word has length 41 [2022-11-16 11:13:17,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:13:17,107 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 94 transitions. [2022-11-16 11:13:17,107 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.5) internal successors, (36), 9 states have internal predecessors, (36), 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-16 11:13:17,107 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 94 transitions. [2022-11-16 11:13:17,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-11-16 11:13:17,107 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:13:17,108 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:13:17,108 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-16 11:13:17,108 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-11-16 11:13:17,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:13:17,108 INFO L85 PathProgramCache]: Analyzing trace with hash -333530929, now seen corresponding path program 1 times [2022-11-16 11:13:17,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:13:17,109 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366566189] [2022-11-16 11:13:17,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:13:17,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:13:17,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:13:18,539 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 14 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-16 11:13:18,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:13:18,539 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366566189] [2022-11-16 11:13:18,539 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1366566189] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:13:18,540 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [529999273] [2022-11-16 11:13:18,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:13:18,540 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:13:18,540 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1477d683-49c0-4268-80c5-f632f093d93d/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:13:18,541 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1477d683-49c0-4268-80c5-f632f093d93d/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:13:18,549 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1477d683-49c0-4268-80c5-f632f093d93d/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-16 11:13:18,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:13:18,714 INFO L263 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 75 conjunts are in the unsatisfiable core [2022-11-16 11:13:18,717 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:13:18,721 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-16 11:13:18,770 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-16 11:13:18,770 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 11 treesize of output 11 [2022-11-16 11:13:18,798 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-16 11:13:18,921 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 11:13:18,922 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 1 case distinctions, treesize of input 28 treesize of output 29 [2022-11-16 11:13:19,057 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:13:19,058 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-16 11:13:19,143 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 25 treesize of output 13 [2022-11-16 11:13:19,149 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 14 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-16 11:13:19,150 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:13:19,351 INFO L321 Elim1Store]: treesize reduction 5, result has 70.6 percent of original size [2022-11-16 11:13:19,351 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 21 treesize of output 20 [2022-11-16 11:13:19,489 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_976 (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|) (+ |c_ULTIMATE.start_sll_update_at_~head#1.offset| 4)))) (= .cse0 (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_976) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))))) is different from false [2022-11-16 11:13:19,499 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_976 (Array Int Int))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) .cse1))) (= .cse0 (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_976) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1))))) is different from false [2022-11-16 11:13:19,561 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_976 (Array Int Int))) (let ((.cse1 (+ 4 |c_ULTIMATE.start_sll_create_~head~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse1))) (= .cse0 (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_976) |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse1))))) is different from false [2022-11-16 11:13:19,574 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_976 (Array Int Int))) (let ((.cse1 (+ |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse1))) (= (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_976) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse1) .cse0)))) is different from false [2022-11-16 11:13:19,581 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:13:19,581 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2022-11-16 11:13:19,584 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 36 treesize of output 24 [2022-11-16 11:13:19,589 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 7 treesize of output 3 [2022-11-16 11:13:19,803 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 7 not checked. [2022-11-16 11:13:19,804 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [529999273] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 11:13:19,804 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 11:13:19,804 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20, 20] total 42 [2022-11-16 11:13:19,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846053640] [2022-11-16 11:13:19,804 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 11:13:19,804 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2022-11-16 11:13:19,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:13:19,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2022-11-16 11:13:19,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=1343, Unknown=38, NotChecked=308, Total=1806 [2022-11-16 11:13:19,806 INFO L87 Difference]: Start difference. First operand 83 states and 94 transitions. Second operand has 43 states, 42 states have (on average 2.261904761904762) internal successors, (95), 43 states have internal predecessors, (95), 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-16 11:13:21,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:13:21,339 INFO L93 Difference]: Finished difference Result 136 states and 152 transitions. [2022-11-16 11:13:21,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-11-16 11:13:21,340 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 42 states have (on average 2.261904761904762) internal successors, (95), 43 states have internal predecessors, (95), 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 44 [2022-11-16 11:13:21,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:13:21,341 INFO L225 Difference]: With dead ends: 136 [2022-11-16 11:13:21,341 INFO L226 Difference]: Without dead ends: 136 [2022-11-16 11:13:21,343 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 63 SyntacticMatches, 6 SemanticMatches, 61 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 592 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=442, Invalid=2958, Unknown=38, NotChecked=468, Total=3906 [2022-11-16 11:13:21,344 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 414 mSDsluCounter, 790 mSDsCounter, 0 mSdLazyCounter, 806 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 414 SdHoareTripleChecker+Valid, 831 SdHoareTripleChecker+Invalid, 1369 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 806 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 547 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-16 11:13:21,344 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [414 Valid, 831 Invalid, 1369 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 806 Invalid, 0 Unknown, 547 Unchecked, 0.5s Time] [2022-11-16 11:13:21,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2022-11-16 11:13:21,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 91. [2022-11-16 11:13:21,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 80 states have (on average 1.35) internal successors, (108), 90 states have internal predecessors, (108), 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-16 11:13:21,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 108 transitions. [2022-11-16 11:13:21,348 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 108 transitions. Word has length 44 [2022-11-16 11:13:21,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:13:21,348 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 108 transitions. [2022-11-16 11:13:21,348 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 42 states have (on average 2.261904761904762) internal successors, (95), 43 states have internal predecessors, (95), 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-16 11:13:21,349 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 108 transitions. [2022-11-16 11:13:21,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-11-16 11:13:21,349 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:13:21,349 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:13:21,363 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1477d683-49c0-4268-80c5-f632f093d93d/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-16 11:13:21,556 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1477d683-49c0-4268-80c5-f632f093d93d/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-11-16 11:13:21,556 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-11-16 11:13:21,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:13:21,556 INFO L85 PathProgramCache]: Analyzing trace with hash -333530928, now seen corresponding path program 1 times [2022-11-16 11:13:21,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:13:21,557 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145119199] [2022-11-16 11:13:21,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:13:21,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:13:21,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:13:23,321 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 14 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-16 11:13:23,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:13:23,321 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145119199] [2022-11-16 11:13:23,321 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1145119199] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:13:23,321 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1766181649] [2022-11-16 11:13:23,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:13:23,322 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:13:23,322 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1477d683-49c0-4268-80c5-f632f093d93d/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:13:23,323 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1477d683-49c0-4268-80c5-f632f093d93d/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:13:23,353 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1477d683-49c0-4268-80c5-f632f093d93d/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-16 11:13:23,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:13:23,515 INFO L263 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 82 conjunts are in the unsatisfiable core [2022-11-16 11:13:23,519 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:13:23,524 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-16 11:13:23,678 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-16 11:13:23,678 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 11 treesize of output 11 [2022-11-16 11:13:23,804 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 13 treesize of output 9 [2022-11-16 11:13:23,809 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-16 11:13:24,221 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 11:13:24,221 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 1 case distinctions, treesize of input 54 treesize of output 53 [2022-11-16 11:13:24,227 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 41 treesize of output 41 [2022-11-16 11:13:24,410 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:13:24,411 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 40 treesize of output 33 [2022-11-16 11:13:24,419 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:13:24,421 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 41 treesize of output 34 [2022-11-16 11:13:24,537 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 39 treesize of output 21 [2022-11-16 11:13:24,544 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 14 [2022-11-16 11:13:24,640 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 14 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-16 11:13:24,641 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:13:27,231 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:13:27,231 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 47 treesize of output 51 [2022-11-16 11:13:27,273 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (and (forall ((v_ArrVal_1088 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_1088) |c_ULTIMATE.start_main_~s~0#1.base|) .cse0))) (forall ((v_prenex_2 (Array Int Int))) (< (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_prenex_2) |c_ULTIMATE.start_main_~s~0#1.base|) .cse0) (+ |c_ULTIMATE.start_sll_update_at_~head#1.offset| 1))) (forall ((v_ArrVal_1089 (Array Int Int))) (= |c_ULTIMATE.start_sll_update_at_~head#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_1089) |c_ULTIMATE.start_main_~s~0#1.base|) .cse0))))) is different from false [2022-11-16 11:13:27,307 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (and (forall ((v_prenex_2 (Array Int Int))) (< (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_update_at_#t~mem10#1.base| v_prenex_2) |c_ULTIMATE.start_main_~s~0#1.base|) .cse0) (+ |c_ULTIMATE.start_sll_update_at_#t~mem10#1.offset| 1))) (forall ((v_ArrVal_1088 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_update_at_#t~mem10#1.base| v_ArrVal_1088) |c_ULTIMATE.start_main_~s~0#1.base|) .cse0))) (forall ((v_ArrVal_1089 (Array Int Int))) (= |c_ULTIMATE.start_sll_update_at_#t~mem10#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_#t~mem10#1.base| v_ArrVal_1089) |c_ULTIMATE.start_main_~s~0#1.base|) .cse0))))) is different from false [2022-11-16 11:13:27,330 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_sll_update_at_~head#1.offset| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|) .cse2)) (.cse1 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (and (forall ((v_ArrVal_1088 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1088) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1))) (forall ((v_prenex_2 (Array Int Int))) (< (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_prenex_2) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1) (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base|) .cse2) 1))) (forall ((v_ArrVal_1089 (Array Int Int))) (= .cse0 (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1089) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1)))))) is different from false [2022-11-16 11:13:27,359 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) .cse1))) (and (forall ((v_ArrVal_1089 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1089) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1) .cse0)) (forall ((v_prenex_2 (Array Int Int))) (< (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_prenex_2) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1) (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) .cse1) 1))) (forall ((v_ArrVal_1088 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1088) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1)))))) is different from false [2022-11-16 11:13:27,389 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_sll_create_#res#1.offset| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_#res#1.base|) .cse1))) (and (forall ((v_ArrVal_1089 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1089) |c_ULTIMATE.start_sll_create_#res#1.base|) .cse1) .cse0)) (forall ((v_prenex_2 (Array Int Int))) (< (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_prenex_2) |c_ULTIMATE.start_sll_create_#res#1.base|) .cse1) (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_#res#1.base|) .cse1) 1))) (forall ((v_ArrVal_1088 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1088) |c_ULTIMATE.start_sll_create_#res#1.base|) .cse1)))))) is different from false [2022-11-16 11:13:27,999 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 6 not checked. [2022-11-16 11:13:28,000 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1766181649] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 11:13:28,000 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 11:13:28,000 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20, 20] total 52 [2022-11-16 11:13:28,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411848626] [2022-11-16 11:13:28,001 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 11:13:28,001 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2022-11-16 11:13:28,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:13:28,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2022-11-16 11:13:28,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=2112, Unknown=5, NotChecked=480, Total=2756 [2022-11-16 11:13:28,003 INFO L87 Difference]: Start difference. First operand 91 states and 108 transitions. Second operand has 53 states, 52 states have (on average 2.1153846153846154) internal successors, (110), 53 states have internal predecessors, (110), 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-16 11:13:30,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:13:30,751 INFO L93 Difference]: Finished difference Result 149 states and 165 transitions. [2022-11-16 11:13:30,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-11-16 11:13:30,752 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 52 states have (on average 2.1153846153846154) internal successors, (110), 53 states have internal predecessors, (110), 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 44 [2022-11-16 11:13:30,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:13:30,753 INFO L225 Difference]: With dead ends: 149 [2022-11-16 11:13:30,753 INFO L226 Difference]: Without dead ends: 149 [2022-11-16 11:13:30,755 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 54 SyntacticMatches, 8 SemanticMatches, 72 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 973 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=558, Invalid=4149, Unknown=5, NotChecked=690, Total=5402 [2022-11-16 11:13:30,755 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 833 mSDsluCounter, 1448 mSDsCounter, 0 mSdLazyCounter, 1060 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 833 SdHoareTripleChecker+Valid, 1507 SdHoareTripleChecker+Invalid, 1876 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 1060 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 797 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-16 11:13:30,755 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [833 Valid, 1507 Invalid, 1876 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 1060 Invalid, 0 Unknown, 797 Unchecked, 0.8s Time] [2022-11-16 11:13:30,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2022-11-16 11:13:30,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 90. [2022-11-16 11:13:30,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 79 states have (on average 1.3037974683544304) internal successors, (103), 89 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-16 11:13:30,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 103 transitions. [2022-11-16 11:13:30,759 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 103 transitions. Word has length 44 [2022-11-16 11:13:30,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:13:30,760 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 103 transitions. [2022-11-16 11:13:30,760 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 52 states have (on average 2.1153846153846154) internal successors, (110), 53 states have internal predecessors, (110), 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-16 11:13:30,760 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 103 transitions. [2022-11-16 11:13:30,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-11-16 11:13:30,761 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:13:30,761 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:13:30,768 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1477d683-49c0-4268-80c5-f632f093d93d/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-16 11:13:30,967 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1477d683-49c0-4268-80c5-f632f093d93d/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:13:30,967 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-11-16 11:13:30,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:13:30,968 INFO L85 PathProgramCache]: Analyzing trace with hash -1958848316, now seen corresponding path program 2 times [2022-11-16 11:13:30,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:13:30,968 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949477929] [2022-11-16 11:13:30,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:13:30,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:13:31,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:13:31,161 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-16 11:13:31,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:13:31,161 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949477929] [2022-11-16 11:13:31,161 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [949477929] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:13:31,162 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [239071771] [2022-11-16 11:13:31,162 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-16 11:13:31,162 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:13:31,162 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1477d683-49c0-4268-80c5-f632f093d93d/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:13:31,163 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1477d683-49c0-4268-80c5-f632f093d93d/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:13:31,194 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1477d683-49c0-4268-80c5-f632f093d93d/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-16 11:13:31,349 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-16 11:13:31,349 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 11:13:31,351 INFO L263 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-16 11:13:31,353 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:13:31,412 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-11-16 11:13:31,413 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 11:13:31,413 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [239071771] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:13:31,413 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-16 11:13:31,413 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 7 [2022-11-16 11:13:31,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262383230] [2022-11-16 11:13:31,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:13:31,414 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-16 11:13:31,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:13:31,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-16 11:13:31,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-16 11:13:31,415 INFO L87 Difference]: Start difference. First operand 90 states and 103 transitions. Second operand has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 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-16 11:13:31,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:13:31,460 INFO L93 Difference]: Finished difference Result 76 states and 81 transitions. [2022-11-16 11:13:31,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-16 11:13:31,461 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 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 47 [2022-11-16 11:13:31,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:13:31,462 INFO L225 Difference]: With dead ends: 76 [2022-11-16 11:13:31,462 INFO L226 Difference]: Without dead ends: 76 [2022-11-16 11:13:31,462 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2022-11-16 11:13:31,463 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 90 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-16 11:13:31,464 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 93 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-16 11:13:31,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-11-16 11:13:31,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2022-11-16 11:13:31,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 69 states have (on average 1.173913043478261) internal successors, (81), 75 states have internal predecessors, (81), 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-16 11:13:31,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 81 transitions. [2022-11-16 11:13:31,471 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 81 transitions. Word has length 47 [2022-11-16 11:13:31,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:13:31,471 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 81 transitions. [2022-11-16 11:13:31,472 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 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-16 11:13:31,472 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 81 transitions. [2022-11-16 11:13:31,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-11-16 11:13:31,472 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:13:31,472 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 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, 1] [2022-11-16 11:13:31,478 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1477d683-49c0-4268-80c5-f632f093d93d/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2022-11-16 11:13:31,678 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1477d683-49c0-4268-80c5-f632f093d93d/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:13:31,680 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-11-16 11:13:31,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:13:31,681 INFO L85 PathProgramCache]: Analyzing trace with hash -645325999, now seen corresponding path program 1 times [2022-11-16 11:13:31,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:13:31,681 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857067765] [2022-11-16 11:13:31,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:13:31,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:13:31,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:13:33,894 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:13:33,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:13:33,894 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857067765] [2022-11-16 11:13:33,894 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [857067765] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:13:33,894 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [800059236] [2022-11-16 11:13:33,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:13:33,895 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:13:33,895 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1477d683-49c0-4268-80c5-f632f093d93d/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:13:33,896 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1477d683-49c0-4268-80c5-f632f093d93d/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:13:33,919 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1477d683-49c0-4268-80c5-f632f093d93d/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-11-16 11:13:34,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:13:34,108 INFO L263 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 110 conjunts are in the unsatisfiable core [2022-11-16 11:13:34,111 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:13:34,152 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-16 11:13:34,347 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-16 11:13:34,347 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 11 treesize of output 11 [2022-11-16 11:13:34,526 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-16 11:13:34,532 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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-16 11:13:35,110 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 11:13:35,111 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 1 case distinctions, treesize of input 66 treesize of output 63 [2022-11-16 11:13:35,118 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 33 treesize of output 23 [2022-11-16 11:13:35,123 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:13:35,124 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 36 treesize of output 38 [2022-11-16 11:13:35,387 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 11:13:35,389 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:13:35,390 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 38 [2022-11-16 11:13:35,399 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 32 [2022-11-16 11:13:35,405 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:13:35,408 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 34 [2022-11-16 11:13:35,698 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 31 treesize of output 19 [2022-11-16 11:13:35,702 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2022-11-16 11:13:35,827 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-16 11:13:35,973 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 16 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-16 11:13:35,973 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:13:37,256 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:13:37,256 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 47 [2022-11-16 11:13:37,271 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:13:37,272 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 98 treesize of output 101 [2022-11-16 11:13:37,290 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 37 treesize of output 23 [2022-11-16 11:13:37,374 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:13:37,375 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 47 [2022-11-16 11:13:37,392 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:13:37,404 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 98 treesize of output 101 [2022-11-16 11:13:37,416 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 37 treesize of output 23 [2022-11-16 11:13:37,501 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) (.cse2 (* |c_ULTIMATE.start_main_~len~0#1| 2)) (.cse1 (+ |c_ULTIMATE.start_sll_update_at_~data#1| 1))) (and (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_25| Int)) (or (forall ((v_ArrVal_1306 (Array Int Int)) (v_ArrVal_1310 Int)) (not (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_1306) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_ArrVal_1310) .cse0) |c_ULTIMATE.start_main_~s~0#1.base|))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_25|))) (<= .cse1 .cse2) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_25| Int)) (or (forall ((v_ArrVal_1306 (Array Int Int)) (v_ArrVal_1310 Int)) (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_1306) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_ArrVal_1310) .cse0) |c_ULTIMATE.start_sll_update_at_~head#1.base|)) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_25|))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_25| Int)) (or (forall ((v_ArrVal_1313 Int) (v_ArrVal_1308 (Array Int Int))) (= |c_ULTIMATE.start_sll_update_at_~head#1.offset| (select (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_1308) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_ArrVal_1313) .cse0))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_25|))) (<= .cse2 .cse1))) is different from false [2022-11-16 11:13:37,595 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) (.cse2 (* |c_ULTIMATE.start_main_~len~0#1| 2)) (.cse1 (+ |c_ULTIMATE.start_sll_update_at_~data#1| 1))) (and (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_25| Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_25|) (forall ((v_ArrVal_1306 (Array Int Int)) (v_ArrVal_1310 Int)) (= |c_ULTIMATE.start_sll_update_at_#t~mem10#1.base| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_#t~mem10#1.base| v_ArrVal_1306) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_ArrVal_1310) .cse0))))) (<= .cse1 .cse2) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_25| Int)) (or (forall ((v_ArrVal_1306 (Array Int Int)) (v_ArrVal_1310 Int)) (not (= |c_ULTIMATE.start_main_~s~0#1.base| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_#t~mem10#1.base| v_ArrVal_1306) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_ArrVal_1310) .cse0)))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_25|))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_25| Int)) (or (forall ((v_ArrVal_1313 Int) (v_ArrVal_1308 (Array Int Int))) (= (select (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_update_at_#t~mem10#1.base| v_ArrVal_1308) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_ArrVal_1313) .cse0) |c_ULTIMATE.start_sll_update_at_#t~mem10#1.offset|)) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_25|))) (<= .cse2 .cse1))) is different from false [2022-11-16 11:13:37,649 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_sll_update_at_~head#1.offset| 4))) (let ((.cse1 (* |c_ULTIMATE.start_main_~len~0#1| 2)) (.cse0 (+ |c_ULTIMATE.start_sll_update_at_~data#1| 1)) (.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|) .cse2)) (.cse4 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (and (<= .cse0 .cse1) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_25| Int)) (or (forall ((v_ArrVal_1313 Int) (v_ArrVal_1308 (Array Int Int))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base|) .cse2) (select (store (select (store |c_#memory_$Pointer$.offset| .cse3 v_ArrVal_1308) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_ArrVal_1313) .cse4))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_25|))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_25| Int)) (or (forall ((v_ArrVal_1306 (Array Int Int)) (v_ArrVal_1310 Int)) (not (= (select (store (select (store |c_#memory_$Pointer$.base| .cse3 v_ArrVal_1306) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_ArrVal_1310) .cse4) |c_ULTIMATE.start_main_~s~0#1.base|))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_25|))) (<= .cse1 .cse0) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_25| Int)) (or (forall ((v_ArrVal_1306 (Array Int Int)) (v_ArrVal_1310 Int)) (= .cse3 (select (store (select (store |c_#memory_$Pointer$.base| .cse3 v_ArrVal_1306) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_ArrVal_1310) .cse4))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_25|)))))) is different from false [2022-11-16 11:13:37,743 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) .cse2)) (.cse0 (+ |c_ULTIMATE.start_main_~i~0#1| 1))) (and (<= .cse0 |c_ULTIMATE.start_main_~len~0#1|) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_25| Int)) (or (forall ((v_ArrVal_1313 Int) (v_ArrVal_1308 (Array Int Int))) (= (select (store (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_1308) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_ArrVal_1313) .cse2) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) .cse2))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_25|))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_25| Int)) (or (forall ((v_ArrVal_1306 (Array Int Int)) (v_ArrVal_1310 Int)) (not (= |c_ULTIMATE.start_main_~s~0#1.base| (select (store (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_1306) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_ArrVal_1310) .cse2)))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_25|))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_25| Int)) (or (forall ((v_ArrVal_1306 (Array Int Int)) (v_ArrVal_1310 Int)) (= .cse1 (select (store (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_1306) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_ArrVal_1310) .cse2))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_25|))) (<= |c_ULTIMATE.start_main_~len~0#1| .cse0)))) is different from false [2022-11-16 11:13:37,794 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_sll_create_#res#1.offset| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_#res#1.base|) .cse1))) (and (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_25| Int)) (or (forall ((v_ArrVal_1306 (Array Int Int)) (v_ArrVal_1310 Int)) (not (= (select (store (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1306) |c_ULTIMATE.start_sll_create_#res#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_ArrVal_1310) .cse1) |c_ULTIMATE.start_sll_create_#res#1.base|))) (< |c_ULTIMATE.start_sll_create_#res#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_25|))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_25| Int)) (or (forall ((v_ArrVal_1306 (Array Int Int)) (v_ArrVal_1310 Int)) (= (select (store (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1306) |c_ULTIMATE.start_sll_create_#res#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_ArrVal_1310) .cse1) .cse0)) (< |c_ULTIMATE.start_sll_create_#res#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_25|))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_25| Int)) (or (forall ((v_ArrVal_1313 Int) (v_ArrVal_1308 (Array Int Int))) (= (select (store (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1308) |c_ULTIMATE.start_sll_create_#res#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_ArrVal_1313) .cse1) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_#res#1.base|) .cse1))) (< |c_ULTIMATE.start_sll_create_#res#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_25|)))))) is different from false [2022-11-16 11:13:38,339 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:13:38,340 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27 [2022-11-16 11:13:38,344 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 45 treesize of output 41 [2022-11-16 11:13:38,347 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 11:13:38,349 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 38 treesize of output 30 [2022-11-16 11:13:38,353 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 11:13:38,355 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 8 treesize of output 4 [2022-11-16 11:13:38,819 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2022-11-16 11:13:38,820 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [800059236] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 11:13:38,820 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 11:13:38,820 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 26, 26] total 73 [2022-11-16 11:13:38,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168417067] [2022-11-16 11:13:38,820 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 11:13:38,821 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 73 states [2022-11-16 11:13:38,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:13:38,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2022-11-16 11:13:38,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=244, Invalid=4236, Unknown=96, NotChecked=680, Total=5256 [2022-11-16 11:13:38,823 INFO L87 Difference]: Start difference. First operand 76 states and 81 transitions. Second operand has 73 states, 73 states have (on average 1.8082191780821917) internal successors, (132), 73 states have internal predecessors, (132), 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-16 11:13:42,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:13:42,314 INFO L93 Difference]: Finished difference Result 78 states and 82 transitions. [2022-11-16 11:13:42,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-11-16 11:13:42,314 INFO L78 Accepts]: Start accepts. Automaton has has 73 states, 73 states have (on average 1.8082191780821917) internal successors, (132), 73 states have internal predecessors, (132), 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 48 [2022-11-16 11:13:42,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:13:42,315 INFO L225 Difference]: With dead ends: 78 [2022-11-16 11:13:42,315 INFO L226 Difference]: Without dead ends: 78 [2022-11-16 11:13:42,318 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 50 SyntacticMatches, 6 SemanticMatches, 96 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 2307 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=663, Invalid=7806, Unknown=107, NotChecked=930, Total=9506 [2022-11-16 11:13:42,318 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 310 mSDsluCounter, 953 mSDsCounter, 0 mSdLazyCounter, 1340 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 310 SdHoareTripleChecker+Valid, 980 SdHoareTripleChecker+Invalid, 1818 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 1340 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 469 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-11-16 11:13:42,319 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [310 Valid, 980 Invalid, 1818 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 1340 Invalid, 0 Unknown, 469 Unchecked, 1.0s Time] [2022-11-16 11:13:42,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2022-11-16 11:13:42,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 76. [2022-11-16 11:13:42,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 69 states have (on average 1.1594202898550725) internal successors, (80), 75 states have internal predecessors, (80), 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-16 11:13:42,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 80 transitions. [2022-11-16 11:13:42,322 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 80 transitions. Word has length 48 [2022-11-16 11:13:42,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:13:42,322 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 80 transitions. [2022-11-16 11:13:42,322 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 73 states, 73 states have (on average 1.8082191780821917) internal successors, (132), 73 states have internal predecessors, (132), 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-16 11:13:42,322 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 80 transitions. [2022-11-16 11:13:42,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-11-16 11:13:42,323 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:13:42,323 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:13:42,330 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1477d683-49c0-4268-80c5-f632f093d93d/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-11-16 11:13:42,530 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1477d683-49c0-4268-80c5-f632f093d93d/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:13:42,530 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-11-16 11:13:42,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:13:42,531 INFO L85 PathProgramCache]: Analyzing trace with hash 1693462380, now seen corresponding path program 1 times [2022-11-16 11:13:42,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:13:42,531 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849079105] [2022-11-16 11:13:42,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:13:42,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:13:42,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:13:43,158 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 1 proven. 24 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-16 11:13:43,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:13:43,159 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849079105] [2022-11-16 11:13:43,159 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [849079105] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:13:43,159 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2106881521] [2022-11-16 11:13:43,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:13:43,159 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:13:43,159 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1477d683-49c0-4268-80c5-f632f093d93d/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:13:43,161 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1477d683-49c0-4268-80c5-f632f093d93d/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:13:43,193 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1477d683-49c0-4268-80c5-f632f093d93d/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-11-16 11:13:43,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:13:43,371 INFO L263 TraceCheckSpWp]: Trace formula consists of 382 conjuncts, 65 conjunts are in the unsatisfiable core [2022-11-16 11:13:43,374 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:13:43,773 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 15 treesize of output 11 [2022-11-16 11:13:44,089 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-16 11:13:44,193 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 10 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-16 11:13:44,193 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:13:44,331 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 36 treesize of output 32 [2022-11-16 11:13:44,359 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:13:44,361 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:13:44,541 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-11-16 11:13:44,542 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2106881521] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 11:13:44,542 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 11:13:44,542 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 18, 12] total 34 [2022-11-16 11:13:44,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583151947] [2022-11-16 11:13:44,542 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 11:13:44,543 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-11-16 11:13:44,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:13:44,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-11-16 11:13:44,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=999, Unknown=0, NotChecked=0, Total=1122 [2022-11-16 11:13:44,544 INFO L87 Difference]: Start difference. First operand 76 states and 80 transitions. Second operand has 34 states, 34 states have (on average 3.9411764705882355) internal successors, (134), 34 states have internal predecessors, (134), 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-16 11:13:45,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:13:45,859 INFO L93 Difference]: Finished difference Result 99 states and 104 transitions. [2022-11-16 11:13:45,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-16 11:13:45,861 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 3.9411764705882355) internal successors, (134), 34 states have internal predecessors, (134), 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 55 [2022-11-16 11:13:45,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:13:45,862 INFO L225 Difference]: With dead ends: 99 [2022-11-16 11:13:45,862 INFO L226 Difference]: Without dead ends: 99 [2022-11-16 11:13:45,863 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 89 SyntacticMatches, 2 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 519 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=463, Invalid=2189, Unknown=0, NotChecked=0, Total=2652 [2022-11-16 11:13:45,864 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 874 mSDsluCounter, 367 mSDsCounter, 0 mSdLazyCounter, 510 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 874 SdHoareTripleChecker+Valid, 406 SdHoareTripleChecker+Invalid, 535 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 510 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-16 11:13:45,864 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [874 Valid, 406 Invalid, 535 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 510 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-16 11:13:45,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2022-11-16 11:13:45,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 80. [2022-11-16 11:13:45,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 73 states have (on average 1.1506849315068493) internal successors, (84), 79 states have internal predecessors, (84), 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-16 11:13:45,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 84 transitions. [2022-11-16 11:13:45,867 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 84 transitions. Word has length 55 [2022-11-16 11:13:45,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:13:45,867 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 84 transitions. [2022-11-16 11:13:45,867 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 3.9411764705882355) internal successors, (134), 34 states have internal predecessors, (134), 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-16 11:13:45,868 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 84 transitions. [2022-11-16 11:13:45,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-11-16 11:13:45,868 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:13:45,868 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:13:45,874 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1477d683-49c0-4268-80c5-f632f093d93d/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-11-16 11:13:46,074 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1477d683-49c0-4268-80c5-f632f093d93d/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:13:46,075 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-11-16 11:13:46,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:13:46,075 INFO L85 PathProgramCache]: Analyzing trace with hash 261778123, now seen corresponding path program 2 times [2022-11-16 11:13:46,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:13:46,075 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354283667] [2022-11-16 11:13:46,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:13:46,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:13:46,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:13:46,279 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 10 proven. 12 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-11-16 11:13:46,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:13:46,280 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [354283667] [2022-11-16 11:13:46,280 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [354283667] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:13:46,280 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [712660314] [2022-11-16 11:13:46,280 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-16 11:13:46,281 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:13:46,281 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1477d683-49c0-4268-80c5-f632f093d93d/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:13:46,282 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1477d683-49c0-4268-80c5-f632f093d93d/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:13:46,311 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1477d683-49c0-4268-80c5-f632f093d93d/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-11-16 11:13:46,515 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-16 11:13:46,515 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 11:13:46,518 INFO L263 TraceCheckSpWp]: Trace formula consists of 397 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-16 11:13:46,519 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:13:46,621 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-11-16 11:13:46,621 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:13:46,728 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-11-16 11:13:46,728 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [712660314] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 11:13:46,729 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 11:13:46,729 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 7 [2022-11-16 11:13:46,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489510041] [2022-11-16 11:13:46,729 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 11:13:46,730 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-16 11:13:46,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:13:46,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-16 11:13:46,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-16 11:13:46,730 INFO L87 Difference]: Start difference. First operand 80 states and 84 transitions. Second operand has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 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-16 11:13:46,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:13:46,807 INFO L93 Difference]: Finished difference Result 71 states and 74 transitions. [2022-11-16 11:13:46,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-16 11:13:46,811 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 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 58 [2022-11-16 11:13:46,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:13:46,812 INFO L225 Difference]: With dead ends: 71 [2022-11-16 11:13:46,812 INFO L226 Difference]: Without dead ends: 71 [2022-11-16 11:13:46,812 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 112 SyntacticMatches, 4 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2022-11-16 11:13:46,813 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 99 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-16 11:13:46,813 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 138 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-16 11:13:46,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2022-11-16 11:13:46,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2022-11-16 11:13:46,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 65 states have (on average 1.1384615384615384) internal successors, (74), 70 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-16 11:13:46,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 74 transitions. [2022-11-16 11:13:46,816 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 74 transitions. Word has length 58 [2022-11-16 11:13:46,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:13:46,816 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 74 transitions. [2022-11-16 11:13:46,816 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 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-16 11:13:46,817 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 74 transitions. [2022-11-16 11:13:46,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-11-16 11:13:46,817 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:13:46,817 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:13:46,831 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1477d683-49c0-4268-80c5-f632f093d93d/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-11-16 11:13:47,023 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1477d683-49c0-4268-80c5-f632f093d93d/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2022-11-16 11:13:47,024 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-11-16 11:13:47,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:13:47,024 INFO L85 PathProgramCache]: Analyzing trace with hash 187254194, now seen corresponding path program 1 times [2022-11-16 11:13:47,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:13:47,030 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815618696] [2022-11-16 11:13:47,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:13:47,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:13:47,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:13:47,204 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2022-11-16 11:13:47,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:13:47,205 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815618696] [2022-11-16 11:13:47,205 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1815618696] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:13:47,205 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:13:47,205 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-16 11:13:47,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077643979] [2022-11-16 11:13:47,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:13:47,206 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-16 11:13:47,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:13:47,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-16 11:13:47,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-11-16 11:13:47,207 INFO L87 Difference]: Start difference. First operand 71 states and 74 transitions. Second operand has 9 states, 8 states have (on average 5.625) internal successors, (45), 9 states have internal predecessors, (45), 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-16 11:13:47,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:13:47,420 INFO L93 Difference]: Finished difference Result 82 states and 85 transitions. [2022-11-16 11:13:47,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-16 11:13:47,420 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.625) internal successors, (45), 9 states have internal predecessors, (45), 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 59 [2022-11-16 11:13:47,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:13:47,421 INFO L225 Difference]: With dead ends: 82 [2022-11-16 11:13:47,421 INFO L226 Difference]: Without dead ends: 82 [2022-11-16 11:13:47,421 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2022-11-16 11:13:47,422 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 226 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 226 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 11:13:47,422 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [226 Valid, 89 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 11:13:47,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2022-11-16 11:13:47,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 72. [2022-11-16 11:13:47,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 67 states have (on average 1.1492537313432836) internal successors, (77), 71 states have internal predecessors, (77), 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-16 11:13:47,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 77 transitions. [2022-11-16 11:13:47,425 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 77 transitions. Word has length 59 [2022-11-16 11:13:47,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:13:47,425 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 77 transitions. [2022-11-16 11:13:47,425 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.625) internal successors, (45), 9 states have internal predecessors, (45), 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-16 11:13:47,425 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 77 transitions. [2022-11-16 11:13:47,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-11-16 11:13:47,426 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:13:47,426 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:13:47,426 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-11-16 11:13:47,427 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-11-16 11:13:47,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:13:47,427 INFO L85 PathProgramCache]: Analyzing trace with hash 187254195, now seen corresponding path program 1 times [2022-11-16 11:13:47,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:13:47,427 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107462407] [2022-11-16 11:13:47,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:13:47,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:13:47,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:13:47,773 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-11-16 11:13:47,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:13:47,773 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107462407] [2022-11-16 11:13:47,773 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2107462407] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:13:47,773 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:13:47,773 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-16 11:13:47,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655488807] [2022-11-16 11:13:47,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:13:47,774 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-16 11:13:47,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:13:47,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-16 11:13:47,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-11-16 11:13:47,775 INFO L87 Difference]: Start difference. First operand 72 states and 77 transitions. Second operand has 9 states, 8 states have (on average 5.875) internal successors, (47), 9 states have internal predecessors, (47), 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-16 11:13:48,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:13:48,098 INFO L93 Difference]: Finished difference Result 80 states and 83 transitions. [2022-11-16 11:13:48,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-16 11:13:48,099 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.875) internal successors, (47), 9 states have internal predecessors, (47), 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 59 [2022-11-16 11:13:48,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:13:48,100 INFO L225 Difference]: With dead ends: 80 [2022-11-16 11:13:48,100 INFO L226 Difference]: Without dead ends: 80 [2022-11-16 11:13:48,100 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2022-11-16 11:13:48,101 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 290 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 290 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 11:13:48,101 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [290 Valid, 52 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 11:13:48,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-11-16 11:13:48,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 74. [2022-11-16 11:13:48,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 69 states have (on average 1.1304347826086956) internal successors, (78), 73 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-16 11:13:48,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 78 transitions. [2022-11-16 11:13:48,103 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 78 transitions. Word has length 59 [2022-11-16 11:13:48,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:13:48,104 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 78 transitions. [2022-11-16 11:13:48,104 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.875) internal successors, (47), 9 states have internal predecessors, (47), 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-16 11:13:48,104 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 78 transitions. [2022-11-16 11:13:48,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-11-16 11:13:48,104 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:13:48,104 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-11-16 11:13:48,105 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-11-16 11:13:48,105 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-11-16 11:13:48,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:13:48,105 INFO L85 PathProgramCache]: Analyzing trace with hash 1509911310, now seen corresponding path program 1 times [2022-11-16 11:13:48,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:13:48,105 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500619732] [2022-11-16 11:13:48,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:13:48,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:13:48,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:13:48,289 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-11-16 11:13:48,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:13:48,289 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500619732] [2022-11-16 11:13:48,289 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [500619732] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:13:48,289 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:13:48,290 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-16 11:13:48,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381865071] [2022-11-16 11:13:48,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:13:48,290 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-16 11:13:48,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:13:48,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-16 11:13:48,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-11-16 11:13:48,292 INFO L87 Difference]: Start difference. First operand 74 states and 78 transitions. Second operand has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 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-16 11:13:48,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:13:48,469 INFO L93 Difference]: Finished difference Result 77 states and 80 transitions. [2022-11-16 11:13:48,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-16 11:13:48,470 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 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 60 [2022-11-16 11:13:48,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:13:48,470 INFO L225 Difference]: With dead ends: 77 [2022-11-16 11:13:48,470 INFO L226 Difference]: Without dead ends: 77 [2022-11-16 11:13:48,471 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2022-11-16 11:13:48,471 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 272 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 272 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 11:13:48,471 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [272 Valid, 81 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 11:13:48,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2022-11-16 11:13:48,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 74. [2022-11-16 11:13:48,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 69 states have (on average 1.1159420289855073) internal successors, (77), 73 states have internal predecessors, (77), 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-16 11:13:48,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 77 transitions. [2022-11-16 11:13:48,473 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 77 transitions. Word has length 60 [2022-11-16 11:13:48,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:13:48,473 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 77 transitions. [2022-11-16 11:13:48,473 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 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-16 11:13:48,473 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 77 transitions. [2022-11-16 11:13:48,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-11-16 11:13:48,474 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:13:48,474 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1] [2022-11-16 11:13:48,474 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-11-16 11:13:48,474 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-11-16 11:13:48,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:13:48,475 INFO L85 PathProgramCache]: Analyzing trace with hash -672727665, now seen corresponding path program 1 times [2022-11-16 11:13:48,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:13:48,475 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578575822] [2022-11-16 11:13:48,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:13:48,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:13:48,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:13:48,667 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-11-16 11:13:48,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:13:48,668 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578575822] [2022-11-16 11:13:48,668 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [578575822] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:13:48,668 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:13:48,668 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-16 11:13:48,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576649312] [2022-11-16 11:13:48,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:13:48,669 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-16 11:13:48,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:13:48,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-16 11:13:48,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-11-16 11:13:48,670 INFO L87 Difference]: Start difference. First operand 74 states and 77 transitions. Second operand has 9 states, 8 states have (on average 6.25) internal successors, (50), 9 states have internal predecessors, (50), 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-16 11:13:48,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:13:48,869 INFO L93 Difference]: Finished difference Result 75 states and 78 transitions. [2022-11-16 11:13:48,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-16 11:13:48,870 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 6.25) internal successors, (50), 9 states have internal predecessors, (50), 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 62 [2022-11-16 11:13:48,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:13:48,870 INFO L225 Difference]: With dead ends: 75 [2022-11-16 11:13:48,870 INFO L226 Difference]: Without dead ends: 75 [2022-11-16 11:13:48,871 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2022-11-16 11:13:48,871 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 255 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 255 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 11:13:48,871 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [255 Valid, 65 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 11:13:48,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2022-11-16 11:13:48,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2022-11-16 11:13:48,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 70 states have (on average 1.1142857142857143) internal successors, (78), 74 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-16 11:13:48,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 78 transitions. [2022-11-16 11:13:48,873 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 78 transitions. Word has length 62 [2022-11-16 11:13:48,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:13:48,874 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 78 transitions. [2022-11-16 11:13:48,874 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 6.25) internal successors, (50), 9 states have internal predecessors, (50), 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-16 11:13:48,874 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 78 transitions. [2022-11-16 11:13:48,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-11-16 11:13:48,874 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:13:48,875 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1] [2022-11-16 11:13:48,875 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-11-16 11:13:48,875 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-11-16 11:13:48,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:13:48,875 INFO L85 PathProgramCache]: Analyzing trace with hash -912303337, now seen corresponding path program 1 times [2022-11-16 11:13:48,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:13:48,876 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246987972] [2022-11-16 11:13:48,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:13:48,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:13:48,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:13:50,270 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 4 proven. 13 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-11-16 11:13:50,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:13:50,270 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246987972] [2022-11-16 11:13:50,271 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1246987972] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:13:50,271 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1721229011] [2022-11-16 11:13:50,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:13:50,271 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:13:50,271 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1477d683-49c0-4268-80c5-f632f093d93d/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:13:50,272 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1477d683-49c0-4268-80c5-f632f093d93d/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:13:50,278 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1477d683-49c0-4268-80c5-f632f093d93d/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-11-16 11:13:50,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:13:50,501 INFO L263 TraceCheckSpWp]: Trace formula consists of 419 conjuncts, 83 conjunts are in the unsatisfiable core [2022-11-16 11:13:50,504 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:13:50,508 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-16 11:13:50,565 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-16 11:13:50,566 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 17 treesize of output 21 [2022-11-16 11:13:50,612 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 13 treesize of output 9 [2022-11-16 11:13:50,804 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 11:13:50,804 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 1 case distinctions, treesize of input 23 treesize of output 26 [2022-11-16 11:13:50,894 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:13:50,895 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 23 [2022-11-16 11:13:51,045 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:13:51,045 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 22 treesize of output 20 [2022-11-16 11:13:51,173 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 11:13:51,173 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 1 case distinctions, treesize of input 16 treesize of output 18 [2022-11-16 11:13:51,178 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 2 proven. 24 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-16 11:13:51,179 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:13:51,808 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1843 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_34| Int) (v_ArrVal_1845 Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_34|) (= (select (store |c_#valid| |c_ULTIMATE.start_main_~s~0#1.base| 0) (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_#t~mem10#1.base| v_ArrVal_1843) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_34| v_ArrVal_1845) 4)) 1))) is different from false [2022-11-16 11:13:52,647 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1843 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_34| Int) (v_ArrVal_1845 Int)) (or (< |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_34|) (= (select (store |c_#valid| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| 0) (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 4)) v_ArrVal_1843) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_34| v_ArrVal_1845) 4)) 1))) is different from false [2022-11-16 11:13:52,658 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:13:52,659 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2022-11-16 11:13:52,663 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 48 treesize of output 44 [2022-11-16 11:13:52,678 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:13:52,678 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 42 treesize of output 44 [2022-11-16 11:13:52,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 32 treesize of output 30 [2022-11-16 11:13:53,174 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 2 proven. 19 refuted. 0 times theorem prover too weak. 11 trivial. 1 not checked. [2022-11-16 11:13:53,175 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1721229011] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 11:13:53,175 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 11:13:53,175 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 23] total 45 [2022-11-16 11:13:53,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261672621] [2022-11-16 11:13:53,175 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 11:13:53,176 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2022-11-16 11:13:53,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:13:53,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2022-11-16 11:13:53,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=1678, Unknown=61, NotChecked=170, Total=2070 [2022-11-16 11:13:53,177 INFO L87 Difference]: Start difference. First operand 75 states and 78 transitions. Second operand has 46 states, 45 states have (on average 2.6444444444444444) internal successors, (119), 46 states have internal predecessors, (119), 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-16 11:13:59,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:13:59,197 INFO L93 Difference]: Finished difference Result 89 states and 92 transitions. [2022-11-16 11:13:59,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-11-16 11:13:59,198 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 45 states have (on average 2.6444444444444444) internal successors, (119), 46 states have internal predecessors, (119), 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 65 [2022-11-16 11:13:59,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:13:59,199 INFO L225 Difference]: With dead ends: 89 [2022-11-16 11:13:59,199 INFO L226 Difference]: Without dead ends: 89 [2022-11-16 11:13:59,201 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 107 SyntacticMatches, 5 SemanticMatches, 69 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 933 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=689, Invalid=3949, Unknown=62, NotChecked=270, Total=4970 [2022-11-16 11:13:59,201 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 480 mSDsluCounter, 419 mSDsCounter, 0 mSdLazyCounter, 631 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 480 SdHoareTripleChecker+Valid, 445 SdHoareTripleChecker+Invalid, 1104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 631 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 459 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-16 11:13:59,203 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [480 Valid, 445 Invalid, 1104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 631 Invalid, 0 Unknown, 459 Unchecked, 0.5s Time] [2022-11-16 11:13:59,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-11-16 11:13:59,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 78. [2022-11-16 11:13:59,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 73 states have (on average 1.1369863013698631) internal successors, (83), 77 states have internal predecessors, (83), 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-16 11:13:59,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 83 transitions. [2022-11-16 11:13:59,211 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 83 transitions. Word has length 65 [2022-11-16 11:13:59,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:13:59,212 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 83 transitions. [2022-11-16 11:13:59,212 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 45 states have (on average 2.6444444444444444) internal successors, (119), 46 states have internal predecessors, (119), 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-16 11:13:59,212 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 83 transitions. [2022-11-16 11:13:59,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-11-16 11:13:59,213 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:13:59,213 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1] [2022-11-16 11:13:59,219 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1477d683-49c0-4268-80c5-f632f093d93d/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-11-16 11:13:59,419 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1477d683-49c0-4268-80c5-f632f093d93d/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-11-16 11:13:59,419 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-11-16 11:13:59,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:13:59,420 INFO L85 PathProgramCache]: Analyzing trace with hash -912303336, now seen corresponding path program 1 times [2022-11-16 11:13:59,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:13:59,420 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442103687] [2022-11-16 11:13:59,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:13:59,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:13:59,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:14:01,602 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 2 proven. 17 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-11-16 11:14:01,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:14:01,602 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442103687] [2022-11-16 11:14:01,603 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [442103687] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:14:01,603 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [363575210] [2022-11-16 11:14:01,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:14:01,603 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:14:01,604 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1477d683-49c0-4268-80c5-f632f093d93d/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:14:01,605 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1477d683-49c0-4268-80c5-f632f093d93d/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:14:01,608 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1477d683-49c0-4268-80c5-f632f093d93d/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-11-16 11:14:01,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:14:01,862 INFO L263 TraceCheckSpWp]: Trace formula consists of 419 conjuncts, 102 conjunts are in the unsatisfiable core [2022-11-16 11:14:01,866 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:14:01,873 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-16 11:14:01,880 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-16 11:14:02,121 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-16 11:14:02,121 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 1 case distinctions, treesize of input 12 treesize of output 18 [2022-11-16 11:14:02,141 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-16 11:14:02,142 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 11 treesize of output 11 [2022-11-16 11:14:02,329 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 13 treesize of output 9 [2022-11-16 11:14:02,336 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-16 11:14:02,899 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 11:14:02,899 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 1 case distinctions, treesize of input 42 treesize of output 41 [2022-11-16 11:14:02,907 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:14:02,908 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 20 treesize of output 22 [2022-11-16 11:14:03,055 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:14:03,057 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 19 treesize of output 18 [2022-11-16 11:14:03,062 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:14:03,063 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-16 11:14:03,624 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:14:03,625 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 24 treesize of output 18 [2022-11-16 11:14:03,641 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:14:03,642 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 27 treesize of output 21 [2022-11-16 11:14:03,875 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 2 proven. 21 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-16 11:14:03,875 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:14:07,309 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (and (forall ((v_ArrVal_1961 (Array Int Int)) (v_ArrVal_1960 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_37| Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_37|) (forall ((v_ArrVal_1964 Int)) (let ((.cse0 (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_1960) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_37| v_ArrVal_1964))) (or (< (select .cse0 .cse1) 0) (forall ((v_ArrVal_1962 Int)) (<= (+ (select .cse0 4) 8) (select |c_#length| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_1961) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_37| v_ArrVal_1962) 4))))))))) (forall ((v_ArrVal_1960 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_37| Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_37|) (forall ((v_ArrVal_1964 Int)) (let ((.cse2 (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_1960) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_37| v_ArrVal_1964))) (or (< (select .cse2 .cse1) 0) (<= 0 (+ (select .cse2 4) 4))))))))) is different from false [2022-11-16 11:14:07,390 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (and (forall ((v_ArrVal_1960 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_37| Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_37|) (forall ((v_ArrVal_1964 Int)) (let ((.cse0 (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_update_at_#t~mem10#1.base| v_ArrVal_1960) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_37| v_ArrVal_1964))) (or (< (select .cse0 .cse1) 0) (<= 0 (+ (select .cse0 4) 4))))))) (forall ((v_ArrVal_1961 (Array Int Int)) (v_ArrVal_1960 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_37| Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_37|) (forall ((v_ArrVal_1964 Int)) (let ((.cse2 (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_update_at_#t~mem10#1.base| v_ArrVal_1960) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_37| v_ArrVal_1964))) (or (forall ((v_ArrVal_1962 Int)) (<= (+ (select .cse2 4) 8) (select |c_#length| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_#t~mem10#1.base| v_ArrVal_1961) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_37| v_ArrVal_1962) 4)))) (< (select .cse2 .cse1) 0)))))))) is different from false [2022-11-16 11:14:16,277 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:14:16,278 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 131 treesize of output 102 [2022-11-16 11:14:16,287 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:14:16,287 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 92 [2022-11-16 11:14:16,292 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 120 treesize of output 116 [2022-11-16 11:14:16,299 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 214 treesize of output 202 [2022-11-16 11:14:16,306 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 231 treesize of output 227 [2022-11-16 11:14:16,325 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:14:16,325 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 288 treesize of output 287 [2022-11-16 11:14:16,343 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:14:16,344 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 334 treesize of output 332 [2022-11-16 11:14:16,378 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:14:16,379 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 424 treesize of output 410 [2022-11-16 11:14:16,402 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:14:16,402 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 423 treesize of output 426 [2022-11-16 11:14:22,513 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 7 proven. 18 refuted. 0 times theorem prover too weak. 5 trivial. 3 not checked. [2022-11-16 11:14:22,513 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [363575210] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 11:14:22,513 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 11:14:22,513 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 25, 27] total 71 [2022-11-16 11:14:22,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287650209] [2022-11-16 11:14:22,514 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 11:14:22,514 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 72 states [2022-11-16 11:14:22,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:14:22,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2022-11-16 11:14:22,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=289, Invalid=4523, Unknown=26, NotChecked=274, Total=5112 [2022-11-16 11:14:22,516 INFO L87 Difference]: Start difference. First operand 78 states and 83 transitions. Second operand has 72 states, 71 states have (on average 2.3661971830985915) internal successors, (168), 72 states have internal predecessors, (168), 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-16 11:14:31,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:14:31,619 INFO L93 Difference]: Finished difference Result 90 states and 93 transitions. [2022-11-16 11:14:31,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-11-16 11:14:31,620 INFO L78 Accepts]: Start accepts. Automaton has has 72 states, 71 states have (on average 2.3661971830985915) internal successors, (168), 72 states have internal predecessors, (168), 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 65 [2022-11-16 11:14:31,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:14:31,621 INFO L225 Difference]: With dead ends: 90 [2022-11-16 11:14:31,621 INFO L226 Difference]: Without dead ends: 90 [2022-11-16 11:14:31,623 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 82 SyntacticMatches, 2 SemanticMatches, 98 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1935 ImplicationChecksByTransitivity, 22.2s TimeCoverageRelationStatistics Valid=1033, Invalid=8455, Unknown=26, NotChecked=386, Total=9900 [2022-11-16 11:14:31,623 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 391 mSDsluCounter, 810 mSDsCounter, 0 mSdLazyCounter, 1255 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 391 SdHoareTripleChecker+Valid, 841 SdHoareTripleChecker+Invalid, 1760 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 1255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 480 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-11-16 11:14:31,624 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [391 Valid, 841 Invalid, 1760 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 1255 Invalid, 0 Unknown, 480 Unchecked, 1.1s Time] [2022-11-16 11:14:31,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2022-11-16 11:14:31,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 80. [2022-11-16 11:14:31,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 75 states have (on average 1.12) internal successors, (84), 79 states have internal predecessors, (84), 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-16 11:14:31,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 84 transitions. [2022-11-16 11:14:31,626 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 84 transitions. Word has length 65 [2022-11-16 11:14:31,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:14:31,626 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 84 transitions. [2022-11-16 11:14:31,626 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 72 states, 71 states have (on average 2.3661971830985915) internal successors, (168), 72 states have internal predecessors, (168), 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-16 11:14:31,626 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 84 transitions. [2022-11-16 11:14:31,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-11-16 11:14:31,627 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:14:31,627 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1] [2022-11-16 11:14:31,638 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1477d683-49c0-4268-80c5-f632f093d93d/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-11-16 11:14:31,838 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1477d683-49c0-4268-80c5-f632f093d93d/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-11-16 11:14:31,838 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-11-16 11:14:31,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:14:31,839 INFO L85 PathProgramCache]: Analyzing trace with hash 1783366217, now seen corresponding path program 1 times [2022-11-16 11:14:31,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:14:31,839 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698718149] [2022-11-16 11:14:31,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:14:31,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:14:31,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:14:33,371 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 2 proven. 18 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-16 11:14:33,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:14:33,371 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698718149] [2022-11-16 11:14:33,371 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1698718149] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:14:33,371 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1342795273] [2022-11-16 11:14:33,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:14:33,372 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:14:33,372 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1477d683-49c0-4268-80c5-f632f093d93d/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:14:33,373 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1477d683-49c0-4268-80c5-f632f093d93d/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:14:33,375 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1477d683-49c0-4268-80c5-f632f093d93d/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-11-16 11:14:33,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:14:33,594 INFO L263 TraceCheckSpWp]: Trace formula consists of 424 conjuncts, 89 conjunts are in the unsatisfiable core [2022-11-16 11:14:33,598 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:14:34,170 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-16 11:14:34,972 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-16 11:14:34,973 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 1 case distinctions, treesize of input 55 treesize of output 56 [2022-11-16 11:14:34,979 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 11:14:34,980 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 30 [2022-11-16 11:14:35,424 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:14:35,425 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 72 treesize of output 59 [2022-11-16 11:14:36,360 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:14:36,360 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 70 treesize of output 56 [2022-11-16 11:14:37,243 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-16 11:14:37,243 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:14:39,562 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:14:39,562 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 25 [2022-11-16 11:14:39,567 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 41 treesize of output 37 [2022-11-16 11:14:39,583 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:14:39,584 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 48 treesize of output 50 [2022-11-16 11:14:39,591 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 48 treesize of output 46 [2022-11-16 11:14:40,662 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-11-16 11:14:40,663 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1342795273] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 11:14:40,663 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 11:14:40,663 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 72 [2022-11-16 11:14:40,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84046714] [2022-11-16 11:14:40,663 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 11:14:40,664 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 72 states [2022-11-16 11:14:40,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:14:40,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2022-11-16 11:14:40,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=280, Invalid=4821, Unknown=11, NotChecked=0, Total=5112 [2022-11-16 11:14:40,666 INFO L87 Difference]: Start difference. First operand 80 states and 84 transitions. Second operand has 72 states, 72 states have (on average 2.486111111111111) internal successors, (179), 72 states have internal predecessors, (179), 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-16 11:14:43,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:14:43,866 INFO L93 Difference]: Finished difference Result 132 states and 138 transitions. [2022-11-16 11:14:43,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2022-11-16 11:14:43,866 INFO L78 Accepts]: Start accepts. Automaton has has 72 states, 72 states have (on average 2.486111111111111) internal successors, (179), 72 states have internal predecessors, (179), 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 66 [2022-11-16 11:14:43,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:14:43,867 INFO L225 Difference]: With dead ends: 132 [2022-11-16 11:14:43,867 INFO L226 Difference]: Without dead ends: 132 [2022-11-16 11:14:43,868 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 96 SyntacticMatches, 2 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1913 ImplicationChecksByTransitivity, 8.9s TimeCoverageRelationStatistics Valid=537, Invalid=9957, Unknown=12, NotChecked=0, Total=10506 [2022-11-16 11:14:43,869 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 70 mSDsluCounter, 1049 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 1077 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 115 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 11:14:43,869 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 1077 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 58 Invalid, 0 Unknown, 115 Unchecked, 0.1s Time] [2022-11-16 11:14:43,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2022-11-16 11:14:43,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 80. [2022-11-16 11:14:43,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 75 states have (on average 1.1066666666666667) internal successors, (83), 79 states have internal predecessors, (83), 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-16 11:14:43,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 83 transitions. [2022-11-16 11:14:43,872 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 83 transitions. Word has length 66 [2022-11-16 11:14:43,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:14:43,872 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 83 transitions. [2022-11-16 11:14:43,873 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 72 states, 72 states have (on average 2.486111111111111) internal successors, (179), 72 states have internal predecessors, (179), 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-16 11:14:43,873 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 83 transitions. [2022-11-16 11:14:43,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-11-16 11:14:43,873 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:14:43,874 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-11-16 11:14:43,884 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1477d683-49c0-4268-80c5-f632f093d93d/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2022-11-16 11:14:44,079 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1477d683-49c0-4268-80c5-f632f093d93d/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:14:44,080 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-11-16 11:14:44,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:14:44,080 INFO L85 PathProgramCache]: Analyzing trace with hash 124432906, now seen corresponding path program 1 times [2022-11-16 11:14:44,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:14:44,080 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009599421] [2022-11-16 11:14:44,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:14:44,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:14:44,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:14:45,453 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 2 proven. 20 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-11-16 11:14:45,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:14:45,454 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1009599421] [2022-11-16 11:14:45,454 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1009599421] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:14:45,454 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [858849989] [2022-11-16 11:14:45,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:14:45,454 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:14:45,454 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1477d683-49c0-4268-80c5-f632f093d93d/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:14:45,456 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1477d683-49c0-4268-80c5-f632f093d93d/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:14:45,458 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1477d683-49c0-4268-80c5-f632f093d93d/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-11-16 11:14:45,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:14:45,704 INFO L263 TraceCheckSpWp]: Trace formula consists of 433 conjuncts, 75 conjunts are in the unsatisfiable core [2022-11-16 11:14:45,707 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:14:45,711 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-16 11:14:45,803 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-16 11:14:45,803 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 11 treesize of output 11 [2022-11-16 11:14:45,857 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-16 11:14:46,087 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 11:14:46,087 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 1 case distinctions, treesize of input 28 treesize of output 29 [2022-11-16 11:14:46,192 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:14:46,193 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-16 11:14:46,401 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:14:46,401 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 27 treesize of output 21 [2022-11-16 11:14:46,509 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 2 proven. 22 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-16 11:14:46,510 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:14:47,045 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_43| Int) (v_ArrVal_2189 (Array Int Int)) (v_ArrVal_2191 Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_43|) (< (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_2189) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_43| v_ArrVal_2191) 4) |c_#StackHeapBarrier|))) is different from false [2022-11-16 11:14:47,234 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_43| Int) (v_ArrVal_2189 (Array Int Int)) (v_ArrVal_2191 Int)) (or (< (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|) (+ |c_ULTIMATE.start_sll_update_at_~head#1.offset| 4)) v_ArrVal_2189) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_43| v_ArrVal_2191) 4) |c_#StackHeapBarrier|) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_43|))) is different from false [2022-11-16 11:14:47,254 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_43| Int) (v_ArrVal_2189 (Array Int Int)) (v_ArrVal_2191 Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_43|) (< (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) v_ArrVal_2189) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_43| v_ArrVal_2191) 4) |c_#StackHeapBarrier|))) is different from false [2022-11-16 11:14:47,266 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_43| Int) (v_ArrVal_2189 (Array Int Int)) (v_ArrVal_2191 Int)) (or (< |c_ULTIMATE.start_sll_create_#res#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_43|) (< (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_#res#1.base|) (+ |c_ULTIMATE.start_sll_create_#res#1.offset| 4)) v_ArrVal_2189) |c_ULTIMATE.start_sll_create_#res#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_43| v_ArrVal_2191) 4) |c_#StackHeapBarrier|))) is different from false [2022-11-16 11:14:47,280 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_43| Int) (v_ArrVal_2189 (Array Int Int)) (v_ArrVal_2191 Int)) (or (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_43|) (< (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) (+ 4 |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) v_ArrVal_2189) |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_43| v_ArrVal_2191) 4) |c_#StackHeapBarrier|))) is different from false [2022-11-16 11:14:47,309 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_43| Int) (v_ArrVal_2189 (Array Int Int)) (v_ArrVal_2191 Int)) (or (< (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 4)) v_ArrVal_2189) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_43| v_ArrVal_2191) 4) |c_#StackHeapBarrier|) (< |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_43|))) is different from false [2022-11-16 11:14:47,319 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:14:47,319 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2022-11-16 11:14:47,324 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 38 treesize of output 34 [2022-11-16 11:14:47,339 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:14:47,339 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 32 treesize of output 34 [2022-11-16 11:14:47,347 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 22 treesize of output 20 [2022-11-16 11:14:47,775 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 11 trivial. 9 not checked. [2022-11-16 11:14:47,775 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [858849989] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 11:14:47,775 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 11:14:47,776 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22, 23] total 46 [2022-11-16 11:14:47,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280426768] [2022-11-16 11:14:47,776 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 11:14:47,776 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2022-11-16 11:14:47,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:14:47,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2022-11-16 11:14:47,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=1498, Unknown=16, NotChecked=498, Total=2162 [2022-11-16 11:14:47,778 INFO L87 Difference]: Start difference. First operand 80 states and 83 transitions. Second operand has 47 states, 46 states have (on average 3.0) internal successors, (138), 47 states have internal predecessors, (138), 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-16 11:14:50,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:14:50,157 INFO L93 Difference]: Finished difference Result 88 states and 91 transitions. [2022-11-16 11:14:50,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-11-16 11:14:50,158 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 46 states have (on average 3.0) internal successors, (138), 47 states have internal predecessors, (138), 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 68 [2022-11-16 11:14:50,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:14:50,158 INFO L225 Difference]: With dead ends: 88 [2022-11-16 11:14:50,159 INFO L226 Difference]: Without dead ends: 88 [2022-11-16 11:14:50,159 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 106 SyntacticMatches, 12 SemanticMatches, 66 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 660 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=456, Invalid=3334, Unknown=16, NotChecked=750, Total=4556 [2022-11-16 11:14:50,160 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 199 mSDsluCounter, 625 mSDsCounter, 0 mSdLazyCounter, 805 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 657 SdHoareTripleChecker+Invalid, 1515 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 805 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 693 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-16 11:14:50,160 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [199 Valid, 657 Invalid, 1515 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 805 Invalid, 0 Unknown, 693 Unchecked, 0.7s Time] [2022-11-16 11:14:50,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2022-11-16 11:14:50,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 81. [2022-11-16 11:14:50,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 76 states have (on average 1.105263157894737) internal successors, (84), 80 states have internal predecessors, (84), 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-16 11:14:50,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 84 transitions. [2022-11-16 11:14:50,163 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 84 transitions. Word has length 68 [2022-11-16 11:14:50,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:14:50,163 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 84 transitions. [2022-11-16 11:14:50,163 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 46 states have (on average 3.0) internal successors, (138), 47 states have internal predecessors, (138), 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-16 11:14:50,163 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 84 transitions. [2022-11-16 11:14:50,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-11-16 11:14:50,164 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:14:50,164 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:14:50,178 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1477d683-49c0-4268-80c5-f632f093d93d/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-11-16 11:14:50,370 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1477d683-49c0-4268-80c5-f632f093d93d/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:14:50,371 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-11-16 11:14:50,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:14:50,371 INFO L85 PathProgramCache]: Analyzing trace with hash 424087740, now seen corresponding path program 2 times [2022-11-16 11:14:50,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:14:50,371 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002702969] [2022-11-16 11:14:50,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:14:50,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:14:50,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:14:53,883 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 2 proven. 30 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-16 11:14:53,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:14:53,884 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002702969] [2022-11-16 11:14:53,884 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1002702969] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:14:53,884 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1180806192] [2022-11-16 11:14:53,884 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-16 11:14:53,884 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:14:53,884 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1477d683-49c0-4268-80c5-f632f093d93d/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:14:53,885 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1477d683-49c0-4268-80c5-f632f093d93d/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:14:53,888 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1477d683-49c0-4268-80c5-f632f093d93d/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-11-16 11:14:54,123 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-16 11:14:54,123 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 11:14:54,127 INFO L263 TraceCheckSpWp]: Trace formula consists of 443 conjuncts, 138 conjunts are in the unsatisfiable core [2022-11-16 11:14:54,132 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:14:54,144 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-16 11:14:54,216 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 13 treesize of output 9 [2022-11-16 11:14:54,224 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 13 treesize of output 9 [2022-11-16 11:14:54,244 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:14:54,245 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 21 treesize of output 20 [2022-11-16 11:14:54,252 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:14:54,253 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 21 treesize of output 20 [2022-11-16 11:14:54,354 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 11:14:54,355 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2022-11-16 11:14:54,362 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 11:14:54,363 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2022-11-16 11:14:54,429 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-16 11:14:54,429 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 11 treesize of output 11 [2022-11-16 11:14:54,459 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 16 [2022-11-16 11:14:54,466 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 16 [2022-11-16 11:14:54,482 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 16 [2022-11-16 11:14:54,490 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 16 [2022-11-16 11:14:54,550 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 21 treesize of output 20 [2022-11-16 11:14:54,554 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 27 treesize of output 26 [2022-11-16 11:14:55,220 INFO L321 Elim1Store]: treesize reduction 98, result has 41.0 percent of original size [2022-11-16 11:14:55,221 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 89 treesize of output 118 [2022-11-16 11:14:55,294 INFO L321 Elim1Store]: treesize reduction 52, result has 52.7 percent of original size [2022-11-16 11:14:55,295 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 99 treesize of output 123 [2022-11-16 11:14:56,090 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:14:56,108 INFO L321 Elim1Store]: treesize reduction 56, result has 1.8 percent of original size [2022-11-16 11:14:56,109 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 134 treesize of output 121 [2022-11-16 11:14:56,164 INFO L321 Elim1Store]: treesize reduction 40, result has 54.0 percent of original size [2022-11-16 11:14:56,165 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 129 treesize of output 158 [2022-11-16 11:14:56,298 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 7 treesize of output 3 [2022-11-16 11:14:56,312 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-16 11:14:56,312 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 13 treesize of output 11 [2022-11-16 11:14:56,427 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 7 treesize of output 3 [2022-11-16 11:14:58,537 INFO L321 Elim1Store]: treesize reduction 21, result has 27.6 percent of original size [2022-11-16 11:14:58,537 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 57 treesize of output 38 [2022-11-16 11:14:58,549 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:14:58,549 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 17 treesize of output 15 [2022-11-16 11:14:58,607 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 2 proven. 28 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-11-16 11:14:58,607 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:15:11,859 INFO L321 Elim1Store]: treesize reduction 10, result has 66.7 percent of original size [2022-11-16 11:15:11,859 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 246 treesize of output 193 [2022-11-16 11:15:11,868 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 286 treesize of output 274 [2022-11-16 11:15:12,202 INFO L321 Elim1Store]: treesize reduction 10, result has 66.7 percent of original size [2022-11-16 11:15:12,202 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 194 treesize of output 189 [2022-11-16 11:15:12,342 INFO L321 Elim1Store]: treesize reduction 10, result has 66.7 percent of original size [2022-11-16 11:15:12,343 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 254 treesize of output 217 [2022-11-16 11:15:15,961 WARN L855 $PredicateComparison]: unable to prove that (or (let ((.cse1 (+ 4 |c_ULTIMATE.start_node_create_~temp~0#1.offset|)) (.cse37 (= |c_ULTIMATE.start_node_create_~temp~0#1.offset| 0))) (let ((.cse0 (not .cse37)) (.cse14 (forall ((v_arrayElimArr_12 (Array Int Int))) (or (forall ((v_arrayElimArr_11 (Array Int Int))) (or (forall ((v_ArrVal_2325 (Array Int Int)) (v_ArrVal_2322 Int) (v_ArrVal_2324 Int) (v_arrayElimCell_137 Int)) (let ((.cse87 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_12)) (.cse85 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_11))) (let ((.cse86 (select .cse85 |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (.cse88 (select .cse87 |c_ULTIMATE.start_sll_create_~head~0#1.base|))) (or (= (select (select (store (store .cse85 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store .cse86 |c_ULTIMATE.start_sll_create_~head~0#1.offset| v_ArrVal_2324)) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2325) (select (select (store .cse87 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store .cse88 |c_ULTIMATE.start_sll_create_~head~0#1.offset| v_ArrVal_2322)) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4)) 4) 0) (= (select (select (store (store .cse85 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store .cse86 v_arrayElimCell_137 v_ArrVal_2324)) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2325) (select (select (store .cse87 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store .cse88 v_arrayElimCell_137 v_ArrVal_2322)) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4)) 4) 0))))) (not (= (select v_arrayElimArr_11 .cse1) |c_ULTIMATE.start_sll_create_~head~0#1.offset|)))) (not (= (select v_arrayElimArr_12 .cse1) |c_ULTIMATE.start_sll_create_~head~0#1.base|))))) (.cse17 (forall ((v_arrayElimArr_12 (Array Int Int))) (or (forall ((v_arrayElimArr_11 (Array Int Int))) (or (forall ((v_ArrVal_2325 (Array Int Int)) (v_ArrVal_2322 Int) (v_ArrVal_2324 Int)) (= (select (select (store (let ((.cse83 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_11))) (store .cse83 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse83 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |c_ULTIMATE.start_sll_create_~head~0#1.offset| v_ArrVal_2324))) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2325) (select (select (let ((.cse84 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_12))) (store .cse84 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse84 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |c_ULTIMATE.start_sll_create_~head~0#1.offset| v_ArrVal_2322))) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4)) 4) 0)) (not (= (select v_arrayElimArr_11 .cse1) |c_ULTIMATE.start_sll_create_~head~0#1.offset|)))) (not (= (select v_arrayElimArr_12 .cse1) |c_ULTIMATE.start_sll_create_~head~0#1.base|)))))) (and (or .cse0 (and (forall ((v_arrayElimArr_12 (Array Int Int))) (or (not (= (select v_arrayElimArr_12 .cse1) |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (forall ((v_arrayElimArr_11 (Array Int Int)) (v_arrayElimCell_138 Int)) (or (forall ((v_ArrVal_2325 (Array Int Int)) (v_ArrVal_2322 Int) (v_ArrVal_2324 Int)) (let ((.cse2 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_11)) (.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_12))) (or (= (select (select (store (store .cse2 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse2 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |c_ULTIMATE.start_sll_create_~head~0#1.offset| v_ArrVal_2324)) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2325) (select (select (store .cse3 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse3 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |c_ULTIMATE.start_sll_create_~head~0#1.offset| v_ArrVal_2322)) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4)) 4) 0) (= (select (let ((.cse4 (select v_arrayElimArr_11 4))) (select (store (store .cse2 v_arrayElimCell_138 (store (select .cse2 v_arrayElimCell_138) .cse4 v_ArrVal_2324)) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2325) (select (select (store .cse3 v_arrayElimCell_138 (store (select .cse3 v_arrayElimCell_138) .cse4 v_ArrVal_2322)) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4))) 4) 0)))) (not (= (select v_arrayElimArr_11 .cse1) |c_ULTIMATE.start_sll_create_~head~0#1.offset|)))))) (forall ((v_arrayElimArr_12 (Array Int Int))) (or (not (= (select v_arrayElimArr_12 .cse1) |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (forall ((v_arrayElimArr_11 (Array Int Int)) (v_arrayElimCell_138 Int)) (or (forall ((v_ArrVal_2325 (Array Int Int)) (v_ArrVal_2322 Int) (v_ArrVal_2324 Int) (v_arrayElimCell_137 Int)) (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_12)) (.cse5 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_11))) (let ((.cse6 (select .cse5 v_arrayElimCell_138)) (.cse8 (select .cse7 v_arrayElimCell_138)) (.cse9 (select .cse5 |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (.cse10 (select .cse7 |c_ULTIMATE.start_sll_create_~head~0#1.base|))) (or (= (select (select (store (store .cse5 v_arrayElimCell_138 (store .cse6 |c_ULTIMATE.start_sll_create_~head~0#1.offset| v_ArrVal_2324)) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2325) (select (select (store .cse7 v_arrayElimCell_138 (store .cse8 |c_ULTIMATE.start_sll_create_~head~0#1.offset| v_ArrVal_2322)) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4)) 4) 0) (= (select (select (store (store .cse5 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store .cse9 |c_ULTIMATE.start_sll_create_~head~0#1.offset| v_ArrVal_2324)) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2325) (select (select (store .cse7 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store .cse10 |c_ULTIMATE.start_sll_create_~head~0#1.offset| v_ArrVal_2322)) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4)) 4) 0) (= (select (select (store (store .cse5 v_arrayElimCell_138 (store .cse6 v_arrayElimCell_137 v_ArrVal_2324)) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2325) (select (select (store .cse7 v_arrayElimCell_138 (store .cse8 v_arrayElimCell_137 v_ArrVal_2322)) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4)) 4) 0) (= (select (select (store (store .cse5 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store .cse9 v_arrayElimCell_137 v_ArrVal_2324)) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2325) (select (select (store .cse7 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store .cse10 v_arrayElimCell_137 v_ArrVal_2322)) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4)) 4) 0))))) (not (= (select v_arrayElimArr_11 .cse1) |c_ULTIMATE.start_sll_create_~head~0#1.offset|)))))) (forall ((v_arrayElimArr_12 (Array Int Int))) (or (not (= (select v_arrayElimArr_12 .cse1) |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (forall ((v_arrayElimArr_11 (Array Int Int)) (v_ArrVal_2325 (Array Int Int)) (v_ArrVal_2322 Int) (v_ArrVal_2324 Int) (v_arrayElimCell_138 Int)) (let ((.cse11 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_11)) (.cse12 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_12))) (or (= (select (select (store (store .cse11 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse11 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |c_ULTIMATE.start_sll_create_~head~0#1.offset| v_ArrVal_2324)) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2325) (select (select (store .cse12 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse12 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |c_ULTIMATE.start_sll_create_~head~0#1.offset| v_ArrVal_2322)) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4)) 4) 0) (not (= (select v_arrayElimArr_11 .cse1) |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) (= (select (let ((.cse13 (select v_arrayElimArr_11 4))) (select (store (store .cse11 v_arrayElimCell_138 (store (select .cse11 v_arrayElimCell_138) .cse13 v_ArrVal_2324)) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2325) (select (select (store .cse12 v_arrayElimCell_138 (store (select .cse12 v_arrayElimCell_138) .cse13 v_ArrVal_2322)) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4))) 4) 0)))))) .cse14 (forall ((v_arrayElimArr_12 (Array Int Int))) (or (forall ((v_arrayElimArr_11 (Array Int Int)) (v_ArrVal_2325 (Array Int Int)) (v_ArrVal_2322 Int) (v_ArrVal_2324 Int)) (or (= (select (select (store (let ((.cse15 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_11))) (store .cse15 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse15 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |c_ULTIMATE.start_sll_create_~head~0#1.offset| v_ArrVal_2324))) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2325) (select (select (let ((.cse16 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_12))) (store .cse16 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse16 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |c_ULTIMATE.start_sll_create_~head~0#1.offset| v_ArrVal_2322))) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4)) 4) 0) (not (= (select v_arrayElimArr_11 .cse1) |c_ULTIMATE.start_sll_create_~head~0#1.offset|)))) (not (= (select v_arrayElimArr_12 .cse1) |c_ULTIMATE.start_sll_create_~head~0#1.base|)))) .cse17 (forall ((v_arrayElimArr_12 (Array Int Int))) (or (not (= (select v_arrayElimArr_12 .cse1) |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (forall ((v_arrayElimArr_11 (Array Int Int)) (v_arrayElimCell_138 Int)) (or (not (= (select v_arrayElimArr_11 .cse1) |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) (forall ((v_ArrVal_2325 (Array Int Int)) (v_ArrVal_2322 Int) (v_ArrVal_2324 Int) (v_arrayElimCell_137 Int)) (let ((.cse20 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_12)) (.cse18 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_11))) (let ((.cse19 (select .cse18 |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (.cse21 (select .cse20 |c_ULTIMATE.start_sll_create_~head~0#1.base|))) (or (= (select (select (store (store .cse18 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store .cse19 |c_ULTIMATE.start_sll_create_~head~0#1.offset| v_ArrVal_2324)) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2325) (select (select (store .cse20 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store .cse21 |c_ULTIMATE.start_sll_create_~head~0#1.offset| v_ArrVal_2322)) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4)) 4) 0) (= (select (select (store (store .cse18 v_arrayElimCell_138 (store (select .cse18 v_arrayElimCell_138) v_arrayElimCell_137 v_ArrVal_2324)) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2325) (select (select (store .cse20 v_arrayElimCell_138 (store (select .cse20 v_arrayElimCell_138) v_arrayElimCell_137 v_ArrVal_2322)) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4)) 4) 0) (= (select (select (store (store .cse18 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store .cse19 v_arrayElimCell_137 v_ArrVal_2324)) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2325) (select (select (store .cse20 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store .cse21 v_arrayElimCell_137 v_ArrVal_2322)) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4)) 4) 0))))))))))) (forall ((v_arrayElimArr_10 (Array Int Int))) (or (forall ((v_ArrVal_2322 Int) (v_ArrVal_2326 Int)) (let ((.cse24 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_10))) (let ((.cse25 (select .cse24 |c_ULTIMATE.start_sll_create_~head~0#1.base|))) (or (forall ((v_arrayElimCell_136 Int)) (or (= (select (let ((.cse22 (store .cse24 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store .cse25 v_arrayElimCell_136 v_ArrVal_2322)))) (let ((.cse23 (select .cse22 |c_ULTIMATE.start_node_create_~temp~0#1.base|))) (select (store .cse22 |c_ULTIMATE.start_node_create_~temp~0#1.base| (store .cse23 0 v_ArrVal_2326)) (select .cse23 4)))) 4) 0) (= (select (let ((.cse26 (let ((.cse28 (select v_arrayElimArr_10 4))) (store .cse24 .cse28 (store (select .cse24 .cse28) v_arrayElimCell_136 v_ArrVal_2322))))) (let ((.cse27 (select .cse26 |c_ULTIMATE.start_node_create_~temp~0#1.base|))) (select (store .cse26 |c_ULTIMATE.start_node_create_~temp~0#1.base| (store .cse27 0 v_ArrVal_2326)) (select .cse27 4)))) 4) 0))) (= (select (let ((.cse29 (store .cse24 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store .cse25 |c_ULTIMATE.start_sll_create_~head~0#1.offset| v_ArrVal_2322)))) (let ((.cse30 (select .cse29 |c_ULTIMATE.start_node_create_~temp~0#1.base|))) (select (store .cse29 |c_ULTIMATE.start_node_create_~temp~0#1.base| (store .cse30 0 v_ArrVal_2326)) (select .cse30 4)))) 4) 0))))) (not (= (select v_arrayElimArr_10 .cse1) |c_ULTIMATE.start_sll_create_~head~0#1.base|)))) (or (forall ((v_arrayElimArr_10 (Array Int Int)) (v_ArrVal_2322 Int) (v_ArrVal_2326 Int) (v_arrayElimCell_136 Int)) (let ((.cse33 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_10))) (or (= (select (let ((.cse31 (store .cse33 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse33 |c_ULTIMATE.start_sll_create_~head~0#1.base|) v_arrayElimCell_136 v_ArrVal_2322)))) (let ((.cse32 (select .cse31 |c_ULTIMATE.start_node_create_~temp~0#1.base|))) (select (store .cse31 |c_ULTIMATE.start_node_create_~temp~0#1.base| (store .cse32 0 v_ArrVal_2326)) (select .cse32 4)))) 4) 0) (= (select (let ((.cse34 (let ((.cse36 (select v_arrayElimArr_10 4))) (store .cse33 .cse36 (store (select .cse33 .cse36) v_arrayElimCell_136 v_ArrVal_2322))))) (let ((.cse35 (select .cse34 |c_ULTIMATE.start_node_create_~temp~0#1.base|))) (select (store .cse34 |c_ULTIMATE.start_node_create_~temp~0#1.base| (store .cse35 0 v_ArrVal_2326)) (select .cse35 4)))) 4) 0) (not (= (select v_arrayElimArr_10 .cse1) |c_ULTIMATE.start_sll_create_~head~0#1.base|))))) .cse37) (or .cse0 (and (forall ((v_arrayElimArr_10 (Array Int Int))) (or (forall ((v_ArrVal_2322 Int) (v_arrayElimCell_135 Int) (v_ArrVal_2326 Int)) (let ((.cse40 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_10))) (let ((.cse41 (select .cse40 |c_ULTIMATE.start_sll_create_~head~0#1.base|))) (or (= (select (let ((.cse38 (store .cse40 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store .cse41 |c_ULTIMATE.start_sll_create_~head~0#1.offset| v_ArrVal_2322)))) (let ((.cse39 (select .cse38 |c_ULTIMATE.start_node_create_~temp~0#1.base|))) (select (store .cse38 |c_ULTIMATE.start_node_create_~temp~0#1.base| (store .cse39 0 v_ArrVal_2326)) (select .cse39 4)))) 4) 0) (forall ((v_arrayElimCell_136 Int)) (or (= (select (let ((.cse42 (store .cse40 v_arrayElimCell_135 (store (select .cse40 v_arrayElimCell_135) v_arrayElimCell_136 v_ArrVal_2322)))) (let ((.cse43 (select .cse42 |c_ULTIMATE.start_node_create_~temp~0#1.base|))) (select (store .cse42 |c_ULTIMATE.start_node_create_~temp~0#1.base| (store .cse43 0 v_ArrVal_2326)) (select .cse43 4)))) 4) 0) (= (select (let ((.cse44 (store .cse40 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store .cse41 v_arrayElimCell_136 v_ArrVal_2322)))) (let ((.cse45 (select .cse44 |c_ULTIMATE.start_node_create_~temp~0#1.base|))) (select (store .cse44 |c_ULTIMATE.start_node_create_~temp~0#1.base| (store .cse45 0 v_ArrVal_2326)) (select .cse45 4)))) 4) 0))))))) (not (= (select v_arrayElimArr_10 .cse1) |c_ULTIMATE.start_sll_create_~head~0#1.base|)))) (forall ((v_arrayElimArr_10 (Array Int Int))) (or (forall ((v_ArrVal_2322 Int) (v_ArrVal_2326 Int)) (= (select (let ((.cse46 (let ((.cse48 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_10))) (store .cse48 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse48 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |c_ULTIMATE.start_sll_create_~head~0#1.offset| v_ArrVal_2322))))) (let ((.cse47 (select .cse46 |c_ULTIMATE.start_node_create_~temp~0#1.base|))) (select (store .cse46 |c_ULTIMATE.start_node_create_~temp~0#1.base| (store .cse47 0 v_ArrVal_2326)) (select .cse47 4)))) 4) 0)) (not (= (select v_arrayElimArr_10 .cse1) |c_ULTIMATE.start_sll_create_~head~0#1.base|)))))) (or .cse37 (forall ((v_arrayElimArr_11 (Array Int Int)) (v_arrayElimArr_12 (Array Int Int)) (v_ArrVal_2325 (Array Int Int)) (v_ArrVal_2322 Int) (v_ArrVal_2324 Int)) (or (= (select (let ((.cse50 (select v_arrayElimArr_12 4)) (.cse51 (select v_arrayElimArr_11 4))) (select (store (let ((.cse49 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_11))) (store .cse49 .cse50 (store (select .cse49 .cse50) .cse51 v_ArrVal_2324))) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2325) (select (select (let ((.cse52 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_12))) (store .cse52 .cse50 (store (select .cse52 .cse50) .cse51 v_ArrVal_2322))) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4))) 4) 0) (not (= (select v_arrayElimArr_11 .cse1) |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) (not (= (select v_arrayElimArr_12 .cse1) |c_ULTIMATE.start_sll_create_~head~0#1.base|))))) (or .cse0 (forall ((v_arrayElimArr_10 (Array Int Int)) (v_ArrVal_2322 Int) (v_ArrVal_2326 Int)) (or (= (select (let ((.cse53 (let ((.cse55 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_10))) (store .cse55 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse55 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |c_ULTIMATE.start_sll_create_~head~0#1.offset| v_ArrVal_2322))))) (let ((.cse54 (select .cse53 |c_ULTIMATE.start_node_create_~temp~0#1.base|))) (select (store .cse53 |c_ULTIMATE.start_node_create_~temp~0#1.base| (store .cse54 0 v_ArrVal_2326)) (select .cse54 4)))) 4) 0) (not (= (select v_arrayElimArr_10 .cse1) |c_ULTIMATE.start_sll_create_~head~0#1.base|))))) (forall ((v_arrayElimArr_12 (Array Int Int))) (or (forall ((v_arrayElimArr_11 (Array Int Int))) (or (forall ((v_ArrVal_2325 (Array Int Int)) (v_ArrVal_2322 Int) (v_ArrVal_2324 Int)) (let ((.cse59 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_12)) (.cse56 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_11)) (.cse61 (select v_arrayElimArr_12 4))) (let ((.cse62 (select .cse56 .cse61)) (.cse63 (select .cse59 .cse61)) (.cse58 (select v_arrayElimArr_11 4)) (.cse57 (select .cse56 |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (.cse60 (select .cse59 |c_ULTIMATE.start_sll_create_~head~0#1.base|))) (or (= (select (select (store (store .cse56 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store .cse57 .cse58 v_ArrVal_2324)) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2325) (select (select (store .cse59 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store .cse60 .cse58 v_ArrVal_2322)) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4)) 4) 0) (= (select (select (store (store .cse56 .cse61 (store .cse62 |c_ULTIMATE.start_sll_create_~head~0#1.offset| v_ArrVal_2324)) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2325) (select (select (store .cse59 .cse61 (store .cse63 |c_ULTIMATE.start_sll_create_~head~0#1.offset| v_ArrVal_2322)) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4)) 4) 0) (= (select (select (store (store .cse56 .cse61 (store .cse62 .cse58 v_ArrVal_2324)) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2325) (select (select (store .cse59 .cse61 (store .cse63 .cse58 v_ArrVal_2322)) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4)) 4) 0) (= (select (select (store (store .cse56 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store .cse57 |c_ULTIMATE.start_sll_create_~head~0#1.offset| v_ArrVal_2324)) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2325) (select (select (store .cse59 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store .cse60 |c_ULTIMATE.start_sll_create_~head~0#1.offset| v_ArrVal_2322)) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4)) 4) 0))))) (not (= (select v_arrayElimArr_11 .cse1) |c_ULTIMATE.start_sll_create_~head~0#1.offset|)))) (not (= (select v_arrayElimArr_12 .cse1) |c_ULTIMATE.start_sll_create_~head~0#1.base|)))) (or .cse37 (forall ((v_arrayElimArr_11 (Array Int Int)) (v_arrayElimArr_12 (Array Int Int)) (v_ArrVal_2325 (Array Int Int)) (v_ArrVal_2322 Int) (v_ArrVal_2324 Int)) (let ((.cse64 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_11)) (.cse66 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_12)) (.cse65 (select v_arrayElimArr_11 4))) (or (= (select (select (store (store .cse64 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse64 |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse65 v_ArrVal_2324)) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2325) (select (select (store .cse66 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse66 |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse65 v_ArrVal_2322)) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4)) 4) 0) (= (select (let ((.cse67 (select v_arrayElimArr_12 4))) (select (store (store .cse64 .cse67 (store (select .cse64 .cse67) .cse65 v_ArrVal_2324)) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2325) (select (select (store .cse66 .cse67 (store (select .cse66 .cse67) .cse65 v_ArrVal_2322)) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4))) 4) 0) (not (= (select v_arrayElimArr_11 .cse1) |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) (not (= (select v_arrayElimArr_12 .cse1) |c_ULTIMATE.start_sll_create_~head~0#1.base|)))))) (or .cse0 (forall ((v_arrayElimArr_11 (Array Int Int)) (v_arrayElimArr_12 (Array Int Int)) (v_ArrVal_2325 (Array Int Int)) (v_ArrVal_2322 Int) (v_ArrVal_2324 Int)) (or (= (select (select (store (let ((.cse68 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_11))) (store .cse68 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse68 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |c_ULTIMATE.start_sll_create_~head~0#1.offset| v_ArrVal_2324))) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2325) (select (select (let ((.cse69 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_12))) (store .cse69 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse69 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |c_ULTIMATE.start_sll_create_~head~0#1.offset| v_ArrVal_2322))) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4)) 4) 0) (not (= (select v_arrayElimArr_11 .cse1) |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) (not (= (select v_arrayElimArr_12 .cse1) |c_ULTIMATE.start_sll_create_~head~0#1.base|))))) (or (forall ((v_arrayElimArr_10 (Array Int Int)) (v_ArrVal_2322 Int) (v_ArrVal_2326 Int) (v_arrayElimCell_136 Int)) (or (= (select (let ((.cse70 (let ((.cse72 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_10)) (.cse73 (select v_arrayElimArr_10 4))) (store .cse72 .cse73 (store (select .cse72 .cse73) v_arrayElimCell_136 v_ArrVal_2322))))) (let ((.cse71 (select .cse70 |c_ULTIMATE.start_node_create_~temp~0#1.base|))) (select (store .cse70 |c_ULTIMATE.start_node_create_~temp~0#1.base| (store .cse71 0 v_ArrVal_2326)) (select .cse71 4)))) 4) 0) (not (= (select v_arrayElimArr_10 .cse1) |c_ULTIMATE.start_sll_create_~head~0#1.base|)))) .cse37) (or .cse0 (and (forall ((v_arrayElimArr_12 (Array Int Int))) (or (not (= (select v_arrayElimArr_12 .cse1) |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (forall ((v_arrayElimArr_11 (Array Int Int))) (or (not (= (select v_arrayElimArr_11 .cse1) |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) (forall ((v_ArrVal_2325 (Array Int Int)) (v_ArrVal_2322 Int) (v_ArrVal_2324 Int) (v_arrayElimCell_137 Int)) (let ((.cse74 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_11)) (.cse75 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_12))) (or (= (select (select (store (store .cse74 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse74 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |c_ULTIMATE.start_sll_create_~head~0#1.offset| v_ArrVal_2324)) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2325) (select (select (store .cse75 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse75 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |c_ULTIMATE.start_sll_create_~head~0#1.offset| v_ArrVal_2322)) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4)) 4) 0) (= (select (let ((.cse76 (select v_arrayElimArr_12 4))) (select (store (store .cse74 .cse76 (store (select .cse74 .cse76) v_arrayElimCell_137 v_ArrVal_2324)) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2325) (select (select (store .cse75 .cse76 (store (select .cse75 .cse76) v_arrayElimCell_137 v_ArrVal_2322)) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4))) 4) 0)))))))) .cse14 .cse17)) (or (forall ((v_arrayElimArr_11 (Array Int Int)) (v_arrayElimArr_12 (Array Int Int)) (v_ArrVal_2325 (Array Int Int)) (v_ArrVal_2322 Int) (v_ArrVal_2324 Int)) (let ((.cse79 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_12)) (.cse77 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_11)) (.cse80 (select v_arrayElimArr_12 4))) (let ((.cse81 (select .cse77 .cse80)) (.cse82 (select .cse79 .cse80)) (.cse78 (select v_arrayElimArr_11 4))) (or (= (select (select (store (store .cse77 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse77 |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse78 v_ArrVal_2324)) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2325) (select (select (store .cse79 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse79 |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse78 v_ArrVal_2322)) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4)) 4) 0) (= (select (select (store (store .cse77 .cse80 (store .cse81 |c_ULTIMATE.start_sll_create_~head~0#1.offset| v_ArrVal_2324)) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2325) (select (select (store .cse79 .cse80 (store .cse82 |c_ULTIMATE.start_sll_create_~head~0#1.offset| v_ArrVal_2322)) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4)) 4) 0) (= (select (select (store (store .cse77 .cse80 (store .cse81 .cse78 v_ArrVal_2324)) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2325) (select (select (store .cse79 .cse80 (store .cse82 .cse78 v_ArrVal_2322)) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4)) 4) 0) (not (= (select v_arrayElimArr_11 .cse1) |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) (not (= (select v_arrayElimArr_12 .cse1) |c_ULTIMATE.start_sll_create_~head~0#1.base|)))))) .cse37)))) (not (<= 0 |c_ULTIMATE.start_node_create_~temp~0#1.offset|))) is different from true [2022-11-16 11:16:16,258 WARN L233 SmtUtils]: Spent 6.57s on a formula simplification. DAG size of input: 244 DAG size of output: 119 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 11:16:35,942 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base|)) (.cse7 (+ 4 |c_ULTIMATE.start_node_create_~temp~0#1.offset|))) (and (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_37| Int) (v_ArrVal_2307 Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_37|) 0)) (forall ((v_arrayElimArr_10 (Array Int Int))) (let ((.cse0 (select v_arrayElimArr_10 4))) (or (not (= |c_ULTIMATE.start_node_create_~temp~0#1.base| .cse0)) (forall ((v_ArrVal_2322 Int) (v_ArrVal_2326 Int)) (let ((.cse3 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| (store (store .cse6 |c_ULTIMATE.start_node_create_~temp~0#1.offset| v_ArrVal_2307) .cse7 |c_ULTIMATE.start_sll_create_~head~0#1.base|)) |v_ULTIMATE.start_node_create_~temp~0#1.base_37| v_arrayElimArr_10))) (or (= (select (let ((.cse1 (store .cse3 |c_ULTIMATE.start_node_create_~temp~0#1.base| (store (select .cse3 |c_ULTIMATE.start_node_create_~temp~0#1.base|) |c_ULTIMATE.start_node_create_~temp~0#1.offset| v_ArrVal_2322)))) (let ((.cse2 (select .cse1 |v_ULTIMATE.start_node_create_~temp~0#1.base_37|))) (select (store .cse1 |v_ULTIMATE.start_node_create_~temp~0#1.base_37| (store .cse2 0 v_ArrVal_2326)) (select .cse2 4)))) 4) 0) (forall ((v_arrayElimCell_136 Int)) (= (select (let ((.cse4 (store .cse3 .cse0 (store (select .cse3 .cse0) v_arrayElimCell_136 v_ArrVal_2322)))) (let ((.cse5 (select .cse4 |v_ULTIMATE.start_node_create_~temp~0#1.base_37|))) (select (store .cse4 |v_ULTIMATE.start_node_create_~temp~0#1.base_37| (store .cse5 0 v_ArrVal_2326)) (select .cse5 4)))) 4) 0)))))))))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_37| Int) (v_ArrVal_2305 Int) (v_ArrVal_2307 Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_37|) 0)) (forall ((v_arrayElimArr_12 (Array Int Int))) (or (not (= (select v_arrayElimArr_12 4) |c_ULTIMATE.start_node_create_~temp~0#1.base|)) (forall ((v_arrayElimArr_11 (Array Int Int)) (v_arrayElimCell_138 Int)) (or (not (= |c_ULTIMATE.start_node_create_~temp~0#1.offset| (select v_arrayElimArr_11 4))) (forall ((v_ArrVal_2325 (Array Int Int)) (v_ArrVal_2322 Int) (v_ArrVal_2324 Int) (v_arrayElimCell_137 Int)) (let ((.cse10 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| (store (store .cse6 |c_ULTIMATE.start_node_create_~temp~0#1.offset| v_ArrVal_2307) .cse7 |c_ULTIMATE.start_sll_create_~head~0#1.base|)) |v_ULTIMATE.start_node_create_~temp~0#1.base_37| v_arrayElimArr_12)) (.cse8 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| (store (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base|) |c_ULTIMATE.start_node_create_~temp~0#1.offset| v_ArrVal_2305) .cse7 |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) |v_ULTIMATE.start_node_create_~temp~0#1.base_37| v_arrayElimArr_11))) (let ((.cse9 (select .cse8 |c_ULTIMATE.start_node_create_~temp~0#1.base|)) (.cse11 (select .cse10 |c_ULTIMATE.start_node_create_~temp~0#1.base|)) (.cse12 (select .cse8 v_arrayElimCell_138)) (.cse13 (select .cse10 v_arrayElimCell_138))) (or (= (select (select (store (store .cse8 |c_ULTIMATE.start_node_create_~temp~0#1.base| (store .cse9 |c_ULTIMATE.start_node_create_~temp~0#1.offset| v_ArrVal_2324)) |v_ULTIMATE.start_node_create_~temp~0#1.base_37| v_ArrVal_2325) (select (select (store .cse10 |c_ULTIMATE.start_node_create_~temp~0#1.base| (store .cse11 |c_ULTIMATE.start_node_create_~temp~0#1.offset| v_ArrVal_2322)) |v_ULTIMATE.start_node_create_~temp~0#1.base_37|) 4)) 4) 0) (= 0 (select (select (store (store .cse8 v_arrayElimCell_138 (store .cse12 |c_ULTIMATE.start_node_create_~temp~0#1.offset| v_ArrVal_2324)) |v_ULTIMATE.start_node_create_~temp~0#1.base_37| v_ArrVal_2325) (select (select (store .cse10 v_arrayElimCell_138 (store .cse13 |c_ULTIMATE.start_node_create_~temp~0#1.offset| v_ArrVal_2322)) |v_ULTIMATE.start_node_create_~temp~0#1.base_37|) 4)) 4)) (= (select (select (store (store .cse8 |c_ULTIMATE.start_node_create_~temp~0#1.base| (store .cse9 v_arrayElimCell_137 v_ArrVal_2324)) |v_ULTIMATE.start_node_create_~temp~0#1.base_37| v_ArrVal_2325) (select (select (store .cse10 |c_ULTIMATE.start_node_create_~temp~0#1.base| (store .cse11 v_arrayElimCell_137 v_ArrVal_2322)) |v_ULTIMATE.start_node_create_~temp~0#1.base_37|) 4)) 4) 0) (= (select (select (store (store .cse8 v_arrayElimCell_138 (store .cse12 v_arrayElimCell_137 v_ArrVal_2324)) |v_ULTIMATE.start_node_create_~temp~0#1.base_37| v_ArrVal_2325) (select (select (store .cse10 v_arrayElimCell_138 (store .cse13 v_arrayElimCell_137 v_ArrVal_2322)) |v_ULTIMATE.start_node_create_~temp~0#1.base_37|) 4)) 4) 0))))))))))))) is different from false [2022-11-16 11:16:36,021 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:16:36,022 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 351 treesize of output 153 [2022-11-16 11:16:36,037 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:16:36,178 INFO L321 Elim1Store]: treesize reduction 60, result has 50.4 percent of original size [2022-11-16 11:16:36,179 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 7 new quantified variables, introduced 14 case distinctions, treesize of input 10533 treesize of output 9401 [2022-11-16 11:16:36,294 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 14537 treesize of output 13343 [2022-11-16 11:16:38,716 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 1380 treesize of output 1364 [2022-11-16 11:16:42,151 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-11-16 11:16:42,543 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 3508 treesize of output 3472 [2022-11-16 11:16:43,326 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 3482 treesize of output 3448 [2022-11-16 11:18:08,986 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:18:08,987 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 598 treesize of output 540 [2022-11-16 11:18:09,153 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 11:18:09,183 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:18:09,184 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 457 treesize of output 331 [2022-11-16 11:18:09,196 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 11:18:09,232 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:18:09,233 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 313 treesize of output 187 [2022-11-16 11:18:09,653 INFO L321 Elim1Store]: treesize reduction 140, result has 70.9 percent of original size [2022-11-16 11:18:09,654 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 13185 treesize of output 12851 [2022-11-16 11:18:09,836 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:18:09,838 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 31995 treesize of output 30981 [2022-11-16 11:18:10,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 35733 treesize of output 32781 [2022-11-16 11:18:11,120 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 26373 treesize of output 26237 [2022-11-16 11:18:11,838 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 26153 treesize of output 25905 [2022-11-16 11:18:13,435 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 716 treesize of output 712 [2022-11-16 11:18:14,497 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:18:14,497 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 288 treesize of output 286 [2022-11-16 11:18:16,121 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 11:18:16,135 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-11-16 11:18:16,737 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:18:16,753 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:18:16,767 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 39 treesize of output 35 [2022-11-16 11:18:18,400 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 335 treesize of output 327 [2022-11-16 11:18:18,823 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 392 treesize of output 382 [2022-11-16 11:18:19,594 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:18:19,596 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:18:19,610 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 11:18:19,611 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 1506 treesize of output 1494 [2022-11-16 11:18:20,526 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 335 treesize of output 327 [2022-11-16 11:18:27,780 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 9409 treesize of output 9389 [2022-11-16 11:18:41,052 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:18:41,063 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 11:18:41,064 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 9440 treesize of output 9416 [2022-11-16 11:20:51,941 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:20:51,953 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 11:20:51,954 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 2719 treesize of output 2707 [2022-11-16 11:20:57,055 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:20:57,066 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 11:20:57,067 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 7346 treesize of output 7326 [2022-11-16 11:21:04,021 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:21:04,025 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 24900 treesize of output 24028 [2022-11-16 11:21:19,413 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-16 11:21:19,414 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 11857 treesize of output 11623 [2022-11-16 11:21:20,190 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 9611 treesize of output 9577 [2022-11-16 11:22:25,762 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:22:25,764 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 8087 treesize of output 7777 [2022-11-16 11:22:29,022 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 2 proven. 25 refuted. 0 times theorem prover too weak. 11 trivial. 3 not checked. [2022-11-16 11:22:29,022 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1180806192] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 11:22:29,022 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 11:22:29,022 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 31, 33] total 73 [2022-11-16 11:22:29,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084079262] [2022-11-16 11:22:29,023 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 11:22:29,023 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 73 states [2022-11-16 11:22:29,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:22:29,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2022-11-16 11:22:29,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=292, Invalid=4657, Unknown=29, NotChecked=278, Total=5256 [2022-11-16 11:22:29,025 INFO L87 Difference]: Start difference. First operand 81 states and 84 transitions. Second operand has 73 states, 73 states have (on average 2.26027397260274) internal successors, (165), 73 states have internal predecessors, (165), 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-16 11:22:32,182 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse37 (= |c_ULTIMATE.start_node_create_~temp~0#1.offset| 0))) (and (= |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 0) (not (= |c_ULTIMATE.start_node_create_~temp~0#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 4)) 0) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) 4) 0) (or (let ((.cse1 (+ 4 |c_ULTIMATE.start_node_create_~temp~0#1.offset|))) (let ((.cse0 (not .cse37)) (.cse14 (forall ((v_arrayElimArr_12 (Array Int Int))) (or (forall ((v_arrayElimArr_11 (Array Int Int))) (or (forall ((v_ArrVal_2325 (Array Int Int)) (v_ArrVal_2322 Int) (v_ArrVal_2324 Int) (v_arrayElimCell_137 Int)) (let ((.cse87 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_12)) (.cse85 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_11))) (let ((.cse86 (select .cse85 |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (.cse88 (select .cse87 |c_ULTIMATE.start_sll_create_~head~0#1.base|))) (or (= (select (select (store (store .cse85 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store .cse86 |c_ULTIMATE.start_sll_create_~head~0#1.offset| v_ArrVal_2324)) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2325) (select (select (store .cse87 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store .cse88 |c_ULTIMATE.start_sll_create_~head~0#1.offset| v_ArrVal_2322)) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4)) 4) 0) (= (select (select (store (store .cse85 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store .cse86 v_arrayElimCell_137 v_ArrVal_2324)) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2325) (select (select (store .cse87 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store .cse88 v_arrayElimCell_137 v_ArrVal_2322)) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4)) 4) 0))))) (not (= (select v_arrayElimArr_11 .cse1) |c_ULTIMATE.start_sll_create_~head~0#1.offset|)))) (not (= (select v_arrayElimArr_12 .cse1) |c_ULTIMATE.start_sll_create_~head~0#1.base|))))) (.cse17 (forall ((v_arrayElimArr_12 (Array Int Int))) (or (forall ((v_arrayElimArr_11 (Array Int Int))) (or (forall ((v_ArrVal_2325 (Array Int Int)) (v_ArrVal_2322 Int) (v_ArrVal_2324 Int)) (= (select (select (store (let ((.cse83 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_11))) (store .cse83 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse83 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |c_ULTIMATE.start_sll_create_~head~0#1.offset| v_ArrVal_2324))) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2325) (select (select (let ((.cse84 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_12))) (store .cse84 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse84 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |c_ULTIMATE.start_sll_create_~head~0#1.offset| v_ArrVal_2322))) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4)) 4) 0)) (not (= (select v_arrayElimArr_11 .cse1) |c_ULTIMATE.start_sll_create_~head~0#1.offset|)))) (not (= (select v_arrayElimArr_12 .cse1) |c_ULTIMATE.start_sll_create_~head~0#1.base|)))))) (and (or .cse0 (and (forall ((v_arrayElimArr_12 (Array Int Int))) (or (not (= (select v_arrayElimArr_12 .cse1) |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (forall ((v_arrayElimArr_11 (Array Int Int)) (v_arrayElimCell_138 Int)) (or (forall ((v_ArrVal_2325 (Array Int Int)) (v_ArrVal_2322 Int) (v_ArrVal_2324 Int)) (let ((.cse2 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_11)) (.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_12))) (or (= (select (select (store (store .cse2 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse2 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |c_ULTIMATE.start_sll_create_~head~0#1.offset| v_ArrVal_2324)) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2325) (select (select (store .cse3 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse3 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |c_ULTIMATE.start_sll_create_~head~0#1.offset| v_ArrVal_2322)) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4)) 4) 0) (= (select (let ((.cse4 (select v_arrayElimArr_11 4))) (select (store (store .cse2 v_arrayElimCell_138 (store (select .cse2 v_arrayElimCell_138) .cse4 v_ArrVal_2324)) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2325) (select (select (store .cse3 v_arrayElimCell_138 (store (select .cse3 v_arrayElimCell_138) .cse4 v_ArrVal_2322)) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4))) 4) 0)))) (not (= (select v_arrayElimArr_11 .cse1) |c_ULTIMATE.start_sll_create_~head~0#1.offset|)))))) (forall ((v_arrayElimArr_12 (Array Int Int))) (or (not (= (select v_arrayElimArr_12 .cse1) |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (forall ((v_arrayElimArr_11 (Array Int Int)) (v_arrayElimCell_138 Int)) (or (forall ((v_ArrVal_2325 (Array Int Int)) (v_ArrVal_2322 Int) (v_ArrVal_2324 Int) (v_arrayElimCell_137 Int)) (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_12)) (.cse5 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_11))) (let ((.cse6 (select .cse5 v_arrayElimCell_138)) (.cse8 (select .cse7 v_arrayElimCell_138)) (.cse9 (select .cse5 |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (.cse10 (select .cse7 |c_ULTIMATE.start_sll_create_~head~0#1.base|))) (or (= (select (select (store (store .cse5 v_arrayElimCell_138 (store .cse6 |c_ULTIMATE.start_sll_create_~head~0#1.offset| v_ArrVal_2324)) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2325) (select (select (store .cse7 v_arrayElimCell_138 (store .cse8 |c_ULTIMATE.start_sll_create_~head~0#1.offset| v_ArrVal_2322)) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4)) 4) 0) (= (select (select (store (store .cse5 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store .cse9 |c_ULTIMATE.start_sll_create_~head~0#1.offset| v_ArrVal_2324)) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2325) (select (select (store .cse7 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store .cse10 |c_ULTIMATE.start_sll_create_~head~0#1.offset| v_ArrVal_2322)) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4)) 4) 0) (= (select (select (store (store .cse5 v_arrayElimCell_138 (store .cse6 v_arrayElimCell_137 v_ArrVal_2324)) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2325) (select (select (store .cse7 v_arrayElimCell_138 (store .cse8 v_arrayElimCell_137 v_ArrVal_2322)) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4)) 4) 0) (= (select (select (store (store .cse5 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store .cse9 v_arrayElimCell_137 v_ArrVal_2324)) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2325) (select (select (store .cse7 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store .cse10 v_arrayElimCell_137 v_ArrVal_2322)) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4)) 4) 0))))) (not (= (select v_arrayElimArr_11 .cse1) |c_ULTIMATE.start_sll_create_~head~0#1.offset|)))))) (forall ((v_arrayElimArr_12 (Array Int Int))) (or (not (= (select v_arrayElimArr_12 .cse1) |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (forall ((v_arrayElimArr_11 (Array Int Int)) (v_ArrVal_2325 (Array Int Int)) (v_ArrVal_2322 Int) (v_ArrVal_2324 Int) (v_arrayElimCell_138 Int)) (let ((.cse11 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_11)) (.cse12 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_12))) (or (= (select (select (store (store .cse11 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse11 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |c_ULTIMATE.start_sll_create_~head~0#1.offset| v_ArrVal_2324)) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2325) (select (select (store .cse12 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse12 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |c_ULTIMATE.start_sll_create_~head~0#1.offset| v_ArrVal_2322)) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4)) 4) 0) (not (= (select v_arrayElimArr_11 .cse1) |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) (= (select (let ((.cse13 (select v_arrayElimArr_11 4))) (select (store (store .cse11 v_arrayElimCell_138 (store (select .cse11 v_arrayElimCell_138) .cse13 v_ArrVal_2324)) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2325) (select (select (store .cse12 v_arrayElimCell_138 (store (select .cse12 v_arrayElimCell_138) .cse13 v_ArrVal_2322)) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4))) 4) 0)))))) .cse14 (forall ((v_arrayElimArr_12 (Array Int Int))) (or (forall ((v_arrayElimArr_11 (Array Int Int)) (v_ArrVal_2325 (Array Int Int)) (v_ArrVal_2322 Int) (v_ArrVal_2324 Int)) (or (= (select (select (store (let ((.cse15 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_11))) (store .cse15 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse15 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |c_ULTIMATE.start_sll_create_~head~0#1.offset| v_ArrVal_2324))) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2325) (select (select (let ((.cse16 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_12))) (store .cse16 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse16 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |c_ULTIMATE.start_sll_create_~head~0#1.offset| v_ArrVal_2322))) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4)) 4) 0) (not (= (select v_arrayElimArr_11 .cse1) |c_ULTIMATE.start_sll_create_~head~0#1.offset|)))) (not (= (select v_arrayElimArr_12 .cse1) |c_ULTIMATE.start_sll_create_~head~0#1.base|)))) .cse17 (forall ((v_arrayElimArr_12 (Array Int Int))) (or (not (= (select v_arrayElimArr_12 .cse1) |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (forall ((v_arrayElimArr_11 (Array Int Int)) (v_arrayElimCell_138 Int)) (or (not (= (select v_arrayElimArr_11 .cse1) |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) (forall ((v_ArrVal_2325 (Array Int Int)) (v_ArrVal_2322 Int) (v_ArrVal_2324 Int) (v_arrayElimCell_137 Int)) (let ((.cse20 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_12)) (.cse18 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_11))) (let ((.cse19 (select .cse18 |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (.cse21 (select .cse20 |c_ULTIMATE.start_sll_create_~head~0#1.base|))) (or (= (select (select (store (store .cse18 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store .cse19 |c_ULTIMATE.start_sll_create_~head~0#1.offset| v_ArrVal_2324)) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2325) (select (select (store .cse20 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store .cse21 |c_ULTIMATE.start_sll_create_~head~0#1.offset| v_ArrVal_2322)) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4)) 4) 0) (= (select (select (store (store .cse18 v_arrayElimCell_138 (store (select .cse18 v_arrayElimCell_138) v_arrayElimCell_137 v_ArrVal_2324)) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2325) (select (select (store .cse20 v_arrayElimCell_138 (store (select .cse20 v_arrayElimCell_138) v_arrayElimCell_137 v_ArrVal_2322)) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4)) 4) 0) (= (select (select (store (store .cse18 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store .cse19 v_arrayElimCell_137 v_ArrVal_2324)) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2325) (select (select (store .cse20 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store .cse21 v_arrayElimCell_137 v_ArrVal_2322)) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4)) 4) 0))))))))))) (forall ((v_arrayElimArr_10 (Array Int Int))) (or (forall ((v_ArrVal_2322 Int) (v_ArrVal_2326 Int)) (let ((.cse24 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_10))) (let ((.cse25 (select .cse24 |c_ULTIMATE.start_sll_create_~head~0#1.base|))) (or (forall ((v_arrayElimCell_136 Int)) (or (= (select (let ((.cse22 (store .cse24 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store .cse25 v_arrayElimCell_136 v_ArrVal_2322)))) (let ((.cse23 (select .cse22 |c_ULTIMATE.start_node_create_~temp~0#1.base|))) (select (store .cse22 |c_ULTIMATE.start_node_create_~temp~0#1.base| (store .cse23 0 v_ArrVal_2326)) (select .cse23 4)))) 4) 0) (= (select (let ((.cse26 (let ((.cse28 (select v_arrayElimArr_10 4))) (store .cse24 .cse28 (store (select .cse24 .cse28) v_arrayElimCell_136 v_ArrVal_2322))))) (let ((.cse27 (select .cse26 |c_ULTIMATE.start_node_create_~temp~0#1.base|))) (select (store .cse26 |c_ULTIMATE.start_node_create_~temp~0#1.base| (store .cse27 0 v_ArrVal_2326)) (select .cse27 4)))) 4) 0))) (= (select (let ((.cse29 (store .cse24 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store .cse25 |c_ULTIMATE.start_sll_create_~head~0#1.offset| v_ArrVal_2322)))) (let ((.cse30 (select .cse29 |c_ULTIMATE.start_node_create_~temp~0#1.base|))) (select (store .cse29 |c_ULTIMATE.start_node_create_~temp~0#1.base| (store .cse30 0 v_ArrVal_2326)) (select .cse30 4)))) 4) 0))))) (not (= (select v_arrayElimArr_10 .cse1) |c_ULTIMATE.start_sll_create_~head~0#1.base|)))) (or (forall ((v_arrayElimArr_10 (Array Int Int)) (v_ArrVal_2322 Int) (v_ArrVal_2326 Int) (v_arrayElimCell_136 Int)) (let ((.cse33 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_10))) (or (= (select (let ((.cse31 (store .cse33 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse33 |c_ULTIMATE.start_sll_create_~head~0#1.base|) v_arrayElimCell_136 v_ArrVal_2322)))) (let ((.cse32 (select .cse31 |c_ULTIMATE.start_node_create_~temp~0#1.base|))) (select (store .cse31 |c_ULTIMATE.start_node_create_~temp~0#1.base| (store .cse32 0 v_ArrVal_2326)) (select .cse32 4)))) 4) 0) (= (select (let ((.cse34 (let ((.cse36 (select v_arrayElimArr_10 4))) (store .cse33 .cse36 (store (select .cse33 .cse36) v_arrayElimCell_136 v_ArrVal_2322))))) (let ((.cse35 (select .cse34 |c_ULTIMATE.start_node_create_~temp~0#1.base|))) (select (store .cse34 |c_ULTIMATE.start_node_create_~temp~0#1.base| (store .cse35 0 v_ArrVal_2326)) (select .cse35 4)))) 4) 0) (not (= (select v_arrayElimArr_10 .cse1) |c_ULTIMATE.start_sll_create_~head~0#1.base|))))) .cse37) (or .cse0 (and (forall ((v_arrayElimArr_10 (Array Int Int))) (or (forall ((v_ArrVal_2322 Int) (v_arrayElimCell_135 Int) (v_ArrVal_2326 Int)) (let ((.cse40 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_10))) (let ((.cse41 (select .cse40 |c_ULTIMATE.start_sll_create_~head~0#1.base|))) (or (= (select (let ((.cse38 (store .cse40 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store .cse41 |c_ULTIMATE.start_sll_create_~head~0#1.offset| v_ArrVal_2322)))) (let ((.cse39 (select .cse38 |c_ULTIMATE.start_node_create_~temp~0#1.base|))) (select (store .cse38 |c_ULTIMATE.start_node_create_~temp~0#1.base| (store .cse39 0 v_ArrVal_2326)) (select .cse39 4)))) 4) 0) (forall ((v_arrayElimCell_136 Int)) (or (= (select (let ((.cse42 (store .cse40 v_arrayElimCell_135 (store (select .cse40 v_arrayElimCell_135) v_arrayElimCell_136 v_ArrVal_2322)))) (let ((.cse43 (select .cse42 |c_ULTIMATE.start_node_create_~temp~0#1.base|))) (select (store .cse42 |c_ULTIMATE.start_node_create_~temp~0#1.base| (store .cse43 0 v_ArrVal_2326)) (select .cse43 4)))) 4) 0) (= (select (let ((.cse44 (store .cse40 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store .cse41 v_arrayElimCell_136 v_ArrVal_2322)))) (let ((.cse45 (select .cse44 |c_ULTIMATE.start_node_create_~temp~0#1.base|))) (select (store .cse44 |c_ULTIMATE.start_node_create_~temp~0#1.base| (store .cse45 0 v_ArrVal_2326)) (select .cse45 4)))) 4) 0))))))) (not (= (select v_arrayElimArr_10 .cse1) |c_ULTIMATE.start_sll_create_~head~0#1.base|)))) (forall ((v_arrayElimArr_10 (Array Int Int))) (or (forall ((v_ArrVal_2322 Int) (v_ArrVal_2326 Int)) (= (select (let ((.cse46 (let ((.cse48 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_10))) (store .cse48 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse48 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |c_ULTIMATE.start_sll_create_~head~0#1.offset| v_ArrVal_2322))))) (let ((.cse47 (select .cse46 |c_ULTIMATE.start_node_create_~temp~0#1.base|))) (select (store .cse46 |c_ULTIMATE.start_node_create_~temp~0#1.base| (store .cse47 0 v_ArrVal_2326)) (select .cse47 4)))) 4) 0)) (not (= (select v_arrayElimArr_10 .cse1) |c_ULTIMATE.start_sll_create_~head~0#1.base|)))))) (or .cse37 (forall ((v_arrayElimArr_11 (Array Int Int)) (v_arrayElimArr_12 (Array Int Int)) (v_ArrVal_2325 (Array Int Int)) (v_ArrVal_2322 Int) (v_ArrVal_2324 Int)) (or (= (select (let ((.cse50 (select v_arrayElimArr_12 4)) (.cse51 (select v_arrayElimArr_11 4))) (select (store (let ((.cse49 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_11))) (store .cse49 .cse50 (store (select .cse49 .cse50) .cse51 v_ArrVal_2324))) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2325) (select (select (let ((.cse52 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_12))) (store .cse52 .cse50 (store (select .cse52 .cse50) .cse51 v_ArrVal_2322))) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4))) 4) 0) (not (= (select v_arrayElimArr_11 .cse1) |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) (not (= (select v_arrayElimArr_12 .cse1) |c_ULTIMATE.start_sll_create_~head~0#1.base|))))) (or .cse0 (forall ((v_arrayElimArr_10 (Array Int Int)) (v_ArrVal_2322 Int) (v_ArrVal_2326 Int)) (or (= (select (let ((.cse53 (let ((.cse55 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_10))) (store .cse55 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse55 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |c_ULTIMATE.start_sll_create_~head~0#1.offset| v_ArrVal_2322))))) (let ((.cse54 (select .cse53 |c_ULTIMATE.start_node_create_~temp~0#1.base|))) (select (store .cse53 |c_ULTIMATE.start_node_create_~temp~0#1.base| (store .cse54 0 v_ArrVal_2326)) (select .cse54 4)))) 4) 0) (not (= (select v_arrayElimArr_10 .cse1) |c_ULTIMATE.start_sll_create_~head~0#1.base|))))) (forall ((v_arrayElimArr_12 (Array Int Int))) (or (forall ((v_arrayElimArr_11 (Array Int Int))) (or (forall ((v_ArrVal_2325 (Array Int Int)) (v_ArrVal_2322 Int) (v_ArrVal_2324 Int)) (let ((.cse59 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_12)) (.cse56 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_11)) (.cse61 (select v_arrayElimArr_12 4))) (let ((.cse62 (select .cse56 .cse61)) (.cse63 (select .cse59 .cse61)) (.cse58 (select v_arrayElimArr_11 4)) (.cse57 (select .cse56 |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (.cse60 (select .cse59 |c_ULTIMATE.start_sll_create_~head~0#1.base|))) (or (= (select (select (store (store .cse56 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store .cse57 .cse58 v_ArrVal_2324)) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2325) (select (select (store .cse59 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store .cse60 .cse58 v_ArrVal_2322)) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4)) 4) 0) (= (select (select (store (store .cse56 .cse61 (store .cse62 |c_ULTIMATE.start_sll_create_~head~0#1.offset| v_ArrVal_2324)) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2325) (select (select (store .cse59 .cse61 (store .cse63 |c_ULTIMATE.start_sll_create_~head~0#1.offset| v_ArrVal_2322)) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4)) 4) 0) (= (select (select (store (store .cse56 .cse61 (store .cse62 .cse58 v_ArrVal_2324)) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2325) (select (select (store .cse59 .cse61 (store .cse63 .cse58 v_ArrVal_2322)) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4)) 4) 0) (= (select (select (store (store .cse56 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store .cse57 |c_ULTIMATE.start_sll_create_~head~0#1.offset| v_ArrVal_2324)) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2325) (select (select (store .cse59 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store .cse60 |c_ULTIMATE.start_sll_create_~head~0#1.offset| v_ArrVal_2322)) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4)) 4) 0))))) (not (= (select v_arrayElimArr_11 .cse1) |c_ULTIMATE.start_sll_create_~head~0#1.offset|)))) (not (= (select v_arrayElimArr_12 .cse1) |c_ULTIMATE.start_sll_create_~head~0#1.base|)))) (or .cse37 (forall ((v_arrayElimArr_11 (Array Int Int)) (v_arrayElimArr_12 (Array Int Int)) (v_ArrVal_2325 (Array Int Int)) (v_ArrVal_2322 Int) (v_ArrVal_2324 Int)) (let ((.cse64 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_11)) (.cse66 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_12)) (.cse65 (select v_arrayElimArr_11 4))) (or (= (select (select (store (store .cse64 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse64 |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse65 v_ArrVal_2324)) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2325) (select (select (store .cse66 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse66 |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse65 v_ArrVal_2322)) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4)) 4) 0) (= (select (let ((.cse67 (select v_arrayElimArr_12 4))) (select (store (store .cse64 .cse67 (store (select .cse64 .cse67) .cse65 v_ArrVal_2324)) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2325) (select (select (store .cse66 .cse67 (store (select .cse66 .cse67) .cse65 v_ArrVal_2322)) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4))) 4) 0) (not (= (select v_arrayElimArr_11 .cse1) |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) (not (= (select v_arrayElimArr_12 .cse1) |c_ULTIMATE.start_sll_create_~head~0#1.base|)))))) (or .cse0 (forall ((v_arrayElimArr_11 (Array Int Int)) (v_arrayElimArr_12 (Array Int Int)) (v_ArrVal_2325 (Array Int Int)) (v_ArrVal_2322 Int) (v_ArrVal_2324 Int)) (or (= (select (select (store (let ((.cse68 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_11))) (store .cse68 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse68 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |c_ULTIMATE.start_sll_create_~head~0#1.offset| v_ArrVal_2324))) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2325) (select (select (let ((.cse69 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_12))) (store .cse69 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse69 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |c_ULTIMATE.start_sll_create_~head~0#1.offset| v_ArrVal_2322))) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4)) 4) 0) (not (= (select v_arrayElimArr_11 .cse1) |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) (not (= (select v_arrayElimArr_12 .cse1) |c_ULTIMATE.start_sll_create_~head~0#1.base|))))) (or (forall ((v_arrayElimArr_10 (Array Int Int)) (v_ArrVal_2322 Int) (v_ArrVal_2326 Int) (v_arrayElimCell_136 Int)) (or (= (select (let ((.cse70 (let ((.cse72 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_10)) (.cse73 (select v_arrayElimArr_10 4))) (store .cse72 .cse73 (store (select .cse72 .cse73) v_arrayElimCell_136 v_ArrVal_2322))))) (let ((.cse71 (select .cse70 |c_ULTIMATE.start_node_create_~temp~0#1.base|))) (select (store .cse70 |c_ULTIMATE.start_node_create_~temp~0#1.base| (store .cse71 0 v_ArrVal_2326)) (select .cse71 4)))) 4) 0) (not (= (select v_arrayElimArr_10 .cse1) |c_ULTIMATE.start_sll_create_~head~0#1.base|)))) .cse37) (or .cse0 (and (forall ((v_arrayElimArr_12 (Array Int Int))) (or (not (= (select v_arrayElimArr_12 .cse1) |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (forall ((v_arrayElimArr_11 (Array Int Int))) (or (not (= (select v_arrayElimArr_11 .cse1) |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) (forall ((v_ArrVal_2325 (Array Int Int)) (v_ArrVal_2322 Int) (v_ArrVal_2324 Int) (v_arrayElimCell_137 Int)) (let ((.cse74 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_11)) (.cse75 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_12))) (or (= (select (select (store (store .cse74 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse74 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |c_ULTIMATE.start_sll_create_~head~0#1.offset| v_ArrVal_2324)) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2325) (select (select (store .cse75 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse75 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |c_ULTIMATE.start_sll_create_~head~0#1.offset| v_ArrVal_2322)) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4)) 4) 0) (= (select (let ((.cse76 (select v_arrayElimArr_12 4))) (select (store (store .cse74 .cse76 (store (select .cse74 .cse76) v_arrayElimCell_137 v_ArrVal_2324)) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2325) (select (select (store .cse75 .cse76 (store (select .cse75 .cse76) v_arrayElimCell_137 v_ArrVal_2322)) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4))) 4) 0)))))))) .cse14 .cse17)) (or (forall ((v_arrayElimArr_11 (Array Int Int)) (v_arrayElimArr_12 (Array Int Int)) (v_ArrVal_2325 (Array Int Int)) (v_ArrVal_2322 Int) (v_ArrVal_2324 Int)) (let ((.cse79 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_12)) (.cse77 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_11)) (.cse80 (select v_arrayElimArr_12 4))) (let ((.cse81 (select .cse77 .cse80)) (.cse82 (select .cse79 .cse80)) (.cse78 (select v_arrayElimArr_11 4))) (or (= (select (select (store (store .cse77 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse77 |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse78 v_ArrVal_2324)) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2325) (select (select (store .cse79 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse79 |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse78 v_ArrVal_2322)) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4)) 4) 0) (= (select (select (store (store .cse77 .cse80 (store .cse81 |c_ULTIMATE.start_sll_create_~head~0#1.offset| v_ArrVal_2324)) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2325) (select (select (store .cse79 .cse80 (store .cse82 |c_ULTIMATE.start_sll_create_~head~0#1.offset| v_ArrVal_2322)) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4)) 4) 0) (= (select (select (store (store .cse77 .cse80 (store .cse81 .cse78 v_ArrVal_2324)) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2325) (select (select (store .cse79 .cse80 (store .cse82 .cse78 v_ArrVal_2322)) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4)) 4) 0) (not (= (select v_arrayElimArr_11 .cse1) |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) (not (= (select v_arrayElimArr_12 .cse1) |c_ULTIMATE.start_sll_create_~head~0#1.base|)))))) .cse37)))) (not (<= 0 |c_ULTIMATE.start_node_create_~temp~0#1.offset|))) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0) .cse37 (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) 1) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0))) is different from true [2022-11-16 11:22:34,266 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse37 (= |c_ULTIMATE.start_node_create_~temp~0#1.offset| 0))) (and (not (= |c_ULTIMATE.start_node_create_~temp~0#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (or (let ((.cse1 (+ 4 |c_ULTIMATE.start_node_create_~temp~0#1.offset|))) (let ((.cse0 (not .cse37)) (.cse14 (forall ((v_arrayElimArr_12 (Array Int Int))) (or (forall ((v_arrayElimArr_11 (Array Int Int))) (or (forall ((v_ArrVal_2325 (Array Int Int)) (v_ArrVal_2322 Int) (v_ArrVal_2324 Int) (v_arrayElimCell_137 Int)) (let ((.cse87 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_12)) (.cse85 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_11))) (let ((.cse86 (select .cse85 |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (.cse88 (select .cse87 |c_ULTIMATE.start_sll_create_~head~0#1.base|))) (or (= (select (select (store (store .cse85 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store .cse86 |c_ULTIMATE.start_sll_create_~head~0#1.offset| v_ArrVal_2324)) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2325) (select (select (store .cse87 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store .cse88 |c_ULTIMATE.start_sll_create_~head~0#1.offset| v_ArrVal_2322)) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4)) 4) 0) (= (select (select (store (store .cse85 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store .cse86 v_arrayElimCell_137 v_ArrVal_2324)) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2325) (select (select (store .cse87 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store .cse88 v_arrayElimCell_137 v_ArrVal_2322)) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4)) 4) 0))))) (not (= (select v_arrayElimArr_11 .cse1) |c_ULTIMATE.start_sll_create_~head~0#1.offset|)))) (not (= (select v_arrayElimArr_12 .cse1) |c_ULTIMATE.start_sll_create_~head~0#1.base|))))) (.cse17 (forall ((v_arrayElimArr_12 (Array Int Int))) (or (forall ((v_arrayElimArr_11 (Array Int Int))) (or (forall ((v_ArrVal_2325 (Array Int Int)) (v_ArrVal_2322 Int) (v_ArrVal_2324 Int)) (= (select (select (store (let ((.cse83 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_11))) (store .cse83 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse83 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |c_ULTIMATE.start_sll_create_~head~0#1.offset| v_ArrVal_2324))) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2325) (select (select (let ((.cse84 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_12))) (store .cse84 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse84 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |c_ULTIMATE.start_sll_create_~head~0#1.offset| v_ArrVal_2322))) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4)) 4) 0)) (not (= (select v_arrayElimArr_11 .cse1) |c_ULTIMATE.start_sll_create_~head~0#1.offset|)))) (not (= (select v_arrayElimArr_12 .cse1) |c_ULTIMATE.start_sll_create_~head~0#1.base|)))))) (and (or .cse0 (and (forall ((v_arrayElimArr_12 (Array Int Int))) (or (not (= (select v_arrayElimArr_12 .cse1) |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (forall ((v_arrayElimArr_11 (Array Int Int)) (v_arrayElimCell_138 Int)) (or (forall ((v_ArrVal_2325 (Array Int Int)) (v_ArrVal_2322 Int) (v_ArrVal_2324 Int)) (let ((.cse2 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_11)) (.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_12))) (or (= (select (select (store (store .cse2 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse2 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |c_ULTIMATE.start_sll_create_~head~0#1.offset| v_ArrVal_2324)) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2325) (select (select (store .cse3 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse3 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |c_ULTIMATE.start_sll_create_~head~0#1.offset| v_ArrVal_2322)) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4)) 4) 0) (= (select (let ((.cse4 (select v_arrayElimArr_11 4))) (select (store (store .cse2 v_arrayElimCell_138 (store (select .cse2 v_arrayElimCell_138) .cse4 v_ArrVal_2324)) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2325) (select (select (store .cse3 v_arrayElimCell_138 (store (select .cse3 v_arrayElimCell_138) .cse4 v_ArrVal_2322)) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4))) 4) 0)))) (not (= (select v_arrayElimArr_11 .cse1) |c_ULTIMATE.start_sll_create_~head~0#1.offset|)))))) (forall ((v_arrayElimArr_12 (Array Int Int))) (or (not (= (select v_arrayElimArr_12 .cse1) |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (forall ((v_arrayElimArr_11 (Array Int Int)) (v_arrayElimCell_138 Int)) (or (forall ((v_ArrVal_2325 (Array Int Int)) (v_ArrVal_2322 Int) (v_ArrVal_2324 Int) (v_arrayElimCell_137 Int)) (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_12)) (.cse5 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_11))) (let ((.cse6 (select .cse5 v_arrayElimCell_138)) (.cse8 (select .cse7 v_arrayElimCell_138)) (.cse9 (select .cse5 |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (.cse10 (select .cse7 |c_ULTIMATE.start_sll_create_~head~0#1.base|))) (or (= (select (select (store (store .cse5 v_arrayElimCell_138 (store .cse6 |c_ULTIMATE.start_sll_create_~head~0#1.offset| v_ArrVal_2324)) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2325) (select (select (store .cse7 v_arrayElimCell_138 (store .cse8 |c_ULTIMATE.start_sll_create_~head~0#1.offset| v_ArrVal_2322)) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4)) 4) 0) (= (select (select (store (store .cse5 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store .cse9 |c_ULTIMATE.start_sll_create_~head~0#1.offset| v_ArrVal_2324)) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2325) (select (select (store .cse7 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store .cse10 |c_ULTIMATE.start_sll_create_~head~0#1.offset| v_ArrVal_2322)) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4)) 4) 0) (= (select (select (store (store .cse5 v_arrayElimCell_138 (store .cse6 v_arrayElimCell_137 v_ArrVal_2324)) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2325) (select (select (store .cse7 v_arrayElimCell_138 (store .cse8 v_arrayElimCell_137 v_ArrVal_2322)) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4)) 4) 0) (= (select (select (store (store .cse5 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store .cse9 v_arrayElimCell_137 v_ArrVal_2324)) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2325) (select (select (store .cse7 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store .cse10 v_arrayElimCell_137 v_ArrVal_2322)) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4)) 4) 0))))) (not (= (select v_arrayElimArr_11 .cse1) |c_ULTIMATE.start_sll_create_~head~0#1.offset|)))))) (forall ((v_arrayElimArr_12 (Array Int Int))) (or (not (= (select v_arrayElimArr_12 .cse1) |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (forall ((v_arrayElimArr_11 (Array Int Int)) (v_ArrVal_2325 (Array Int Int)) (v_ArrVal_2322 Int) (v_ArrVal_2324 Int) (v_arrayElimCell_138 Int)) (let ((.cse11 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_11)) (.cse12 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_12))) (or (= (select (select (store (store .cse11 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse11 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |c_ULTIMATE.start_sll_create_~head~0#1.offset| v_ArrVal_2324)) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2325) (select (select (store .cse12 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse12 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |c_ULTIMATE.start_sll_create_~head~0#1.offset| v_ArrVal_2322)) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4)) 4) 0) (not (= (select v_arrayElimArr_11 .cse1) |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) (= (select (let ((.cse13 (select v_arrayElimArr_11 4))) (select (store (store .cse11 v_arrayElimCell_138 (store (select .cse11 v_arrayElimCell_138) .cse13 v_ArrVal_2324)) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2325) (select (select (store .cse12 v_arrayElimCell_138 (store (select .cse12 v_arrayElimCell_138) .cse13 v_ArrVal_2322)) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4))) 4) 0)))))) .cse14 (forall ((v_arrayElimArr_12 (Array Int Int))) (or (forall ((v_arrayElimArr_11 (Array Int Int)) (v_ArrVal_2325 (Array Int Int)) (v_ArrVal_2322 Int) (v_ArrVal_2324 Int)) (or (= (select (select (store (let ((.cse15 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_11))) (store .cse15 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse15 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |c_ULTIMATE.start_sll_create_~head~0#1.offset| v_ArrVal_2324))) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2325) (select (select (let ((.cse16 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_12))) (store .cse16 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse16 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |c_ULTIMATE.start_sll_create_~head~0#1.offset| v_ArrVal_2322))) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4)) 4) 0) (not (= (select v_arrayElimArr_11 .cse1) |c_ULTIMATE.start_sll_create_~head~0#1.offset|)))) (not (= (select v_arrayElimArr_12 .cse1) |c_ULTIMATE.start_sll_create_~head~0#1.base|)))) .cse17 (forall ((v_arrayElimArr_12 (Array Int Int))) (or (not (= (select v_arrayElimArr_12 .cse1) |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (forall ((v_arrayElimArr_11 (Array Int Int)) (v_arrayElimCell_138 Int)) (or (not (= (select v_arrayElimArr_11 .cse1) |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) (forall ((v_ArrVal_2325 (Array Int Int)) (v_ArrVal_2322 Int) (v_ArrVal_2324 Int) (v_arrayElimCell_137 Int)) (let ((.cse20 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_12)) (.cse18 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_11))) (let ((.cse19 (select .cse18 |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (.cse21 (select .cse20 |c_ULTIMATE.start_sll_create_~head~0#1.base|))) (or (= (select (select (store (store .cse18 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store .cse19 |c_ULTIMATE.start_sll_create_~head~0#1.offset| v_ArrVal_2324)) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2325) (select (select (store .cse20 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store .cse21 |c_ULTIMATE.start_sll_create_~head~0#1.offset| v_ArrVal_2322)) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4)) 4) 0) (= (select (select (store (store .cse18 v_arrayElimCell_138 (store (select .cse18 v_arrayElimCell_138) v_arrayElimCell_137 v_ArrVal_2324)) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2325) (select (select (store .cse20 v_arrayElimCell_138 (store (select .cse20 v_arrayElimCell_138) v_arrayElimCell_137 v_ArrVal_2322)) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4)) 4) 0) (= (select (select (store (store .cse18 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store .cse19 v_arrayElimCell_137 v_ArrVal_2324)) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2325) (select (select (store .cse20 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store .cse21 v_arrayElimCell_137 v_ArrVal_2322)) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4)) 4) 0))))))))))) (forall ((v_arrayElimArr_10 (Array Int Int))) (or (forall ((v_ArrVal_2322 Int) (v_ArrVal_2326 Int)) (let ((.cse24 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_10))) (let ((.cse25 (select .cse24 |c_ULTIMATE.start_sll_create_~head~0#1.base|))) (or (forall ((v_arrayElimCell_136 Int)) (or (= (select (let ((.cse22 (store .cse24 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store .cse25 v_arrayElimCell_136 v_ArrVal_2322)))) (let ((.cse23 (select .cse22 |c_ULTIMATE.start_node_create_~temp~0#1.base|))) (select (store .cse22 |c_ULTIMATE.start_node_create_~temp~0#1.base| (store .cse23 0 v_ArrVal_2326)) (select .cse23 4)))) 4) 0) (= (select (let ((.cse26 (let ((.cse28 (select v_arrayElimArr_10 4))) (store .cse24 .cse28 (store (select .cse24 .cse28) v_arrayElimCell_136 v_ArrVal_2322))))) (let ((.cse27 (select .cse26 |c_ULTIMATE.start_node_create_~temp~0#1.base|))) (select (store .cse26 |c_ULTIMATE.start_node_create_~temp~0#1.base| (store .cse27 0 v_ArrVal_2326)) (select .cse27 4)))) 4) 0))) (= (select (let ((.cse29 (store .cse24 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store .cse25 |c_ULTIMATE.start_sll_create_~head~0#1.offset| v_ArrVal_2322)))) (let ((.cse30 (select .cse29 |c_ULTIMATE.start_node_create_~temp~0#1.base|))) (select (store .cse29 |c_ULTIMATE.start_node_create_~temp~0#1.base| (store .cse30 0 v_ArrVal_2326)) (select .cse30 4)))) 4) 0))))) (not (= (select v_arrayElimArr_10 .cse1) |c_ULTIMATE.start_sll_create_~head~0#1.base|)))) (or (forall ((v_arrayElimArr_10 (Array Int Int)) (v_ArrVal_2322 Int) (v_ArrVal_2326 Int) (v_arrayElimCell_136 Int)) (let ((.cse33 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_10))) (or (= (select (let ((.cse31 (store .cse33 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse33 |c_ULTIMATE.start_sll_create_~head~0#1.base|) v_arrayElimCell_136 v_ArrVal_2322)))) (let ((.cse32 (select .cse31 |c_ULTIMATE.start_node_create_~temp~0#1.base|))) (select (store .cse31 |c_ULTIMATE.start_node_create_~temp~0#1.base| (store .cse32 0 v_ArrVal_2326)) (select .cse32 4)))) 4) 0) (= (select (let ((.cse34 (let ((.cse36 (select v_arrayElimArr_10 4))) (store .cse33 .cse36 (store (select .cse33 .cse36) v_arrayElimCell_136 v_ArrVal_2322))))) (let ((.cse35 (select .cse34 |c_ULTIMATE.start_node_create_~temp~0#1.base|))) (select (store .cse34 |c_ULTIMATE.start_node_create_~temp~0#1.base| (store .cse35 0 v_ArrVal_2326)) (select .cse35 4)))) 4) 0) (not (= (select v_arrayElimArr_10 .cse1) |c_ULTIMATE.start_sll_create_~head~0#1.base|))))) .cse37) (or .cse0 (and (forall ((v_arrayElimArr_10 (Array Int Int))) (or (forall ((v_ArrVal_2322 Int) (v_arrayElimCell_135 Int) (v_ArrVal_2326 Int)) (let ((.cse40 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_10))) (let ((.cse41 (select .cse40 |c_ULTIMATE.start_sll_create_~head~0#1.base|))) (or (= (select (let ((.cse38 (store .cse40 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store .cse41 |c_ULTIMATE.start_sll_create_~head~0#1.offset| v_ArrVal_2322)))) (let ((.cse39 (select .cse38 |c_ULTIMATE.start_node_create_~temp~0#1.base|))) (select (store .cse38 |c_ULTIMATE.start_node_create_~temp~0#1.base| (store .cse39 0 v_ArrVal_2326)) (select .cse39 4)))) 4) 0) (forall ((v_arrayElimCell_136 Int)) (or (= (select (let ((.cse42 (store .cse40 v_arrayElimCell_135 (store (select .cse40 v_arrayElimCell_135) v_arrayElimCell_136 v_ArrVal_2322)))) (let ((.cse43 (select .cse42 |c_ULTIMATE.start_node_create_~temp~0#1.base|))) (select (store .cse42 |c_ULTIMATE.start_node_create_~temp~0#1.base| (store .cse43 0 v_ArrVal_2326)) (select .cse43 4)))) 4) 0) (= (select (let ((.cse44 (store .cse40 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store .cse41 v_arrayElimCell_136 v_ArrVal_2322)))) (let ((.cse45 (select .cse44 |c_ULTIMATE.start_node_create_~temp~0#1.base|))) (select (store .cse44 |c_ULTIMATE.start_node_create_~temp~0#1.base| (store .cse45 0 v_ArrVal_2326)) (select .cse45 4)))) 4) 0))))))) (not (= (select v_arrayElimArr_10 .cse1) |c_ULTIMATE.start_sll_create_~head~0#1.base|)))) (forall ((v_arrayElimArr_10 (Array Int Int))) (or (forall ((v_ArrVal_2322 Int) (v_ArrVal_2326 Int)) (= (select (let ((.cse46 (let ((.cse48 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_10))) (store .cse48 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse48 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |c_ULTIMATE.start_sll_create_~head~0#1.offset| v_ArrVal_2322))))) (let ((.cse47 (select .cse46 |c_ULTIMATE.start_node_create_~temp~0#1.base|))) (select (store .cse46 |c_ULTIMATE.start_node_create_~temp~0#1.base| (store .cse47 0 v_ArrVal_2326)) (select .cse47 4)))) 4) 0)) (not (= (select v_arrayElimArr_10 .cse1) |c_ULTIMATE.start_sll_create_~head~0#1.base|)))))) (or .cse37 (forall ((v_arrayElimArr_11 (Array Int Int)) (v_arrayElimArr_12 (Array Int Int)) (v_ArrVal_2325 (Array Int Int)) (v_ArrVal_2322 Int) (v_ArrVal_2324 Int)) (or (= (select (let ((.cse50 (select v_arrayElimArr_12 4)) (.cse51 (select v_arrayElimArr_11 4))) (select (store (let ((.cse49 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_11))) (store .cse49 .cse50 (store (select .cse49 .cse50) .cse51 v_ArrVal_2324))) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2325) (select (select (let ((.cse52 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_12))) (store .cse52 .cse50 (store (select .cse52 .cse50) .cse51 v_ArrVal_2322))) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4))) 4) 0) (not (= (select v_arrayElimArr_11 .cse1) |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) (not (= (select v_arrayElimArr_12 .cse1) |c_ULTIMATE.start_sll_create_~head~0#1.base|))))) (or .cse0 (forall ((v_arrayElimArr_10 (Array Int Int)) (v_ArrVal_2322 Int) (v_ArrVal_2326 Int)) (or (= (select (let ((.cse53 (let ((.cse55 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_10))) (store .cse55 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse55 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |c_ULTIMATE.start_sll_create_~head~0#1.offset| v_ArrVal_2322))))) (let ((.cse54 (select .cse53 |c_ULTIMATE.start_node_create_~temp~0#1.base|))) (select (store .cse53 |c_ULTIMATE.start_node_create_~temp~0#1.base| (store .cse54 0 v_ArrVal_2326)) (select .cse54 4)))) 4) 0) (not (= (select v_arrayElimArr_10 .cse1) |c_ULTIMATE.start_sll_create_~head~0#1.base|))))) (forall ((v_arrayElimArr_12 (Array Int Int))) (or (forall ((v_arrayElimArr_11 (Array Int Int))) (or (forall ((v_ArrVal_2325 (Array Int Int)) (v_ArrVal_2322 Int) (v_ArrVal_2324 Int)) (let ((.cse59 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_12)) (.cse56 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_11)) (.cse61 (select v_arrayElimArr_12 4))) (let ((.cse62 (select .cse56 .cse61)) (.cse63 (select .cse59 .cse61)) (.cse58 (select v_arrayElimArr_11 4)) (.cse57 (select .cse56 |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (.cse60 (select .cse59 |c_ULTIMATE.start_sll_create_~head~0#1.base|))) (or (= (select (select (store (store .cse56 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store .cse57 .cse58 v_ArrVal_2324)) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2325) (select (select (store .cse59 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store .cse60 .cse58 v_ArrVal_2322)) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4)) 4) 0) (= (select (select (store (store .cse56 .cse61 (store .cse62 |c_ULTIMATE.start_sll_create_~head~0#1.offset| v_ArrVal_2324)) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2325) (select (select (store .cse59 .cse61 (store .cse63 |c_ULTIMATE.start_sll_create_~head~0#1.offset| v_ArrVal_2322)) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4)) 4) 0) (= (select (select (store (store .cse56 .cse61 (store .cse62 .cse58 v_ArrVal_2324)) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2325) (select (select (store .cse59 .cse61 (store .cse63 .cse58 v_ArrVal_2322)) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4)) 4) 0) (= (select (select (store (store .cse56 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store .cse57 |c_ULTIMATE.start_sll_create_~head~0#1.offset| v_ArrVal_2324)) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2325) (select (select (store .cse59 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store .cse60 |c_ULTIMATE.start_sll_create_~head~0#1.offset| v_ArrVal_2322)) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4)) 4) 0))))) (not (= (select v_arrayElimArr_11 .cse1) |c_ULTIMATE.start_sll_create_~head~0#1.offset|)))) (not (= (select v_arrayElimArr_12 .cse1) |c_ULTIMATE.start_sll_create_~head~0#1.base|)))) (or .cse37 (forall ((v_arrayElimArr_11 (Array Int Int)) (v_arrayElimArr_12 (Array Int Int)) (v_ArrVal_2325 (Array Int Int)) (v_ArrVal_2322 Int) (v_ArrVal_2324 Int)) (let ((.cse64 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_11)) (.cse66 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_12)) (.cse65 (select v_arrayElimArr_11 4))) (or (= (select (select (store (store .cse64 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse64 |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse65 v_ArrVal_2324)) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2325) (select (select (store .cse66 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse66 |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse65 v_ArrVal_2322)) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4)) 4) 0) (= (select (let ((.cse67 (select v_arrayElimArr_12 4))) (select (store (store .cse64 .cse67 (store (select .cse64 .cse67) .cse65 v_ArrVal_2324)) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2325) (select (select (store .cse66 .cse67 (store (select .cse66 .cse67) .cse65 v_ArrVal_2322)) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4))) 4) 0) (not (= (select v_arrayElimArr_11 .cse1) |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) (not (= (select v_arrayElimArr_12 .cse1) |c_ULTIMATE.start_sll_create_~head~0#1.base|)))))) (or .cse0 (forall ((v_arrayElimArr_11 (Array Int Int)) (v_arrayElimArr_12 (Array Int Int)) (v_ArrVal_2325 (Array Int Int)) (v_ArrVal_2322 Int) (v_ArrVal_2324 Int)) (or (= (select (select (store (let ((.cse68 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_11))) (store .cse68 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse68 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |c_ULTIMATE.start_sll_create_~head~0#1.offset| v_ArrVal_2324))) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2325) (select (select (let ((.cse69 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_12))) (store .cse69 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse69 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |c_ULTIMATE.start_sll_create_~head~0#1.offset| v_ArrVal_2322))) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4)) 4) 0) (not (= (select v_arrayElimArr_11 .cse1) |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) (not (= (select v_arrayElimArr_12 .cse1) |c_ULTIMATE.start_sll_create_~head~0#1.base|))))) (or (forall ((v_arrayElimArr_10 (Array Int Int)) (v_ArrVal_2322 Int) (v_ArrVal_2326 Int) (v_arrayElimCell_136 Int)) (or (= (select (let ((.cse70 (let ((.cse72 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_10)) (.cse73 (select v_arrayElimArr_10 4))) (store .cse72 .cse73 (store (select .cse72 .cse73) v_arrayElimCell_136 v_ArrVal_2322))))) (let ((.cse71 (select .cse70 |c_ULTIMATE.start_node_create_~temp~0#1.base|))) (select (store .cse70 |c_ULTIMATE.start_node_create_~temp~0#1.base| (store .cse71 0 v_ArrVal_2326)) (select .cse71 4)))) 4) 0) (not (= (select v_arrayElimArr_10 .cse1) |c_ULTIMATE.start_sll_create_~head~0#1.base|)))) .cse37) (or .cse0 (and (forall ((v_arrayElimArr_12 (Array Int Int))) (or (not (= (select v_arrayElimArr_12 .cse1) |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (forall ((v_arrayElimArr_11 (Array Int Int))) (or (not (= (select v_arrayElimArr_11 .cse1) |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) (forall ((v_ArrVal_2325 (Array Int Int)) (v_ArrVal_2322 Int) (v_ArrVal_2324 Int) (v_arrayElimCell_137 Int)) (let ((.cse74 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_11)) (.cse75 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_12))) (or (= (select (select (store (store .cse74 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse74 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |c_ULTIMATE.start_sll_create_~head~0#1.offset| v_ArrVal_2324)) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2325) (select (select (store .cse75 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse75 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |c_ULTIMATE.start_sll_create_~head~0#1.offset| v_ArrVal_2322)) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4)) 4) 0) (= (select (let ((.cse76 (select v_arrayElimArr_12 4))) (select (store (store .cse74 .cse76 (store (select .cse74 .cse76) v_arrayElimCell_137 v_ArrVal_2324)) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2325) (select (select (store .cse75 .cse76 (store (select .cse75 .cse76) v_arrayElimCell_137 v_ArrVal_2322)) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4))) 4) 0)))))))) .cse14 .cse17)) (or (forall ((v_arrayElimArr_11 (Array Int Int)) (v_arrayElimArr_12 (Array Int Int)) (v_ArrVal_2325 (Array Int Int)) (v_ArrVal_2322 Int) (v_ArrVal_2324 Int)) (let ((.cse79 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_12)) (.cse77 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_11)) (.cse80 (select v_arrayElimArr_12 4))) (let ((.cse81 (select .cse77 .cse80)) (.cse82 (select .cse79 .cse80)) (.cse78 (select v_arrayElimArr_11 4))) (or (= (select (select (store (store .cse77 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse77 |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse78 v_ArrVal_2324)) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2325) (select (select (store .cse79 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse79 |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse78 v_ArrVal_2322)) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4)) 4) 0) (= (select (select (store (store .cse77 .cse80 (store .cse81 |c_ULTIMATE.start_sll_create_~head~0#1.offset| v_ArrVal_2324)) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2325) (select (select (store .cse79 .cse80 (store .cse82 |c_ULTIMATE.start_sll_create_~head~0#1.offset| v_ArrVal_2322)) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4)) 4) 0) (= (select (select (store (store .cse77 .cse80 (store .cse81 .cse78 v_ArrVal_2324)) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2325) (select (select (store .cse79 .cse80 (store .cse82 .cse78 v_ArrVal_2322)) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4)) 4) 0) (not (= (select v_arrayElimArr_11 .cse1) |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) (not (= (select v_arrayElimArr_12 .cse1) |c_ULTIMATE.start_sll_create_~head~0#1.base|)))))) .cse37)))) (not (<= 0 |c_ULTIMATE.start_node_create_~temp~0#1.offset|))) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0) .cse37 (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0))) is different from true [2022-11-16 11:22:40,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:22:40,803 INFO L93 Difference]: Finished difference Result 144 states and 149 transitions. [2022-11-16 11:22:40,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-11-16 11:22:40,804 INFO L78 Accepts]: Start accepts. Automaton has has 73 states, 73 states have (on average 2.26027397260274) internal successors, (165), 73 states have internal predecessors, (165), 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 71 [2022-11-16 11:22:40,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:22:40,804 INFO L225 Difference]: With dead ends: 144 [2022-11-16 11:22:40,804 INFO L226 Difference]: Without dead ends: 144 [2022-11-16 11:22:40,806 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 103 SyntacticMatches, 7 SemanticMatches, 95 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 2137 ImplicationChecksByTransitivity, 106.7s TimeCoverageRelationStatistics Valid=635, Invalid=7906, Unknown=31, NotChecked=740, Total=9312 [2022-11-16 11:22:40,806 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 205 mSDsluCounter, 1473 mSDsCounter, 0 mSdLazyCounter, 778 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 1510 SdHoareTripleChecker+Invalid, 1666 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 778 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 865 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-11-16 11:22:40,807 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 1510 Invalid, 1666 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 778 Invalid, 0 Unknown, 865 Unchecked, 1.1s Time] [2022-11-16 11:22:40,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2022-11-16 11:22:40,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 139. [2022-11-16 11:22:40,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 134 states have (on average 1.0820895522388059) internal successors, (145), 138 states have internal predecessors, (145), 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-16 11:22:40,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 145 transitions. [2022-11-16 11:22:40,811 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 145 transitions. Word has length 71 [2022-11-16 11:22:40,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:22:40,811 INFO L495 AbstractCegarLoop]: Abstraction has 139 states and 145 transitions. [2022-11-16 11:22:40,812 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 73 states, 73 states have (on average 2.26027397260274) internal successors, (165), 73 states have internal predecessors, (165), 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-16 11:22:40,812 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 145 transitions. [2022-11-16 11:22:40,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-11-16 11:22:40,812 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:22:40,813 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-11-16 11:22:40,819 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1477d683-49c0-4268-80c5-f632f093d93d/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2022-11-16 11:22:41,018 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1477d683-49c0-4268-80c5-f632f093d93d/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:22:41,019 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-11-16 11:22:41,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:22:41,019 INFO L85 PathProgramCache]: Analyzing trace with hash 261816644, now seen corresponding path program 2 times [2022-11-16 11:22:41,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:22:41,020 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641561125] [2022-11-16 11:22:41,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:22:41,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:22:41,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:22:43,307 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-11-16 11:22:43,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:22:43,308 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [641561125] [2022-11-16 11:22:43,308 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [641561125] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:22:43,308 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1167508877] [2022-11-16 11:22:43,308 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-16 11:22:43,308 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:22:43,308 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1477d683-49c0-4268-80c5-f632f093d93d/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:22:43,315 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1477d683-49c0-4268-80c5-f632f093d93d/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:22:43,338 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1477d683-49c0-4268-80c5-f632f093d93d/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-11-16 11:22:43,585 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-16 11:22:43,585 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 11:22:43,589 INFO L263 TraceCheckSpWp]: Trace formula consists of 448 conjuncts, 92 conjunts are in the unsatisfiable core [2022-11-16 11:22:43,592 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:22:43,789 INFO L321 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2022-11-16 11:22:43,790 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 44 [2022-11-16 11:22:44,175 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-16 11:22:45,218 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-16 11:22:45,218 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 1 case distinctions, treesize of input 60 treesize of output 59 [2022-11-16 11:22:45,253 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-16 11:22:45,253 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 45 treesize of output 35 [2022-11-16 11:22:45,991 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-11-16 11:22:45,992 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 93 treesize of output 80 [2022-11-16 11:22:47,892 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:22:47,892 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 91 treesize of output 73 [2022-11-16 11:22:49,175 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-11-16 11:22:49,175 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:22:51,340 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:22:51,340 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 39 treesize of output 39 [2022-11-16 11:22:51,387 INFO L321 Elim1Store]: treesize reduction 12, result has 66.7 percent of original size [2022-11-16 11:22:51,387 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 2 case distinctions, treesize of input 63 treesize of output 73 [2022-11-16 11:22:51,407 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:22:51,407 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 117 treesize of output 107 [2022-11-16 11:22:51,415 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 86 treesize of output 82 [2022-11-16 11:23:42,145 WARN L233 SmtUtils]: Spent 50.23s on a formula simplification. DAG size of input: 55 DAG size of output: 35 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 11:24:06,045 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-11-16 11:24:06,045 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1167508877] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 11:24:06,046 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 11:24:06,046 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 24, 24] total 62 [2022-11-16 11:24:06,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061476662] [2022-11-16 11:24:06,046 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 11:24:06,047 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 63 states [2022-11-16 11:24:06,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:24:06,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2022-11-16 11:24:06,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=211, Invalid=3685, Unknown=10, NotChecked=0, Total=3906 [2022-11-16 11:24:06,048 INFO L87 Difference]: Start difference. First operand 139 states and 145 transitions. Second operand has 63 states, 62 states have (on average 2.7580645161290325) internal successors, (171), 63 states have internal predecessors, (171), 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-16 11:24:11,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:24:11,551 INFO L93 Difference]: Finished difference Result 141 states and 146 transitions. [2022-11-16 11:24:11,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-11-16 11:24:11,551 INFO L78 Accepts]: Start accepts. Automaton has has 63 states, 62 states have (on average 2.7580645161290325) internal successors, (171), 63 states have internal predecessors, (171), 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 72 [2022-11-16 11:24:11,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:24:11,552 INFO L225 Difference]: With dead ends: 141 [2022-11-16 11:24:11,552 INFO L226 Difference]: Without dead ends: 90 [2022-11-16 11:24:11,553 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 107 SyntacticMatches, 5 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1418 ImplicationChecksByTransitivity, 84.2s TimeCoverageRelationStatistics Valid=481, Invalid=6481, Unknown=10, NotChecked=0, Total=6972 [2022-11-16 11:24:11,554 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 184 mSDsluCounter, 1021 mSDsCounter, 0 mSdLazyCounter, 591 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 1052 SdHoareTripleChecker+Invalid, 1306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 591 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 705 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-16 11:24:11,554 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 1052 Invalid, 1306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 591 Invalid, 0 Unknown, 705 Unchecked, 0.9s Time] [2022-11-16 11:24:11,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2022-11-16 11:24:11,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2022-11-16 11:24:11,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 85 states have (on average 1.0941176470588236) internal successors, (93), 89 states have internal predecessors, (93), 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-16 11:24:11,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 93 transitions. [2022-11-16 11:24:11,557 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 93 transitions. Word has length 72 [2022-11-16 11:24:11,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:24:11,558 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 93 transitions. [2022-11-16 11:24:11,558 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 63 states, 62 states have (on average 2.7580645161290325) internal successors, (171), 63 states have internal predecessors, (171), 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-16 11:24:11,558 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 93 transitions. [2022-11-16 11:24:11,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-11-16 11:24:11,559 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:24:11,559 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:24:11,565 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1477d683-49c0-4268-80c5-f632f093d93d/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2022-11-16 11:24:11,765 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1477d683-49c0-4268-80c5-f632f093d93d/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2022-11-16 11:24:11,765 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-11-16 11:24:11,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:24:11,766 INFO L85 PathProgramCache]: Analyzing trace with hash 683637232, now seen corresponding path program 3 times [2022-11-16 11:24:11,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:24:11,766 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872818955] [2022-11-16 11:24:11,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:24:11,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:24:11,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:24:11,899 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 20 proven. 10 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-11-16 11:24:11,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:24:11,899 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872818955] [2022-11-16 11:24:11,899 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1872818955] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:24:11,899 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1013060442] [2022-11-16 11:24:11,900 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-16 11:24:11,900 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:24:11,900 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1477d683-49c0-4268-80c5-f632f093d93d/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:24:11,903 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1477d683-49c0-4268-80c5-f632f093d93d/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:24:11,930 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1477d683-49c0-4268-80c5-f632f093d93d/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-11-16 11:24:12,599 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-11-16 11:24:12,599 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 11:24:12,603 INFO L263 TraceCheckSpWp]: Trace formula consists of 523 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-16 11:24:12,605 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:24:12,676 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-11-16 11:24:12,676 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 11:24:12,676 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1013060442] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:24:12,676 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-16 11:24:12,676 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 6 [2022-11-16 11:24:12,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10556009] [2022-11-16 11:24:12,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:24:12,677 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-16 11:24:12,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:24:12,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 11:24:12,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-11-16 11:24:12,677 INFO L87 Difference]: Start difference. First operand 90 states and 93 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 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-16 11:24:12,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:24:12,693 INFO L93 Difference]: Finished difference Result 21 states and 20 transitions. [2022-11-16 11:24:12,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 11:24:12,694 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 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 80 [2022-11-16 11:24:12,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:24:12,694 INFO L225 Difference]: With dead ends: 21 [2022-11-16 11:24:12,694 INFO L226 Difference]: Without dead ends: 0 [2022-11-16 11:24:12,695 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-11-16 11:24:12,695 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 0 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-16 11:24:12,695 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 32 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-16 11:24:12,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-11-16 11:24:12,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-11-16 11:24:12,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 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-16 11:24:12,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-11-16 11:24:12,696 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 80 [2022-11-16 11:24:12,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:24:12,696 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-11-16 11:24:12,696 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 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-16 11:24:12,696 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-11-16 11:24:12,697 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-11-16 11:24:12,699 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 21 remaining) [2022-11-16 11:24:12,699 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 21 remaining) [2022-11-16 11:24:12,700 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 21 remaining) [2022-11-16 11:24:12,700 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 21 remaining) [2022-11-16 11:24:12,700 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 21 remaining) [2022-11-16 11:24:12,700 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 21 remaining) [2022-11-16 11:24:12,700 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 21 remaining) [2022-11-16 11:24:12,700 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 21 remaining) [2022-11-16 11:24:12,700 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 21 remaining) [2022-11-16 11:24:12,700 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 21 remaining) [2022-11-16 11:24:12,701 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 21 remaining) [2022-11-16 11:24:12,701 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 21 remaining) [2022-11-16 11:24:12,701 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 21 remaining) [2022-11-16 11:24:12,701 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 21 remaining) [2022-11-16 11:24:12,701 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 21 remaining) [2022-11-16 11:24:12,701 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 21 remaining) [2022-11-16 11:24:12,701 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE (4 of 21 remaining) [2022-11-16 11:24:12,701 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE (3 of 21 remaining) [2022-11-16 11:24:12,701 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE (2 of 21 remaining) [2022-11-16 11:24:12,702 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK (1 of 21 remaining) [2022-11-16 11:24:12,702 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK (0 of 21 remaining) [2022-11-16 11:24:12,712 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1477d683-49c0-4268-80c5-f632f093d93d/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-11-16 11:24:12,910 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1477d683-49c0-4268-80c5-f632f093d93d/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:24:12,913 INFO L444 BasicCegarLoop]: Path program histogram: [3, 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-16 11:24:12,915 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-16 11:24:12,917 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 11:24:12 BoogieIcfgContainer [2022-11-16 11:24:12,918 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-16 11:24:12,918 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-16 11:24:12,918 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-16 11:24:12,918 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-16 11:24:12,919 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 11:12:56" (3/4) ... [2022-11-16 11:24:12,921 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-11-16 11:24:12,930 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 18 nodes and edges [2022-11-16 11:24:12,930 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2022-11-16 11:24:12,931 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2022-11-16 11:24:12,931 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-16 11:24:12,979 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1477d683-49c0-4268-80c5-f632f093d93d/bin/uautomizer-tPACEb0tL8/witness.graphml [2022-11-16 11:24:12,979 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-16 11:24:12,980 INFO L158 Benchmark]: Toolchain (without parser) took 677607.71ms. Allocated memory was 90.2MB in the beginning and 847.2MB in the end (delta: 757.1MB). Free memory was 52.0MB in the beginning and 539.7MB in the end (delta: -487.7MB). Peak memory consumption was 268.4MB. Max. memory is 16.1GB. [2022-11-16 11:24:12,980 INFO L158 Benchmark]: CDTParser took 0.32ms. Allocated memory is still 90.2MB. Free memory is still 69.5MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-16 11:24:12,980 INFO L158 Benchmark]: CACSL2BoogieTranslator took 576.18ms. Allocated memory is still 90.2MB. Free memory was 51.8MB in the beginning and 59.0MB in the end (delta: -7.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-11-16 11:24:12,981 INFO L158 Benchmark]: Boogie Procedure Inliner took 83.77ms. Allocated memory is still 90.2MB. Free memory was 59.0MB in the beginning and 56.6MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-16 11:24:12,981 INFO L158 Benchmark]: Boogie Preprocessor took 66.55ms. Allocated memory is still 90.2MB. Free memory was 56.6MB in the beginning and 55.1MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-16 11:24:12,981 INFO L158 Benchmark]: RCFGBuilder took 649.20ms. Allocated memory is still 90.2MB. Free memory was 54.8MB in the beginning and 38.2MB in the end (delta: 16.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-11-16 11:24:12,981 INFO L158 Benchmark]: TraceAbstraction took 676162.98ms. Allocated memory was 90.2MB in the beginning and 847.2MB in the end (delta: 757.1MB). Free memory was 37.6MB in the beginning and 542.9MB in the end (delta: -505.3MB). Peak memory consumption was 253.7MB. Max. memory is 16.1GB. [2022-11-16 11:24:12,981 INFO L158 Benchmark]: Witness Printer took 61.55ms. Allocated memory is still 847.2MB. Free memory was 542.9MB in the beginning and 539.7MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-16 11:24:12,992 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.32ms. Allocated memory is still 90.2MB. Free memory is still 69.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 576.18ms. Allocated memory is still 90.2MB. Free memory was 51.8MB in the beginning and 59.0MB in the end (delta: -7.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 83.77ms. Allocated memory is still 90.2MB. Free memory was 59.0MB in the beginning and 56.6MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 66.55ms. Allocated memory is still 90.2MB. Free memory was 56.6MB in the beginning and 55.1MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 649.20ms. Allocated memory is still 90.2MB. Free memory was 54.8MB in the beginning and 38.2MB in the end (delta: 16.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 676162.98ms. Allocated memory was 90.2MB in the beginning and 847.2MB in the end (delta: 757.1MB). Free memory was 37.6MB in the beginning and 542.9MB in the end (delta: -505.3MB). Peak memory consumption was 253.7MB. Max. memory is 16.1GB. * Witness Printer took 61.55ms. Allocated memory is still 847.2MB. Free memory was 542.9MB in the beginning and 539.7MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 595]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 595]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 595]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 630]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 613]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 64 locations, 21 error locations. Started 1 CEGAR loops. OverallTime: 676.0s, OverallIterations: 34, TraceHistogramMax: 3, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 57.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 11522 SdHoareTripleChecker+Valid, 10.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 11522 mSDsluCounter, 13028 SdHoareTripleChecker+Invalid, 8.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 5232 IncrementalHoareTripleChecker+Unchecked, 11521 mSDsCounter, 299 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 11078 IncrementalHoareTripleChecker+Invalid, 16609 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 299 mSolverCounterUnsat, 1507 mSDtfsCounter, 11078 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2624 GetRequests, 1462 SyntacticMatches, 72 SemanticMatches, 1090 ConstructedPredicates, 28 IntricatePredicates, 0 DeprecatedPredicates, 14205 ImplicationChecksByTransitivity, 258.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=139occurred in iteration=32, InterpolantAutomatonStates: 504, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 34 MinimizatonAttempts, 678 StatesRemovedByMinimization, 27 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.5s SsaConstructionTime, 2.0s SatisfiabilityAnalysisTime, 608.4s InterpolantComputationTime, 2465 NumberOfCodeBlocks, 2434 NumberOfCodeBlocksAsserted, 63 NumberOfCheckSat, 3198 ConstructedInterpolants, 361 QuantifiedInterpolants, 61212 SizeOfPredicates, 447 NumberOfNonLiveVariables, 7045 ConjunctsInSsa, 1066 ConjunctsInUnsatCore, 71 InterpolantComputations, 18 PerfectInterpolantSequences, 873/1634 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 21 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2022-11-16 11:24:13,157 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1477d683-49c0-4268-80c5-f632f093d93d/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE