./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-simple/sll2n_insert_equal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version b5237d83 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6683ff47-d74d-4eab-b0ef-b08aeaf9387f/bin/uautomizer-vX5HgA9Q3a/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6683ff47-d74d-4eab-b0ef-b08aeaf9387f/bin/uautomizer-vX5HgA9Q3a/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6683ff47-d74d-4eab-b0ef-b08aeaf9387f/bin/uautomizer-vX5HgA9Q3a/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6683ff47-d74d-4eab-b0ef-b08aeaf9387f/bin/uautomizer-vX5HgA9Q3a/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-simple/sll2n_insert_equal.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6683ff47-d74d-4eab-b0ef-b08aeaf9387f/bin/uautomizer-vX5HgA9Q3a/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6683ff47-d74d-4eab-b0ef-b08aeaf9387f/bin/uautomizer-vX5HgA9Q3a --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 43bf83586090da08f52ccb7b612d2451c8f1efe9c820d873134ac51350c022e3 --- 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-b5237d8 [2022-11-21 17:09:25,885 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-21 17:09:25,888 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-21 17:09:25,935 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-21 17:09:25,937 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-21 17:09:25,941 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-21 17:09:25,944 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-21 17:09:25,947 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-21 17:09:25,950 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-21 17:09:25,956 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-21 17:09:25,957 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-21 17:09:25,958 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-21 17:09:25,959 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-21 17:09:25,960 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-21 17:09:25,961 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-21 17:09:25,964 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-21 17:09:25,966 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-21 17:09:25,967 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-21 17:09:25,969 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-21 17:09:25,976 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-21 17:09:25,978 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-21 17:09:25,982 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-21 17:09:25,983 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-21 17:09:25,984 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-21 17:09:25,993 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-21 17:09:25,995 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-21 17:09:25,995 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-21 17:09:25,996 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-21 17:09:25,998 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-21 17:09:26,000 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-21 17:09:26,001 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-21 17:09:26,002 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-21 17:09:26,004 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-21 17:09:26,005 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-21 17:09:26,006 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-21 17:09:26,007 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-21 17:09:26,008 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-21 17:09:26,008 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-21 17:09:26,008 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-21 17:09:26,010 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-21 17:09:26,011 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-21 17:09:26,012 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6683ff47-d74d-4eab-b0ef-b08aeaf9387f/bin/uautomizer-vX5HgA9Q3a/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-11-21 17:09:26,059 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-21 17:09:26,059 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-21 17:09:26,060 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-21 17:09:26,060 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-21 17:09:26,061 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-21 17:09:26,062 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-21 17:09:26,062 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-21 17:09:26,063 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-21 17:09:26,063 INFO L138 SettingsManager]: * Use SBE=true [2022-11-21 17:09:26,063 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-21 17:09:26,064 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-21 17:09:26,065 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-21 17:09:26,065 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-21 17:09:26,065 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-21 17:09:26,065 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-21 17:09:26,066 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-21 17:09:26,066 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-21 17:09:26,066 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-21 17:09:26,066 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-21 17:09:26,066 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-21 17:09:26,067 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-21 17:09:26,067 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-21 17:09:26,067 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-21 17:09:26,067 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-21 17:09:26,068 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-21 17:09:26,068 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-21 17:09:26,068 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-21 17:09:26,068 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-21 17:09:26,069 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-21 17:09:26,069 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-21 17:09:26,070 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_6683ff47-d74d-4eab-b0ef-b08aeaf9387f/bin/uautomizer-vX5HgA9Q3a/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_6683ff47-d74d-4eab-b0ef-b08aeaf9387f/bin/uautomizer-vX5HgA9Q3a 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 -> 43bf83586090da08f52ccb7b612d2451c8f1efe9c820d873134ac51350c022e3 [2022-11-21 17:09:26,392 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-21 17:09:26,417 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-21 17:09:26,420 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-21 17:09:26,421 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-21 17:09:26,422 INFO L275 PluginConnector]: CDTParser initialized [2022-11-21 17:09:26,424 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6683ff47-d74d-4eab-b0ef-b08aeaf9387f/bin/uautomizer-vX5HgA9Q3a/../../sv-benchmarks/c/list-simple/sll2n_insert_equal.i [2022-11-21 17:09:29,552 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-21 17:09:29,837 INFO L351 CDTParser]: Found 1 translation units. [2022-11-21 17:09:29,838 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6683ff47-d74d-4eab-b0ef-b08aeaf9387f/sv-benchmarks/c/list-simple/sll2n_insert_equal.i [2022-11-21 17:09:29,865 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6683ff47-d74d-4eab-b0ef-b08aeaf9387f/bin/uautomizer-vX5HgA9Q3a/data/56a3a8ebf/3d8f9c3e346341a6b4867b4ba66db0db/FLAGc195e25ca [2022-11-21 17:09:29,881 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6683ff47-d74d-4eab-b0ef-b08aeaf9387f/bin/uautomizer-vX5HgA9Q3a/data/56a3a8ebf/3d8f9c3e346341a6b4867b4ba66db0db [2022-11-21 17:09:29,884 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-21 17:09:29,886 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-21 17:09:29,887 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-21 17:09:29,888 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-21 17:09:29,892 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-21 17:09:29,893 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 05:09:29" (1/1) ... [2022-11-21 17:09:29,894 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@15fed545 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:09:29, skipping insertion in model container [2022-11-21 17:09:29,894 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 05:09:29" (1/1) ... [2022-11-21 17:09:29,902 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-21 17:09:29,954 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-21 17:09:30,318 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6683ff47-d74d-4eab-b0ef-b08aeaf9387f/sv-benchmarks/c/list-simple/sll2n_insert_equal.i[24301,24314] [2022-11-21 17:09:30,325 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-21 17:09:30,346 INFO L203 MainTranslator]: Completed pre-run [2022-11-21 17:09:30,435 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6683ff47-d74d-4eab-b0ef-b08aeaf9387f/sv-benchmarks/c/list-simple/sll2n_insert_equal.i[24301,24314] [2022-11-21 17:09:30,441 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-21 17:09:30,479 INFO L208 MainTranslator]: Completed translation [2022-11-21 17:09:30,480 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:09:30 WrapperNode [2022-11-21 17:09:30,481 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-21 17:09:30,484 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-21 17:09:30,484 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-21 17:09:30,484 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-21 17:09:30,493 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:09:30" (1/1) ... [2022-11-21 17:09:30,531 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:09:30" (1/1) ... [2022-11-21 17:09:30,565 INFO L138 Inliner]: procedures = 127, calls = 32, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 122 [2022-11-21 17:09:30,567 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-21 17:09:30,568 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-21 17:09:30,568 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-21 17:09:30,568 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-21 17:09:30,579 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:09:30" (1/1) ... [2022-11-21 17:09:30,580 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:09:30" (1/1) ... [2022-11-21 17:09:30,599 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:09:30" (1/1) ... [2022-11-21 17:09:30,600 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:09:30" (1/1) ... [2022-11-21 17:09:30,607 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:09:30" (1/1) ... [2022-11-21 17:09:30,622 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:09:30" (1/1) ... [2022-11-21 17:09:30,625 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:09:30" (1/1) ... [2022-11-21 17:09:30,633 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:09:30" (1/1) ... [2022-11-21 17:09:30,642 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-21 17:09:30,643 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-21 17:09:30,643 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-21 17:09:30,643 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-21 17:09:30,644 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:09:30" (1/1) ... [2022-11-21 17:09:30,652 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-21 17:09:30,666 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6683ff47-d74d-4eab-b0ef-b08aeaf9387f/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 17:09:30,679 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6683ff47-d74d-4eab-b0ef-b08aeaf9387f/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-21 17:09:30,710 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6683ff47-d74d-4eab-b0ef-b08aeaf9387f/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-21 17:09:30,735 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-21 17:09:30,736 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-21 17:09:30,736 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2022-11-21 17:09:30,736 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2022-11-21 17:09:30,736 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-21 17:09:30,736 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-21 17:09:30,737 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-21 17:09:30,737 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-21 17:09:30,737 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-21 17:09:30,737 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-21 17:09:30,737 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-11-21 17:09:30,738 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-21 17:09:30,738 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-21 17:09:30,738 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-21 17:09:30,978 INFO L235 CfgBuilder]: Building ICFG [2022-11-21 17:09:30,980 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-21 17:09:31,520 INFO L276 CfgBuilder]: Performing block encoding [2022-11-21 17:09:31,540 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-21 17:09:31,540 INFO L300 CfgBuilder]: Removed 4 assume(true) statements. [2022-11-21 17:09:31,543 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 05:09:31 BoogieIcfgContainer [2022-11-21 17:09:31,543 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-21 17:09:31,546 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-21 17:09:31,546 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-21 17:09:31,550 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-21 17:09:31,550 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.11 05:09:29" (1/3) ... [2022-11-21 17:09:31,551 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56dbb77a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 05:09:31, skipping insertion in model container [2022-11-21 17:09:31,551 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:09:30" (2/3) ... [2022-11-21 17:09:31,551 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56dbb77a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 05:09:31, skipping insertion in model container [2022-11-21 17:09:31,551 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 05:09:31" (3/3) ... [2022-11-21 17:09:31,555 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2n_insert_equal.i [2022-11-21 17:09:31,577 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-21 17:09:31,579 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 31 error locations. [2022-11-21 17:09:31,656 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-21 17:09:31,664 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;@cb50a35, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-21 17:09:31,664 INFO L358 AbstractCegarLoop]: Starting to check reachability of 31 error locations. [2022-11-21 17:09:31,669 INFO L276 IsEmpty]: Start isEmpty. Operand has 82 states, 47 states have (on average 1.9148936170212767) internal successors, (90), 78 states have internal predecessors, (90), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-21 17:09:31,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-21 17:09:31,677 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 17:09:31,677 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-21 17:09:31,678 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-11-21 17:09:31,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:09:31,689 INFO L85 PathProgramCache]: Analyzing trace with hash 1813843193, now seen corresponding path program 1 times [2022-11-21 17:09:31,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:09:31,697 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010533935] [2022-11-21 17:09:31,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:09:31,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:09:31,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:09:31,952 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-21 17:09:31,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:09:31,953 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010533935] [2022-11-21 17:09:31,954 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1010533935] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 17:09:31,954 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 17:09:31,954 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-21 17:09:31,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289345337] [2022-11-21 17:09:31,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 17:09:31,962 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 17:09:31,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:09:31,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 17:09:31,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 17:09:31,999 INFO L87 Difference]: Start difference. First operand has 82 states, 47 states have (on average 1.9148936170212767) internal successors, (90), 78 states have internal predecessors, (90), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:09:32,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 17:09:32,111 INFO L93 Difference]: Finished difference Result 80 states and 87 transitions. [2022-11-21 17:09:32,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 17:09:32,114 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-11-21 17:09:32,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 17:09:32,123 INFO L225 Difference]: With dead ends: 80 [2022-11-21 17:09:32,123 INFO L226 Difference]: Without dead ends: 77 [2022-11-21 17:09:32,125 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-21 17:09:32,129 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 8 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 17:09:32,130 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 126 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 17:09:32,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2022-11-21 17:09:32,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2022-11-21 17:09:32,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 45 states have (on average 1.7555555555555555) internal successors, (79), 73 states have internal predecessors, (79), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-21 17:09:32,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 83 transitions. [2022-11-21 17:09:32,186 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 83 transitions. Word has length 7 [2022-11-21 17:09:32,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 17:09:32,187 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 83 transitions. [2022-11-21 17:09:32,187 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:09:32,187 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 83 transitions. [2022-11-21 17:09:32,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-21 17:09:32,188 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 17:09:32,188 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-21 17:09:32,188 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-21 17:09:32,188 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-11-21 17:09:32,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:09:32,189 INFO L85 PathProgramCache]: Analyzing trace with hash 1813843194, now seen corresponding path program 1 times [2022-11-21 17:09:32,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:09:32,190 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915565076] [2022-11-21 17:09:32,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:09:32,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:09:32,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:09:32,381 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-21 17:09:32,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:09:32,382 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1915565076] [2022-11-21 17:09:32,382 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1915565076] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 17:09:32,382 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 17:09:32,382 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-21 17:09:32,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004886524] [2022-11-21 17:09:32,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 17:09:32,384 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 17:09:32,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:09:32,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 17:09:32,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 17:09:32,385 INFO L87 Difference]: Start difference. First operand 77 states and 83 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:09:32,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 17:09:32,495 INFO L93 Difference]: Finished difference Result 75 states and 81 transitions. [2022-11-21 17:09:32,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 17:09:32,499 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-11-21 17:09:32,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 17:09:32,500 INFO L225 Difference]: With dead ends: 75 [2022-11-21 17:09:32,500 INFO L226 Difference]: Without dead ends: 75 [2022-11-21 17:09:32,500 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-21 17:09:32,502 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 4 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 17:09:32,502 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 126 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 17:09:32,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2022-11-21 17:09:32,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2022-11-21 17:09:32,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 45 states have (on average 1.711111111111111) internal successors, (77), 71 states have internal predecessors, (77), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-21 17:09:32,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 81 transitions. [2022-11-21 17:09:32,511 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 81 transitions. Word has length 7 [2022-11-21 17:09:32,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 17:09:32,511 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 81 transitions. [2022-11-21 17:09:32,511 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:09:32,512 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 81 transitions. [2022-11-21 17:09:32,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-21 17:09:32,512 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 17:09:32,512 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 17:09:32,513 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-21 17:09:32,513 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-11-21 17:09:32,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:09:32,514 INFO L85 PathProgramCache]: Analyzing trace with hash 649951808, now seen corresponding path program 1 times [2022-11-21 17:09:32,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:09:32,514 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765705957] [2022-11-21 17:09:32,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:09:32,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:09:32,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:09:32,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-21 17:09:32,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:09:32,833 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-21 17:09:32,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:09:32,835 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765705957] [2022-11-21 17:09:32,835 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1765705957] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 17:09:32,835 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 17:09:32,837 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-21 17:09:32,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178080446] [2022-11-21 17:09:32,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 17:09:32,838 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-21 17:09:32,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:09:32,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-21 17:09:32,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-21 17:09:32,841 INFO L87 Difference]: Start difference. First operand 75 states and 81 transitions. Second operand has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-21 17:09:33,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 17:09:33,143 INFO L93 Difference]: Finished difference Result 79 states and 88 transitions. [2022-11-21 17:09:33,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-21 17:09:33,144 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-11-21 17:09:33,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 17:09:33,150 INFO L225 Difference]: With dead ends: 79 [2022-11-21 17:09:33,150 INFO L226 Difference]: Without dead ends: 79 [2022-11-21 17:09:33,155 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-11-21 17:09:33,156 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 11 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 293 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-21 17:09:33,159 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 293 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-21 17:09:33,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2022-11-21 17:09:33,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 74. [2022-11-21 17:09:33,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 45 states have (on average 1.6888888888888889) internal successors, (76), 70 states have internal predecessors, (76), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-21 17:09:33,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 80 transitions. [2022-11-21 17:09:33,176 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 80 transitions. Word has length 13 [2022-11-21 17:09:33,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 17:09:33,176 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 80 transitions. [2022-11-21 17:09:33,177 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-21 17:09:33,178 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 80 transitions. [2022-11-21 17:09:33,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-21 17:09:33,179 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 17:09:33,179 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 17:09:33,180 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-21 17:09:33,180 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-11-21 17:09:33,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:09:33,181 INFO L85 PathProgramCache]: Analyzing trace with hash 649951809, now seen corresponding path program 1 times [2022-11-21 17:09:33,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:09:33,182 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12296802] [2022-11-21 17:09:33,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:09:33,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:09:33,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:09:33,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-21 17:09:33,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:09:33,625 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-21 17:09:33,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:09:33,626 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12296802] [2022-11-21 17:09:33,626 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [12296802] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 17:09:33,627 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 17:09:33,628 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-21 17:09:33,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585287344] [2022-11-21 17:09:33,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 17:09:33,629 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-21 17:09:33,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:09:33,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-21 17:09:33,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-21 17:09:33,631 INFO L87 Difference]: Start difference. First operand 74 states and 80 transitions. Second operand has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-21 17:09:33,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 17:09:33,887 INFO L93 Difference]: Finished difference Result 78 states and 87 transitions. [2022-11-21 17:09:33,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-21 17:09:33,888 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-11-21 17:09:33,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 17:09:33,889 INFO L225 Difference]: With dead ends: 78 [2022-11-21 17:09:33,889 INFO L226 Difference]: Without dead ends: 78 [2022-11-21 17:09:33,890 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-11-21 17:09:33,891 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 9 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 309 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-21 17:09:33,892 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 309 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-21 17:09:33,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2022-11-21 17:09:33,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 73. [2022-11-21 17:09:33,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 45 states have (on average 1.6666666666666667) internal successors, (75), 69 states have internal predecessors, (75), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-21 17:09:33,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 79 transitions. [2022-11-21 17:09:33,905 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 79 transitions. Word has length 13 [2022-11-21 17:09:33,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 17:09:33,919 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 79 transitions. [2022-11-21 17:09:33,919 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-21 17:09:33,919 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 79 transitions. [2022-11-21 17:09:33,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-21 17:09:33,920 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 17:09:33,920 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 17:09:33,920 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-21 17:09:33,921 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-11-21 17:09:33,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:09:33,921 INFO L85 PathProgramCache]: Analyzing trace with hash 87749440, now seen corresponding path program 1 times [2022-11-21 17:09:33,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:09:33,922 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004723373] [2022-11-21 17:09:33,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:09:33,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:09:33,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:09:34,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-11-21 17:09:34,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:09:34,044 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-21 17:09:34,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:09:34,045 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004723373] [2022-11-21 17:09:34,045 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1004723373] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 17:09:34,045 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 17:09:34,045 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-21 17:09:34,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896641132] [2022-11-21 17:09:34,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 17:09:34,048 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-21 17:09:34,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:09:34,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-21 17:09:34,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-21 17:09:34,050 INFO L87 Difference]: Start difference. First operand 73 states and 79 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-21 17:09:34,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 17:09:34,151 INFO L93 Difference]: Finished difference Result 79 states and 86 transitions. [2022-11-21 17:09:34,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-21 17:09:34,153 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-11-21 17:09:34,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 17:09:34,159 INFO L225 Difference]: With dead ends: 79 [2022-11-21 17:09:34,159 INFO L226 Difference]: Without dead ends: 79 [2022-11-21 17:09:34,160 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-21 17:09:34,166 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 4 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 17:09:34,166 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 186 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 17:09:34,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2022-11-21 17:09:34,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 74. [2022-11-21 17:09:34,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 46 states have (on average 1.6521739130434783) internal successors, (76), 70 states have internal predecessors, (76), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-21 17:09:34,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 80 transitions. [2022-11-21 17:09:34,188 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 80 transitions. Word has length 15 [2022-11-21 17:09:34,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 17:09:34,188 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 80 transitions. [2022-11-21 17:09:34,189 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-21 17:09:34,189 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 80 transitions. [2022-11-21 17:09:34,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-21 17:09:34,190 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 17:09:34,190 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 17:09:34,191 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-21 17:09:34,191 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-11-21 17:09:34,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:09:34,192 INFO L85 PathProgramCache]: Analyzing trace with hash -847170750, now seen corresponding path program 1 times [2022-11-21 17:09:34,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:09:34,192 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145435489] [2022-11-21 17:09:34,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:09:34,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:09:34,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:09:34,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-21 17:09:34,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:09:34,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-21 17:09:34,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:09:34,373 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-21 17:09:34,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:09:34,374 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145435489] [2022-11-21 17:09:34,374 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1145435489] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 17:09:34,375 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2062602773] [2022-11-21 17:09:34,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:09:34,376 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 17:09:34,376 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6683ff47-d74d-4eab-b0ef-b08aeaf9387f/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 17:09:34,380 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6683ff47-d74d-4eab-b0ef-b08aeaf9387f/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 17:09:34,383 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6683ff47-d74d-4eab-b0ef-b08aeaf9387f/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-21 17:09:34,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:09:34,536 INFO L263 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-21 17:09:34,548 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 17:09:34,625 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 17:09:34,626 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 17:09:34,679 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-21 17:09:34,679 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2062602773] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 17:09:34,680 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 17:09:34,680 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 6 [2022-11-21 17:09:34,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145527605] [2022-11-21 17:09:34,680 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 17:09:34,681 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-21 17:09:34,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:09:34,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-21 17:09:34,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-21 17:09:34,684 INFO L87 Difference]: Start difference. First operand 74 states and 80 transitions. Second operand has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 5 states have internal predecessors, (31), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-11-21 17:09:34,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 17:09:34,796 INFO L93 Difference]: Finished difference Result 80 states and 87 transitions. [2022-11-21 17:09:34,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-21 17:09:34,798 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 5 states have internal predecessors, (31), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 28 [2022-11-21 17:09:34,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 17:09:34,800 INFO L225 Difference]: With dead ends: 80 [2022-11-21 17:09:34,800 INFO L226 Difference]: Without dead ends: 80 [2022-11-21 17:09:34,800 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 56 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-21 17:09:34,805 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 8 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 255 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 17:09:34,805 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 255 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 17:09:34,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-11-21 17:09:34,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2022-11-21 17:09:34,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 51 states have (on average 1.588235294117647) internal successors, (81), 75 states have internal predecessors, (81), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-21 17:09:34,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 87 transitions. [2022-11-21 17:09:34,822 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 87 transitions. Word has length 28 [2022-11-21 17:09:34,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 17:09:34,822 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 87 transitions. [2022-11-21 17:09:34,822 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 5 states have internal predecessors, (31), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-11-21 17:09:34,822 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 87 transitions. [2022-11-21 17:09:34,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-11-21 17:09:34,824 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 17:09:34,824 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 17:09:34,839 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6683ff47-d74d-4eab-b0ef-b08aeaf9387f/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-21 17:09:35,039 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6683ff47-d74d-4eab-b0ef-b08aeaf9387f/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 17:09:35,039 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-11-21 17:09:35,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:09:35,040 INFO L85 PathProgramCache]: Analyzing trace with hash 1562281600, now seen corresponding path program 2 times [2022-11-21 17:09:35,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:09:35,041 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239373254] [2022-11-21 17:09:35,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:09:35,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:09:35,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:09:35,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-21 17:09:35,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:09:35,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-21 17:09:35,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:09:35,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-11-21 17:09:35,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:09:35,882 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-11-21 17:09:35,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:09:35,883 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239373254] [2022-11-21 17:09:35,883 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [239373254] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 17:09:35,883 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 17:09:35,884 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-21 17:09:35,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692025365] [2022-11-21 17:09:35,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 17:09:35,887 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-21 17:09:35,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:09:35,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-21 17:09:35,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-21 17:09:35,888 INFO L87 Difference]: Start difference. First operand 80 states and 87 transitions. Second operand has 7 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-21 17:09:36,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 17:09:36,101 INFO L93 Difference]: Finished difference Result 88 states and 96 transitions. [2022-11-21 17:09:36,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-21 17:09:36,102 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 41 [2022-11-21 17:09:36,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 17:09:36,103 INFO L225 Difference]: With dead ends: 88 [2022-11-21 17:09:36,103 INFO L226 Difference]: Without dead ends: 88 [2022-11-21 17:09:36,104 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-11-21 17:09:36,106 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 109 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-21 17:09:36,107 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 136 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-21 17:09:36,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2022-11-21 17:09:36,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 76. [2022-11-21 17:09:36,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 51 states have (on average 1.5098039215686274) internal successors, (77), 71 states have internal predecessors, (77), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-21 17:09:36,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 83 transitions. [2022-11-21 17:09:36,128 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 83 transitions. Word has length 41 [2022-11-21 17:09:36,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 17:09:36,129 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 83 transitions. [2022-11-21 17:09:36,129 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-21 17:09:36,130 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 83 transitions. [2022-11-21 17:09:36,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-11-21 17:09:36,137 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 17:09:36,137 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 17:09:36,137 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-21 17:09:36,139 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-11-21 17:09:36,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:09:36,140 INFO L85 PathProgramCache]: Analyzing trace with hash 1562281601, now seen corresponding path program 1 times [2022-11-21 17:09:36,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:09:36,140 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843486057] [2022-11-21 17:09:36,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:09:36,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:09:36,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:09:36,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-21 17:09:36,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:09:36,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-21 17:09:36,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:09:37,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-11-21 17:09:37,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:09:37,199 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-21 17:09:37,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:09:37,200 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [843486057] [2022-11-21 17:09:37,200 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [843486057] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 17:09:37,200 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [116079806] [2022-11-21 17:09:37,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:09:37,201 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 17:09:37,201 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6683ff47-d74d-4eab-b0ef-b08aeaf9387f/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 17:09:37,202 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6683ff47-d74d-4eab-b0ef-b08aeaf9387f/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 17:09:37,228 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6683ff47-d74d-4eab-b0ef-b08aeaf9387f/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-21 17:09:37,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:09:37,397 INFO L263 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 26 conjunts are in the unsatisfiable core [2022-11-21 17:09:37,403 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 17:09:37,457 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-21 17:09:37,521 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 5 treesize of output 3 [2022-11-21 17:09:37,581 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_452 Int)) (= |c_#length| (store |c_old(#length)| |node_create_~temp~0#1.base| v_ArrVal_452))))) is different from true [2022-11-21 17:09:37,689 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:09:37,691 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 12 treesize of output 14 [2022-11-21 17:09:37,788 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 5 treesize of output 3 [2022-11-21 17:09:37,806 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_453 Int)) (= (store |c_old(#length)| |node_create_~temp~0#1.base| v_ArrVal_453) |c_#length|)))) is different from true [2022-11-21 17:09:37,909 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:09:37,911 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 12 treesize of output 14 [2022-11-21 17:09:38,010 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 5 treesize of output 3 [2022-11-21 17:09:38,025 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_454 Int)) (= (store |c_old(#length)| |node_create_~temp~0#1.base| v_ArrVal_454) |c_#length|)))) is different from true [2022-11-21 17:09:38,080 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:09:38,081 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 12 treesize of output 14 [2022-11-21 17:09:38,089 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 18 not checked. [2022-11-21 17:09:38,089 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 17:09:40,265 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [116079806] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 17:09:40,265 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-21 17:09:40,265 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 17 [2022-11-21 17:09:40,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950615157] [2022-11-21 17:09:40,266 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-21 17:09:40,266 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-11-21 17:09:40,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:09:40,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-11-21 17:09:40,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=225, Unknown=3, NotChecked=96, Total=380 [2022-11-21 17:09:40,267 INFO L87 Difference]: Start difference. First operand 76 states and 83 transitions. Second operand has 18 states, 16 states have (on average 3.8125) internal successors, (61), 16 states have internal predecessors, (61), 4 states have call successors, (4), 2 states have call predecessors, (4), 6 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-11-21 17:09:40,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 17:09:40,741 INFO L93 Difference]: Finished difference Result 84 states and 92 transitions. [2022-11-21 17:09:40,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-21 17:09:40,742 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 3.8125) internal successors, (61), 16 states have internal predecessors, (61), 4 states have call successors, (4), 2 states have call predecessors, (4), 6 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 41 [2022-11-21 17:09:40,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 17:09:40,743 INFO L225 Difference]: With dead ends: 84 [2022-11-21 17:09:40,743 INFO L226 Difference]: Without dead ends: 84 [2022-11-21 17:09:40,743 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=88, Invalid=341, Unknown=3, NotChecked=120, Total=552 [2022-11-21 17:09:40,744 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 255 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 255 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 432 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 195 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-21 17:09:40,744 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [255 Valid, 178 Invalid, 432 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 220 Invalid, 0 Unknown, 195 Unchecked, 0.3s Time] [2022-11-21 17:09:40,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2022-11-21 17:09:40,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 72. [2022-11-21 17:09:40,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 51 states have (on average 1.4313725490196079) internal successors, (73), 67 states have internal predecessors, (73), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-21 17:09:40,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 79 transitions. [2022-11-21 17:09:40,747 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 79 transitions. Word has length 41 [2022-11-21 17:09:40,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 17:09:40,748 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 79 transitions. [2022-11-21 17:09:40,748 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 3.8125) internal successors, (61), 16 states have internal predecessors, (61), 4 states have call successors, (4), 2 states have call predecessors, (4), 6 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-11-21 17:09:40,748 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 79 transitions. [2022-11-21 17:09:40,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-11-21 17:09:40,749 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 17:09:40,749 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 17:09:40,761 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6683ff47-d74d-4eab-b0ef-b08aeaf9387f/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-11-21 17:09:40,955 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6683ff47-d74d-4eab-b0ef-b08aeaf9387f/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 17:09:40,956 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-11-21 17:09:40,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:09:40,956 INFO L85 PathProgramCache]: Analyzing trace with hash 1665526433, now seen corresponding path program 1 times [2022-11-21 17:09:40,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:09:40,957 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878758943] [2022-11-21 17:09:40,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:09:40,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:09:40,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:09:41,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-21 17:09:41,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:09:41,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-21 17:09:41,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:09:41,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-11-21 17:09:41,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:09:41,895 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 18 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-21 17:09:41,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:09:41,895 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1878758943] [2022-11-21 17:09:41,895 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1878758943] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 17:09:41,896 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [182782260] [2022-11-21 17:09:41,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:09:41,896 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 17:09:41,896 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6683ff47-d74d-4eab-b0ef-b08aeaf9387f/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 17:09:41,898 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6683ff47-d74d-4eab-b0ef-b08aeaf9387f/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 17:09:41,925 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6683ff47-d74d-4eab-b0ef-b08aeaf9387f/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-21 17:09:42,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:09:42,083 INFO L263 TraceCheckSpWp]: Trace formula consists of 359 conjuncts, 41 conjunts are in the unsatisfiable core [2022-11-21 17:09:42,086 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 17:09:42,162 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-21 17:09:42,452 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 9 treesize of output 5 [2022-11-21 17:09:42,621 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int) (v_ArrVal_615 (Array Int Int))) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| (select |c_#valid| |node_create_~temp~0#1.base|))) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_615)))) is different from true [2022-11-21 17:09:42,675 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:09:42,676 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 16 treesize of output 18 [2022-11-21 17:09:42,707 INFO L321 Elim1Store]: treesize reduction 32, result has 36.0 percent of original size [2022-11-21 17:09:42,707 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 23 treesize of output 24 [2022-11-21 17:09:42,764 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-11-21 17:09:42,771 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 20 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 3 not checked. [2022-11-21 17:09:42,771 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 17:09:42,911 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [182782260] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 17:09:42,912 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-21 17:09:42,912 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 25 [2022-11-21 17:09:42,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262254992] [2022-11-21 17:09:42,912 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-21 17:09:42,913 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-11-21 17:09:42,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:09:42,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-11-21 17:09:42,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=572, Unknown=1, NotChecked=48, Total=702 [2022-11-21 17:09:42,914 INFO L87 Difference]: Start difference. First operand 72 states and 79 transitions. Second operand has 26 states, 23 states have (on average 2.5217391304347827) internal successors, (58), 22 states have internal predecessors, (58), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-11-21 17:09:43,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 17:09:43,867 INFO L93 Difference]: Finished difference Result 124 states and 137 transitions. [2022-11-21 17:09:43,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-21 17:09:43,868 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 23 states have (on average 2.5217391304347827) internal successors, (58), 22 states have internal predecessors, (58), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 44 [2022-11-21 17:09:43,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 17:09:43,869 INFO L225 Difference]: With dead ends: 124 [2022-11-21 17:09:43,869 INFO L226 Difference]: Without dead ends: 124 [2022-11-21 17:09:43,870 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 43 SyntacticMatches, 3 SemanticMatches, 35 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 257 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=199, Invalid=1064, Unknown=1, NotChecked=68, Total=1332 [2022-11-21 17:09:43,870 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 597 mSDsluCounter, 337 mSDsCounter, 0 mSdLazyCounter, 534 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 597 SdHoareTripleChecker+Valid, 374 SdHoareTripleChecker+Invalid, 626 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 534 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 73 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-21 17:09:43,871 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [597 Valid, 374 Invalid, 626 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 534 Invalid, 0 Unknown, 73 Unchecked, 0.6s Time] [2022-11-21 17:09:43,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2022-11-21 17:09:43,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 74. [2022-11-21 17:09:43,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 53 states have (on average 1.4528301886792452) internal successors, (77), 69 states have internal predecessors, (77), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-21 17:09:43,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 83 transitions. [2022-11-21 17:09:43,879 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 83 transitions. Word has length 44 [2022-11-21 17:09:43,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 17:09:43,879 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 83 transitions. [2022-11-21 17:09:43,880 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 23 states have (on average 2.5217391304347827) internal successors, (58), 22 states have internal predecessors, (58), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-11-21 17:09:43,880 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 83 transitions. [2022-11-21 17:09:43,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-11-21 17:09:43,881 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 17:09:43,882 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 17:09:43,897 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6683ff47-d74d-4eab-b0ef-b08aeaf9387f/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-21 17:09:44,098 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6683ff47-d74d-4eab-b0ef-b08aeaf9387f/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 17:09:44,098 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-11-21 17:09:44,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:09:44,099 INFO L85 PathProgramCache]: Analyzing trace with hash 1665526434, now seen corresponding path program 1 times [2022-11-21 17:09:44,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:09:44,099 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324266115] [2022-11-21 17:09:44,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:09:44,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:09:44,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:09:44,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-21 17:09:44,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:09:44,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-21 17:09:44,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:09:45,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-11-21 17:09:45,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:09:45,686 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 18 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-21 17:09:45,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:09:45,687 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324266115] [2022-11-21 17:09:45,687 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1324266115] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 17:09:45,687 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1789997852] [2022-11-21 17:09:45,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:09:45,687 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 17:09:45,688 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6683ff47-d74d-4eab-b0ef-b08aeaf9387f/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 17:09:45,692 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6683ff47-d74d-4eab-b0ef-b08aeaf9387f/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 17:09:45,719 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6683ff47-d74d-4eab-b0ef-b08aeaf9387f/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-21 17:09:45,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:09:45,905 INFO L263 TraceCheckSpWp]: Trace formula consists of 359 conjuncts, 64 conjunts are in the unsatisfiable core [2022-11-21 17:09:45,912 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 17:09:45,994 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-21 17:09:45,999 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-21 17:09:46,610 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 19 treesize of output 11 [2022-11-21 17:09:46,619 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-11-21 17:09:46,868 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int) (v_ArrVal_782 (Array Int Int)) (v_ArrVal_783 (Array Int Int))) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)) (= (store |c_old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| v_ArrVal_782) |c_#memory_$Pointer$.offset|) (= (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_783) |c_#memory_$Pointer$.base|))) is different from true [2022-11-21 17:09:46,934 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:09:46,935 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 23 treesize of output 23 [2022-11-21 17:09:46,943 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:09:46,944 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 25 treesize of output 25 [2022-11-21 17:09:46,958 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-11-21 17:09:46,958 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2022-11-21 17:09:46,964 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 18 treesize of output 13 [2022-11-21 17:09:47,041 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 24 treesize of output 12 [2022-11-21 17:09:47,045 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-11-21 17:09:47,163 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 20 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 3 not checked. [2022-11-21 17:09:47,163 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 17:09:48,431 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1789997852] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 17:09:48,431 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-21 17:09:48,432 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 31 [2022-11-21 17:09:48,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816019206] [2022-11-21 17:09:48,432 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-21 17:09:48,432 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-11-21 17:09:48,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:09:48,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-11-21 17:09:48,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=1085, Unknown=1, NotChecked=66, Total=1260 [2022-11-21 17:09:48,434 INFO L87 Difference]: Start difference. First operand 74 states and 83 transitions. Second operand has 32 states, 29 states have (on average 2.2758620689655173) internal successors, (66), 28 states have internal predecessors, (66), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-11-21 17:09:50,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 17:09:50,334 INFO L93 Difference]: Finished difference Result 114 states and 125 transitions. [2022-11-21 17:09:50,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-21 17:09:50,336 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 29 states have (on average 2.2758620689655173) internal successors, (66), 28 states have internal predecessors, (66), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 44 [2022-11-21 17:09:50,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 17:09:50,337 INFO L225 Difference]: With dead ends: 114 [2022-11-21 17:09:50,338 INFO L226 Difference]: Without dead ends: 114 [2022-11-21 17:09:50,339 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 34 SyntacticMatches, 3 SemanticMatches, 46 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 443 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=228, Invalid=1937, Unknown=1, NotChecked=90, Total=2256 [2022-11-21 17:09:50,340 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 302 mSDsluCounter, 583 mSDsCounter, 0 mSdLazyCounter, 866 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 302 SdHoareTripleChecker+Valid, 623 SdHoareTripleChecker+Invalid, 995 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 866 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 116 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-21 17:09:50,341 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [302 Valid, 623 Invalid, 995 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 866 Invalid, 0 Unknown, 116 Unchecked, 0.9s Time] [2022-11-21 17:09:50,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2022-11-21 17:09:50,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 74. [2022-11-21 17:09:50,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 53 states have (on average 1.4339622641509433) internal successors, (76), 69 states have internal predecessors, (76), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-21 17:09:50,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 82 transitions. [2022-11-21 17:09:50,346 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 82 transitions. Word has length 44 [2022-11-21 17:09:50,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 17:09:50,347 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 82 transitions. [2022-11-21 17:09:50,347 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 29 states have (on average 2.2758620689655173) internal successors, (66), 28 states have internal predecessors, (66), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-11-21 17:09:50,347 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 82 transitions. [2022-11-21 17:09:50,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-11-21 17:09:50,349 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 17:09:50,349 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 17:09:50,357 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6683ff47-d74d-4eab-b0ef-b08aeaf9387f/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-21 17:09:50,556 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6683ff47-d74d-4eab-b0ef-b08aeaf9387f/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 17:09:50,557 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-11-21 17:09:50,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:09:50,557 INFO L85 PathProgramCache]: Analyzing trace with hash 91710248, now seen corresponding path program 1 times [2022-11-21 17:09:50,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:09:50,557 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524550319] [2022-11-21 17:09:50,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:09:50,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:09:50,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:09:50,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-21 17:09:50,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:09:50,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-21 17:09:50,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:09:50,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-11-21 17:09:50,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:09:50,702 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-11-21 17:09:50,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:09:50,703 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524550319] [2022-11-21 17:09:50,703 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1524550319] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 17:09:50,703 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 17:09:50,703 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-21 17:09:50,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245353863] [2022-11-21 17:09:50,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 17:09:50,704 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-21 17:09:50,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:09:50,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-21 17:09:50,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-21 17:09:50,705 INFO L87 Difference]: Start difference. First operand 74 states and 82 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-21 17:09:50,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 17:09:50,771 INFO L93 Difference]: Finished difference Result 109 states and 119 transitions. [2022-11-21 17:09:50,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-21 17:09:50,772 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 45 [2022-11-21 17:09:50,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 17:09:50,775 INFO L225 Difference]: With dead ends: 109 [2022-11-21 17:09:50,775 INFO L226 Difference]: Without dead ends: 109 [2022-11-21 17:09:50,776 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-21 17:09:50,776 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 38 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 17:09:50,777 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 163 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 17:09:50,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2022-11-21 17:09:50,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 75. [2022-11-21 17:09:50,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 54 states have (on average 1.4259259259259258) internal successors, (77), 70 states have internal predecessors, (77), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-21 17:09:50,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 83 transitions. [2022-11-21 17:09:50,781 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 83 transitions. Word has length 45 [2022-11-21 17:09:50,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 17:09:50,781 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 83 transitions. [2022-11-21 17:09:50,781 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-21 17:09:50,782 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 83 transitions. [2022-11-21 17:09:50,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-11-21 17:09:50,787 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 17:09:50,787 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 17:09:50,787 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-21 17:09:50,788 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-11-21 17:09:50,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:09:50,788 INFO L85 PathProgramCache]: Analyzing trace with hash -1451944619, now seen corresponding path program 1 times [2022-11-21 17:09:50,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:09:50,789 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356985880] [2022-11-21 17:09:50,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:09:50,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:09:50,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:09:50,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-21 17:09:50,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:09:50,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-21 17:09:50,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:09:50,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-11-21 17:09:50,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:09:50,960 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-11-21 17:09:50,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:09:50,960 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356985880] [2022-11-21 17:09:50,961 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [356985880] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 17:09:50,961 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 17:09:50,961 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-21 17:09:50,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285519683] [2022-11-21 17:09:50,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 17:09:50,965 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-21 17:09:50,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:09:50,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-21 17:09:50,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-21 17:09:50,966 INFO L87 Difference]: Start difference. First operand 75 states and 83 transitions. Second operand has 7 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-21 17:09:51,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 17:09:51,128 INFO L93 Difference]: Finished difference Result 86 states and 95 transitions. [2022-11-21 17:09:51,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-21 17:09:51,128 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 46 [2022-11-21 17:09:51,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 17:09:51,129 INFO L225 Difference]: With dead ends: 86 [2022-11-21 17:09:51,129 INFO L226 Difference]: Without dead ends: 86 [2022-11-21 17:09:51,129 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-11-21 17:09:51,129 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 44 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 17:09:51,130 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 207 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 17:09:51,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2022-11-21 17:09:51,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 74. [2022-11-21 17:09:51,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 54 states have (on average 1.4074074074074074) internal successors, (76), 69 states have internal predecessors, (76), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-21 17:09:51,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 82 transitions. [2022-11-21 17:09:51,132 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 82 transitions. Word has length 46 [2022-11-21 17:09:51,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 17:09:51,133 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 82 transitions. [2022-11-21 17:09:51,133 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-21 17:09:51,133 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 82 transitions. [2022-11-21 17:09:51,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-11-21 17:09:51,133 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 17:09:51,133 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 17:09:51,134 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-21 17:09:51,134 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-11-21 17:09:51,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:09:51,134 INFO L85 PathProgramCache]: Analyzing trace with hash -1451944618, now seen corresponding path program 1 times [2022-11-21 17:09:51,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:09:51,135 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795375788] [2022-11-21 17:09:51,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:09:51,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:09:51,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:09:51,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-21 17:09:51,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:09:51,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-21 17:09:51,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:09:51,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-11-21 17:09:51,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:09:51,400 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-11-21 17:09:51,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:09:51,401 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795375788] [2022-11-21 17:09:51,401 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [795375788] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 17:09:51,401 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [520695896] [2022-11-21 17:09:51,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:09:51,402 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 17:09:51,402 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6683ff47-d74d-4eab-b0ef-b08aeaf9387f/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 17:09:51,403 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6683ff47-d74d-4eab-b0ef-b08aeaf9387f/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 17:09:51,428 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6683ff47-d74d-4eab-b0ef-b08aeaf9387f/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-21 17:09:51,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:09:51,633 INFO L263 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-21 17:09:51,641 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 17:09:51,702 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-11-21 17:09:51,702 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-21 17:09:51,703 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [520695896] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 17:09:51,703 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-21 17:09:51,703 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 6 [2022-11-21 17:09:51,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385989807] [2022-11-21 17:09:51,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 17:09:51,704 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-21 17:09:51,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:09:51,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-21 17:09:51,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-21 17:09:51,706 INFO L87 Difference]: Start difference. First operand 74 states and 82 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-21 17:09:51,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 17:09:51,730 INFO L93 Difference]: Finished difference Result 73 states and 80 transitions. [2022-11-21 17:09:51,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-21 17:09:51,731 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 46 [2022-11-21 17:09:51,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 17:09:51,732 INFO L225 Difference]: With dead ends: 73 [2022-11-21 17:09:51,732 INFO L226 Difference]: Without dead ends: 73 [2022-11-21 17:09:51,733 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 51 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-11-21 17:09:51,735 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 56 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-21 17:09:51,735 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 131 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-21 17:09:51,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2022-11-21 17:09:51,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2022-11-21 17:09:51,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 53 states have (on average 1.3962264150943395) internal successors, (74), 68 states have internal predecessors, (74), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-21 17:09:51,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 80 transitions. [2022-11-21 17:09:51,741 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 80 transitions. Word has length 46 [2022-11-21 17:09:51,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 17:09:51,742 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 80 transitions. [2022-11-21 17:09:51,742 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-21 17:09:51,742 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 80 transitions. [2022-11-21 17:09:51,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-11-21 17:09:51,744 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 17:09:51,744 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 17:09:51,760 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6683ff47-d74d-4eab-b0ef-b08aeaf9387f/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-21 17:09:51,951 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6683ff47-d74d-4eab-b0ef-b08aeaf9387f/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 17:09:51,951 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-11-21 17:09:51,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:09:51,952 INFO L85 PathProgramCache]: Analyzing trace with hash -2059192403, now seen corresponding path program 1 times [2022-11-21 17:09:51,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:09:51,952 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407015031] [2022-11-21 17:09:51,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:09:51,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:09:51,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:09:52,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-21 17:09:52,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:09:52,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-21 17:09:52,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:09:52,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-11-21 17:09:52,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:09:52,240 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-11-21 17:09:52,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:09:52,241 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407015031] [2022-11-21 17:09:52,241 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1407015031] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 17:09:52,241 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1425566418] [2022-11-21 17:09:52,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:09:52,242 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 17:09:52,242 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6683ff47-d74d-4eab-b0ef-b08aeaf9387f/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 17:09:52,244 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6683ff47-d74d-4eab-b0ef-b08aeaf9387f/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 17:09:52,267 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6683ff47-d74d-4eab-b0ef-b08aeaf9387f/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-21 17:09:52,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:09:52,484 INFO L263 TraceCheckSpWp]: Trace formula consists of 378 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-21 17:09:52,487 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 17:09:52,603 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-11-21 17:09:52,604 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-21 17:09:52,604 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1425566418] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 17:09:52,604 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-21 17:09:52,604 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 7 [2022-11-21 17:09:52,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455956408] [2022-11-21 17:09:52,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 17:09:52,605 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-21 17:09:52,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:09:52,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-21 17:09:52,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-21 17:09:52,606 INFO L87 Difference]: Start difference. First operand 73 states and 80 transitions. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-21 17:09:52,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 17:09:52,645 INFO L93 Difference]: Finished difference Result 70 states and 76 transitions. [2022-11-21 17:09:52,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-21 17:09:52,646 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 47 [2022-11-21 17:09:52,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 17:09:52,646 INFO L225 Difference]: With dead ends: 70 [2022-11-21 17:09:52,647 INFO L226 Difference]: Without dead ends: 70 [2022-11-21 17:09:52,647 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-11-21 17:09:52,648 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 91 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-21 17:09:52,648 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 111 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-21 17:09:52,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-11-21 17:09:52,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2022-11-21 17:09:52,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 52 states have (on average 1.3461538461538463) internal successors, (70), 65 states have internal predecessors, (70), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-21 17:09:52,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 76 transitions. [2022-11-21 17:09:52,652 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 76 transitions. Word has length 47 [2022-11-21 17:09:52,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 17:09:52,652 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 76 transitions. [2022-11-21 17:09:52,652 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-21 17:09:52,653 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 76 transitions. [2022-11-21 17:09:52,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-11-21 17:09:52,653 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 17:09:52,654 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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-21 17:09:52,666 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6683ff47-d74d-4eab-b0ef-b08aeaf9387f/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-21 17:09:52,861 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6683ff47-d74d-4eab-b0ef-b08aeaf9387f/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-11-21 17:09:52,861 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-11-21 17:09:52,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:09:52,862 INFO L85 PathProgramCache]: Analyzing trace with hash 589543324, now seen corresponding path program 1 times [2022-11-21 17:09:52,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:09:52,863 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372998452] [2022-11-21 17:09:52,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:09:52,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:09:52,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:09:53,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-21 17:09:53,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:09:53,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-21 17:09:53,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:09:53,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-11-21 17:09:53,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:09:53,117 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-11-21 17:09:53,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:09:53,132 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372998452] [2022-11-21 17:09:53,132 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1372998452] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 17:09:53,132 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 17:09:53,133 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-21 17:09:53,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351683248] [2022-11-21 17:09:53,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 17:09:53,133 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-21 17:09:53,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:09:53,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-21 17:09:53,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-21 17:09:53,135 INFO L87 Difference]: Start difference. First operand 70 states and 76 transitions. Second operand has 5 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-21 17:09:53,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 17:09:53,263 INFO L93 Difference]: Finished difference Result 81 states and 88 transitions. [2022-11-21 17:09:53,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-21 17:09:53,264 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 48 [2022-11-21 17:09:53,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 17:09:53,265 INFO L225 Difference]: With dead ends: 81 [2022-11-21 17:09:53,265 INFO L226 Difference]: Without dead ends: 81 [2022-11-21 17:09:53,265 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-21 17:09:53,266 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 37 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 17:09:53,266 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 140 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 17:09:53,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2022-11-21 17:09:53,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 69. [2022-11-21 17:09:53,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 52 states have (on average 1.3269230769230769) internal successors, (69), 64 states have internal predecessors, (69), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-21 17:09:53,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 75 transitions. [2022-11-21 17:09:53,269 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 75 transitions. Word has length 48 [2022-11-21 17:09:53,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 17:09:53,270 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 75 transitions. [2022-11-21 17:09:53,270 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-21 17:09:53,270 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 75 transitions. [2022-11-21 17:09:53,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-11-21 17:09:53,270 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 17:09:53,271 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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-21 17:09:53,271 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-21 17:09:53,271 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-11-21 17:09:53,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:09:53,274 INFO L85 PathProgramCache]: Analyzing trace with hash 589543325, now seen corresponding path program 1 times [2022-11-21 17:09:53,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:09:53,275 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268656331] [2022-11-21 17:09:53,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:09:53,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:09:53,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:09:53,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-21 17:09:53,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:09:53,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-21 17:09:53,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:09:53,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-11-21 17:09:53,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:09:54,141 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 18 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-21 17:09:54,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:09:54,142 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268656331] [2022-11-21 17:09:54,142 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1268656331] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 17:09:54,142 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1823575287] [2022-11-21 17:09:54,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:09:54,143 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 17:09:54,143 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6683ff47-d74d-4eab-b0ef-b08aeaf9387f/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 17:09:54,144 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6683ff47-d74d-4eab-b0ef-b08aeaf9387f/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 17:09:54,172 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6683ff47-d74d-4eab-b0ef-b08aeaf9387f/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-21 17:09:54,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:09:54,425 INFO L263 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 9 conjunts are in the unsatisfiable core [2022-11-21 17:09:54,427 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 17:09:54,510 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-11-21 17:09:54,510 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-21 17:09:54,511 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1823575287] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 17:09:54,511 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-21 17:09:54,511 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [18] total 20 [2022-11-21 17:09:54,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432496655] [2022-11-21 17:09:54,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 17:09:54,512 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-21 17:09:54,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:09:54,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-21 17:09:54,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=370, Unknown=0, NotChecked=0, Total=420 [2022-11-21 17:09:54,512 INFO L87 Difference]: Start difference. First operand 69 states and 75 transitions. Second operand has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-21 17:09:54,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 17:09:54,592 INFO L93 Difference]: Finished difference Result 68 states and 74 transitions. [2022-11-21 17:09:54,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-21 17:09:54,593 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 48 [2022-11-21 17:09:54,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 17:09:54,594 INFO L225 Difference]: With dead ends: 68 [2022-11-21 17:09:54,594 INFO L226 Difference]: Without dead ends: 68 [2022-11-21 17:09:54,595 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=54, Invalid=408, Unknown=0, NotChecked=0, Total=462 [2022-11-21 17:09:54,595 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 39 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 17:09:54,596 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 111 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 17:09:54,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2022-11-21 17:09:54,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2022-11-21 17:09:54,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 52 states have (on average 1.3076923076923077) internal successors, (68), 63 states have internal predecessors, (68), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-21 17:09:54,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 74 transitions. [2022-11-21 17:09:54,598 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 74 transitions. Word has length 48 [2022-11-21 17:09:54,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 17:09:54,599 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 74 transitions. [2022-11-21 17:09:54,599 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-21 17:09:54,599 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 74 transitions. [2022-11-21 17:09:54,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-11-21 17:09:54,599 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 17:09:54,602 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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-21 17:09:54,614 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6683ff47-d74d-4eab-b0ef-b08aeaf9387f/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-21 17:09:54,802 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6683ff47-d74d-4eab-b0ef-b08aeaf9387f/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-11-21 17:09:54,803 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-11-21 17:09:54,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:09:54,803 INFO L85 PathProgramCache]: Analyzing trace with hash 1095973890, now seen corresponding path program 1 times [2022-11-21 17:09:54,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:09:54,804 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957330519] [2022-11-21 17:09:54,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:09:54,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:09:54,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:09:55,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-21 17:09:55,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:09:55,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-21 17:09:55,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:09:55,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-11-21 17:09:55,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:09:55,141 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-11-21 17:09:55,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:09:55,142 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957330519] [2022-11-21 17:09:55,142 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1957330519] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 17:09:55,142 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 17:09:55,143 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-21 17:09:55,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12201428] [2022-11-21 17:09:55,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 17:09:55,145 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-21 17:09:55,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:09:55,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-21 17:09:55,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-21 17:09:55,147 INFO L87 Difference]: Start difference. First operand 68 states and 74 transitions. Second operand has 7 states, 6 states have (on average 5.333333333333333) internal successors, (32), 5 states have internal predecessors, (32), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-21 17:09:55,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 17:09:55,291 INFO L93 Difference]: Finished difference Result 67 states and 73 transitions. [2022-11-21 17:09:55,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-21 17:09:55,291 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.333333333333333) internal successors, (32), 5 states have internal predecessors, (32), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 49 [2022-11-21 17:09:55,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 17:09:55,292 INFO L225 Difference]: With dead ends: 67 [2022-11-21 17:09:55,292 INFO L226 Difference]: Without dead ends: 67 [2022-11-21 17:09:55,292 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-11-21 17:09:55,293 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 38 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 17:09:55,293 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 206 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 17:09:55,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-11-21 17:09:55,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2022-11-21 17:09:55,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 52 states have (on average 1.2884615384615385) internal successors, (67), 62 states have internal predecessors, (67), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-21 17:09:55,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 73 transitions. [2022-11-21 17:09:55,296 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 73 transitions. Word has length 49 [2022-11-21 17:09:55,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 17:09:55,296 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 73 transitions. [2022-11-21 17:09:55,296 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.333333333333333) internal successors, (32), 5 states have internal predecessors, (32), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-21 17:09:55,296 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 73 transitions. [2022-11-21 17:09:55,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-11-21 17:09:55,297 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 17:09:55,297 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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] [2022-11-21 17:09:55,297 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-21 17:09:55,297 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-11-21 17:09:55,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:09:55,298 INFO L85 PathProgramCache]: Analyzing trace with hash 15214980, now seen corresponding path program 1 times [2022-11-21 17:09:55,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:09:55,298 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034684920] [2022-11-21 17:09:55,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:09:55,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:09:55,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:09:56,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-21 17:09:56,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:09:56,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-21 17:09:56,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:09:56,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-11-21 17:09:56,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:09:56,444 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 24 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-21 17:09:56,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:09:56,444 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034684920] [2022-11-21 17:09:56,445 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2034684920] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 17:09:56,445 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1495563799] [2022-11-21 17:09:56,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:09:56,445 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 17:09:56,445 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6683ff47-d74d-4eab-b0ef-b08aeaf9387f/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 17:09:56,446 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6683ff47-d74d-4eab-b0ef-b08aeaf9387f/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 17:09:56,468 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6683ff47-d74d-4eab-b0ef-b08aeaf9387f/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-21 17:09:56,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:09:56,716 INFO L263 TraceCheckSpWp]: Trace formula consists of 423 conjuncts, 66 conjunts are in the unsatisfiable core [2022-11-21 17:09:56,720 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 17:09:56,734 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-21 17:09:56,793 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 5 treesize of output 3 [2022-11-21 17:09:56,830 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_1852 Int)) (= |c_#length| (store |c_old(#length)| |node_create_~temp~0#1.base| v_ArrVal_1852))) (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|))) is different from true [2022-11-21 17:09:56,879 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:09:56,881 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 12 treesize of output 14 [2022-11-21 17:09:56,933 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 5 treesize of output 3 [2022-11-21 17:09:56,943 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-21 17:09:57,088 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:09:57,089 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 12 treesize of output 14 [2022-11-21 17:09:57,515 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-11-21 17:09:57,525 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 5 treesize of output 3 [2022-11-21 17:09:57,530 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-21 17:09:58,014 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:09:58,016 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 25 treesize of output 25 [2022-11-21 17:09:58,047 INFO L321 Elim1Store]: treesize reduction 30, result has 37.5 percent of original size [2022-11-21 17:09:58,047 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 21 treesize of output 29 [2022-11-21 17:09:58,070 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:09:58,072 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-21 17:09:58,434 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 17:09:58,434 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 17 [2022-11-21 17:09:58,660 INFO L321 Elim1Store]: treesize reduction 25, result has 30.6 percent of original size [2022-11-21 17:09:58,661 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 40 treesize of output 35 [2022-11-21 17:09:59,019 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:09:59,035 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-11-21 17:09:59,036 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 87 treesize of output 90 [2022-11-21 17:09:59,147 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-21 17:09:59,433 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 17:09:59,434 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 18 [2022-11-21 17:09:59,606 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 14 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 12 not checked. [2022-11-21 17:09:59,607 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 17:09:59,625 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1861 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_1861) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) 1)) is different from false [2022-11-21 17:10:02,005 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset_15| Int) (v_ArrVal_1861 (Array Int Int)) (|ULTIMATE.start_sll_insert_#t~mem8#1.base| Int)) (let ((.cse0 (+ |v_ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset_15| 4))) (or (< (select |c_#length| |ULTIMATE.start_sll_insert_#t~mem8#1.base|) (+ |v_ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset_15| 8)) (= (select |c_#valid| (select (select (store (store |c_#memory_$Pointer$.base| |ULTIMATE.start_sll_insert_#t~mem8#1.base| (store (select |c_#memory_$Pointer$.base| |ULTIMATE.start_sll_insert_#t~mem8#1.base|) .cse0 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|)) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_1861) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) 1) (not (<= 0 .cse0))))) is different from false [2022-11-21 17:11:06,340 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1495563799] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 17:11:06,340 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-21 17:11:06,340 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 45 [2022-11-21 17:11:06,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177217767] [2022-11-21 17:11:06,341 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-21 17:11:06,341 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2022-11-21 17:11:06,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:11:06,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2022-11-21 17:11:06,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=2245, Unknown=36, NotChecked=294, Total=2756 [2022-11-21 17:11:06,344 INFO L87 Difference]: Start difference. First operand 67 states and 73 transitions. Second operand has 46 states, 43 states have (on average 2.1627906976744184) internal successors, (93), 39 states have internal predecessors, (93), 4 states have call successors, (4), 3 states have call predecessors, (4), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-11-21 17:11:13,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 17:11:13,521 INFO L93 Difference]: Finished difference Result 147 states and 161 transitions. [2022-11-21 17:11:13,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-11-21 17:11:13,521 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 43 states have (on average 2.1627906976744184) internal successors, (93), 39 states have internal predecessors, (93), 4 states have call successors, (4), 3 states have call predecessors, (4), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 54 [2022-11-21 17:11:13,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 17:11:13,523 INFO L225 Difference]: With dead ends: 147 [2022-11-21 17:11:13,524 INFO L226 Difference]: Without dead ends: 147 [2022-11-21 17:11:13,526 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 44 SyntacticMatches, 3 SemanticMatches, 73 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1222 ImplicationChecksByTransitivity, 73.9s TimeCoverageRelationStatistics Valid=662, Invalid=4425, Unknown=37, NotChecked=426, Total=5550 [2022-11-21 17:11:13,526 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 1352 mSDsluCounter, 479 mSDsCounter, 0 mSdLazyCounter, 1084 mSolverCounterSat, 47 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1352 SdHoareTripleChecker+Valid, 505 SdHoareTripleChecker+Invalid, 1246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 1084 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 113 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-11-21 17:11:13,527 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1352 Valid, 505 Invalid, 1246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 1084 Invalid, 2 Unknown, 113 Unchecked, 1.7s Time] [2022-11-21 17:11:13,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2022-11-21 17:11:13,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 68. [2022-11-21 17:11:13,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 54 states have (on average 1.2962962962962963) internal successors, (70), 63 states have internal predecessors, (70), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-21 17:11:13,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 76 transitions. [2022-11-21 17:11:13,532 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 76 transitions. Word has length 54 [2022-11-21 17:11:13,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 17:11:13,533 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 76 transitions. [2022-11-21 17:11:13,533 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 43 states have (on average 2.1627906976744184) internal successors, (93), 39 states have internal predecessors, (93), 4 states have call successors, (4), 3 states have call predecessors, (4), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-11-21 17:11:13,533 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 76 transitions. [2022-11-21 17:11:13,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-11-21 17:11:13,534 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 17:11:13,534 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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] [2022-11-21 17:11:13,552 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6683ff47-d74d-4eab-b0ef-b08aeaf9387f/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-21 17:11:13,747 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6683ff47-d74d-4eab-b0ef-b08aeaf9387f/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-11-21 17:11:13,747 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-11-21 17:11:13,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:11:13,748 INFO L85 PathProgramCache]: Analyzing trace with hash 15214981, now seen corresponding path program 1 times [2022-11-21 17:11:13,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:11:13,748 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640510460] [2022-11-21 17:11:13,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:11:13,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:11:13,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:11:15,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-21 17:11:15,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:11:15,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-21 17:11:15,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:11:15,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-11-21 17:11:15,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:11:15,689 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 18 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-21 17:11:15,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:11:15,690 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640510460] [2022-11-21 17:11:15,690 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [640510460] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 17:11:15,690 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1503238660] [2022-11-21 17:11:15,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:11:15,690 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 17:11:15,691 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6683ff47-d74d-4eab-b0ef-b08aeaf9387f/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 17:11:15,692 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6683ff47-d74d-4eab-b0ef-b08aeaf9387f/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 17:11:15,701 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6683ff47-d74d-4eab-b0ef-b08aeaf9387f/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-21 17:11:16,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:11:16,028 INFO L263 TraceCheckSpWp]: Trace formula consists of 423 conjuncts, 76 conjunts are in the unsatisfiable core [2022-11-21 17:11:16,032 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 17:11:16,617 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 9 treesize of output 5 [2022-11-21 17:11:16,631 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 7 treesize of output 3 [2022-11-21 17:11:17,168 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:11:17,169 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-21 17:11:17,185 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:11:17,186 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 16 treesize of output 18 [2022-11-21 17:11:17,208 INFO L321 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2022-11-21 17:11:17,208 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 26 [2022-11-21 17:11:17,568 INFO L321 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2022-11-21 17:11:17,569 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 23 treesize of output 32 [2022-11-21 17:11:17,600 INFO L321 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2022-11-21 17:11:17,600 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 21 treesize of output 20 [2022-11-21 17:11:23,497 WARN L233 SmtUtils]: Spent 5.74s on a formula simplification. DAG size of input: 41 DAG size of output: 36 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-21 17:11:23,522 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:11:23,541 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-11-21 17:11:23,542 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 50 [2022-11-21 17:11:23,553 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:11:23,571 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-11-21 17:11:23,571 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 48 treesize of output 57 [2022-11-21 17:11:23,610 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-21 17:11:23,670 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-21 17:11:23,694 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-21 17:11:23,878 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-11-21 17:11:23,883 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-21 17:11:23,934 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-21 17:11:23,935 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-21 17:11:23,935 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1503238660] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 17:11:23,935 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-21 17:11:23,935 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [23] total 39 [2022-11-21 17:11:23,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678042534] [2022-11-21 17:11:23,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 17:11:23,937 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-11-21 17:11:23,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:11:23,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-11-21 17:11:23,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=1443, Unknown=0, NotChecked=0, Total=1560 [2022-11-21 17:11:23,938 INFO L87 Difference]: Start difference. First operand 68 states and 76 transitions. Second operand has 21 states, 19 states have (on average 2.473684210526316) internal successors, (47), 18 states have internal predecessors, (47), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-21 17:11:30,954 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-21 17:11:31,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 17:11:31,419 INFO L93 Difference]: Finished difference Result 91 states and 99 transitions. [2022-11-21 17:11:31,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-21 17:11:31,420 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 19 states have (on average 2.473684210526316) internal successors, (47), 18 states have internal predecessors, (47), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 54 [2022-11-21 17:11:31,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 17:11:31,421 INFO L225 Difference]: With dead ends: 91 [2022-11-21 17:11:31,421 INFO L226 Difference]: Without dead ends: 91 [2022-11-21 17:11:31,422 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 39 SyntacticMatches, 3 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 481 ImplicationChecksByTransitivity, 12.5s TimeCoverageRelationStatistics Valid=254, Invalid=2296, Unknown=0, NotChecked=0, Total=2550 [2022-11-21 17:11:31,423 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 493 mSDsluCounter, 311 mSDsCounter, 0 mSdLazyCounter, 454 mSolverCounterSat, 22 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 493 SdHoareTripleChecker+Valid, 345 SdHoareTripleChecker+Invalid, 478 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 454 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2022-11-21 17:11:31,423 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [493 Valid, 345 Invalid, 478 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 454 Invalid, 2 Unknown, 0 Unchecked, 2.7s Time] [2022-11-21 17:11:31,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2022-11-21 17:11:31,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 70. [2022-11-21 17:11:31,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 56 states have (on average 1.2678571428571428) internal successors, (71), 65 states have internal predecessors, (71), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-21 17:11:31,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 77 transitions. [2022-11-21 17:11:31,428 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 77 transitions. Word has length 54 [2022-11-21 17:11:31,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 17:11:31,428 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 77 transitions. [2022-11-21 17:11:31,428 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 19 states have (on average 2.473684210526316) internal successors, (47), 18 states have internal predecessors, (47), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-21 17:11:31,429 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 77 transitions. [2022-11-21 17:11:31,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-11-21 17:11:31,429 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 17:11:31,430 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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] [2022-11-21 17:11:31,440 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6683ff47-d74d-4eab-b0ef-b08aeaf9387f/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-21 17:11:31,637 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6683ff47-d74d-4eab-b0ef-b08aeaf9387f/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 17:11:31,638 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-11-21 17:11:31,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:11:31,638 INFO L85 PathProgramCache]: Analyzing trace with hash 471663079, now seen corresponding path program 1 times [2022-11-21 17:11:31,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:11:31,638 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737041437] [2022-11-21 17:11:31,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:11:31,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:11:31,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:11:32,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-21 17:11:32,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:11:32,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-21 17:11:32,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:11:32,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-11-21 17:11:32,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:11:33,304 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 18 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-21 17:11:33,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:11:33,305 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737041437] [2022-11-21 17:11:33,305 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [737041437] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 17:11:33,305 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2023420858] [2022-11-21 17:11:33,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:11:33,305 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 17:11:33,306 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6683ff47-d74d-4eab-b0ef-b08aeaf9387f/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 17:11:33,308 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6683ff47-d74d-4eab-b0ef-b08aeaf9387f/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 17:11:33,346 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6683ff47-d74d-4eab-b0ef-b08aeaf9387f/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-21 17:11:33,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:11:33,657 INFO L263 TraceCheckSpWp]: Trace formula consists of 427 conjuncts, 41 conjunts are in the unsatisfiable core [2022-11-21 17:11:33,661 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 17:11:34,182 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 8 treesize of output 4 [2022-11-21 17:11:34,482 WARN L859 $PredicateComparison]: unable to prove that (and (< |c_node_create_#res#1.base| |c_#StackHeapBarrier|) (not (= |c_node_create_#res#1.base| 0)) (exists ((v_ArrVal_2237 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_node_create_#res#1.base| v_ArrVal_2237)))) is different from true [2022-11-21 17:11:34,509 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:11:34,511 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2022-11-21 17:11:34,734 INFO L321 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2022-11-21 17:11:34,734 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 1 case distinctions, treesize of input 22 treesize of output 31 [2022-11-21 17:11:36,900 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:11:36,915 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-11-21 17:11:36,915 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 40 [2022-11-21 17:11:36,938 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-21 17:11:36,949 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 16 treesize of output 8 [2022-11-21 17:11:36,954 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 2 not checked. [2022-11-21 17:11:36,955 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 17:11:37,889 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2023420858] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 17:11:37,889 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-21 17:11:37,889 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 20] total 38 [2022-11-21 17:11:37,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098584933] [2022-11-21 17:11:37,890 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-21 17:11:37,890 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-11-21 17:11:37,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:11:37,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-11-21 17:11:37,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=1620, Unknown=57, NotChecked=82, Total=1892 [2022-11-21 17:11:37,892 INFO L87 Difference]: Start difference. First operand 70 states and 77 transitions. Second operand has 38 states, 36 states have (on average 2.1666666666666665) internal successors, (78), 32 states have internal predecessors, (78), 3 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2022-11-21 17:11:45,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 17:11:45,241 INFO L93 Difference]: Finished difference Result 72 states and 77 transitions. [2022-11-21 17:11:45,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-21 17:11:45,242 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 36 states have (on average 2.1666666666666665) internal successors, (78), 32 states have internal predecessors, (78), 3 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Word has length 55 [2022-11-21 17:11:45,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 17:11:45,243 INFO L225 Difference]: With dead ends: 72 [2022-11-21 17:11:45,243 INFO L226 Difference]: Without dead ends: 72 [2022-11-21 17:11:45,244 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 55 SyntacticMatches, 2 SemanticMatches, 60 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 594 ImplicationChecksByTransitivity, 10.7s TimeCoverageRelationStatistics Valid=456, Invalid=3149, Unknown=59, NotChecked=118, Total=3782 [2022-11-21 17:11:45,245 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 660 mSDsluCounter, 602 mSDsCounter, 0 mSdLazyCounter, 848 mSolverCounterSat, 34 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 661 SdHoareTripleChecker+Valid, 636 SdHoareTripleChecker+Invalid, 957 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 848 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 73 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-11-21 17:11:45,246 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [661 Valid, 636 Invalid, 957 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 848 Invalid, 2 Unknown, 73 Unchecked, 1.0s Time] [2022-11-21 17:11:45,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-11-21 17:11:45,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 69. [2022-11-21 17:11:45,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 55 states have (on average 1.2363636363636363) internal successors, (68), 64 states have internal predecessors, (68), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-21 17:11:45,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 74 transitions. [2022-11-21 17:11:45,250 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 74 transitions. Word has length 55 [2022-11-21 17:11:45,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 17:11:45,250 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 74 transitions. [2022-11-21 17:11:45,251 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 36 states have (on average 2.1666666666666665) internal successors, (78), 32 states have internal predecessors, (78), 3 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2022-11-21 17:11:45,251 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 74 transitions. [2022-11-21 17:11:45,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-11-21 17:11:45,252 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 17:11:45,252 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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, 1, 1] [2022-11-21 17:11:45,259 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6683ff47-d74d-4eab-b0ef-b08aeaf9387f/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-21 17:11:45,459 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6683ff47-d74d-4eab-b0ef-b08aeaf9387f/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 17:11:45,459 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-11-21 17:11:45,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:11:45,460 INFO L85 PathProgramCache]: Analyzing trace with hash -1777907541, now seen corresponding path program 1 times [2022-11-21 17:11:45,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:11:45,460 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431613360] [2022-11-21 17:11:45,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:11:45,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:11:45,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:11:47,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-21 17:11:47,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:11:47,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-21 17:11:47,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:11:47,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-11-21 17:11:47,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:11:48,586 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 12 proven. 13 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-21 17:11:48,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:11:48,586 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431613360] [2022-11-21 17:11:48,586 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1431613360] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 17:11:48,587 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [876328631] [2022-11-21 17:11:48,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:11:48,587 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 17:11:48,587 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6683ff47-d74d-4eab-b0ef-b08aeaf9387f/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 17:11:48,588 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6683ff47-d74d-4eab-b0ef-b08aeaf9387f/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 17:11:48,591 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6683ff47-d74d-4eab-b0ef-b08aeaf9387f/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-21 17:11:48,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:11:48,888 INFO L263 TraceCheckSpWp]: Trace formula consists of 442 conjuncts, 111 conjunts are in the unsatisfiable core [2022-11-21 17:11:48,894 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 17:11:49,115 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 11 treesize of output 7 [2022-11-21 17:11:49,509 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-21 17:11:50,180 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 34 treesize of output 22 [2022-11-21 17:11:50,188 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 11 treesize of output 3 [2022-11-21 17:11:50,195 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 5 treesize of output 3 [2022-11-21 17:11:50,203 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-21 17:11:50,725 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:11:50,726 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 42 treesize of output 33 [2022-11-21 17:11:50,747 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-11-21 17:11:50,748 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2022-11-21 17:11:50,760 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 19 [2022-11-21 17:11:50,771 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:11:50,772 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 29 [2022-11-21 17:11:51,796 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-21 17:11:51,796 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 78 treesize of output 71 [2022-11-21 17:11:51,811 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 36 [2022-11-21 17:11:51,821 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:11:51,822 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 38 [2022-11-21 17:11:51,980 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:11:51,981 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 37 [2022-11-21 17:11:51,995 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-11-21 17:11:52,002 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:11:52,003 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 34 [2022-11-21 17:11:52,147 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 32 treesize of output 20 [2022-11-21 17:11:52,152 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 33 treesize of output 17 [2022-11-21 17:11:52,377 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-21 17:11:52,456 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 14 proven. 13 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-21 17:11:52,456 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 17:11:52,485 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2439 (Array Int Int)) (v_ArrVal_2438 (Array Int Int)) (v_ArrVal_2440 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_2438) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_2440) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_2439) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) is different from false [2022-11-21 17:11:54,509 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2439 (Array Int Int)) (v_ArrVal_2438 (Array Int Int)) (v_ArrVal_2435 (Array Int Int)) (v_ArrVal_2434 (Array Int Int)) (v_ArrVal_2440 (Array Int Int)) (v_ArrVal_2437 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base|) (+ |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset| 4) v_ArrVal_2437)) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_2438) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| v_ArrVal_2435) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_2440) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| v_ArrVal_2434) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_2439) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) is different from false [2022-11-21 17:11:54,562 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2439 (Array Int Int)) (v_ArrVal_2438 (Array Int Int)) (v_ArrVal_2435 (Array Int Int)) (v_ArrVal_2434 (Array Int Int)) (v_ArrVal_2440 (Array Int Int)) (v_ArrVal_2437 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_insert_~last~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_insert_~last~0#1.base|) (+ |c_ULTIMATE.start_sll_insert_~last~0#1.offset| 4) v_ArrVal_2437)) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_2438) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_insert_~last~0#1.base| v_ArrVal_2435) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_2440) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_insert_~last~0#1.base| v_ArrVal_2434) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_2439) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) is different from false [2022-11-21 17:11:55,751 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2439 (Array Int Int)) (v_ArrVal_2438 (Array Int Int)) (v_ArrVal_2435 (Array Int Int)) (v_ArrVal_2434 (Array Int Int)) (v_ArrVal_2440 (Array Int Int)) (v_ArrVal_2437 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|))) (select (select (store (store |c_#memory_int| .cse0 (store (select |c_#memory_int| .cse0) (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4) v_ArrVal_2437)) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_2438) (select (select (store (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_2435) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_2440) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_2434) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_2439) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) is different from false [2022-11-21 17:11:55,767 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2439 (Array Int Int)) (v_ArrVal_2438 (Array Int Int)) (v_ArrVal_2435 (Array Int Int)) (v_ArrVal_2434 (Array Int Int)) (v_ArrVal_2440 (Array Int Int)) (v_ArrVal_2437 Int)) (= (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|))) (select (select (store (store |c_#memory_int| .cse0 (store (select |c_#memory_int| .cse0) (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4) v_ArrVal_2437)) |c_ULTIMATE.start_sll_insert_#t~ret7#1.base| v_ArrVal_2438) (select (select (store (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_2435) |c_ULTIMATE.start_sll_insert_#t~ret7#1.base| v_ArrVal_2440) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_2434) |c_ULTIMATE.start_sll_insert_#t~ret7#1.base| v_ArrVal_2439) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) |c_ULTIMATE.start_main_~data~0#1|)) is different from false [2022-11-21 17:11:56,152 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [876328631] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 17:11:56,152 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-21 17:11:56,152 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 47 [2022-11-21 17:11:56,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292819951] [2022-11-21 17:11:56,153 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-21 17:11:56,153 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2022-11-21 17:11:56,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:11:56,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2022-11-21 17:11:56,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=2173, Unknown=35, NotChecked=490, Total=2862 [2022-11-21 17:11:56,156 INFO L87 Difference]: Start difference. First operand 69 states and 74 transitions. Second operand has 47 states, 45 states have (on average 2.022222222222222) internal successors, (91), 41 states have internal predecessors, (91), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-11-21 17:12:00,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 17:12:00,293 INFO L93 Difference]: Finished difference Result 82 states and 88 transitions. [2022-11-21 17:12:00,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-11-21 17:12:00,294 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 45 states have (on average 2.022222222222222) internal successors, (91), 41 states have internal predecessors, (91), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 58 [2022-11-21 17:12:00,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 17:12:00,294 INFO L225 Difference]: With dead ends: 82 [2022-11-21 17:12:00,295 INFO L226 Difference]: Without dead ends: 82 [2022-11-21 17:12:00,296 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 53 SyntacticMatches, 4 SemanticMatches, 74 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 884 ImplicationChecksByTransitivity, 9.6s TimeCoverageRelationStatistics Valid=452, Invalid=4503, Unknown=35, NotChecked=710, Total=5700 [2022-11-21 17:12:00,297 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 245 mSDsluCounter, 592 mSDsCounter, 0 mSdLazyCounter, 1140 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 245 SdHoareTripleChecker+Valid, 620 SdHoareTripleChecker+Invalid, 1160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 1140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-11-21 17:12:00,297 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [245 Valid, 620 Invalid, 1160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 1140 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-11-21 17:12:00,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2022-11-21 17:12:00,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 70. [2022-11-21 17:12:00,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 56 states have (on average 1.2321428571428572) internal successors, (69), 65 states have internal predecessors, (69), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-21 17:12:00,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 75 transitions. [2022-11-21 17:12:00,300 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 75 transitions. Word has length 58 [2022-11-21 17:12:00,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 17:12:00,301 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 75 transitions. [2022-11-21 17:12:00,301 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 45 states have (on average 2.022222222222222) internal successors, (91), 41 states have internal predecessors, (91), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-11-21 17:12:00,301 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 75 transitions. [2022-11-21 17:12:00,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-11-21 17:12:00,302 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 17:12:00,302 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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, 1] [2022-11-21 17:12:00,310 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6683ff47-d74d-4eab-b0ef-b08aeaf9387f/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-11-21 17:12:00,510 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6683ff47-d74d-4eab-b0ef-b08aeaf9387f/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 17:12:00,510 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-11-21 17:12:00,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:12:00,511 INFO L85 PathProgramCache]: Analyzing trace with hash 719441558, now seen corresponding path program 1 times [2022-11-21 17:12:00,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:12:00,511 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734630375] [2022-11-21 17:12:00,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:12:00,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:12:00,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:12:02,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-21 17:12:02,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:12:02,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-21 17:12:02,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:12:02,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-11-21 17:12:02,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:12:03,443 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 18 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-21 17:12:03,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:12:03,444 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734630375] [2022-11-21 17:12:03,444 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [734630375] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 17:12:03,444 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1421012112] [2022-11-21 17:12:03,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:12:03,444 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 17:12:03,445 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6683ff47-d74d-4eab-b0ef-b08aeaf9387f/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 17:12:03,446 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6683ff47-d74d-4eab-b0ef-b08aeaf9387f/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 17:12:03,471 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6683ff47-d74d-4eab-b0ef-b08aeaf9387f/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-11-21 17:12:03,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:12:03,803 INFO L263 TraceCheckSpWp]: Trace formula consists of 450 conjuncts, 98 conjunts are in the unsatisfiable core [2022-11-21 17:12:03,809 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 17:12:04,734 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 19 treesize of output 11 [2022-11-21 17:12:04,739 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 5 treesize of output 3 [2022-11-21 17:12:04,745 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-21 17:12:05,328 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:12:05,328 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 21 [2022-11-21 17:12:05,350 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:12:05,352 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 25 treesize of output 25 [2022-11-21 17:12:05,389 INFO L321 Elim1Store]: treesize reduction 30, result has 37.5 percent of original size [2022-11-21 17:12:05,390 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 21 treesize of output 29 [2022-11-21 17:12:06,343 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:12:06,344 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 44 [2022-11-21 17:12:06,357 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:12:06,358 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 40 [2022-11-21 17:12:06,544 INFO L321 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-11-21 17:12:06,545 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 119 treesize of output 100 [2022-11-21 17:12:06,566 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-21 17:12:06,566 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 95 treesize of output 90 [2022-11-21 17:12:06,752 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 82 treesize of output 58 [2022-11-21 17:12:07,100 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:12:07,102 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 17:12:07,103 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 80 treesize of output 31 [2022-11-21 17:12:07,458 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 20 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-21 17:12:07,458 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 17:12:07,806 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2640 (Array Int Int)) (v_ArrVal_2639 (Array Int Int))) (= (select |c_#valid| (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_2639))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_2640) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) 1)) is different from false [2022-11-21 17:12:07,821 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2636 (Array Int Int)) (v_ArrVal_2640 (Array Int Int)) (v_ArrVal_2639 (Array Int Int))) (= (select |c_#valid| (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base|) (+ |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset| 4) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|)) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_2639))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| v_ArrVal_2636) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_2640) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) 1)) is different from false [2022-11-21 17:12:07,873 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2636 (Array Int Int)) (v_ArrVal_2640 (Array Int Int)) (v_ArrVal_2639 (Array Int Int))) (= (select |c_#valid| (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_insert_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_insert_~last~0#1.base|) (+ |c_ULTIMATE.start_sll_insert_~last~0#1.offset| 4) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|)) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_2639))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_insert_~last~0#1.base| v_ArrVal_2636) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_2640) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) 1)) is different from false [2022-11-21 17:12:07,892 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2636 (Array Int Int)) (v_ArrVal_2640 (Array Int Int)) (v_ArrVal_2639 (Array Int Int))) (= (select |c_#valid| (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_insert_#t~mem8#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_insert_#t~mem8#1.base|) (+ |c_ULTIMATE.start_sll_insert_#t~mem8#1.offset| 4) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|)) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_2639))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_insert_#t~mem8#1.base| v_ArrVal_2636) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_2640) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) 1)) is different from false [2022-11-21 17:12:08,308 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2636 (Array Int Int)) (v_ArrVal_2640 (Array Int Int)) (v_ArrVal_2639 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|))) (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| .cse1 (store (select |c_#memory_$Pointer$.base| .cse1) (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4) |c_ULTIMATE.start_sll_insert_#t~ret7#1.base|)) |c_ULTIMATE.start_sll_insert_#t~ret7#1.base| v_ArrVal_2639))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_2636) |c_ULTIMATE.start_sll_insert_#t~ret7#1.base| v_ArrVal_2640) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)))) 1)) is different from false [2022-11-21 17:12:08,441 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2649 (Array Int Int)) (v_ArrVal_2648 (Array Int Int)) (v_ArrVal_2636 (Array Int Int)) (v_ArrVal_2640 (Array Int Int)) (|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_27| Int) (v_ArrVal_2639 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_27|) 0)) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_27| |c_#StackHeapBarrier|)) (= (select (store |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_27| 1) (let ((.cse1 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_27| v_ArrVal_2649))) (let ((.cse3 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_27| v_ArrVal_2648)) (.cse2 (select (select .cse1 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|))) (select (let ((.cse0 (store (store .cse1 .cse2 (store (select .cse1 .cse2) (+ (select (select .cse3 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_27|)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_27| v_ArrVal_2639))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ (select (select (store (store .cse3 .cse2 v_ArrVal_2636) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_27| v_ArrVal_2640) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))))) 1))) is different from false [2022-11-21 17:12:08,444 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1421012112] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 17:12:08,445 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-21 17:12:08,445 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 26] total 52 [2022-11-21 17:12:08,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692547314] [2022-11-21 17:12:08,445 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-21 17:12:08,446 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2022-11-21 17:12:08,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:12:08,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2022-11-21 17:12:08,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=187, Invalid=3105, Unknown=38, NotChecked=702, Total=4032 [2022-11-21 17:12:08,448 INFO L87 Difference]: Start difference. First operand 70 states and 75 transitions. Second operand has 53 states, 50 states have (on average 1.94) internal successors, (97), 47 states have internal predecessors, (97), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-11-21 17:12:15,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 17:12:15,197 INFO L93 Difference]: Finished difference Result 105 states and 112 transitions. [2022-11-21 17:12:15,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-11-21 17:12:15,201 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 50 states have (on average 1.94) internal successors, (97), 47 states have internal predecessors, (97), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 59 [2022-11-21 17:12:15,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 17:12:15,202 INFO L225 Difference]: With dead ends: 105 [2022-11-21 17:12:15,202 INFO L226 Difference]: Without dead ends: 105 [2022-11-21 17:12:15,205 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 47 SyntacticMatches, 2 SemanticMatches, 83 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 1313 ImplicationChecksByTransitivity, 8.9s TimeCoverageRelationStatistics Valid=636, Invalid=5510, Unknown=40, NotChecked=954, Total=7140 [2022-11-21 17:12:15,206 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 751 mSDsluCounter, 653 mSDsCounter, 0 mSdLazyCounter, 1606 mSolverCounterSat, 28 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 751 SdHoareTripleChecker+Valid, 679 SdHoareTripleChecker+Invalid, 1636 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 1606 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-11-21 17:12:15,206 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [751 Valid, 679 Invalid, 1636 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 1606 Invalid, 2 Unknown, 0 Unchecked, 2.3s Time] [2022-11-21 17:12:15,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2022-11-21 17:12:15,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 72. [2022-11-21 17:12:15,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 58 states have (on average 1.2586206896551724) internal successors, (73), 67 states have internal predecessors, (73), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-21 17:12:15,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 79 transitions. [2022-11-21 17:12:15,210 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 79 transitions. Word has length 59 [2022-11-21 17:12:15,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 17:12:15,211 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 79 transitions. [2022-11-21 17:12:15,211 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 50 states have (on average 1.94) internal successors, (97), 47 states have internal predecessors, (97), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-11-21 17:12:15,211 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 79 transitions. [2022-11-21 17:12:15,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-11-21 17:12:15,212 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 17:12:15,212 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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, 1] [2022-11-21 17:12:15,225 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6683ff47-d74d-4eab-b0ef-b08aeaf9387f/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2022-11-21 17:12:15,420 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6683ff47-d74d-4eab-b0ef-b08aeaf9387f/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-11-21 17:12:15,420 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-11-21 17:12:15,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:12:15,420 INFO L85 PathProgramCache]: Analyzing trace with hash 719441559, now seen corresponding path program 1 times [2022-11-21 17:12:15,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:12:15,421 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797276121] [2022-11-21 17:12:15,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:12:15,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:12:15,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:12:17,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-21 17:12:17,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:12:17,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-21 17:12:17,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:12:17,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-11-21 17:12:17,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:12:18,595 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 20 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-21 17:12:18,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:12:18,595 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [797276121] [2022-11-21 17:12:18,595 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [797276121] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 17:12:18,595 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [662441577] [2022-11-21 17:12:18,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:12:18,596 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 17:12:18,596 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6683ff47-d74d-4eab-b0ef-b08aeaf9387f/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 17:12:18,600 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6683ff47-d74d-4eab-b0ef-b08aeaf9387f/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 17:12:18,606 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6683ff47-d74d-4eab-b0ef-b08aeaf9387f/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-11-21 17:12:19,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:12:19,014 INFO L263 TraceCheckSpWp]: Trace formula consists of 450 conjuncts, 113 conjunts are in the unsatisfiable core [2022-11-21 17:12:19,019 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 17:12:19,975 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 19 treesize of output 11 [2022-11-21 17:12:19,982 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 5 treesize of output 3 [2022-11-21 17:12:19,989 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-21 17:12:20,640 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:12:20,641 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 21 [2022-11-21 17:12:20,671 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:12:20,672 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 25 treesize of output 25 [2022-11-21 17:12:20,691 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-11-21 17:12:20,691 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2022-11-21 17:12:21,713 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:12:21,715 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 50 [2022-11-21 17:12:21,726 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:12:21,727 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 43 [2022-11-21 17:12:21,938 INFO L321 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-11-21 17:12:21,938 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 127 treesize of output 108 [2022-11-21 17:12:21,958 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:12:21,988 INFO L321 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2022-11-21 17:12:21,989 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 112 treesize of output 108 [2022-11-21 17:12:22,662 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 17:12:22,664 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:12:22,668 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 17:12:22,669 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 113 treesize of output 51 [2022-11-21 17:12:22,677 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:12:22,684 INFO L321 Elim1Store]: treesize reduction 7, result has 30.0 percent of original size [2022-11-21 17:12:22,684 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 24 [2022-11-21 17:12:23,084 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 26 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-21 17:12:23,085 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 17:12:24,345 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse9 (+ |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset| 4))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base|) .cse9 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|))) (.cse3 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base|) .cse9 |c_ULTIMATE.start_sll_insert_~new_node~0#1.offset|)))) (and (forall ((v_ArrVal_2836 (Array Int Int))) (let ((.cse1 (store .cse3 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_2836))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (<= 0 .cse0)) (forall ((v_ArrVal_2837 (Array Int Int))) (<= 0 (+ (select (select .cse1 (select (select (store .cse2 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_2837) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ 4 .cse0)) 4))))))) (forall ((v_ArrVal_2836 (Array Int Int))) (let ((.cse5 (store .cse3 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_2836))) (let ((.cse4 (select (select .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (<= 0 .cse4)) (forall ((v_ArrVal_2837 (Array Int Int))) (let ((.cse8 (store .cse2 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_2837))) (let ((.cse6 (select (select .cse8 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse7 (+ 4 .cse4))) (<= (+ (select (select .cse5 .cse6) .cse7) 8) (select |c_#length| (select (select .cse8 .cse6) .cse7))))))))))))) is different from false [2022-11-21 17:12:26,645 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse9 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse10 (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse1 (store |c_#memory_$Pointer$.base| .cse9 (store (select |c_#memory_$Pointer$.base| .cse9) .cse10 |c_ULTIMATE.start_sll_insert_#t~ret7#1.base|))) (.cse3 (store |c_#memory_$Pointer$.offset| .cse9 (store (select |c_#memory_$Pointer$.offset| .cse9) .cse10 |c_ULTIMATE.start_sll_insert_#t~ret7#1.offset|)))) (and (forall ((v_ArrVal_2836 (Array Int Int))) (let ((.cse0 (store .cse3 |c_ULTIMATE.start_sll_insert_#t~ret7#1.base| v_ArrVal_2836))) (let ((.cse2 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_ArrVal_2837 (Array Int Int))) (<= 0 (+ 4 (select (select .cse0 (select (select (store .cse1 |c_ULTIMATE.start_sll_insert_#t~ret7#1.base| v_ArrVal_2837) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ 4 .cse2))))) (not (<= 0 .cse2)))))) (forall ((v_ArrVal_2836 (Array Int Int))) (let ((.cse4 (store .cse3 |c_ULTIMATE.start_sll_insert_#t~ret7#1.base| v_ArrVal_2836))) (let ((.cse8 (select (select .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_ArrVal_2837 (Array Int Int))) (let ((.cse7 (store .cse1 |c_ULTIMATE.start_sll_insert_#t~ret7#1.base| v_ArrVal_2837))) (let ((.cse5 (select (select .cse7 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse6 (+ 4 .cse8))) (<= (+ 8 (select (select .cse4 .cse5) .cse6)) (select |c_#length| (select (select .cse7 .cse5) .cse6)))))) (not (<= 0 .cse8))))))))) is different from false [2022-11-21 17:12:26,825 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 17:12:26,826 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 520 treesize of output 524 [2022-11-21 17:12:32,120 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [662441577] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 17:12:32,121 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-21 17:12:32,121 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 27] total 53 [2022-11-21 17:12:32,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271214083] [2022-11-21 17:12:32,121 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-21 17:12:32,122 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2022-11-21 17:12:32,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:12:32,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2022-11-21 17:12:32,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=206, Invalid=3989, Unknown=103, NotChecked=258, Total=4556 [2022-11-21 17:12:32,124 INFO L87 Difference]: Start difference. First operand 72 states and 79 transitions. Second operand has 54 states, 51 states have (on average 1.9019607843137254) internal successors, (97), 48 states have internal predecessors, (97), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-11-21 17:12:41,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 17:12:41,332 INFO L93 Difference]: Finished difference Result 120 states and 128 transitions. [2022-11-21 17:12:41,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-11-21 17:12:41,334 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 51 states have (on average 1.9019607843137254) internal successors, (97), 48 states have internal predecessors, (97), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 59 [2022-11-21 17:12:41,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 17:12:41,335 INFO L225 Difference]: With dead ends: 120 [2022-11-21 17:12:41,335 INFO L226 Difference]: Without dead ends: 120 [2022-11-21 17:12:41,338 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 44 SyntacticMatches, 2 SemanticMatches, 91 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1589 ImplicationChecksByTransitivity, 19.4s TimeCoverageRelationStatistics Valid=622, Invalid=7465, Unknown=111, NotChecked=358, Total=8556 [2022-11-21 17:12:41,339 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 1155 mSDsluCounter, 674 mSDsCounter, 0 mSdLazyCounter, 1525 mSolverCounterSat, 28 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1155 SdHoareTripleChecker+Valid, 700 SdHoareTripleChecker+Invalid, 1554 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 1525 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-11-21 17:12:41,339 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1155 Valid, 700 Invalid, 1554 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 1525 Invalid, 1 Unknown, 0 Unchecked, 2.1s Time] [2022-11-21 17:12:41,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2022-11-21 17:12:41,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 74. [2022-11-21 17:12:41,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 60 states have (on average 1.2333333333333334) internal successors, (74), 69 states have internal predecessors, (74), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-21 17:12:41,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 80 transitions. [2022-11-21 17:12:41,344 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 80 transitions. Word has length 59 [2022-11-21 17:12:41,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 17:12:41,344 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 80 transitions. [2022-11-21 17:12:41,344 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 51 states have (on average 1.9019607843137254) internal successors, (97), 48 states have internal predecessors, (97), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-11-21 17:12:41,345 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 80 transitions. [2022-11-21 17:12:41,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-11-21 17:12:41,346 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 17:12:41,346 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1] [2022-11-21 17:12:41,356 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6683ff47-d74d-4eab-b0ef-b08aeaf9387f/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-11-21 17:12:41,556 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6683ff47-d74d-4eab-b0ef-b08aeaf9387f/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2022-11-21 17:12:41,557 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-11-21 17:12:41,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:12:41,557 INFO L85 PathProgramCache]: Analyzing trace with hash 827850517, now seen corresponding path program 1 times [2022-11-21 17:12:41,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:12:41,558 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257431509] [2022-11-21 17:12:41,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:12:41,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:12:41,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:12:43,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-21 17:12:43,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:12:43,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-21 17:12:43,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:12:44,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-11-21 17:12:44,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:12:44,931 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 6 proven. 20 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-21 17:12:44,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:12:44,931 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257431509] [2022-11-21 17:12:44,932 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1257431509] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 17:12:44,932 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [896863897] [2022-11-21 17:12:44,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:12:44,932 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 17:12:44,932 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6683ff47-d74d-4eab-b0ef-b08aeaf9387f/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 17:12:44,933 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6683ff47-d74d-4eab-b0ef-b08aeaf9387f/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 17:12:44,937 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6683ff47-d74d-4eab-b0ef-b08aeaf9387f/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-11-21 17:12:45,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:12:45,293 INFO L263 TraceCheckSpWp]: Trace formula consists of 454 conjuncts, 98 conjunts are in the unsatisfiable core [2022-11-21 17:12:45,297 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 17:12:46,289 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 19 treesize of output 11 [2022-11-21 17:12:46,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 5 treesize of output 3 [2022-11-21 17:12:46,300 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 7 treesize of output 3 [2022-11-21 17:12:46,935 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:12:46,937 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-21 17:12:46,959 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:12:46,959 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-11-21 17:12:46,979 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-11-21 17:12:46,979 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 1 case distinctions, treesize of input 15 treesize of output 15 [2022-11-21 17:12:47,932 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:12:47,933 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 50 [2022-11-21 17:12:47,946 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:12:47,947 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 40 [2022-11-21 17:12:48,157 INFO L321 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-11-21 17:12:48,157 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 109 treesize of output 92 [2022-11-21 17:12:48,182 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-21 17:12:48,183 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 87 treesize of output 84 [2022-11-21 17:12:48,369 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 74 treesize of output 54 [2022-11-21 17:12:48,725 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 17:12:48,726 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:12:48,730 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 17:12:48,730 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 64 treesize of output 28 [2022-11-21 17:12:48,924 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 20 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-21 17:12:48,924 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 17:12:49,227 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3032 (Array Int Int)) (v_ArrVal_3033 (Array Int Int))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_3032) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_3033))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ .cse1 4)) 0)) (<= (+ .cse1 1) 0)))) is different from false [2022-11-21 17:12:50,901 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [896863897] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 17:12:50,901 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-21 17:12:50,901 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 28] total 55 [2022-11-21 17:12:50,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370395353] [2022-11-21 17:12:50,901 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-21 17:12:50,902 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2022-11-21 17:12:50,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:12:50,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2022-11-21 17:12:50,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=186, Invalid=3710, Unknown=14, NotChecked=122, Total=4032 [2022-11-21 17:12:50,904 INFO L87 Difference]: Start difference. First operand 74 states and 80 transitions. Second operand has 55 states, 53 states have (on average 1.9056603773584906) internal successors, (101), 49 states have internal predecessors, (101), 4 states have call successors, (4), 3 states have call predecessors, (4), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-11-21 17:12:59,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 17:12:59,710 INFO L93 Difference]: Finished difference Result 89 states and 95 transitions. [2022-11-21 17:12:59,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-11-21 17:12:59,717 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 53 states have (on average 1.9056603773584906) internal successors, (101), 49 states have internal predecessors, (101), 4 states have call successors, (4), 3 states have call predecessors, (4), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 60 [2022-11-21 17:12:59,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 17:12:59,719 INFO L225 Difference]: With dead ends: 89 [2022-11-21 17:12:59,719 INFO L226 Difference]: Without dead ends: 89 [2022-11-21 17:12:59,720 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 52 SyntacticMatches, 2 SemanticMatches, 89 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1518 ImplicationChecksByTransitivity, 12.5s TimeCoverageRelationStatistics Valid=823, Invalid=7175, Unknown=16, NotChecked=176, Total=8190 [2022-11-21 17:12:59,721 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 970 mSDsluCounter, 778 mSDsCounter, 0 mSdLazyCounter, 1512 mSolverCounterSat, 37 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 970 SdHoareTripleChecker+Valid, 807 SdHoareTripleChecker+Invalid, 1551 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 1512 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-11-21 17:12:59,721 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [970 Valid, 807 Invalid, 1551 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 1512 Invalid, 2 Unknown, 0 Unchecked, 2.1s Time] [2022-11-21 17:12:59,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-11-21 17:12:59,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 74. [2022-11-21 17:12:59,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 60 states have (on average 1.2166666666666666) internal successors, (73), 69 states have internal predecessors, (73), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-21 17:12:59,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 79 transitions. [2022-11-21 17:12:59,726 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 79 transitions. Word has length 60 [2022-11-21 17:12:59,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 17:12:59,726 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 79 transitions. [2022-11-21 17:12:59,727 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 53 states have (on average 1.9056603773584906) internal successors, (101), 49 states have internal predecessors, (101), 4 states have call successors, (4), 3 states have call predecessors, (4), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-11-21 17:12:59,727 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 79 transitions. [2022-11-21 17:12:59,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-11-21 17:12:59,728 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 17:12:59,728 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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] [2022-11-21 17:12:59,736 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6683ff47-d74d-4eab-b0ef-b08aeaf9387f/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-11-21 17:12:59,935 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6683ff47-d74d-4eab-b0ef-b08aeaf9387f/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2022-11-21 17:12:59,935 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-11-21 17:12:59,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:12:59,936 INFO L85 PathProgramCache]: Analyzing trace with hash 832836797, now seen corresponding path program 1 times [2022-11-21 17:12:59,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:12:59,936 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054277430] [2022-11-21 17:12:59,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:12:59,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:12:59,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:13:02,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-21 17:13:02,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:13:02,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-21 17:13:02,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:13:03,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-11-21 17:13:03,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:13:03,902 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 22 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-21 17:13:03,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:13:03,904 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054277430] [2022-11-21 17:13:03,904 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2054277430] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 17:13:03,904 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [652045128] [2022-11-21 17:13:03,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:13:03,905 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 17:13:03,905 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6683ff47-d74d-4eab-b0ef-b08aeaf9387f/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 17:13:03,906 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6683ff47-d74d-4eab-b0ef-b08aeaf9387f/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 17:13:03,909 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6683ff47-d74d-4eab-b0ef-b08aeaf9387f/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-11-21 17:13:04,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:13:04,248 INFO L263 TraceCheckSpWp]: Trace formula consists of 469 conjuncts, 131 conjunts are in the unsatisfiable core [2022-11-21 17:13:04,255 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 17:13:05,419 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 19 treesize of output 11 [2022-11-21 17:13:05,428 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-21 17:13:05,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 5 treesize of output 3 [2022-11-21 17:13:05,733 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 11 treesize of output 7 [2022-11-21 17:13:06,006 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:13:06,010 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 23 treesize of output 16 [2022-11-21 17:13:06,035 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:13:06,038 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 20 [2022-11-21 17:13:06,061 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-11-21 17:13:06,061 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2022-11-21 17:13:07,315 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:13:07,316 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 56 [2022-11-21 17:13:07,329 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:13:07,330 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 43 [2022-11-21 17:13:07,356 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-21 17:13:07,585 INFO L321 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-11-21 17:13:07,585 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 168 treesize of output 137 [2022-11-21 17:13:07,597 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:13:07,623 INFO L321 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2022-11-21 17:13:07,624 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 153 treesize of output 145 [2022-11-21 17:13:07,646 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 46 [2022-11-21 17:13:08,358 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:13:08,361 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 17:13:08,361 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 123 treesize of output 54 [2022-11-21 17:13:08,370 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:13:08,370 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 18 [2022-11-21 17:13:08,715 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-21 17:13:08,811 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 26 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-21 17:13:08,811 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 17:13:09,468 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3232 (Array Int Int)) (v_ArrVal_3233 (Array Int Int)) (v_ArrVal_3231 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse3 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_3233)) (.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_3232))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (+ 4 (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) (+ |c_ULTIMATE.start_sll_insert_~new_node~0#1.offset| 4) v_ArrVal_3231)) (select (select .cse0 .cse1) .cse2)) (select (select .cse3 .cse1) .cse2)))))) is different from false [2022-11-21 17:13:09,494 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3230 (Array Int Int)) (v_ArrVal_3232 (Array Int Int)) (v_ArrVal_3233 (Array Int Int)) (v_ArrVal_3231 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse5 (+ |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset| 4))) (let ((.cse4 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base|) .cse5 |c_ULTIMATE.start_sll_insert_~new_node~0#1.offset|)) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_3233)) (.cse1 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base|) .cse5 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|)) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_3232))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse3 (+ (select (select .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (select (select (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| v_ArrVal_3230))) (store .cse0 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| (store (select .cse0 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) (+ |c_ULTIMATE.start_sll_insert_~new_node~0#1.offset| 4) v_ArrVal_3231))) (select (select .cse1 .cse2) .cse3)) (select (select .cse4 .cse2) .cse3))))))) is different from false [2022-11-21 17:13:09,555 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3230 (Array Int Int)) (v_ArrVal_3232 (Array Int Int)) (v_ArrVal_3233 (Array Int Int)) (v_ArrVal_3231 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse5 (+ |c_ULTIMATE.start_sll_insert_~last~0#1.offset| 4))) (let ((.cse4 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_insert_~last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_insert_~last~0#1.base|) .cse5 |c_ULTIMATE.start_sll_insert_~new_node~0#1.offset|)) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_3233)) (.cse1 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_insert_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_insert_~last~0#1.base|) .cse5 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|)) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_3232))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse3 (+ 4 (select (select .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (select (select (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_sll_insert_~last~0#1.base| v_ArrVal_3230))) (store .cse0 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| (store (select .cse0 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) (+ |c_ULTIMATE.start_sll_insert_~new_node~0#1.offset| 4) v_ArrVal_3231))) (select (select .cse1 .cse2) .cse3)) (select (select .cse4 .cse2) .cse3))))))) is different from false [2022-11-21 17:13:10,466 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3230 (Array Int Int)) (v_ArrVal_3232 (Array Int Int)) (v_ArrVal_3233 (Array Int Int)) (v_ArrVal_3231 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse6 (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse5 (store (store |c_#memory_$Pointer$.offset| .cse1 (store (select |c_#memory_$Pointer$.offset| .cse1) .cse6 |c_ULTIMATE.start_sll_insert_~new_node~0#1.offset|)) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_3233)) (.cse2 (store (store |c_#memory_$Pointer$.base| .cse1 (store (select |c_#memory_$Pointer$.base| .cse1) .cse6 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|)) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_3232))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse4 (+ (select (select .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (select (select (let ((.cse0 (store |c_#memory_int| .cse1 v_ArrVal_3230))) (store .cse0 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| (store (select .cse0 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) (+ |c_ULTIMATE.start_sll_insert_~new_node~0#1.offset| 4) v_ArrVal_3231))) (select (select .cse2 .cse3) .cse4)) (select (select .cse5 .cse3) .cse4))))))) is different from false [2022-11-21 17:13:10,492 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3230 (Array Int Int)) (v_ArrVal_3232 (Array Int Int)) (v_ArrVal_3233 (Array Int Int)) (v_ArrVal_3231 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse6 (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse5 (store (store |c_#memory_$Pointer$.offset| .cse1 (store (select |c_#memory_$Pointer$.offset| .cse1) .cse6 |c_ULTIMATE.start_sll_insert_#t~ret7#1.offset|)) |c_ULTIMATE.start_sll_insert_#t~ret7#1.base| v_ArrVal_3233)) (.cse2 (store (store |c_#memory_$Pointer$.base| .cse1 (store (select |c_#memory_$Pointer$.base| .cse1) .cse6 |c_ULTIMATE.start_sll_insert_#t~ret7#1.base|)) |c_ULTIMATE.start_sll_insert_#t~ret7#1.base| v_ArrVal_3232))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse4 (+ (select (select .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (select (select (let ((.cse0 (store |c_#memory_int| .cse1 v_ArrVal_3230))) (store .cse0 |c_ULTIMATE.start_sll_insert_#t~ret7#1.base| (store (select .cse0 |c_ULTIMATE.start_sll_insert_#t~ret7#1.base|) (+ 4 |c_ULTIMATE.start_sll_insert_#t~ret7#1.offset|) v_ArrVal_3231))) (select (select .cse2 .cse3) .cse4)) (select (select .cse5 .cse3) .cse4))))))) is different from false [2022-11-21 17:13:10,677 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 17:13:10,677 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 319 treesize of output 312 [2022-11-21 17:13:10,731 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 17:13:10,731 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 6836 treesize of output 6424 [2022-11-21 17:13:10,760 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 7388 treesize of output 6300 [2022-11-21 17:13:12,281 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 1852 treesize of output 1308 [2022-11-21 17:13:23,249 WARN L233 SmtUtils]: Spent 10.91s on a formula simplification that was a NOOP. DAG size: 257 (called from [L 318] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2022-11-21 17:13:23,250 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 17:13:23,251 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 3260 treesize of output 7162