./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/list-simple/sll2n_update_all.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6b4ec56b Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6aec7cb7-89c8-447d-8f3d-5def91949efc/bin/utaipan-6cKwYrpEi9/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6aec7cb7-89c8-447d-8f3d-5def91949efc/bin/utaipan-6cKwYrpEi9/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6aec7cb7-89c8-447d-8f3d-5def91949efc/bin/utaipan-6cKwYrpEi9/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6aec7cb7-89c8-447d-8f3d-5def91949efc/bin/utaipan-6cKwYrpEi9/config/TaipanReach.xml -i ../../sv-benchmarks/c/list-simple/sll2n_update_all.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6aec7cb7-89c8-447d-8f3d-5def91949efc/bin/utaipan-6cKwYrpEi9/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6aec7cb7-89c8-447d-8f3d-5def91949efc/bin/utaipan-6cKwYrpEi9 --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1fd0aba5d9be2820550e57012fb4e12f76fe291bb253443319d08539e5b2ba1a --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-6b4ec56 [2022-11-20 18:56:14,077 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-20 18:56:14,079 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-20 18:56:14,098 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-20 18:56:14,098 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-20 18:56:14,099 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-20 18:56:14,101 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-20 18:56:14,102 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-20 18:56:14,104 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-20 18:56:14,105 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-20 18:56:14,106 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-20 18:56:14,107 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-20 18:56:14,107 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-20 18:56:14,108 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-20 18:56:14,109 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-20 18:56:14,111 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-20 18:56:14,111 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-20 18:56:14,112 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-20 18:56:14,114 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-20 18:56:14,115 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-20 18:56:14,117 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-20 18:56:14,118 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-20 18:56:14,119 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-20 18:56:14,120 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-20 18:56:14,123 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-20 18:56:14,124 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-20 18:56:14,124 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-20 18:56:14,125 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-20 18:56:14,125 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-20 18:56:14,126 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-20 18:56:14,127 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-20 18:56:14,127 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-20 18:56:14,128 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-20 18:56:14,129 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-20 18:56:14,130 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-20 18:56:14,130 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-20 18:56:14,134 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-20 18:56:14,134 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-20 18:56:14,134 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-20 18:56:14,135 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-20 18:56:14,136 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-20 18:56:14,137 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6aec7cb7-89c8-447d-8f3d-5def91949efc/bin/utaipan-6cKwYrpEi9/config/svcomp-Reach-32bit-Taipan_Default.epf [2022-11-20 18:56:14,159 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-20 18:56:14,159 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-20 18:56:14,159 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-20 18:56:14,160 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-20 18:56:14,160 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-20 18:56:14,161 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-20 18:56:14,161 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-20 18:56:14,161 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-20 18:56:14,161 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-20 18:56:14,161 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-20 18:56:14,162 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-20 18:56:14,162 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-20 18:56:14,162 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-20 18:56:14,162 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-20 18:56:14,162 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-20 18:56:14,162 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-20 18:56:14,163 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-20 18:56:14,163 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-20 18:56:14,164 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-20 18:56:14,164 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-20 18:56:14,164 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-20 18:56:14,164 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-20 18:56:14,164 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-20 18:56:14,164 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-20 18:56:14,165 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-20 18:56:14,165 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-20 18:56:14,165 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-20 18:56:14,165 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-20 18:56:14,165 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-20 18:56:14,165 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-20 18:56:14,166 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-20 18:56:14,166 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-20 18:56:14,166 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 18:56:14,166 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-20 18:56:14,166 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-20 18:56:14,167 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-20 18:56:14,167 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-20 18:56:14,167 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-20 18:56:14,167 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-20 18:56:14,167 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-20 18:56:14,167 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-20 18:56:14,168 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_6aec7cb7-89c8-447d-8f3d-5def91949efc/bin/utaipan-6cKwYrpEi9/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_6aec7cb7-89c8-447d-8f3d-5def91949efc/bin/utaipan-6cKwYrpEi9 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan 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 -> 1fd0aba5d9be2820550e57012fb4e12f76fe291bb253443319d08539e5b2ba1a [2022-11-20 18:56:14,495 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-20 18:56:14,535 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-20 18:56:14,538 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-20 18:56:14,539 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-20 18:56:14,540 INFO L275 PluginConnector]: CDTParser initialized [2022-11-20 18:56:14,541 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6aec7cb7-89c8-447d-8f3d-5def91949efc/bin/utaipan-6cKwYrpEi9/../../sv-benchmarks/c/list-simple/sll2n_update_all.i [2022-11-20 18:56:17,791 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-20 18:56:18,080 INFO L351 CDTParser]: Found 1 translation units. [2022-11-20 18:56:18,081 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6aec7cb7-89c8-447d-8f3d-5def91949efc/sv-benchmarks/c/list-simple/sll2n_update_all.i [2022-11-20 18:56:18,095 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6aec7cb7-89c8-447d-8f3d-5def91949efc/bin/utaipan-6cKwYrpEi9/data/5de860261/9c21d45e74a34db1908a9585a605505c/FLAGc7c0000cb [2022-11-20 18:56:18,112 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6aec7cb7-89c8-447d-8f3d-5def91949efc/bin/utaipan-6cKwYrpEi9/data/5de860261/9c21d45e74a34db1908a9585a605505c [2022-11-20 18:56:18,116 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-20 18:56:18,117 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-20 18:56:18,119 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-20 18:56:18,119 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-20 18:56:18,129 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-20 18:56:18,130 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 06:56:18" (1/1) ... [2022-11-20 18:56:18,132 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@52e29652 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:56:18, skipping insertion in model container [2022-11-20 18:56:18,133 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 06:56:18" (1/1) ... [2022-11-20 18:56:18,142 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-20 18:56:18,188 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-20 18:56:18,636 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_6aec7cb7-89c8-447d-8f3d-5def91949efc/sv-benchmarks/c/list-simple/sll2n_update_all.i[24218,24231] [2022-11-20 18:56:18,642 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 18:56:18,660 INFO L203 MainTranslator]: Completed pre-run [2022-11-20 18:56:18,735 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_6aec7cb7-89c8-447d-8f3d-5def91949efc/sv-benchmarks/c/list-simple/sll2n_update_all.i[24218,24231] [2022-11-20 18:56:18,736 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 18:56:18,772 INFO L208 MainTranslator]: Completed translation [2022-11-20 18:56:18,773 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:56:18 WrapperNode [2022-11-20 18:56:18,773 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-20 18:56:18,775 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-20 18:56:18,775 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-20 18:56:18,775 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-20 18:56:18,783 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:56:18" (1/1) ... [2022-11-20 18:56:18,815 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:56:18" (1/1) ... [2022-11-20 18:56:18,850 INFO L138 Inliner]: procedures = 126, calls = 22, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 118 [2022-11-20 18:56:18,851 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-20 18:56:18,852 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-20 18:56:18,853 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-20 18:56:18,853 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-20 18:56:18,862 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:56:18" (1/1) ... [2022-11-20 18:56:18,862 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:56:18" (1/1) ... [2022-11-20 18:56:18,865 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:56:18" (1/1) ... [2022-11-20 18:56:18,865 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:56:18" (1/1) ... [2022-11-20 18:56:18,871 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:56:18" (1/1) ... [2022-11-20 18:56:18,875 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:56:18" (1/1) ... [2022-11-20 18:56:18,886 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:56:18" (1/1) ... [2022-11-20 18:56:18,887 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:56:18" (1/1) ... [2022-11-20 18:56:18,893 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-20 18:56:18,894 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-20 18:56:18,894 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-20 18:56:18,894 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-20 18:56:18,895 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:56:18" (1/1) ... [2022-11-20 18:56:18,909 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 18:56:18,923 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6aec7cb7-89c8-447d-8f3d-5def91949efc/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 18:56:18,938 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6aec7cb7-89c8-447d-8f3d-5def91949efc/bin/utaipan-6cKwYrpEi9/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-20 18:56:18,952 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6aec7cb7-89c8-447d-8f3d-5def91949efc/bin/utaipan-6cKwYrpEi9/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-20 18:56:18,984 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-20 18:56:18,984 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-20 18:56:18,984 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-20 18:56:18,984 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-20 18:56:18,985 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-20 18:56:18,985 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-20 18:56:18,985 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-20 18:56:18,985 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-20 18:56:18,985 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-20 18:56:18,986 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-20 18:56:19,099 INFO L235 CfgBuilder]: Building ICFG [2022-11-20 18:56:19,102 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-20 18:56:19,334 INFO L276 CfgBuilder]: Performing block encoding [2022-11-20 18:56:19,462 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-20 18:56:19,463 INFO L300 CfgBuilder]: Removed 6 assume(true) statements. [2022-11-20 18:56:19,467 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 06:56:19 BoogieIcfgContainer [2022-11-20 18:56:19,467 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-20 18:56:19,472 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-20 18:56:19,474 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-20 18:56:19,478 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-20 18:56:19,478 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 06:56:18" (1/3) ... [2022-11-20 18:56:19,480 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7cb75704 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 06:56:19, skipping insertion in model container [2022-11-20 18:56:19,480 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:56:18" (2/3) ... [2022-11-20 18:56:19,483 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7cb75704 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 06:56:19, skipping insertion in model container [2022-11-20 18:56:19,484 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 06:56:19" (3/3) ... [2022-11-20 18:56:19,486 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2n_update_all.i [2022-11-20 18:56:19,512 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-20 18:56:19,512 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-20 18:56:19,568 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-20 18:56:19,577 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@95e20c2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-20 18:56:19,577 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-20 18:56:19,581 INFO L276 IsEmpty]: Start isEmpty. Operand has 14 states, 12 states have (on average 1.75) internal successors, (21), 13 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 18:56:19,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-20 18:56:19,588 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 18:56:19,589 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-20 18:56:19,590 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 18:56:19,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 18:56:19,596 INFO L85 PathProgramCache]: Analyzing trace with hash 1963659983, now seen corresponding path program 1 times [2022-11-20 18:56:19,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 18:56:19,610 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7735100] [2022-11-20 18:56:19,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 18:56:19,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 18:56:19,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 18:56:19,921 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 18:56:19,922 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 18:56:19,922 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7735100] [2022-11-20 18:56:19,923 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [7735100] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 18:56:19,924 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 18:56:19,924 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 18:56:19,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701434926] [2022-11-20 18:56:19,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 18:56:19,932 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 18:56:19,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 18:56:19,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 18:56:19,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 18:56:19,974 INFO L87 Difference]: Start difference. First operand has 14 states, 12 states have (on average 1.75) internal successors, (21), 13 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 18:56:20,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 18:56:20,030 INFO L93 Difference]: Finished difference Result 27 states and 41 transitions. [2022-11-20 18:56:20,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 18:56:20,033 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-11-20 18:56:20,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 18:56:20,041 INFO L225 Difference]: With dead ends: 27 [2022-11-20 18:56:20,041 INFO L226 Difference]: Without dead ends: 12 [2022-11-20 18:56:20,044 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-20 18:56:20,048 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 3 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-20 18:56:20,049 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 18 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 18:56:20,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2022-11-20 18:56:20,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 11. [2022-11-20 18:56:20,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.5) internal successors, (15), 10 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 18:56:20,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 15 transitions. [2022-11-20 18:56:20,082 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 15 transitions. Word has length 7 [2022-11-20 18:56:20,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 18:56:20,083 INFO L495 AbstractCegarLoop]: Abstraction has 11 states and 15 transitions. [2022-11-20 18:56:20,083 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 18:56:20,083 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 15 transitions. [2022-11-20 18:56:20,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-20 18:56:20,084 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 18:56:20,084 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 18:56:20,085 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-20 18:56:20,085 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 18:56:20,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 18:56:20,086 INFO L85 PathProgramCache]: Analyzing trace with hash -1491156930, now seen corresponding path program 1 times [2022-11-20 18:56:20,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 18:56:20,087 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340531107] [2022-11-20 18:56:20,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 18:56:20,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 18:56:20,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 18:56:20,295 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 18:56:20,296 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 18:56:20,296 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340531107] [2022-11-20 18:56:20,310 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1340531107] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 18:56:20,311 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [313653557] [2022-11-20 18:56:20,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 18:56:20,312 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 18:56:20,312 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6aec7cb7-89c8-447d-8f3d-5def91949efc/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 18:56:20,319 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6aec7cb7-89c8-447d-8f3d-5def91949efc/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 18:56:20,322 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6aec7cb7-89c8-447d-8f3d-5def91949efc/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-20 18:56:20,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 18:56:20,529 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-20 18:56:20,536 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 18:56:20,607 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 18:56:20,607 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 18:56:20,643 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 18:56:20,648 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [313653557] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 18:56:20,649 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1008145079] [2022-11-20 18:56:20,679 INFO L159 IcfgInterpreter]: Started Sifa with 9 locations of interest [2022-11-20 18:56:20,680 INFO L166 IcfgInterpreter]: Building call graph [2022-11-20 18:56:20,685 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-20 18:56:20,695 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-20 18:56:20,697 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-20 18:56:20,843 INFO L321 Elim1Store]: treesize reduction 20, result has 48.7 percent of original size [2022-11-20 18:56:20,844 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 30 [2022-11-20 18:56:20,920 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-11-20 18:56:20,921 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 27 treesize of output 41 [2022-11-20 18:56:21,023 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 18:56:21,024 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 18:56:21,026 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 17 [2022-11-20 18:56:21,069 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 18:56:21,071 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 18:56:21,072 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 18:56:21,077 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 28 [2022-11-20 18:56:21,115 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 18:56:21,116 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 18:56:21,118 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 17 [2022-11-20 18:56:21,381 INFO L321 Elim1Store]: treesize reduction 70, result has 34.0 percent of original size [2022-11-20 18:56:21,381 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 232 treesize of output 255 [2022-11-20 18:56:21,473 INFO L321 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-11-20 18:56:21,474 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 225 treesize of output 233 [2022-11-20 18:56:21,888 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 18:56:22,008 INFO L321 Elim1Store]: treesize reduction 52, result has 33.3 percent of original size [2022-11-20 18:56:22,009 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 229 treesize of output 238 [2022-11-20 18:56:22,048 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 18:56:22,061 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-20 18:56:22,061 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 222 treesize of output 204 [2022-11-20 18:56:22,090 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 18:56:22,176 INFO L321 Elim1Store]: treesize reduction 52, result has 33.3 percent of original size [2022-11-20 18:56:22,176 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 223 treesize of output 232 [2022-11-20 18:56:22,202 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 18:56:22,207 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 18:56:22,234 INFO L321 Elim1Store]: treesize reduction 21, result has 34.4 percent of original size [2022-11-20 18:56:22,234 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 232 treesize of output 209 [2022-11-20 18:56:22,275 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 18:56:22,314 INFO L321 Elim1Store]: treesize reduction 39, result has 18.8 percent of original size [2022-11-20 18:56:22,315 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 49 treesize of output 42 [2022-11-20 18:56:22,353 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 18:56:22,386 INFO L321 Elim1Store]: treesize reduction 39, result has 18.8 percent of original size [2022-11-20 18:56:22,388 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 49 treesize of output 42 [2022-11-20 18:56:22,778 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 9 [2022-11-20 18:56:22,790 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-20 18:56:22,828 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 18:56:22,829 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 18:56:22,830 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 18:56:22,831 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 17 [2022-11-20 18:56:22,854 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 18:56:22,855 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 18:56:22,856 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 7 [2022-11-20 18:56:22,873 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 18:56:22,874 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 18:56:22,875 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 17 [2022-11-20 18:56:22,923 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-20 18:56:22,931 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 9 [2022-11-20 18:56:22,936 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-20 18:56:23,221 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [1008145079] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 18:56:23,221 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-11-20 18:56:23,221 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [3, 3, 3] total 7 [2022-11-20 18:56:23,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556032633] [2022-11-20 18:56:23,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 18:56:23,223 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 18:56:23,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 18:56:23,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 18:56:23,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-11-20 18:56:23,224 INFO L87 Difference]: Start difference. First operand 11 states and 15 transitions. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 18:56:23,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 18:56:23,291 INFO L93 Difference]: Finished difference Result 18 states and 25 transitions. [2022-11-20 18:56:23,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 18:56:23,292 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-11-20 18:56:23,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 18:56:23,293 INFO L225 Difference]: With dead ends: 18 [2022-11-20 18:56:23,293 INFO L226 Difference]: Without dead ends: 13 [2022-11-20 18:56:23,293 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 20 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-11-20 18:56:23,294 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 17 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 18:56:23,295 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 12 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 18:56:23,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2022-11-20 18:56:23,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 12. [2022-11-20 18:56:23,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 11 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 18:56:23,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 16 transitions. [2022-11-20 18:56:23,316 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 16 transitions. Word has length 9 [2022-11-20 18:56:23,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 18:56:23,317 INFO L495 AbstractCegarLoop]: Abstraction has 12 states and 16 transitions. [2022-11-20 18:56:23,317 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 18:56:23,317 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 16 transitions. [2022-11-20 18:56:23,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-20 18:56:23,318 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 18:56:23,318 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 18:56:23,334 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6aec7cb7-89c8-447d-8f3d-5def91949efc/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-20 18:56:23,524 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6aec7cb7-89c8-447d-8f3d-5def91949efc/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 18:56:23,524 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 18:56:23,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 18:56:23,524 INFO L85 PathProgramCache]: Analyzing trace with hash -1766738179, now seen corresponding path program 1 times [2022-11-20 18:56:23,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 18:56:23,525 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092892797] [2022-11-20 18:56:23,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 18:56:23,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 18:56:23,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 18:56:23,708 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-20 18:56:23,708 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 18:56:23,711 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092892797] [2022-11-20 18:56:23,712 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1092892797] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 18:56:23,712 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [125791454] [2022-11-20 18:56:23,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 18:56:23,713 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 18:56:23,713 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6aec7cb7-89c8-447d-8f3d-5def91949efc/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 18:56:23,715 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6aec7cb7-89c8-447d-8f3d-5def91949efc/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 18:56:23,735 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6aec7cb7-89c8-447d-8f3d-5def91949efc/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-20 18:56:23,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 18:56:23,829 INFO L263 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-20 18:56:23,830 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 18:56:23,844 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-20 18:56:23,844 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 18:56:23,865 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-20 18:56:23,865 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [125791454] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 18:56:23,866 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1240430643] [2022-11-20 18:56:23,868 INFO L159 IcfgInterpreter]: Started Sifa with 10 locations of interest [2022-11-20 18:56:23,868 INFO L166 IcfgInterpreter]: Building call graph [2022-11-20 18:56:23,868 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-20 18:56:23,869 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-20 18:56:23,869 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-20 18:56:23,921 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-11-20 18:56:23,921 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 27 treesize of output 41 [2022-11-20 18:56:23,935 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2022-11-20 18:56:23,972 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 18:56:23,973 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 18:56:23,974 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 18:56:23,975 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 28 [2022-11-20 18:56:23,988 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 18:56:23,992 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 9 [2022-11-20 18:56:24,002 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 18:56:24,003 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 13 [2022-11-20 18:56:24,017 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 18:56:24,021 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 9 [2022-11-20 18:56:24,031 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 18:56:24,032 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 13 [2022-11-20 18:56:24,188 INFO L321 Elim1Store]: treesize reduction 70, result has 34.0 percent of original size [2022-11-20 18:56:24,189 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 232 treesize of output 255 [2022-11-20 18:56:24,244 INFO L321 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-11-20 18:56:24,245 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 225 treesize of output 233 [2022-11-20 18:56:24,474 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 18:56:24,587 INFO L321 Elim1Store]: treesize reduction 52, result has 33.3 percent of original size [2022-11-20 18:56:24,588 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 229 treesize of output 238 [2022-11-20 18:56:24,632 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 18:56:24,646 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-20 18:56:24,647 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 222 treesize of output 204 [2022-11-20 18:56:24,677 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 18:56:24,765 INFO L321 Elim1Store]: treesize reduction 52, result has 33.3 percent of original size [2022-11-20 18:56:24,766 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 223 treesize of output 232 [2022-11-20 18:56:24,788 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 18:56:24,793 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 18:56:24,821 INFO L321 Elim1Store]: treesize reduction 21, result has 34.4 percent of original size [2022-11-20 18:56:24,821 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 232 treesize of output 209 [2022-11-20 18:56:24,859 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 18:56:24,882 INFO L321 Elim1Store]: treesize reduction 39, result has 18.8 percent of original size [2022-11-20 18:56:24,883 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 49 treesize of output 42 [2022-11-20 18:56:24,911 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 18:56:24,930 INFO L321 Elim1Store]: treesize reduction 39, result has 18.8 percent of original size [2022-11-20 18:56:24,931 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 49 treesize of output 42 [2022-11-20 18:56:25,231 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-20 18:56:25,241 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 9 [2022-11-20 18:56:25,273 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 18:56:25,274 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 18:56:25,275 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 17 [2022-11-20 18:56:25,293 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 18:56:25,294 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 18:56:25,295 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 18:56:25,295 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 17 [2022-11-20 18:56:25,313 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 18:56:25,314 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 18:56:25,315 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 7 [2022-11-20 18:56:25,357 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-20 18:56:25,371 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-20 18:56:25,381 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-20 18:56:25,473 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-20 18:56:25,484 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-20 18:56:25,501 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-20 18:56:25,610 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-20 18:56:25,619 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-20 18:56:25,631 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-20 18:56:25,728 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 9 [2022-11-20 18:56:25,737 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-20 18:56:25,743 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-20 18:56:26,802 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '259#(and (<= 0 |ULTIMATE.start_main_~s~0#1.offset|) (= |ULTIMATE.start_main_~i~0#1| 0) (= (select (select |#memory_int| |ULTIMATE.start_sll_get_data_at_~head#1.base|) |ULTIMATE.start_sll_get_data_at_~head#1.offset|) |ULTIMATE.start_sll_get_data_at_#res#1|) (= |ULTIMATE.start_sll_get_data_at_#in~head#1.offset| |ULTIMATE.start_sll_get_data_at_~head#1.offset|) (not (= |ULTIMATE.start_sll_get_data_at_#res#1| |ULTIMATE.start_main_~expected~0#1|)) (= |ULTIMATE.start_sll_get_data_at_#in~index#1| |ULTIMATE.start_main_~i~0#1|) (<= 1 |ULTIMATE.start_sll_create_#in~data#1|) (<= |ULTIMATE.start_sll_create_#in~data#1| 1) (<= |ULTIMATE.start_sll_create_~head~0#1.offset| 0) (= (+ |ULTIMATE.start_main_~len~0#1| |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~expected~0#1|) (<= |ULTIMATE.start_sll_create_~len#1| 0) (<= |ULTIMATE.start_sll_create_#res#1.offset| 0) (<= 1 |ULTIMATE.start_sll_create_~data#1|) (= |ULTIMATE.start_main_~data~0#1| 1) (<= |ULTIMATE.start_sll_create_~data#1| 1) (<= |ULTIMATE.start_sll_create_#in~len#1| 2) (= |ULTIMATE.start_sll_get_data_at_#in~head#1.offset| |ULTIMATE.start_main_~s~0#1.offset|) (= |ULTIMATE.start_main_~len~0#1| 2) (= |#NULL.offset| 0) (= |ULTIMATE.start_sll_get_data_at_#in~head#1.base| |ULTIMATE.start_main_~s~0#1.base|) (= |ULTIMATE.start_sll_get_data_at_#in~index#1| |ULTIMATE.start_sll_get_data_at_~index#1|) (<= 0 |ULTIMATE.start_sll_create_#res#1.offset|) (<= |ULTIMATE.start_sll_get_data_at_#res#1| 2147483647) (= |ULTIMATE.start_sll_get_data_at_#in~head#1.base| |ULTIMATE.start_sll_get_data_at_~head#1.base|) (<= 0 |#StackHeapBarrier|) (<= 2 |ULTIMATE.start_sll_create_#in~len#1|) (<= |ULTIMATE.start_main_~s~0#1.offset| 0) (<= 0 |ULTIMATE.start_sll_create_~head~0#1.offset|) (= |#NULL.base| 0) (<= 0 (+ |ULTIMATE.start_sll_get_data_at_#res#1| 2147483648)))' at error location [2022-11-20 18:56:26,802 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-20 18:56:26,802 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 18:56:26,802 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2022-11-20 18:56:26,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427063270] [2022-11-20 18:56:26,803 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 18:56:26,803 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 18:56:26,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 18:56:26,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 18:56:26,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2022-11-20 18:56:26,804 INFO L87 Difference]: Start difference. First operand 12 states and 16 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 18:56:26,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 18:56:26,853 INFO L93 Difference]: Finished difference Result 22 states and 30 transitions. [2022-11-20 18:56:26,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 18:56:26,854 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-11-20 18:56:26,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 18:56:26,854 INFO L225 Difference]: With dead ends: 22 [2022-11-20 18:56:26,854 INFO L226 Difference]: Without dead ends: 14 [2022-11-20 18:56:26,857 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 21 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2022-11-20 18:56:26,859 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 2 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-20 18:56:26,861 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 18 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 18:56:26,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2022-11-20 18:56:26,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2022-11-20 18:56:26,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 13 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 18:56:26,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 18 transitions. [2022-11-20 18:56:26,875 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 18 transitions. Word has length 11 [2022-11-20 18:56:26,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 18:56:26,876 INFO L495 AbstractCegarLoop]: Abstraction has 14 states and 18 transitions. [2022-11-20 18:56:26,876 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 18:56:26,876 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 18 transitions. [2022-11-20 18:56:26,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-20 18:56:26,878 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 18:56:26,878 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 18:56:26,888 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6aec7cb7-89c8-447d-8f3d-5def91949efc/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-11-20 18:56:27,083 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6aec7cb7-89c8-447d-8f3d-5def91949efc/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 18:56:27,084 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 18:56:27,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 18:56:27,084 INFO L85 PathProgramCache]: Analyzing trace with hash 323163372, now seen corresponding path program 2 times [2022-11-20 18:56:27,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 18:56:27,084 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32188975] [2022-11-20 18:56:27,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 18:56:27,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 18:56:27,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 18:56:27,272 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-20 18:56:27,273 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 18:56:27,273 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [32188975] [2022-11-20 18:56:27,273 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [32188975] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 18:56:27,273 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [237654796] [2022-11-20 18:56:27,274 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-20 18:56:27,274 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 18:56:27,274 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6aec7cb7-89c8-447d-8f3d-5def91949efc/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 18:56:27,275 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6aec7cb7-89c8-447d-8f3d-5def91949efc/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 18:56:27,299 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6aec7cb7-89c8-447d-8f3d-5def91949efc/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-20 18:56:27,387 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-20 18:56:27,387 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 18:56:27,388 INFO L263 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-20 18:56:27,390 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 18:56:27,437 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-20 18:56:27,437 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 18:56:27,468 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-20 18:56:27,468 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [237654796] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 18:56:27,468 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [393414605] [2022-11-20 18:56:27,473 INFO L159 IcfgInterpreter]: Started Sifa with 10 locations of interest [2022-11-20 18:56:27,473 INFO L166 IcfgInterpreter]: Building call graph [2022-11-20 18:56:27,474 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-20 18:56:27,474 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-20 18:56:27,475 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-20 18:56:27,536 INFO L321 Elim1Store]: treesize reduction 20, result has 48.7 percent of original size [2022-11-20 18:56:27,536 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 30 [2022-11-20 18:56:27,575 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-11-20 18:56:27,576 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 27 treesize of output 41 [2022-11-20 18:56:27,606 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 18:56:27,609 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 9 [2022-11-20 18:56:27,618 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 18:56:27,619 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 13 [2022-11-20 18:56:27,633 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 18:56:27,637 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 9 [2022-11-20 18:56:27,647 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 18:56:27,648 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 13 [2022-11-20 18:56:27,677 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 18:56:27,678 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 18:56:27,679 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 18:56:27,683 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 28 [2022-11-20 18:56:27,806 INFO L321 Elim1Store]: treesize reduction 54, result has 27.0 percent of original size [2022-11-20 18:56:27,807 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 227 treesize of output 235 [2022-11-20 18:56:27,887 INFO L321 Elim1Store]: treesize reduction 78, result has 26.4 percent of original size [2022-11-20 18:56:27,888 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 230 treesize of output 245 [2022-11-20 18:56:28,179 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 18:56:28,186 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 18:56:28,270 INFO L321 Elim1Store]: treesize reduction 49, result has 25.8 percent of original size [2022-11-20 18:56:28,270 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 228 treesize of output 220 [2022-11-20 18:56:28,295 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 18:56:28,408 INFO L321 Elim1Store]: treesize reduction 52, result has 33.3 percent of original size [2022-11-20 18:56:28,409 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 1 case distinctions, treesize of input 225 treesize of output 234 [2022-11-20 18:56:28,441 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 18:56:28,541 INFO L321 Elim1Store]: treesize reduction 52, result has 33.3 percent of original size [2022-11-20 18:56:28,541 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 1 case distinctions, treesize of input 219 treesize of output 228 [2022-11-20 18:56:28,582 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 18:56:28,589 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 18:56:28,592 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 18:56:28,679 INFO L321 Elim1Store]: treesize reduction 89, result has 26.4 percent of original size [2022-11-20 18:56:28,679 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 245 treesize of output 235 [2022-11-20 18:56:28,721 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 18:56:28,746 INFO L321 Elim1Store]: treesize reduction 39, result has 18.8 percent of original size [2022-11-20 18:56:28,746 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 49 treesize of output 42 [2022-11-20 18:56:28,781 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 18:56:28,813 INFO L321 Elim1Store]: treesize reduction 39, result has 18.8 percent of original size [2022-11-20 18:56:28,814 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 49 treesize of output 42 [2022-11-20 18:56:29,151 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-20 18:56:29,157 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 9 [2022-11-20 18:56:29,185 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 18:56:29,186 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 18:56:29,191 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 17 [2022-11-20 18:56:29,210 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 18:56:29,211 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 18:56:29,212 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 7 [2022-11-20 18:56:29,229 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 18:56:29,229 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 18:56:29,231 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 18:56:29,232 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 17 [2022-11-20 18:56:29,276 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-20 18:56:29,285 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-20 18:56:29,303 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-20 18:56:29,346 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-20 18:56:29,355 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-20 18:56:29,362 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-20 18:56:29,441 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-20 18:56:29,451 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-20 18:56:29,463 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-20 18:56:29,556 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-20 18:56:29,564 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 9 [2022-11-20 18:56:29,567 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-20 18:56:30,465 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '413#(and (<= 0 |ULTIMATE.start_main_~s~0#1.offset|) (= |ULTIMATE.start_main_~i~0#1| 0) (= (select (select |#memory_int| |ULTIMATE.start_sll_get_data_at_~head#1.base|) |ULTIMATE.start_sll_get_data_at_~head#1.offset|) |ULTIMATE.start_sll_get_data_at_#res#1|) (= |ULTIMATE.start_sll_get_data_at_#in~head#1.offset| |ULTIMATE.start_sll_get_data_at_~head#1.offset|) (not (= |ULTIMATE.start_sll_get_data_at_#res#1| |ULTIMATE.start_main_~expected~0#1|)) (= |ULTIMATE.start_sll_get_data_at_#in~index#1| |ULTIMATE.start_main_~i~0#1|) (<= 1 |ULTIMATE.start_sll_create_#in~data#1|) (<= |ULTIMATE.start_sll_create_#in~data#1| 1) (<= |ULTIMATE.start_sll_create_~head~0#1.offset| 0) (= (+ |ULTIMATE.start_main_~len~0#1| |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~expected~0#1|) (<= |ULTIMATE.start_sll_create_~len#1| 0) (<= |ULTIMATE.start_sll_create_#res#1.offset| 0) (<= 1 |ULTIMATE.start_sll_create_~data#1|) (= |ULTIMATE.start_main_~data~0#1| 1) (<= |ULTIMATE.start_sll_create_~data#1| 1) (<= |ULTIMATE.start_sll_create_#in~len#1| 2) (= |ULTIMATE.start_sll_get_data_at_#in~head#1.offset| |ULTIMATE.start_main_~s~0#1.offset|) (= |ULTIMATE.start_main_~len~0#1| 2) (= |#NULL.offset| 0) (= |ULTIMATE.start_sll_get_data_at_#in~head#1.base| |ULTIMATE.start_main_~s~0#1.base|) (= |ULTIMATE.start_sll_get_data_at_#in~index#1| |ULTIMATE.start_sll_get_data_at_~index#1|) (<= 0 |ULTIMATE.start_sll_create_#res#1.offset|) (<= |ULTIMATE.start_sll_get_data_at_#res#1| 2147483647) (= |ULTIMATE.start_sll_get_data_at_#in~head#1.base| |ULTIMATE.start_sll_get_data_at_~head#1.base|) (<= 0 |#StackHeapBarrier|) (<= 2 |ULTIMATE.start_sll_create_#in~len#1|) (<= |ULTIMATE.start_main_~s~0#1.offset| 0) (<= 0 |ULTIMATE.start_sll_create_~head~0#1.offset|) (= |#NULL.base| 0) (<= 0 (+ |ULTIMATE.start_sll_get_data_at_#res#1| 2147483648)))' at error location [2022-11-20 18:56:30,466 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-20 18:56:30,466 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 18:56:30,466 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2022-11-20 18:56:30,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503502020] [2022-11-20 18:56:30,466 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 18:56:30,467 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-20 18:56:30,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 18:56:30,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-20 18:56:30,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=197, Unknown=0, NotChecked=0, Total=306 [2022-11-20 18:56:30,468 INFO L87 Difference]: Start difference. First operand 14 states and 18 transitions. Second operand has 10 states, 10 states have (on average 2.2) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 18:56:30,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 18:56:30,540 INFO L93 Difference]: Finished difference Result 27 states and 35 transitions. [2022-11-20 18:56:30,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 18:56:30,541 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.2) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-11-20 18:56:30,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 18:56:30,541 INFO L225 Difference]: With dead ends: 27 [2022-11-20 18:56:30,541 INFO L226 Difference]: Without dead ends: 22 [2022-11-20 18:56:30,542 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=109, Invalid=197, Unknown=0, NotChecked=0, Total=306 [2022-11-20 18:56:30,543 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 36 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 18:56:30,544 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 15 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 18:56:30,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-11-20 18:56:30,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 16. [2022-11-20 18:56:30,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 1.4) internal successors, (21), 15 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 18:56:30,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 21 transitions. [2022-11-20 18:56:30,552 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 21 transitions. Word has length 13 [2022-11-20 18:56:30,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 18:56:30,553 INFO L495 AbstractCegarLoop]: Abstraction has 16 states and 21 transitions. [2022-11-20 18:56:30,553 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.2) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 18:56:30,553 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 21 transitions. [2022-11-20 18:56:30,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-20 18:56:30,554 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 18:56:30,554 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 18:56:30,561 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6aec7cb7-89c8-447d-8f3d-5def91949efc/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-20 18:56:30,760 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6aec7cb7-89c8-447d-8f3d-5def91949efc/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 18:56:30,760 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 18:56:30,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 18:56:30,761 INFO L85 PathProgramCache]: Analyzing trace with hash -1961650133, now seen corresponding path program 3 times [2022-11-20 18:56:30,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 18:56:30,761 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468401711] [2022-11-20 18:56:30,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 18:56:30,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 18:56:30,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 18:56:30,903 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-20 18:56:30,903 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 18:56:30,903 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468401711] [2022-11-20 18:56:30,903 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1468401711] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 18:56:30,904 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [531290541] [2022-11-20 18:56:30,904 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-20 18:56:30,904 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 18:56:30,904 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6aec7cb7-89c8-447d-8f3d-5def91949efc/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 18:56:30,905 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6aec7cb7-89c8-447d-8f3d-5def91949efc/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 18:56:30,935 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6aec7cb7-89c8-447d-8f3d-5def91949efc/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-20 18:56:31,044 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-20 18:56:31,044 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 18:56:31,046 INFO L263 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-20 18:56:31,047 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 18:56:31,066 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-20 18:56:31,066 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 18:56:31,092 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-20 18:56:31,092 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [531290541] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 18:56:31,092 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [201846247] [2022-11-20 18:56:31,094 INFO L159 IcfgInterpreter]: Started Sifa with 10 locations of interest [2022-11-20 18:56:31,095 INFO L166 IcfgInterpreter]: Building call graph [2022-11-20 18:56:31,095 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-20 18:56:31,095 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-20 18:56:31,095 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-20 18:56:31,143 INFO L321 Elim1Store]: treesize reduction 20, result has 48.7 percent of original size [2022-11-20 18:56:31,143 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 30 [2022-11-20 18:56:31,190 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-11-20 18:56:31,190 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 27 treesize of output 41 [2022-11-20 18:56:31,249 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 18:56:31,253 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 9 [2022-11-20 18:56:31,261 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 18:56:31,262 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 13 [2022-11-20 18:56:31,281 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 18:56:31,282 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 18:56:31,283 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 17 [2022-11-20 18:56:31,300 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 18:56:31,301 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 18:56:31,302 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 18:56:31,303 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 28 [2022-11-20 18:56:31,429 INFO L321 Elim1Store]: treesize reduction 70, result has 34.0 percent of original size [2022-11-20 18:56:31,429 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 232 treesize of output 255 [2022-11-20 18:56:31,473 INFO L321 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-11-20 18:56:31,473 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 225 treesize of output 233 [2022-11-20 18:56:31,652 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 18:56:31,663 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-20 18:56:31,664 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 228 treesize of output 210 [2022-11-20 18:56:31,683 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 18:56:31,774 INFO L321 Elim1Store]: treesize reduction 52, result has 33.3 percent of original size [2022-11-20 18:56:31,774 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 229 treesize of output 238 [2022-11-20 18:56:31,799 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 18:56:31,876 INFO L321 Elim1Store]: treesize reduction 52, result has 33.3 percent of original size [2022-11-20 18:56:31,876 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 223 treesize of output 232 [2022-11-20 18:56:31,917 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 18:56:31,920 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 18:56:31,943 INFO L321 Elim1Store]: treesize reduction 21, result has 34.4 percent of original size [2022-11-20 18:56:31,943 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 232 treesize of output 209 [2022-11-20 18:56:31,977 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 18:56:32,007 INFO L321 Elim1Store]: treesize reduction 39, result has 18.8 percent of original size [2022-11-20 18:56:32,008 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 49 treesize of output 42 [2022-11-20 18:56:32,038 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 18:56:32,069 INFO L321 Elim1Store]: treesize reduction 39, result has 18.8 percent of original size [2022-11-20 18:56:32,069 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 49 treesize of output 42 [2022-11-20 18:56:32,277 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 9 [2022-11-20 18:56:32,289 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-20 18:56:32,316 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 18:56:32,317 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 18:56:32,317 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 18:56:32,320 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 17 [2022-11-20 18:56:32,335 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 18:56:32,336 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 18:56:32,337 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 7 [2022-11-20 18:56:32,354 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 18:56:32,354 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 18:56:32,355 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 17 [2022-11-20 18:56:32,394 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-20 18:56:32,405 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-20 18:56:32,421 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-20 18:56:32,470 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-20 18:56:32,477 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-20 18:56:32,484 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-20 18:56:32,519 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-20 18:56:32,532 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-20 18:56:32,542 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-20 18:56:32,607 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 9 [2022-11-20 18:56:32,615 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-20 18:56:32,617 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-20 18:56:33,517 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '588#(and (<= 0 |ULTIMATE.start_main_~s~0#1.offset|) (= |ULTIMATE.start_main_~i~0#1| 0) (= (select (select |#memory_int| |ULTIMATE.start_sll_get_data_at_~head#1.base|) |ULTIMATE.start_sll_get_data_at_~head#1.offset|) |ULTIMATE.start_sll_get_data_at_#res#1|) (= |ULTIMATE.start_sll_get_data_at_#in~head#1.offset| |ULTIMATE.start_sll_get_data_at_~head#1.offset|) (not (= |ULTIMATE.start_sll_get_data_at_#res#1| |ULTIMATE.start_main_~expected~0#1|)) (= |ULTIMATE.start_sll_get_data_at_#in~index#1| |ULTIMATE.start_main_~i~0#1|) (<= 1 |ULTIMATE.start_sll_create_#in~data#1|) (<= |ULTIMATE.start_sll_create_#in~data#1| 1) (<= |ULTIMATE.start_sll_create_~head~0#1.offset| 0) (= (+ |ULTIMATE.start_main_~len~0#1| |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~expected~0#1|) (<= |ULTIMATE.start_sll_create_~len#1| 0) (<= |ULTIMATE.start_sll_create_#res#1.offset| 0) (<= 1 |ULTIMATE.start_sll_create_~data#1|) (= |ULTIMATE.start_main_~data~0#1| 1) (<= |ULTIMATE.start_sll_create_~data#1| 1) (<= |ULTIMATE.start_sll_create_#in~len#1| 2) (= |ULTIMATE.start_sll_get_data_at_#in~head#1.offset| |ULTIMATE.start_main_~s~0#1.offset|) (= |ULTIMATE.start_main_~len~0#1| 2) (= |#NULL.offset| 0) (= |ULTIMATE.start_sll_get_data_at_#in~head#1.base| |ULTIMATE.start_main_~s~0#1.base|) (= |ULTIMATE.start_sll_get_data_at_#in~index#1| |ULTIMATE.start_sll_get_data_at_~index#1|) (<= 0 |ULTIMATE.start_sll_create_#res#1.offset|) (<= |ULTIMATE.start_sll_get_data_at_#res#1| 2147483647) (= |ULTIMATE.start_sll_get_data_at_#in~head#1.base| |ULTIMATE.start_sll_get_data_at_~head#1.base|) (<= 0 |#StackHeapBarrier|) (<= 2 |ULTIMATE.start_sll_create_#in~len#1|) (<= |ULTIMATE.start_main_~s~0#1.offset| 0) (<= 0 |ULTIMATE.start_sll_create_~head~0#1.offset|) (= |#NULL.base| 0) (<= 0 (+ |ULTIMATE.start_sll_get_data_at_#res#1| 2147483648)))' at error location [2022-11-20 18:56:33,517 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-20 18:56:33,517 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 18:56:33,518 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2022-11-20 18:56:33,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033711007] [2022-11-20 18:56:33,518 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 18:56:33,518 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-20 18:56:33,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 18:56:33,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-20 18:56:33,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2022-11-20 18:56:33,519 INFO L87 Difference]: Start difference. First operand 16 states and 21 transitions. Second operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 18:56:33,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 18:56:33,620 INFO L93 Difference]: Finished difference Result 29 states and 39 transitions. [2022-11-20 18:56:33,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 18:56:33,622 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-11-20 18:56:33,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 18:56:33,625 INFO L225 Difference]: With dead ends: 29 [2022-11-20 18:56:33,626 INFO L226 Difference]: Without dead ends: 22 [2022-11-20 18:56:33,626 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 32 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2022-11-20 18:56:33,627 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 14 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 18:56:33,627 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 32 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 18:56:33,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-11-20 18:56:33,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 17. [2022-11-20 18:56:33,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.375) internal successors, (22), 16 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 18:56:33,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 22 transitions. [2022-11-20 18:56:33,641 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 22 transitions. Word has length 15 [2022-11-20 18:56:33,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 18:56:33,642 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 22 transitions. [2022-11-20 18:56:33,642 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 18:56:33,642 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 22 transitions. [2022-11-20 18:56:33,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-20 18:56:33,643 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 18:56:33,643 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 18:56:33,656 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6aec7cb7-89c8-447d-8f3d-5def91949efc/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-20 18:56:33,851 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6aec7cb7-89c8-447d-8f3d-5def91949efc/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 18:56:33,851 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 18:56:33,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 18:56:33,852 INFO L85 PathProgramCache]: Analyzing trace with hash -1300823316, now seen corresponding path program 1 times [2022-11-20 18:56:33,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 18:56:33,852 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117829131] [2022-11-20 18:56:33,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 18:56:33,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 18:56:33,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 18:56:35,233 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 18:56:35,233 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 18:56:35,233 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [117829131] [2022-11-20 18:56:35,233 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [117829131] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 18:56:35,233 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [202568612] [2022-11-20 18:56:35,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 18:56:35,234 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 18:56:35,234 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6aec7cb7-89c8-447d-8f3d-5def91949efc/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 18:56:35,235 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6aec7cb7-89c8-447d-8f3d-5def91949efc/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 18:56:35,255 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6aec7cb7-89c8-447d-8f3d-5def91949efc/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-20 18:56:35,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 18:56:35,380 INFO L263 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 89 conjunts are in the unsatisfiable core [2022-11-20 18:56:35,383 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 18:56:35,407 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-20 18:56:35,472 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-20 18:56:35,472 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-20 18:56:35,520 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-20 18:56:35,658 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-20 18:56:35,663 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2022-11-20 18:56:35,760 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 18:56:35,760 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 18 treesize of output 8 [2022-11-20 18:56:35,805 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-20 18:56:35,934 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-20 18:56:35,967 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 18:56:35,967 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 18:56:36,156 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 24 [2022-11-20 18:56:36,166 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 18:56:36,167 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 18:56:36,419 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 18:56:36,420 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [202568612] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 18:56:36,420 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1861848447] [2022-11-20 18:56:36,422 INFO L159 IcfgInterpreter]: Started Sifa with 10 locations of interest [2022-11-20 18:56:36,422 INFO L166 IcfgInterpreter]: Building call graph [2022-11-20 18:56:36,422 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-20 18:56:36,423 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-20 18:56:36,423 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-20 18:56:36,494 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-11-20 18:56:36,495 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 27 treesize of output 41 [2022-11-20 18:56:36,508 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2022-11-20 18:56:36,538 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 18:56:36,542 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 9 [2022-11-20 18:56:36,550 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 18:56:36,551 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 13 [2022-11-20 18:56:36,571 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 18:56:36,572 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 18:56:36,573 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 17 [2022-11-20 18:56:36,590 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 18:56:36,591 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 18:56:36,591 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 18:56:36,592 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 28 [2022-11-20 18:56:36,688 INFO L321 Elim1Store]: treesize reduction 54, result has 27.0 percent of original size [2022-11-20 18:56:36,689 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 227 treesize of output 235 [2022-11-20 18:56:36,766 INFO L321 Elim1Store]: treesize reduction 78, result has 26.4 percent of original size [2022-11-20 18:56:36,767 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 230 treesize of output 245 [2022-11-20 18:56:36,943 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 18:56:37,065 INFO L321 Elim1Store]: treesize reduction 52, result has 33.3 percent of original size [2022-11-20 18:56:37,065 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 1 case distinctions, treesize of input 229 treesize of output 238 [2022-11-20 18:56:37,087 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 18:56:37,191 INFO L321 Elim1Store]: treesize reduction 52, result has 33.3 percent of original size [2022-11-20 18:56:37,192 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 1 case distinctions, treesize of input 223 treesize of output 232 [2022-11-20 18:56:37,216 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 18:56:37,222 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 18:56:37,231 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-20 18:56:37,232 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 216 treesize of output 198 [2022-11-20 18:56:37,255 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 18:56:37,259 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 18:56:37,261 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 18:56:37,297 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-11-20 18:56:37,297 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 232 treesize of output 209 [2022-11-20 18:56:37,325 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 18:56:37,359 INFO L321 Elim1Store]: treesize reduction 39, result has 18.8 percent of original size [2022-11-20 18:56:37,360 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 49 treesize of output 42 [2022-11-20 18:56:37,387 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 18:56:37,406 INFO L321 Elim1Store]: treesize reduction 39, result has 18.8 percent of original size [2022-11-20 18:56:37,406 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 49 treesize of output 42 [2022-11-20 18:56:37,663 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-20 18:56:37,671 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 9 [2022-11-20 18:56:37,700 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 18:56:37,701 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 18:56:37,702 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 17 [2022-11-20 18:56:37,718 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 18:56:37,719 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 18:56:37,720 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 18:56:37,721 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 17 [2022-11-20 18:56:37,740 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 18:56:37,740 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 18:56:37,741 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 7 [2022-11-20 18:56:37,791 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-20 18:56:37,802 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-20 18:56:37,820 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-20 18:56:37,897 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-20 18:56:37,912 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-20 18:56:37,922 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-20 18:56:38,018 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-20 18:56:38,027 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-20 18:56:38,039 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-20 18:56:38,127 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-20 18:56:38,135 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 9 [2022-11-20 18:56:38,139 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-20 18:56:39,499 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '805#(and (<= 0 |ULTIMATE.start_main_~s~0#1.offset|) (= |ULTIMATE.start_main_~i~0#1| 0) (= (select (select |#memory_int| |ULTIMATE.start_sll_get_data_at_~head#1.base|) |ULTIMATE.start_sll_get_data_at_~head#1.offset|) |ULTIMATE.start_sll_get_data_at_#res#1|) (= |ULTIMATE.start_sll_get_data_at_#in~head#1.offset| |ULTIMATE.start_sll_get_data_at_~head#1.offset|) (not (= |ULTIMATE.start_sll_get_data_at_#res#1| |ULTIMATE.start_main_~expected~0#1|)) (= |ULTIMATE.start_sll_get_data_at_#in~index#1| |ULTIMATE.start_main_~i~0#1|) (<= 1 |ULTIMATE.start_sll_create_#in~data#1|) (<= |ULTIMATE.start_sll_create_#in~data#1| 1) (<= |ULTIMATE.start_sll_create_~head~0#1.offset| 0) (= (+ |ULTIMATE.start_main_~len~0#1| |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~expected~0#1|) (<= |ULTIMATE.start_sll_create_~len#1| 0) (<= |ULTIMATE.start_sll_create_#res#1.offset| 0) (<= 1 |ULTIMATE.start_sll_create_~data#1|) (= |ULTIMATE.start_main_~data~0#1| 1) (<= |ULTIMATE.start_sll_create_~data#1| 1) (<= |ULTIMATE.start_sll_create_#in~len#1| 2) (= |ULTIMATE.start_sll_get_data_at_#in~head#1.offset| |ULTIMATE.start_main_~s~0#1.offset|) (= |ULTIMATE.start_main_~len~0#1| 2) (= |#NULL.offset| 0) (= |ULTIMATE.start_sll_get_data_at_#in~head#1.base| |ULTIMATE.start_main_~s~0#1.base|) (= |ULTIMATE.start_sll_get_data_at_#in~index#1| |ULTIMATE.start_sll_get_data_at_~index#1|) (<= 0 |ULTIMATE.start_sll_create_#res#1.offset|) (<= |ULTIMATE.start_sll_get_data_at_#res#1| 2147483647) (= |ULTIMATE.start_sll_get_data_at_#in~head#1.base| |ULTIMATE.start_sll_get_data_at_~head#1.base|) (<= 0 |#StackHeapBarrier|) (<= 2 |ULTIMATE.start_sll_create_#in~len#1|) (<= |ULTIMATE.start_main_~s~0#1.offset| 0) (<= 0 |ULTIMATE.start_sll_create_~head~0#1.offset|) (= |#NULL.base| 0) (<= 0 (+ |ULTIMATE.start_sll_get_data_at_#res#1| 2147483648)))' at error location [2022-11-20 18:56:39,499 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-20 18:56:39,499 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 18:56:39,499 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 37 [2022-11-20 18:56:39,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853540919] [2022-11-20 18:56:39,500 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 18:56:39,500 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-11-20 18:56:39,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 18:56:39,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-11-20 18:56:39,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=1809, Unknown=0, NotChecked=0, Total=1980 [2022-11-20 18:56:39,501 INFO L87 Difference]: Start difference. First operand 17 states and 22 transitions. Second operand has 37 states, 37 states have (on average 1.1081081081081081) internal successors, (41), 37 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 18:56:40,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 18:56:40,622 INFO L93 Difference]: Finished difference Result 42 states and 56 transitions. [2022-11-20 18:56:40,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-20 18:56:40,623 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 1.1081081081081081) internal successors, (41), 37 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-11-20 18:56:40,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 18:56:40,625 INFO L225 Difference]: With dead ends: 42 [2022-11-20 18:56:40,625 INFO L226 Difference]: Without dead ends: 40 [2022-11-20 18:56:40,627 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 15 SyntacticMatches, 3 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 902 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=539, Invalid=3367, Unknown=0, NotChecked=0, Total=3906 [2022-11-20 18:56:40,634 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 348 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 326 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 348 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 378 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 326 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 30 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-20 18:56:40,635 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [348 Valid, 52 Invalid, 378 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 326 Invalid, 0 Unknown, 30 Unchecked, 0.4s Time] [2022-11-20 18:56:40,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-11-20 18:56:40,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 25. [2022-11-20 18:56:40,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 24 states have (on average 1.4166666666666667) internal successors, (34), 24 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 18:56:40,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 34 transitions. [2022-11-20 18:56:40,665 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 34 transitions. Word has length 16 [2022-11-20 18:56:40,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 18:56:40,665 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 34 transitions. [2022-11-20 18:56:40,666 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 1.1081081081081081) internal successors, (41), 37 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 18:56:40,666 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 34 transitions. [2022-11-20 18:56:40,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-20 18:56:40,666 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 18:56:40,667 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 18:56:40,679 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6aec7cb7-89c8-447d-8f3d-5def91949efc/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-20 18:56:40,875 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6aec7cb7-89c8-447d-8f3d-5def91949efc/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-11-20 18:56:40,875 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 18:56:40,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 18:56:40,876 INFO L85 PathProgramCache]: Analyzing trace with hash -1672469698, now seen corresponding path program 1 times [2022-11-20 18:56:40,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 18:56:40,876 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916526821] [2022-11-20 18:56:40,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 18:56:40,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 18:56:40,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 18:56:40,956 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-20 18:56:40,957 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 18:56:40,957 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916526821] [2022-11-20 18:56:40,957 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1916526821] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 18:56:40,957 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 18:56:40,957 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-20 18:56:40,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506828541] [2022-11-20 18:56:40,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 18:56:40,958 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 18:56:40,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 18:56:40,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 18:56:40,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 18:56:40,959 INFO L87 Difference]: Start difference. First operand 25 states and 34 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 18:56:41,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 18:56:41,020 INFO L93 Difference]: Finished difference Result 36 states and 47 transitions. [2022-11-20 18:56:41,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 18:56:41,020 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-11-20 18:56:41,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 18:56:41,021 INFO L225 Difference]: With dead ends: 36 [2022-11-20 18:56:41,021 INFO L226 Difference]: Without dead ends: 31 [2022-11-20 18:56:41,022 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-20 18:56:41,023 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 10 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-20 18:56:41,023 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 15 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 18:56:41,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-11-20 18:56:41,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 27. [2022-11-20 18:56:41,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.3461538461538463) internal successors, (35), 26 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 18:56:41,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 35 transitions. [2022-11-20 18:56:41,043 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 35 transitions. Word has length 17 [2022-11-20 18:56:41,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 18:56:41,044 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 35 transitions. [2022-11-20 18:56:41,044 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 18:56:41,045 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 35 transitions. [2022-11-20 18:56:41,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-20 18:56:41,046 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 18:56:41,046 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 18:56:41,046 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-20 18:56:41,046 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 18:56:41,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 18:56:41,047 INFO L85 PathProgramCache]: Analyzing trace with hash 2004938827, now seen corresponding path program 2 times [2022-11-20 18:56:41,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 18:56:41,047 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201882080] [2022-11-20 18:56:41,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 18:56:41,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 18:56:41,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 18:56:41,196 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-20 18:56:41,196 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 18:56:41,197 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201882080] [2022-11-20 18:56:41,197 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [201882080] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 18:56:41,197 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [651108754] [2022-11-20 18:56:41,197 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-20 18:56:41,197 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 18:56:41,198 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6aec7cb7-89c8-447d-8f3d-5def91949efc/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 18:56:41,199 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6aec7cb7-89c8-447d-8f3d-5def91949efc/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 18:56:41,231 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6aec7cb7-89c8-447d-8f3d-5def91949efc/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-20 18:56:41,597 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-11-20 18:56:41,597 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 18:56:41,600 INFO L263 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-20 18:56:41,601 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 18:56:41,632 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-20 18:56:41,632 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 18:56:41,665 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-20 18:56:41,665 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [651108754] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 18:56:41,665 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [65486421] [2022-11-20 18:56:41,670 INFO L159 IcfgInterpreter]: Started Sifa with 10 locations of interest [2022-11-20 18:56:41,670 INFO L166 IcfgInterpreter]: Building call graph [2022-11-20 18:56:41,671 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-20 18:56:41,671 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-20 18:56:41,671 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-20 18:56:41,713 INFO L321 Elim1Store]: treesize reduction 20, result has 48.7 percent of original size [2022-11-20 18:56:41,713 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 30 [2022-11-20 18:56:41,752 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-11-20 18:56:41,753 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 27 treesize of output 41 [2022-11-20 18:56:41,787 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 18:56:41,788 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 18:56:41,788 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 17 [2022-11-20 18:56:41,802 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 18:56:41,806 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 9 [2022-11-20 18:56:41,815 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 18:56:41,815 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 13 [2022-11-20 18:56:41,832 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 18:56:41,833 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 18:56:41,834 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 18:56:41,835 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 28 [2022-11-20 18:56:41,957 INFO L321 Elim1Store]: treesize reduction 70, result has 34.0 percent of original size [2022-11-20 18:56:41,958 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 232 treesize of output 255 [2022-11-20 18:56:42,003 INFO L321 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-11-20 18:56:42,003 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 225 treesize of output 233 [2022-11-20 18:56:42,236 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 18:56:42,416 INFO L321 Elim1Store]: treesize reduction 52, result has 33.3 percent of original size [2022-11-20 18:56:42,417 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 229 treesize of output 238 [2022-11-20 18:56:42,442 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 18:56:42,559 INFO L321 Elim1Store]: treesize reduction 52, result has 33.3 percent of original size [2022-11-20 18:56:42,560 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 223 treesize of output 232 [2022-11-20 18:56:42,589 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 18:56:42,599 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-20 18:56:42,599 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 216 treesize of output 198 [2022-11-20 18:56:42,621 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 18:56:42,625 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 18:56:42,647 INFO L321 Elim1Store]: treesize reduction 21, result has 34.4 percent of original size [2022-11-20 18:56:42,647 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 232 treesize of output 209 [2022-11-20 18:56:42,672 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 18:56:42,701 INFO L321 Elim1Store]: treesize reduction 39, result has 18.8 percent of original size [2022-11-20 18:56:42,701 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 49 treesize of output 42 [2022-11-20 18:56:42,727 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 18:56:42,756 INFO L321 Elim1Store]: treesize reduction 39, result has 18.8 percent of original size [2022-11-20 18:56:42,756 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 49 treesize of output 42 [2022-11-20 18:56:42,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 12 treesize of output 9 [2022-11-20 18:56:42,971 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-20 18:56:42,996 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 18:56:42,997 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 18:56:42,997 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 17 [2022-11-20 18:56:43,014 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 18:56:43,014 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 18:56:43,015 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 18:56:43,016 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 17 [2022-11-20 18:56:43,031 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 18:56:43,031 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 18:56:43,032 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 7 [2022-11-20 18:56:43,072 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-20 18:56:43,080 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-20 18:56:43,090 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-20 18:56:43,169 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-20 18:56:43,178 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-20 18:56:43,194 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-20 18:56:43,312 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-20 18:56:43,321 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-20 18:56:43,331 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-20 18:56:43,415 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 9 [2022-11-20 18:56:43,422 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-20 18:56:43,426 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-20 18:56:44,350 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1194#(and (<= 0 |ULTIMATE.start_main_~s~0#1.offset|) (= |ULTIMATE.start_main_~i~0#1| 0) (= (select (select |#memory_int| |ULTIMATE.start_sll_get_data_at_~head#1.base|) |ULTIMATE.start_sll_get_data_at_~head#1.offset|) |ULTIMATE.start_sll_get_data_at_#res#1|) (= |ULTIMATE.start_sll_get_data_at_#in~head#1.offset| |ULTIMATE.start_sll_get_data_at_~head#1.offset|) (not (= |ULTIMATE.start_sll_get_data_at_#res#1| |ULTIMATE.start_main_~expected~0#1|)) (= |ULTIMATE.start_sll_get_data_at_#in~index#1| |ULTIMATE.start_main_~i~0#1|) (<= 1 |ULTIMATE.start_sll_create_#in~data#1|) (<= |ULTIMATE.start_sll_create_#in~data#1| 1) (<= |ULTIMATE.start_sll_create_~head~0#1.offset| 0) (= (+ |ULTIMATE.start_main_~len~0#1| |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~expected~0#1|) (<= |ULTIMATE.start_sll_create_~len#1| 0) (<= |ULTIMATE.start_sll_create_#res#1.offset| 0) (<= 1 |ULTIMATE.start_sll_create_~data#1|) (= |ULTIMATE.start_main_~data~0#1| 1) (<= |ULTIMATE.start_sll_create_~data#1| 1) (<= |ULTIMATE.start_sll_create_#in~len#1| 2) (= |ULTIMATE.start_sll_get_data_at_#in~head#1.offset| |ULTIMATE.start_main_~s~0#1.offset|) (= |ULTIMATE.start_main_~len~0#1| 2) (= |#NULL.offset| 0) (= |ULTIMATE.start_sll_get_data_at_#in~head#1.base| |ULTIMATE.start_main_~s~0#1.base|) (= |ULTIMATE.start_sll_get_data_at_#in~index#1| |ULTIMATE.start_sll_get_data_at_~index#1|) (<= 0 |ULTIMATE.start_sll_create_#res#1.offset|) (<= |ULTIMATE.start_sll_get_data_at_#res#1| 2147483647) (= |ULTIMATE.start_sll_get_data_at_#in~head#1.base| |ULTIMATE.start_sll_get_data_at_~head#1.base|) (<= 0 |#StackHeapBarrier|) (<= 2 |ULTIMATE.start_sll_create_#in~len#1|) (<= |ULTIMATE.start_main_~s~0#1.offset| 0) (<= 0 |ULTIMATE.start_sll_create_~head~0#1.offset|) (= |#NULL.base| 0) (<= 0 (+ |ULTIMATE.start_sll_get_data_at_#res#1| 2147483648)))' at error location [2022-11-20 18:56:44,351 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-20 18:56:44,351 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 18:56:44,351 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 8 [2022-11-20 18:56:44,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827479120] [2022-11-20 18:56:44,351 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 18:56:44,352 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-20 18:56:44,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 18:56:44,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-20 18:56:44,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=176, Unknown=0, NotChecked=0, Total=240 [2022-11-20 18:56:44,353 INFO L87 Difference]: Start difference. First operand 27 states and 35 transitions. Second operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 18:56:44,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 18:56:44,471 INFO L93 Difference]: Finished difference Result 47 states and 60 transitions. [2022-11-20 18:56:44,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-20 18:56:44,471 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-11-20 18:56:44,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 18:56:44,472 INFO L225 Difference]: With dead ends: 47 [2022-11-20 18:56:44,472 INFO L226 Difference]: Without dead ends: 35 [2022-11-20 18:56:44,473 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 37 SyntacticMatches, 4 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=87, Invalid=255, Unknown=0, NotChecked=0, Total=342 [2022-11-20 18:56:44,473 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 48 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 18:56:44,474 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 26 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 18:56:44,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-11-20 18:56:44,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 27. [2022-11-20 18:56:44,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 26 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 18:56:44,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 33 transitions. [2022-11-20 18:56:44,488 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 33 transitions. Word has length 17 [2022-11-20 18:56:44,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 18:56:44,489 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 33 transitions. [2022-11-20 18:56:44,489 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 18:56:44,489 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 33 transitions. [2022-11-20 18:56:44,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-20 18:56:44,490 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 18:56:44,490 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 18:56:44,501 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6aec7cb7-89c8-447d-8f3d-5def91949efc/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-11-20 18:56:44,696 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6aec7cb7-89c8-447d-8f3d-5def91949efc/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 18:56:44,697 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 18:56:44,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 18:56:44,697 INFO L85 PathProgramCache]: Analyzing trace with hash 688194100, now seen corresponding path program 1 times [2022-11-20 18:56:44,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 18:56:44,697 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701873843] [2022-11-20 18:56:44,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 18:56:44,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 18:56:44,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 18:56:44,797 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-20 18:56:44,797 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 18:56:44,798 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701873843] [2022-11-20 18:56:44,798 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [701873843] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 18:56:44,798 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1769878990] [2022-11-20 18:56:44,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 18:56:44,798 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 18:56:44,798 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6aec7cb7-89c8-447d-8f3d-5def91949efc/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 18:56:44,799 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6aec7cb7-89c8-447d-8f3d-5def91949efc/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 18:56:44,808 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6aec7cb7-89c8-447d-8f3d-5def91949efc/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-20 18:56:44,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 18:56:44,954 INFO L263 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-20 18:56:44,956 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 18:56:44,970 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-20 18:56:44,970 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 18:56:44,989 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-20 18:56:44,990 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1769878990] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 18:56:44,990 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2051304443] [2022-11-20 18:56:44,995 INFO L159 IcfgInterpreter]: Started Sifa with 10 locations of interest [2022-11-20 18:56:44,996 INFO L166 IcfgInterpreter]: Building call graph [2022-11-20 18:56:44,996 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-20 18:56:44,996 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-20 18:56:44,996 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-20 18:56:45,040 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-11-20 18:56:45,041 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 27 treesize of output 41 [2022-11-20 18:56:45,051 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2022-11-20 18:56:45,076 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 18:56:45,079 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 9 [2022-11-20 18:56:45,087 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 18:56:45,088 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 13 [2022-11-20 18:56:45,103 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 18:56:45,104 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 18:56:45,105 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 18:56:45,106 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 28 [2022-11-20 18:56:45,118 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 18:56:45,124 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 9 [2022-11-20 18:56:45,133 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 18:56:45,134 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 13 [2022-11-20 18:56:45,241 INFO L321 Elim1Store]: treesize reduction 54, result has 27.0 percent of original size [2022-11-20 18:56:45,241 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 227 treesize of output 235 [2022-11-20 18:56:45,312 INFO L321 Elim1Store]: treesize reduction 78, result has 26.4 percent of original size [2022-11-20 18:56:45,312 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 230 treesize of output 245 [2022-11-20 18:56:45,513 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 18:56:45,620 INFO L321 Elim1Store]: treesize reduction 52, result has 33.3 percent of original size [2022-11-20 18:56:45,621 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 1 case distinctions, treesize of input 229 treesize of output 238 [2022-11-20 18:56:45,647 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 18:56:45,652 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 18:56:45,664 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-20 18:56:45,665 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 222 treesize of output 204 [2022-11-20 18:56:45,690 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 18:56:45,697 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 18:56:45,698 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 18:56:45,736 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-11-20 18:56:45,736 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 238 treesize of output 215 [2022-11-20 18:56:45,757 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 18:56:45,807 INFO L321 Elim1Store]: treesize reduction 52, result has 33.3 percent of original size [2022-11-20 18:56:45,807 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 1 case distinctions, treesize of input 219 treesize of output 228 [2022-11-20 18:56:45,828 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 18:56:45,855 INFO L321 Elim1Store]: treesize reduction 39, result has 18.8 percent of original size [2022-11-20 18:56:45,855 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 49 treesize of output 42 [2022-11-20 18:56:45,885 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 18:56:45,907 INFO L321 Elim1Store]: treesize reduction 39, result has 18.8 percent of original size [2022-11-20 18:56:45,907 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 49 treesize of output 42 [2022-11-20 18:56:46,184 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-20 18:56:46,191 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 9 [2022-11-20 18:56:46,222 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 18:56:46,223 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 18:56:46,224 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 17 [2022-11-20 18:56:46,240 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 18:56:46,241 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 18:56:46,242 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 7 [2022-11-20 18:56:46,267 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 18:56:46,268 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 18:56:46,269 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 18:56:46,270 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 17 [2022-11-20 18:56:46,318 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-20 18:56:46,333 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-20 18:56:46,343 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-20 18:56:46,421 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-20 18:56:46,434 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-20 18:56:46,447 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-20 18:56:46,511 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-20 18:56:46,518 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-20 18:56:46,527 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-20 18:56:46,654 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-20 18:56:46,661 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 9 [2022-11-20 18:56:46,664 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-20 18:56:48,252 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1456#(and (<= 0 |ULTIMATE.start_main_~s~0#1.offset|) (= |ULTIMATE.start_main_~i~0#1| 0) (= (select (select |#memory_int| |ULTIMATE.start_sll_get_data_at_~head#1.base|) |ULTIMATE.start_sll_get_data_at_~head#1.offset|) |ULTIMATE.start_sll_get_data_at_#res#1|) (= |ULTIMATE.start_sll_get_data_at_#in~head#1.offset| |ULTIMATE.start_sll_get_data_at_~head#1.offset|) (not (= |ULTIMATE.start_sll_get_data_at_#res#1| |ULTIMATE.start_main_~expected~0#1|)) (= |ULTIMATE.start_sll_get_data_at_#in~index#1| |ULTIMATE.start_main_~i~0#1|) (<= 1 |ULTIMATE.start_sll_create_#in~data#1|) (<= |ULTIMATE.start_sll_create_#in~data#1| 1) (<= |ULTIMATE.start_sll_create_~head~0#1.offset| 0) (= (+ |ULTIMATE.start_main_~len~0#1| |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~expected~0#1|) (<= |ULTIMATE.start_sll_create_~len#1| 0) (<= |ULTIMATE.start_sll_create_#res#1.offset| 0) (<= 1 |ULTIMATE.start_sll_create_~data#1|) (= |ULTIMATE.start_main_~data~0#1| 1) (<= |ULTIMATE.start_sll_create_~data#1| 1) (<= |ULTIMATE.start_sll_create_#in~len#1| 2) (= |ULTIMATE.start_sll_get_data_at_#in~head#1.offset| |ULTIMATE.start_main_~s~0#1.offset|) (= |ULTIMATE.start_main_~len~0#1| 2) (= |#NULL.offset| 0) (= |ULTIMATE.start_sll_get_data_at_#in~head#1.base| |ULTIMATE.start_main_~s~0#1.base|) (= |ULTIMATE.start_sll_get_data_at_#in~index#1| |ULTIMATE.start_sll_get_data_at_~index#1|) (<= 0 |ULTIMATE.start_sll_create_#res#1.offset|) (<= |ULTIMATE.start_sll_get_data_at_#res#1| 2147483647) (= |ULTIMATE.start_sll_get_data_at_#in~head#1.base| |ULTIMATE.start_sll_get_data_at_~head#1.base|) (<= 0 |#StackHeapBarrier|) (<= 2 |ULTIMATE.start_sll_create_#in~len#1|) (<= |ULTIMATE.start_main_~s~0#1.offset| 0) (<= 0 |ULTIMATE.start_sll_create_~head~0#1.offset|) (= |#NULL.base| 0) (<= 0 (+ |ULTIMATE.start_sll_get_data_at_#res#1| 2147483648)))' at error location [2022-11-20 18:56:48,252 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-20 18:56:48,252 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 18:56:48,252 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 6 [2022-11-20 18:56:48,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250901562] [2022-11-20 18:56:48,252 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 18:56:48,253 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 18:56:48,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 18:56:48,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 18:56:48,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2022-11-20 18:56:48,254 INFO L87 Difference]: Start difference. First operand 27 states and 33 transitions. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 18:56:48,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 18:56:48,342 INFO L93 Difference]: Finished difference Result 36 states and 44 transitions. [2022-11-20 18:56:48,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 18:56:48,343 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-11-20 18:56:48,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 18:56:48,343 INFO L225 Difference]: With dead ends: 36 [2022-11-20 18:56:48,344 INFO L226 Difference]: Without dead ends: 31 [2022-11-20 18:56:48,344 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 45 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2022-11-20 18:56:48,345 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 14 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 18:56:48,345 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 19 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 18:56:48,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-11-20 18:56:48,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 28. [2022-11-20 18:56:48,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 27 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 18:56:48,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 34 transitions. [2022-11-20 18:56:48,359 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 34 transitions. Word has length 19 [2022-11-20 18:56:48,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 18:56:48,360 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 34 transitions. [2022-11-20 18:56:48,360 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 18:56:48,360 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions. [2022-11-20 18:56:48,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-20 18:56:48,360 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 18:56:48,361 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 18:56:48,366 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6aec7cb7-89c8-447d-8f3d-5def91949efc/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-20 18:56:48,563 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6aec7cb7-89c8-447d-8f3d-5def91949efc/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 18:56:48,563 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 18:56:48,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 18:56:48,564 INFO L85 PathProgramCache]: Analyzing trace with hash -142471946, now seen corresponding path program 1 times [2022-11-20 18:56:48,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 18:56:48,564 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878218833] [2022-11-20 18:56:48,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 18:56:48,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 18:56:48,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 18:56:49,779 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 18:56:49,779 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 18:56:49,779 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1878218833] [2022-11-20 18:56:49,779 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1878218833] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 18:56:49,779 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1023959163] [2022-11-20 18:56:49,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 18:56:49,780 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 18:56:49,780 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6aec7cb7-89c8-447d-8f3d-5def91949efc/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 18:56:49,780 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6aec7cb7-89c8-447d-8f3d-5def91949efc/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 18:56:49,792 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6aec7cb7-89c8-447d-8f3d-5def91949efc/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-20 18:56:49,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 18:56:49,940 INFO L263 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 100 conjunts are in the unsatisfiable core [2022-11-20 18:56:49,943 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 18:56:49,969 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-20 18:56:50,033 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-20 18:56:50,033 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-20 18:56:50,093 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-20 18:56:50,231 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 18:56:50,231 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2022-11-20 18:56:50,433 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-20 18:56:50,433 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 64 treesize of output 61 [2022-11-20 18:56:50,440 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 31 treesize of output 21 [2022-11-20 18:56:50,444 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 18:56:50,445 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 34 treesize of output 36 [2022-11-20 18:56:50,717 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 19 [2022-11-20 18:56:50,721 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2022-11-20 18:56:50,760 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-20 18:56:50,791 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 18:56:50,791 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 18:56:50,994 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 86 treesize of output 64 [2022-11-20 18:56:51,010 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 86 treesize of output 64 [2022-11-20 18:56:51,021 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) (.cse1 (+ |c_ULTIMATE.start_main_~len~0#1| 1))) (and (forall ((v_ArrVal_772 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_772) |c_ULTIMATE.start_main_~s~0#1.base|) .cse0) |c_ULTIMATE.start_sll_update_at_~head#1.offset|)) (<= |c_ULTIMATE.start_sll_update_at_~data#1| .cse1) (forall ((v_ArrVal_773 (Array Int Int))) (= |c_ULTIMATE.start_sll_update_at_~head#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_773) |c_ULTIMATE.start_main_~s~0#1.base|) .cse0))) (<= .cse1 |c_ULTIMATE.start_sll_update_at_~data#1|))) is different from false [2022-11-20 18:56:51,035 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 18:56:51,035 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 50 treesize of output 43 [2022-11-20 18:56:51,040 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 17 treesize of output 13 [2022-11-20 18:56:51,397 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 18 treesize of output 16 [2022-11-20 18:56:51,399 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 18:56:51,501 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-11-20 18:56:51,501 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1023959163] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 18:56:51,502 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1995388253] [2022-11-20 18:56:51,506 INFO L159 IcfgInterpreter]: Started Sifa with 10 locations of interest [2022-11-20 18:56:51,506 INFO L166 IcfgInterpreter]: Building call graph [2022-11-20 18:56:51,506 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-20 18:56:51,506 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-20 18:56:51,507 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-20 18:56:51,568 INFO L321 Elim1Store]: treesize reduction 20, result has 48.7 percent of original size [2022-11-20 18:56:51,569 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 30 [2022-11-20 18:56:51,610 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-11-20 18:56:51,611 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 27 treesize of output 41 [2022-11-20 18:56:51,639 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 18:56:51,642 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 9 [2022-11-20 18:56:51,650 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 18:56:51,651 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 13 [2022-11-20 18:56:51,670 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 18:56:51,671 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 18:56:51,672 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 18:56:51,675 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 28 [2022-11-20 18:56:51,693 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 18:56:51,694 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 18:56:51,694 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 17 [2022-11-20 18:56:51,804 INFO L321 Elim1Store]: treesize reduction 70, result has 34.0 percent of original size [2022-11-20 18:56:51,804 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 232 treesize of output 255 [2022-11-20 18:56:51,842 INFO L321 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-11-20 18:56:51,842 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 225 treesize of output 233 [2022-11-20 18:56:52,148 INFO L321 Elim1Store]: treesize reduction 49, result has 25.8 percent of original size [2022-11-20 18:56:52,148 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 228 treesize of output 220 [2022-11-20 18:56:52,173 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 18:56:52,257 INFO L321 Elim1Store]: treesize reduction 52, result has 33.3 percent of original size [2022-11-20 18:56:52,258 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 225 treesize of output 234 [2022-11-20 18:56:52,276 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 18:56:52,350 INFO L321 Elim1Store]: treesize reduction 52, result has 33.3 percent of original size [2022-11-20 18:56:52,351 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 219 treesize of output 228 [2022-11-20 18:56:52,368 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 18:56:52,372 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 18:56:52,434 INFO L321 Elim1Store]: treesize reduction 74, result has 24.5 percent of original size [2022-11-20 18:56:52,435 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 245 treesize of output 235 [2022-11-20 18:56:52,463 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 18:56:52,496 INFO L321 Elim1Store]: treesize reduction 39, result has 18.8 percent of original size [2022-11-20 18:56:52,497 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 49 treesize of output 42 [2022-11-20 18:56:52,527 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 18:56:52,558 INFO L321 Elim1Store]: treesize reduction 39, result has 18.8 percent of original size [2022-11-20 18:56:52,559 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 49 treesize of output 42 [2022-11-20 18:56:52,882 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 9 [2022-11-20 18:56:52,888 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-20 18:56:52,914 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 18:56:52,914 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 18:56:52,915 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 18:56:52,915 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 17 [2022-11-20 18:56:52,943 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 18:56:52,943 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 18:56:52,947 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 7 [2022-11-20 18:56:52,966 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 18:56:52,967 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 18:56:52,967 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 17 [2022-11-20 18:56:53,005 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-20 18:56:53,019 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-20 18:56:53,031 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-20 18:56:53,100 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-20 18:56:53,113 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-20 18:56:53,121 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-20 18:56:53,200 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-20 18:56:53,213 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-20 18:56:53,221 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-20 18:56:53,702 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-20 18:56:53,709 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 9 [2022-11-20 18:56:53,711 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-20 18:56:55,202 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1741#(and (<= |ULTIMATE.start_sll_get_data_at_~index#1| 0) (<= 0 |ULTIMATE.start_main_~s~0#1.offset|) (<= 1 |ULTIMATE.start_sll_create_#in~data#1|) (<= |ULTIMATE.start_sll_create_#in~data#1| 1) (<= |ULTIMATE.start_sll_create_~head~0#1.offset| 0) (<= |ULTIMATE.start_sll_create_~len#1| 0) (<= |ULTIMATE.start_sll_create_#res#1.offset| 0) (<= 1 |ULTIMATE.start_sll_create_~data#1|) (<= 0 |ULTIMATE.start_main_~i~0#1|) (= |ULTIMATE.start_main_~data~0#1| 1) (<= 0 |ULTIMATE.start_sll_get_data_at_#in~head#1.offset|) (<= |ULTIMATE.start_sll_create_~data#1| 1) (<= |ULTIMATE.start_sll_create_#in~len#1| 2) (= |ULTIMATE.start_main_~len~0#1| 2) (= |#NULL.offset| 0) (<= 0 |ULTIMATE.start_sll_create_#res#1.offset|) (<= |ULTIMATE.start_sll_get_data_at_#res#1| 2147483647) (<= 2 |ULTIMATE.start_main_~expected~0#1|) (<= 0 |#StackHeapBarrier|) (<= 2 |ULTIMATE.start_sll_create_#in~len#1|) (<= |ULTIMATE.start_main_~s~0#1.offset| 0) (<= 0 |ULTIMATE.start_sll_get_data_at_#in~index#1|) (<= |ULTIMATE.start_sll_get_data_at_#in~head#1.offset| 0) (<= 0 |ULTIMATE.start_sll_create_~head~0#1.offset|) (= |#NULL.base| 0) (<= 0 (+ |ULTIMATE.start_sll_get_data_at_#res#1| 2147483648)))' at error location [2022-11-20 18:56:55,202 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-20 18:56:55,203 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 18:56:55,203 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 45 [2022-11-20 18:56:55,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724249179] [2022-11-20 18:56:55,203 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 18:56:55,203 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2022-11-20 18:56:55,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 18:56:55,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2022-11-20 18:56:55,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=196, Invalid=2459, Unknown=1, NotChecked=100, Total=2756 [2022-11-20 18:56:55,205 INFO L87 Difference]: Start difference. First operand 28 states and 34 transitions. Second operand has 45 states, 45 states have (on average 1.2) internal successors, (54), 45 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 18:56:56,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 18:56:56,212 INFO L93 Difference]: Finished difference Result 69 states and 86 transitions. [2022-11-20 18:56:56,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-20 18:56:56,213 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 45 states have (on average 1.2) internal successors, (54), 45 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-11-20 18:56:56,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 18:56:56,214 INFO L225 Difference]: With dead ends: 69 [2022-11-20 18:56:56,214 INFO L226 Difference]: Without dead ends: 67 [2022-11-20 18:56:56,215 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 22 SyntacticMatches, 2 SemanticMatches, 64 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 998 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=385, Invalid=3778, Unknown=1, NotChecked=126, Total=4290 [2022-11-20 18:56:56,216 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 143 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 444 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 552 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 444 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 101 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-20 18:56:56,216 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 109 Invalid, 552 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 444 Invalid, 0 Unknown, 101 Unchecked, 0.4s Time] [2022-11-20 18:56:56,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-11-20 18:56:56,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 35. [2022-11-20 18:56:56,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 34 states have (on average 1.2647058823529411) internal successors, (43), 34 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 18:56:56,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 43 transitions. [2022-11-20 18:56:56,234 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 43 transitions. Word has length 20 [2022-11-20 18:56:56,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 18:56:56,234 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 43 transitions. [2022-11-20 18:56:56,234 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 45 states have (on average 1.2) internal successors, (54), 45 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 18:56:56,235 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 43 transitions. [2022-11-20 18:56:56,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-20 18:56:56,235 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 18:56:56,235 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 18:56:56,243 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6aec7cb7-89c8-447d-8f3d-5def91949efc/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-11-20 18:56:56,437 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6aec7cb7-89c8-447d-8f3d-5def91949efc/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 18:56:56,437 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 18:56:56,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 18:56:56,437 INFO L85 PathProgramCache]: Analyzing trace with hash 1594744395, now seen corresponding path program 3 times [2022-11-20 18:56:56,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 18:56:56,438 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360867388] [2022-11-20 18:56:56,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 18:56:56,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 18:56:56,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 18:56:56,553 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 13 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-20 18:56:56,554 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 18:56:56,554 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360867388] [2022-11-20 18:56:56,554 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [360867388] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 18:56:56,554 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [894374235] [2022-11-20 18:56:56,554 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-20 18:56:56,555 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 18:56:56,555 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6aec7cb7-89c8-447d-8f3d-5def91949efc/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 18:56:56,556 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6aec7cb7-89c8-447d-8f3d-5def91949efc/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 18:56:56,583 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6aec7cb7-89c8-447d-8f3d-5def91949efc/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-20 18:56:56,884 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-20 18:56:56,884 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 18:56:56,887 INFO L263 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-20 18:56:56,889 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 18:56:56,952 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-20 18:56:56,952 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 18:56:56,952 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [894374235] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 18:56:56,952 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-20 18:56:56,953 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 9 [2022-11-20 18:56:56,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071179533] [2022-11-20 18:56:56,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 18:56:56,954 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 18:56:56,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 18:56:56,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 18:56:56,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2022-11-20 18:56:56,976 INFO L87 Difference]: Start difference. First operand 35 states and 43 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 18:56:57,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 18:56:57,031 INFO L93 Difference]: Finished difference Result 41 states and 50 transitions. [2022-11-20 18:56:57,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-20 18:56:57,032 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-11-20 18:56:57,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 18:56:57,034 INFO L225 Difference]: With dead ends: 41 [2022-11-20 18:56:57,034 INFO L226 Difference]: Without dead ends: 22 [2022-11-20 18:56:57,034 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2022-11-20 18:56:57,035 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 22 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-20 18:56:57,035 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 10 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 18:56:57,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-11-20 18:56:57,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2022-11-20 18:56:57,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 21 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 18:56:57,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 23 transitions. [2022-11-20 18:56:57,054 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 23 transitions. Word has length 20 [2022-11-20 18:56:57,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 18:56:57,054 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 23 transitions. [2022-11-20 18:56:57,054 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 18:56:57,054 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2022-11-20 18:56:57,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-20 18:56:57,055 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 18:56:57,055 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 18:56:57,071 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6aec7cb7-89c8-447d-8f3d-5def91949efc/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-20 18:56:57,255 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6aec7cb7-89c8-447d-8f3d-5def91949efc/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-11-20 18:56:57,256 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 18:56:57,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 18:56:57,256 INFO L85 PathProgramCache]: Analyzing trace with hash -123315596, now seen corresponding path program 2 times [2022-11-20 18:56:57,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 18:56:57,256 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523648291] [2022-11-20 18:56:57,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 18:56:57,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 18:56:57,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 18:56:57,377 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-20 18:56:57,377 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 18:56:57,377 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523648291] [2022-11-20 18:56:57,378 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1523648291] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 18:56:57,378 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [85577659] [2022-11-20 18:56:57,378 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-20 18:56:57,378 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 18:56:57,378 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6aec7cb7-89c8-447d-8f3d-5def91949efc/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 18:56:57,383 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6aec7cb7-89c8-447d-8f3d-5def91949efc/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 18:56:57,395 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6aec7cb7-89c8-447d-8f3d-5def91949efc/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-20 18:56:57,553 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-20 18:56:57,553 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 18:56:57,555 INFO L263 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-20 18:56:57,556 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 18:56:57,591 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-11-20 18:56:57,592 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 18:56:57,630 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-11-20 18:56:57,630 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [85577659] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 18:56:57,630 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1509073444] [2022-11-20 18:56:57,633 INFO L159 IcfgInterpreter]: Started Sifa with 10 locations of interest [2022-11-20 18:56:57,633 INFO L166 IcfgInterpreter]: Building call graph [2022-11-20 18:56:57,634 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-20 18:56:57,634 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-20 18:56:57,634 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-20 18:56:57,688 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-11-20 18:56:57,689 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 27 treesize of output 41 [2022-11-20 18:56:57,700 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2022-11-20 18:56:57,734 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 18:56:57,734 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 18:56:57,735 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 17 [2022-11-20 18:56:57,750 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 18:56:57,754 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 9 [2022-11-20 18:56:57,764 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 18:56:57,765 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 13 [2022-11-20 18:56:57,788 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 18:56:57,789 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 18:56:57,790 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 18:56:57,791 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 28 [2022-11-20 18:56:57,905 INFO L321 Elim1Store]: treesize reduction 70, result has 34.0 percent of original size [2022-11-20 18:56:57,905 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 232 treesize of output 255 [2022-11-20 18:56:57,940 INFO L321 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-11-20 18:56:57,941 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 225 treesize of output 233 [2022-11-20 18:56:58,195 INFO L321 Elim1Store]: treesize reduction 49, result has 25.8 percent of original size [2022-11-20 18:56:58,196 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 228 treesize of output 220 [2022-11-20 18:56:58,216 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 18:56:58,302 INFO L321 Elim1Store]: treesize reduction 52, result has 33.3 percent of original size [2022-11-20 18:56:58,303 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 225 treesize of output 234 [2022-11-20 18:56:58,323 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 18:56:58,405 INFO L321 Elim1Store]: treesize reduction 52, result has 33.3 percent of original size [2022-11-20 18:56:58,406 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 219 treesize of output 228 [2022-11-20 18:56:58,422 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 18:56:58,425 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 18:56:58,477 INFO L321 Elim1Store]: treesize reduction 74, result has 24.5 percent of original size [2022-11-20 18:56:58,478 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 245 treesize of output 235 [2022-11-20 18:56:58,503 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 18:56:58,530 INFO L321 Elim1Store]: treesize reduction 39, result has 18.8 percent of original size [2022-11-20 18:56:58,530 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 49 treesize of output 42 [2022-11-20 18:56:58,556 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 18:56:58,573 INFO L321 Elim1Store]: treesize reduction 39, result has 18.8 percent of original size [2022-11-20 18:56:58,573 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 49 treesize of output 42 [2022-11-20 18:56:58,961 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-20 18:56:58,973 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 9 [2022-11-20 18:56:58,997 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 18:56:58,998 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 18:56:58,999 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 7 [2022-11-20 18:56:59,013 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 18:56:59,014 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 18:56:59,015 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 18:56:59,015 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 17 [2022-11-20 18:56:59,036 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 18:56:59,036 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 18:56:59,037 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 17 [2022-11-20 18:56:59,098 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-20 18:56:59,107 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-20 18:56:59,116 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-20 18:56:59,196 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-20 18:56:59,210 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-20 18:56:59,220 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-20 18:56:59,306 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-20 18:56:59,313 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-20 18:56:59,326 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-20 18:56:59,799 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 9 [2022-11-20 18:56:59,806 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-20 18:56:59,809 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-20 18:57:00,724 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '2272#(and (<= |ULTIMATE.start_sll_get_data_at_~index#1| 0) (<= 0 |ULTIMATE.start_main_~s~0#1.offset|) (<= 1 |ULTIMATE.start_sll_create_#in~data#1|) (<= |ULTIMATE.start_sll_create_#in~data#1| 1) (<= |ULTIMATE.start_sll_create_~head~0#1.offset| 0) (<= |ULTIMATE.start_sll_create_~len#1| 0) (<= |ULTIMATE.start_sll_create_#res#1.offset| 0) (<= 1 |ULTIMATE.start_sll_create_~data#1|) (<= 0 |ULTIMATE.start_main_~i~0#1|) (= |ULTIMATE.start_main_~data~0#1| 1) (<= 0 |ULTIMATE.start_sll_get_data_at_#in~head#1.offset|) (<= |ULTIMATE.start_sll_create_~data#1| 1) (<= |ULTIMATE.start_sll_create_#in~len#1| 2) (= |ULTIMATE.start_main_~len~0#1| 2) (= |#NULL.offset| 0) (<= 0 |ULTIMATE.start_sll_create_#res#1.offset|) (<= |ULTIMATE.start_sll_get_data_at_#res#1| 2147483647) (<= 2 |ULTIMATE.start_main_~expected~0#1|) (<= 0 |#StackHeapBarrier|) (<= 2 |ULTIMATE.start_sll_create_#in~len#1|) (<= |ULTIMATE.start_main_~s~0#1.offset| 0) (<= 0 |ULTIMATE.start_sll_get_data_at_#in~index#1|) (<= |ULTIMATE.start_sll_get_data_at_#in~head#1.offset| 0) (<= 0 |ULTIMATE.start_sll_create_~head~0#1.offset|) (= |#NULL.base| 0) (<= 0 (+ |ULTIMATE.start_sll_get_data_at_#res#1| 2147483648)))' at error location [2022-11-20 18:57:00,724 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-20 18:57:00,724 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 18:57:00,724 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 7 [2022-11-20 18:57:00,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596064076] [2022-11-20 18:57:00,725 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 18:57:00,725 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-20 18:57:00,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 18:57:00,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-20 18:57:00,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2022-11-20 18:57:00,726 INFO L87 Difference]: Start difference. First operand 22 states and 23 transitions. Second operand has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 18:57:00,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 18:57:00,830 INFO L93 Difference]: Finished difference Result 22 states and 23 transitions. [2022-11-20 18:57:00,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-20 18:57:00,830 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-11-20 18:57:00,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 18:57:00,830 INFO L225 Difference]: With dead ends: 22 [2022-11-20 18:57:00,830 INFO L226 Difference]: Without dead ends: 0 [2022-11-20 18:57:00,831 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 52 SyntacticMatches, 3 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=89, Invalid=291, Unknown=0, NotChecked=0, Total=380 [2022-11-20 18:57:00,831 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 11 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 18:57:00,832 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 8 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 18:57:00,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-11-20 18:57:00,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-11-20 18:57:00,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 18:57:00,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-11-20 18:57:00,833 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 21 [2022-11-20 18:57:00,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 18:57:00,833 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-11-20 18:57:00,833 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 18:57:00,833 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-11-20 18:57:00,833 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-11-20 18:57:00,835 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-11-20 18:57:00,843 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6aec7cb7-89c8-447d-8f3d-5def91949efc/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-20 18:57:01,036 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6aec7cb7-89c8-447d-8f3d-5def91949efc/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-11-20 18:57:01,038 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-11-20 18:57:03,276 INFO L902 garLoopResultBuilder]: At program point L572(line 572) the Hoare annotation is: true [2022-11-20 18:57:03,276 INFO L895 garLoopResultBuilder]: At program point L622-3(lines 622 627) the Hoare annotation is: (let ((.cse9 (= |ULTIMATE.start_main_~i~0#1| 0)) (.cse23 (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|))) (let ((.cse1 (not (= |ULTIMATE.start_main_~s~0#1.base| (select .cse23 4)))) (.cse7 (= (let ((.cse24 (+ |ULTIMATE.start_main_~s~0#1.offset| 4))) (select (select |#memory_int| (select .cse23 .cse24)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) .cse24))) (+ |ULTIMATE.start_main_~len~0#1| 1))) (.cse8 (= |ULTIMATE.start_main_~s~0#1.offset| 0)) (.cse0 (let ((.cse10 (<= 1 |ULTIMATE.start_sll_create_#in~data#1|)) (.cse11 (<= |ULTIMATE.start_sll_create_#in~data#1| 1)) (.cse12 (<= |ULTIMATE.start_sll_create_~head~0#1.offset| 0)) (.cse13 (<= 1 |ULTIMATE.start_sll_create_~data#1|)) (.cse14 (= |ULTIMATE.start_main_~data~0#1| 1)) (.cse15 (<= |ULTIMATE.start_sll_create_~data#1| 1)) (.cse16 (<= |ULTIMATE.start_sll_create_#in~len#1| 2)) (.cse17 (= |#NULL.offset| 0)) (.cse18 (<= 0 |#StackHeapBarrier|)) (.cse19 (<= 2 |ULTIMATE.start_sll_create_#in~len#1|)) (.cse20 (<= 0 |ULTIMATE.start_sll_create_~head~0#1.offset|)) (.cse21 (<= |ULTIMATE.start_sll_create_~len#1| 2)) (.cse22 (= |#NULL.base| 0))) (or (and .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (and (<= 1 |ULTIMATE.start_main_~i~0#1|) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22)))) (.cse2 (= (select |#valid| |ULTIMATE.start_node_create_~temp~0#1.base|) 1)) (.cse3 (= (select |#valid| |ULTIMATE.start_sll_create_~head~0#1.base|) 1)) (.cse4 (= |ULTIMATE.start_node_create_~temp~0#1.offset| 0)) (.cse5 (<= |ULTIMATE.start_sll_update_at_~index#1| 0)) (.cse6 (= |ULTIMATE.start_main_~len~0#1| 2))) (or (and .cse0 (<= |ULTIMATE.start_sll_get_data_at_~index#1| 0) .cse1 .cse2 .cse3 .cse4 (= |ULTIMATE.start_main_~i~0#1| 1) .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse9 .cse1 .cse2 .cse3 (not (= |ULTIMATE.start_sll_update_at_~head#1.base| |ULTIMATE.start_main_~s~0#1.base|)) .cse4 (= (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) |ULTIMATE.start_main_~len~0#1|) .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse2 .cse3 .cse4 .cse5 (<= 2 |ULTIMATE.start_main_~i~0#1|) .cse6)))) [2022-11-20 18:57:03,277 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-11-20 18:57:03,277 INFO L902 garLoopResultBuilder]: At program point L631(lines 613 632) the Hoare annotation is: true [2022-11-20 18:57:03,277 INFO L895 garLoopResultBuilder]: At program point L607-2(lines 607 610) the Hoare annotation is: (let ((.cse7 (= |ULTIMATE.start_sll_update_at_~data#1| (+ |ULTIMATE.start_main_~len~0#1| |ULTIMATE.start_main_~i~0#1|))) (.cse24 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) 4)) (.cse0 (= (select |#valid| |ULTIMATE.start_node_create_~temp~0#1.base|) 1)) (.cse1 (= (select |#valid| |ULTIMATE.start_sll_create_~head~0#1.base|) 1)) (.cse2 (<= 1 |ULTIMATE.start_sll_create_#in~data#1|)) (.cse3 (= |ULTIMATE.start_node_create_~temp~0#1.offset| 0)) (.cse4 (<= |ULTIMATE.start_sll_create_#in~data#1| 1)) (.cse5 (<= |ULTIMATE.start_sll_create_~head~0#1.offset| 0)) (.cse22 (= (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) |ULTIMATE.start_main_~len~0#1|)) (.cse6 (<= 1 |ULTIMATE.start_sll_create_~data#1|)) (.cse23 (= |ULTIMATE.start_sll_update_at_~data#1| (+ |ULTIMATE.start_main_~len~0#1| 1))) (.cse8 (= |ULTIMATE.start_main_~data~0#1| 1)) (.cse9 (<= |ULTIMATE.start_sll_create_~data#1| 1)) (.cse10 (<= |ULTIMATE.start_sll_create_#in~len#1| 2)) (.cse11 (= |ULTIMATE.start_main_~len~0#1| 2)) (.cse12 (= |ULTIMATE.start_main_~s~0#1.offset| |ULTIMATE.start_sll_update_at_~head#1.offset|)) (.cse13 (= |#NULL.offset| 0)) (.cse14 (= |ULTIMATE.start_sll_update_at_~index#1| |ULTIMATE.start_main_~i~0#1|)) (.cse15 (= |ULTIMATE.start_sll_update_at_~head#1.base| |ULTIMATE.start_main_~s~0#1.base|)) (.cse16 (<= 0 |#StackHeapBarrier|)) (.cse17 (<= 2 |ULTIMATE.start_sll_create_#in~len#1|)) (.cse18 (<= 0 |ULTIMATE.start_sll_create_~head~0#1.offset|)) (.cse19 (<= |ULTIMATE.start_sll_create_~len#1| 2)) (.cse20 (= |ULTIMATE.start_main_~s~0#1.offset| 0)) (.cse21 (= |#NULL.base| 0))) (or (and (= |ULTIMATE.start_main_~i~0#1| 0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not (= |ULTIMATE.start_sll_create_~head~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) (+ |ULTIMATE.start_sll_create_~head~0#1.offset| 4)))) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 (not (= |ULTIMATE.start_sll_update_at_~head#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_update_at_~head#1.base|) 4))) .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (and .cse0 .cse1 .cse2 (forall ((v_ArrVal_772 (Array Int Int))) (= (select (select (store |#memory_$Pointer$.offset| |ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_772) |ULTIMATE.start_main_~s~0#1.base|) (+ |ULTIMATE.start_main_~s~0#1.offset| 4)) |ULTIMATE.start_sll_update_at_~head#1.offset|)) .cse3 .cse4 .cse5 .cse22 .cse6 (<= |ULTIMATE.start_sll_update_at_~index#1| 0) .cse7 .cse23 (= |ULTIMATE.start_sll_update_at_~head#1.base| .cse24) .cse8 .cse9 .cse10 .cse11 .cse13 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (and (not (= |ULTIMATE.start_main_~s~0#1.base| .cse24)) (<= 1 |ULTIMATE.start_main_~i~0#1|) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse22 .cse6 .cse23 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 (<= |ULTIMATE.start_main_~i~0#1| 1) .cse16 .cse17 .cse18 .cse19 .cse20 .cse21))) [2022-11-20 18:57:03,277 INFO L899 garLoopResultBuilder]: For program point L624(lines 624 626) no Hoare annotation was computed. [2022-11-20 18:57:03,278 INFO L895 garLoopResultBuilder]: At program point L600-2(lines 600 603) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_main_~i~0#1| 0)) (.cse15 (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|))) (let ((.cse8 (= |ULTIMATE.start_sll_get_data_at_~head#1.offset| 0)) (.cse1 (not (= |ULTIMATE.start_main_~s~0#1.base| (select .cse15 4)))) (.cse2 (= (select |#valid| |ULTIMATE.start_node_create_~temp~0#1.base|) 1)) (.cse3 (= (select |#valid| |ULTIMATE.start_sll_create_~head~0#1.base|) 1)) (.cse4 (= |ULTIMATE.start_node_create_~temp~0#1.offset| 0)) (.cse13 (= |ULTIMATE.start_main_~i~0#1| 1)) (.cse6 (<= |ULTIMATE.start_sll_update_at_~index#1| 0)) (.cse14 (= 3 |ULTIMATE.start_main_~expected~0#1|)) (.cse7 (let ((.cse17 (<= 1 |ULTIMATE.start_sll_create_#in~data#1|)) (.cse18 (<= |ULTIMATE.start_sll_create_#in~data#1| 1)) (.cse19 (<= |ULTIMATE.start_sll_create_~head~0#1.offset| 0)) (.cse20 (<= 1 |ULTIMATE.start_sll_create_~data#1|)) (.cse21 (= |ULTIMATE.start_main_~data~0#1| 1)) (.cse22 (<= |ULTIMATE.start_sll_create_~data#1| 1)) (.cse23 (<= |ULTIMATE.start_sll_create_#in~len#1| 2)) (.cse24 (= |ULTIMATE.start_main_~len~0#1| 2)) (.cse25 (= |#NULL.offset| 0)) (.cse26 (<= |ULTIMATE.start_main_~i~0#1| 1)) (.cse27 (<= 0 |#StackHeapBarrier|)) (.cse28 (<= 2 |ULTIMATE.start_sll_create_#in~len#1|)) (.cse29 (<= 0 |ULTIMATE.start_sll_create_~head~0#1.offset|)) (.cse30 (<= |ULTIMATE.start_sll_create_~len#1| 2)) (.cse31 (= |#NULL.base| 0))) (or (and (<= 1 |ULTIMATE.start_main_~i~0#1|) .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31) (and .cse0 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31)))) (.cse5 (select (select |#memory_int| |ULTIMATE.start_sll_get_data_at_~head#1.base|) |ULTIMATE.start_sll_get_data_at_~head#1.offset|)) (.cse9 (= (let ((.cse16 (+ |ULTIMATE.start_main_~s~0#1.offset| 4))) (select (select |#memory_int| (select .cse15 .cse16)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) .cse16))) (+ |ULTIMATE.start_main_~len~0#1| 1))) (.cse10 (= |ULTIMATE.start_main_~s~0#1.offset| 0))) (or (and .cse0 .cse1 .cse2 .cse3 (not (= |ULTIMATE.start_sll_update_at_~head#1.base| |ULTIMATE.start_main_~s~0#1.base|)) .cse4 (= .cse5 |ULTIMATE.start_main_~expected~0#1|) (= (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) |ULTIMATE.start_main_~len~0#1|) (= 2 |ULTIMATE.start_main_~expected~0#1|) .cse6 .cse7 .cse8 .cse9 .cse10 (= |ULTIMATE.start_sll_get_data_at_~index#1| 0)) (let ((.cse11 (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_get_data_at_~head#1.base|))) (and (= (let ((.cse12 (+ |ULTIMATE.start_sll_get_data_at_~head#1.offset| 4))) (select (select |#memory_int| (select .cse11 .cse12)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_get_data_at_~head#1.base|) .cse12))) 3) .cse1 .cse2 (<= 1 |ULTIMATE.start_sll_get_data_at_~index#1|) .cse3 (not (= |ULTIMATE.start_sll_get_data_at_~head#1.base| (select .cse11 4))) .cse4 .cse13 (<= |ULTIMATE.start_sll_get_data_at_~index#1| 1) .cse6 .cse14 .cse7 .cse8 .cse9 .cse10)) (and (<= |ULTIMATE.start_sll_get_data_at_~index#1| 0) .cse1 .cse2 .cse3 .cse4 .cse13 .cse6 .cse14 .cse7 (= .cse5 3) .cse9 .cse10)))) [2022-11-20 18:57:03,278 INFO L895 garLoopResultBuilder]: At program point L625(lines 613 632) the Hoare annotation is: false [2022-11-20 18:57:03,278 INFO L895 garLoopResultBuilder]: At program point L576(lines 576 578) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_node_create_~data#1| |ULTIMATE.start_node_create_#in~data#1|)) (.cse1 (= (select |#valid| |ULTIMATE.start_node_create_~temp~0#1.base|) 1)) (.cse2 (<= 1 |ULTIMATE.start_sll_create_#in~data#1|)) (.cse3 (= 8 (select |#length| |ULTIMATE.start_node_create_~temp~0#1.base|))) (.cse4 (= |ULTIMATE.start_node_create_~temp~0#1.offset| 0)) (.cse5 (<= |ULTIMATE.start_sll_create_#in~data#1| 1)) (.cse6 (<= |ULTIMATE.start_sll_create_~head~0#1.offset| 0)) (.cse7 (<= 1 |ULTIMATE.start_sll_create_~data#1|)) (.cse8 (= |ULTIMATE.start_main_~data~0#1| 1)) (.cse9 (<= |ULTIMATE.start_sll_create_~data#1| 1)) (.cse10 (<= |ULTIMATE.start_sll_create_#in~len#1| 2)) (.cse11 (= |ULTIMATE.start_main_~len~0#1| 2)) (.cse12 (< |ULTIMATE.start_node_create_~temp~0#1.base| |#StackHeapBarrier|)) (.cse13 (= |#NULL.offset| 0)) (.cse14 (= |ULTIMATE.start_sll_create_~data#1| |ULTIMATE.start_node_create_#in~data#1|)) (.cse15 (<= 0 |#StackHeapBarrier|)) (.cse16 (<= 2 |ULTIMATE.start_sll_create_#in~len#1|)) (.cse17 (not (= |ULTIMATE.start_node_create_~temp~0#1.base| 0))) (.cse18 (<= 0 |ULTIMATE.start_sll_create_~head~0#1.offset|)) (.cse19 (= |#NULL.base| 0))) (or (and .cse0 (not (= |ULTIMATE.start_node_create_~temp~0#1.base| |ULTIMATE.start_sll_create_~head~0#1.base|)) .cse1 (= (select |#valid| |ULTIMATE.start_sll_create_~head~0#1.base|) 1) .cse2 .cse3 .cse4 .cse5 .cse6 (<= 1 |ULTIMATE.start_sll_create_~len#1|) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 (<= |ULTIMATE.start_sll_create_~len#1| 2) .cse19) (and (= 2 |ULTIMATE.start_sll_create_~len#1|) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19))) [2022-11-20 18:57:03,279 INFO L902 garLoopResultBuilder]: At program point L593-2(lines 593 597) the Hoare annotation is: true [2022-11-20 18:57:03,279 INFO L895 garLoopResultBuilder]: At program point L618-3(lines 618 621) the Hoare annotation is: (let ((.cse17 (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|))) (let ((.cse0 (not (= |ULTIMATE.start_main_~s~0#1.base| (select .cse17 4)))) (.cse1 (= (select |#valid| |ULTIMATE.start_node_create_~temp~0#1.base|) 1)) (.cse2 (= (select |#valid| |ULTIMATE.start_sll_create_~head~0#1.base|) 1)) (.cse3 (<= 1 |ULTIMATE.start_sll_create_#in~data#1|)) (.cse5 (= |ULTIMATE.start_node_create_~temp~0#1.offset| 0)) (.cse6 (<= |ULTIMATE.start_sll_create_#in~data#1| 1)) (.cse22 (not (= |ULTIMATE.start_sll_create_~head~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) (+ |ULTIMATE.start_sll_create_~head~0#1.offset| 4))))) (.cse7 (= (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) |ULTIMATE.start_main_~len~0#1|)) (.cse8 (<= 1 |ULTIMATE.start_sll_create_~data#1|)) (.cse9 (<= |ULTIMATE.start_sll_update_at_~index#1| 0)) (.cse10 (= |ULTIMATE.start_main_~data~0#1| 1)) (.cse11 (<= |ULTIMATE.start_sll_create_~data#1| 1)) (.cse12 (<= |ULTIMATE.start_sll_create_#in~len#1| 2)) (.cse13 (= |ULTIMATE.start_main_~len~0#1| 2)) (.cse14 (= |#NULL.offset| 0)) (.cse4 (= |ULTIMATE.start_sll_update_at_~head#1.base| |ULTIMATE.start_main_~s~0#1.base|)) (.cse15 (<= 0 |#StackHeapBarrier|)) (.cse16 (<= 2 |ULTIMATE.start_sll_create_#in~len#1|)) (.cse19 (<= |ULTIMATE.start_sll_create_~len#1| 2)) (.cse20 (= |ULTIMATE.start_main_~s~0#1.offset| 0)) (.cse21 (= |#NULL.base| 0))) (or (and .cse0 .cse1 .cse2 .cse3 (not .cse4) .cse5 .cse6 (<= |ULTIMATE.start_sll_create_~head~0#1.offset| 0) .cse7 .cse8 .cse9 (<= 2 |ULTIMATE.start_main_~i~0#1|) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 (= (let ((.cse18 (+ |ULTIMATE.start_main_~s~0#1.offset| 4))) (select (select |#memory_int| (select .cse17 .cse18)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) .cse18))) (+ |ULTIMATE.start_main_~len~0#1| 1)) (<= 0 |ULTIMATE.start_sll_create_~head~0#1.offset|) .cse19 .cse20 .cse21) (and (= |ULTIMATE.start_main_~s~0#1.base| |ULTIMATE.start_sll_create_#res#1.base|) (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_sll_create_~head~0#1.base| |ULTIMATE.start_sll_create_#res#1.base|) .cse1 .cse2 .cse3 .cse5 .cse6 .cse22 (<= |ULTIMATE.start_sll_create_~len#1| 0) .cse8 .cse10 .cse11 .cse12 .cse13 (= |ULTIMATE.start_sll_create_#res#1.offset| |ULTIMATE.start_sll_create_~head~0#1.offset|) .cse14 (= |ULTIMATE.start_sll_create_#res#1.offset| |ULTIMATE.start_main_~s~0#1.offset|) .cse15 .cse16 .cse20 .cse21) (and (= |ULTIMATE.start_main_~len~0#1| |ULTIMATE.start_sll_update_at_~data#1|) .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse22 (= |ULTIMATE.start_main_~i~0#1| 1) (= |ULTIMATE.start_sll_create_~head~0#1.offset| 0) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (= |ULTIMATE.start_main_~s~0#1.offset| |ULTIMATE.start_sll_update_at_~head#1.offset|) .cse14 .cse4 .cse15 .cse16 .cse19 .cse20 .cse21)))) [2022-11-20 18:57:03,279 INFO L895 garLoopResultBuilder]: At program point L585-3(lines 585 589) the Hoare annotation is: (let ((.cse5 (<= |ULTIMATE.start_sll_create_~head~0#1.offset| 0)) (.cse14 (<= 0 |ULTIMATE.start_sll_create_~head~0#1.offset|)) (.cse0 (= (select |#valid| |ULTIMATE.start_node_create_~temp~0#1.base|) 1)) (.cse1 (= (select |#valid| |ULTIMATE.start_sll_create_~head~0#1.base|) 1)) (.cse2 (<= 1 |ULTIMATE.start_sll_create_#in~data#1|)) (.cse3 (= |ULTIMATE.start_node_create_~temp~0#1.offset| 0)) (.cse4 (<= |ULTIMATE.start_sll_create_#in~data#1| 1)) (.cse6 (<= 1 |ULTIMATE.start_sll_create_~data#1|)) (.cse7 (= |ULTIMATE.start_main_~data~0#1| 1)) (.cse8 (<= |ULTIMATE.start_sll_create_~data#1| 1)) (.cse9 (<= |ULTIMATE.start_sll_create_#in~len#1| 2)) (.cse10 (= |ULTIMATE.start_main_~len~0#1| 2)) (.cse11 (= |#NULL.offset| 0)) (.cse12 (<= 0 |#StackHeapBarrier|)) (.cse13 (<= 2 |ULTIMATE.start_sll_create_#in~len#1|)) (.cse15 (<= |ULTIMATE.start_sll_create_~len#1| 2)) (.cse16 (= |#NULL.base| 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= 1 |ULTIMATE.start_sll_create_~len#1|) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and (= 2 |ULTIMATE.start_sll_create_~len#1|) .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse4 (not (= |ULTIMATE.start_sll_create_~head~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) (+ |ULTIMATE.start_sll_create_~head~0#1.offset| 4)))) (= |ULTIMATE.start_sll_create_~head~0#1.offset| 0) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16))) [2022-11-20 18:57:03,279 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 630) no Hoare annotation was computed. [2022-11-20 18:57:03,280 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-11-20 18:57:03,283 INFO L444 BasicCegarLoop]: Path program histogram: [3, 3, 2, 1, 1, 1, 1] [2022-11-20 18:57:03,285 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-20 18:57:03,304 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 18:57:03,308 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 18:57:03,308 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 18:57:03,313 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 18:57:03,314 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 18:57:03,314 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 18:57:03,320 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 18:57:03,328 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 18:57:03,328 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 18:57:03,328 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 18:57:03,331 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 18:57:03,331 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 18:57:03,337 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 18:57:03,350 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 18:57:03,351 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 18:57:03,352 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 18:57:03,352 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 18:57:03,352 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 18:57:03,353 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 18:57:03,353 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 18:57:03,355 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 18:57:03,355 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 18:57:03,355 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 18:57:03,356 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 18:57:03,363 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 18:57:03,363 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 18:57:03,365 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 18:57:03,366 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 18:57:03,366 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 18:57:03,366 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 18:57:03,366 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 18:57:03,367 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 18:57:03,367 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 18:57:03,367 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 18:57:03,367 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 18:57:03,367 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 18:57:03,368 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 18:57:03,368 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 18:57:03,370 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 18:57:03,377 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 18:57:03,378 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 18:57:03,378 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 18:57:03,378 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 18:57:03,378 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 18:57:03,379 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 18:57:03,379 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 18:57:03,379 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 18:57:03,379 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 18:57:03,380 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 18:57:03,380 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 18:57:03,383 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 18:57:03,383 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 18:57:03,383 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 18:57:03,384 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_772,QUANTIFIED] [2022-11-20 18:57:03,384 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 18:57:03,386 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 18:57:03,388 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 18:57:03,393 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 18:57:03,393 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 18:57:03,393 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_772,QUANTIFIED] [2022-11-20 18:57:03,394 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 18:57:03,394 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 18:57:03,396 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 06:57:03 BoogieIcfgContainer [2022-11-20 18:57:03,396 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-20 18:57:03,396 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-20 18:57:03,396 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-20 18:57:03,397 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-20 18:57:03,399 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 06:56:19" (3/4) ... [2022-11-20 18:57:03,403 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-11-20 18:57:03,416 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 28 nodes and edges [2022-11-20 18:57:03,416 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2022-11-20 18:57:03,417 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2022-11-20 18:57:03,417 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-20 18:57:03,445 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((\valid[temp] == 1 && \valid[head] == 1) && 1 <= \old(data)) && temp == 0) && \old(data) <= 1) && head <= 0) && 1 <= len) && 1 <= data) && data == 1) && data <= 1) && \old(len) <= 2) && len == 2) && #NULL == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && 2 <= \old(len)) && 0 <= head) && len <= 2) && #NULL == 0) || (((((((((((((2 == len && 1 <= \old(data)) && \old(data) <= 1) && head <= 0) && 1 <= data) && data == 1) && data <= 1) && \old(len) <= 2) && len == 2) && #NULL == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && 2 <= \old(len)) && 0 <= head) && #NULL == 0)) || ((((((((((((((((\valid[temp] == 1 && \valid[head] == 1) && 1 <= \old(data)) && temp == 0) && \old(data) <= 1) && !(head == #memory_$Pointer$[head][head + 4])) && head == 0) && 1 <= data) && data == 1) && data <= 1) && \old(len) <= 2) && len == 2) && #NULL == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && 2 <= \old(len)) && len <= 2) && #NULL == 0) [2022-11-20 18:57:03,445 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((data == \old(data) && !(temp == head)) && \valid[temp] == 1) && \valid[head] == 1) && 1 <= \old(data)) && 8 == unknown-#length-unknown[temp]) && temp == 0) && \old(data) <= 1) && head <= 0) && 1 <= len) && 1 <= data) && data == 1) && data <= 1) && \old(len) <= 2) && len == 2) && temp < unknown-#StackHeapBarrier-unknown) && #NULL == 0) && data == \old(data)) && 0 <= unknown-#StackHeapBarrier-unknown) && 2 <= \old(len)) && !(temp == 0)) && 0 <= head) && len <= 2) && #NULL == 0) || ((((((((((((((((((((2 == len && data == \old(data)) && \valid[temp] == 1) && 1 <= \old(data)) && 8 == unknown-#length-unknown[temp]) && temp == 0) && \old(data) <= 1) && head <= 0) && 1 <= data) && data == 1) && data <= 1) && \old(len) <= 2) && len == 2) && temp < unknown-#StackHeapBarrier-unknown) && #NULL == 0) && data == \old(data)) && 0 <= unknown-#StackHeapBarrier-unknown) && 2 <= \old(len)) && !(temp == 0)) && 0 <= head) && #NULL == 0) [2022-11-20 18:57:03,445 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((!(s == #memory_$Pointer$[s][4]) && \valid[temp] == 1) && \valid[head] == 1) && 1 <= \old(data)) && !(head == s)) && temp == 0) && \old(data) <= 1) && head <= 0) && unknown-#memory_int-unknown[s][s] == len) && 1 <= data) && index <= 0) && 2 <= i) && data == 1) && data <= 1) && \old(len) <= 2) && len == 2) && #NULL == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && 2 <= \old(len)) && unknown-#memory_int-unknown[#memory_$Pointer$[s][s + 4]][#memory_$Pointer$[s][s + 4]] == len + 1) && 0 <= head) && len <= 2) && s == 0) && #NULL == 0) || (((((((((((((((((((((s == \result && i == 0) && head == \result) && \valid[temp] == 1) && \valid[head] == 1) && 1 <= \old(data)) && temp == 0) && \old(data) <= 1) && !(head == #memory_$Pointer$[head][head + 4])) && len <= 0) && 1 <= data) && data == 1) && data <= 1) && \old(len) <= 2) && len == 2) && \result == head) && #NULL == 0) && \result == s) && 0 <= unknown-#StackHeapBarrier-unknown) && 2 <= \old(len)) && s == 0) && #NULL == 0)) || ((((((((((((((((((((((((len == data && !(s == #memory_$Pointer$[s][4])) && \valid[temp] == 1) && \valid[head] == 1) && 1 <= \old(data)) && temp == 0) && \old(data) <= 1) && !(head == #memory_$Pointer$[head][head + 4])) && i == 1) && head == 0) && unknown-#memory_int-unknown[s][s] == len) && 1 <= data) && index <= 0) && data == 1) && data <= 1) && \old(len) <= 2) && len == 2) && s == head) && #NULL == 0) && head == s) && 0 <= unknown-#StackHeapBarrier-unknown) && 2 <= \old(len)) && len <= 2) && s == 0) && #NULL == 0) [2022-11-20 18:57:03,446 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((i == 0 && 1 <= \old(data)) && \old(data) <= 1) && head <= 0) && 1 <= data) && data == 1) && data <= 1) && \old(len) <= 2) && #NULL == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && 2 <= \old(len)) && 0 <= head) && len <= 2) && #NULL == 0) || (((((((((((((1 <= i && 1 <= \old(data)) && \old(data) <= 1) && head <= 0) && 1 <= data) && data == 1) && data <= 1) && \old(len) <= 2) && #NULL == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && 2 <= \old(len)) && 0 <= head) && len <= 2) && #NULL == 0)) && index <= 0) && !(s == #memory_$Pointer$[s][4])) && \valid[temp] == 1) && \valid[head] == 1) && temp == 0) && i == 1) && index <= 0) && len == 2) && unknown-#memory_int-unknown[#memory_$Pointer$[s][s + 4]][#memory_$Pointer$[s][s + 4]] == len + 1) && s == 0) || (((((((((((((((((((((((((i == 0 && 1 <= \old(data)) && \old(data) <= 1) && head <= 0) && 1 <= data) && data == 1) && data <= 1) && \old(len) <= 2) && #NULL == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && 2 <= \old(len)) && 0 <= head) && len <= 2) && #NULL == 0) || (((((((((((((1 <= i && 1 <= \old(data)) && \old(data) <= 1) && head <= 0) && 1 <= data) && data == 1) && data <= 1) && \old(len) <= 2) && #NULL == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && 2 <= \old(len)) && 0 <= head) && len <= 2) && #NULL == 0)) && i == 0) && !(s == #memory_$Pointer$[s][4])) && \valid[temp] == 1) && \valid[head] == 1) && !(head == s)) && temp == 0) && unknown-#memory_int-unknown[s][s] == len) && index <= 0) && len == 2) && unknown-#memory_int-unknown[#memory_$Pointer$[s][s + 4]][#memory_$Pointer$[s][s + 4]] == len + 1) && s == 0)) || ((((((((((((((((((((i == 0 && 1 <= \old(data)) && \old(data) <= 1) && head <= 0) && 1 <= data) && data == 1) && data <= 1) && \old(len) <= 2) && #NULL == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && 2 <= \old(len)) && 0 <= head) && len <= 2) && #NULL == 0) || (((((((((((((1 <= i && 1 <= \old(data)) && \old(data) <= 1) && head <= 0) && 1 <= data) && data == 1) && data <= 1) && \old(len) <= 2) && #NULL == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && 2 <= \old(len)) && 0 <= head) && len <= 2) && #NULL == 0)) && \valid[temp] == 1) && \valid[head] == 1) && temp == 0) && index <= 0) && 2 <= i) && len == 2) [2022-11-20 18:57:03,447 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((i == 0 && \valid[temp] == 1) && \valid[head] == 1) && 1 <= \old(data)) && temp == 0) && \old(data) <= 1) && head <= 0) && !(head == #memory_$Pointer$[head][head + 4])) && 1 <= data) && data == len + i) && data == 1) && data <= 1) && \old(len) <= 2) && len == 2) && s == head) && #NULL == 0) && index == i) && head == s) && !(head == #memory_$Pointer$[head][4])) && 0 <= unknown-#StackHeapBarrier-unknown) && 2 <= \old(len)) && 0 <= head) && len <= 2) && s == 0) && #NULL == 0) || (((((((((((((((((((((((\valid[temp] == 1 && \valid[head] == 1) && 1 <= \old(data)) && (forall v_ArrVal_772 : [int]int :: #memory_$Pointer$[head := v_ArrVal_772][s][s + 4] == head)) && temp == 0) && \old(data) <= 1) && head <= 0) && unknown-#memory_int-unknown[s][s] == len) && 1 <= data) && index <= 0) && data == len + i) && data == len + 1) && head == #memory_$Pointer$[s][4]) && data == 1) && data <= 1) && \old(len) <= 2) && len == 2) && #NULL == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && 2 <= \old(len)) && 0 <= head) && len <= 2) && s == 0) && #NULL == 0)) || (((((((((((((((((((((((((!(s == #memory_$Pointer$[s][4]) && 1 <= i) && \valid[temp] == 1) && \valid[head] == 1) && 1 <= \old(data)) && temp == 0) && \old(data) <= 1) && head <= 0) && unknown-#memory_int-unknown[s][s] == len) && 1 <= data) && data == len + 1) && data == 1) && data <= 1) && \old(len) <= 2) && len == 2) && s == head) && #NULL == 0) && index == i) && head == s) && i <= 1) && 0 <= unknown-#StackHeapBarrier-unknown) && 2 <= \old(len)) && 0 <= head) && len <= 2) && s == 0) && #NULL == 0) [2022-11-20 18:57:03,448 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((i == 0 && !(s == #memory_$Pointer$[s][4])) && \valid[temp] == 1) && \valid[head] == 1) && !(head == s)) && temp == 0) && unknown-#memory_int-unknown[head][head] == expected) && unknown-#memory_int-unknown[s][s] == len) && 2 == expected) && index <= 0) && ((((((((((((((((1 <= i && 1 <= \old(data)) && \old(data) <= 1) && head <= 0) && 1 <= data) && data == 1) && data <= 1) && \old(len) <= 2) && len == 2) && #NULL == 0) && i <= 1) && 0 <= unknown-#StackHeapBarrier-unknown) && 2 <= \old(len)) && 0 <= head) && len <= 2) && #NULL == 0) || (((((((((((((((i == 0 && 1 <= \old(data)) && \old(data) <= 1) && head <= 0) && 1 <= data) && data == 1) && data <= 1) && \old(len) <= 2) && len == 2) && #NULL == 0) && i <= 1) && 0 <= unknown-#StackHeapBarrier-unknown) && 2 <= \old(len)) && 0 <= head) && len <= 2) && #NULL == 0))) && head == 0) && unknown-#memory_int-unknown[#memory_$Pointer$[s][s + 4]][#memory_$Pointer$[s][s + 4]] == len + 1) && s == 0) && index == 0) || ((((((((((((((unknown-#memory_int-unknown[#memory_$Pointer$[head][head + 4]][#memory_$Pointer$[head][head + 4]] == 3 && !(s == #memory_$Pointer$[s][4])) && \valid[temp] == 1) && 1 <= index) && \valid[head] == 1) && !(head == #memory_$Pointer$[head][4])) && temp == 0) && i == 1) && index <= 1) && index <= 0) && 3 == expected) && ((((((((((((((((1 <= i && 1 <= \old(data)) && \old(data) <= 1) && head <= 0) && 1 <= data) && data == 1) && data <= 1) && \old(len) <= 2) && len == 2) && #NULL == 0) && i <= 1) && 0 <= unknown-#StackHeapBarrier-unknown) && 2 <= \old(len)) && 0 <= head) && len <= 2) && #NULL == 0) || (((((((((((((((i == 0 && 1 <= \old(data)) && \old(data) <= 1) && head <= 0) && 1 <= data) && data == 1) && data <= 1) && \old(len) <= 2) && len == 2) && #NULL == 0) && i <= 1) && 0 <= unknown-#StackHeapBarrier-unknown) && 2 <= \old(len)) && 0 <= head) && len <= 2) && #NULL == 0))) && head == 0) && unknown-#memory_int-unknown[#memory_$Pointer$[s][s + 4]][#memory_$Pointer$[s][s + 4]] == len + 1) && s == 0)) || (((((((((((index <= 0 && !(s == #memory_$Pointer$[s][4])) && \valid[temp] == 1) && \valid[head] == 1) && temp == 0) && i == 1) && index <= 0) && 3 == expected) && ((((((((((((((((1 <= i && 1 <= \old(data)) && \old(data) <= 1) && head <= 0) && 1 <= data) && data == 1) && data <= 1) && \old(len) <= 2) && len == 2) && #NULL == 0) && i <= 1) && 0 <= unknown-#StackHeapBarrier-unknown) && 2 <= \old(len)) && 0 <= head) && len <= 2) && #NULL == 0) || (((((((((((((((i == 0 && 1 <= \old(data)) && \old(data) <= 1) && head <= 0) && 1 <= data) && data == 1) && data <= 1) && \old(len) <= 2) && len == 2) && #NULL == 0) && i <= 1) && 0 <= unknown-#StackHeapBarrier-unknown) && 2 <= \old(len)) && 0 <= head) && len <= 2) && #NULL == 0))) && unknown-#memory_int-unknown[head][head] == 3) && unknown-#memory_int-unknown[#memory_$Pointer$[s][s + 4]][#memory_$Pointer$[s][s + 4]] == len + 1) && s == 0) [2022-11-20 18:57:03,483 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6aec7cb7-89c8-447d-8f3d-5def91949efc/bin/utaipan-6cKwYrpEi9/witness.graphml [2022-11-20 18:57:03,483 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-20 18:57:03,484 INFO L158 Benchmark]: Toolchain (without parser) took 45366.70ms. Allocated memory was 161.5MB in the beginning and 415.2MB in the end (delta: 253.8MB). Free memory was 122.1MB in the beginning and 280.5MB in the end (delta: -158.4MB). Peak memory consumption was 97.1MB. Max. memory is 16.1GB. [2022-11-20 18:57:03,484 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 117.4MB. Free memory is still 86.2MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-20 18:57:03,484 INFO L158 Benchmark]: CACSL2BoogieTranslator took 654.60ms. Allocated memory is still 161.5MB. Free memory was 122.1MB in the beginning and 104.6MB in the end (delta: 17.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-11-20 18:57:03,484 INFO L158 Benchmark]: Boogie Procedure Inliner took 77.20ms. Allocated memory is still 161.5MB. Free memory was 104.6MB in the beginning and 102.6MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-20 18:57:03,485 INFO L158 Benchmark]: Boogie Preprocessor took 40.45ms. Allocated memory is still 161.5MB. Free memory was 102.6MB in the beginning and 101.1MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-20 18:57:03,485 INFO L158 Benchmark]: RCFGBuilder took 573.40ms. Allocated memory is still 161.5MB. Free memory was 101.1MB in the beginning and 82.9MB in the end (delta: 18.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-11-20 18:57:03,485 INFO L158 Benchmark]: TraceAbstraction took 43923.71ms. Allocated memory was 161.5MB in the beginning and 415.2MB in the end (delta: 253.8MB). Free memory was 82.3MB in the beginning and 283.6MB in the end (delta: -201.3MB). Peak memory consumption was 202.2MB. Max. memory is 16.1GB. [2022-11-20 18:57:03,485 INFO L158 Benchmark]: Witness Printer took 86.90ms. Allocated memory is still 415.2MB. Free memory was 283.6MB in the beginning and 280.5MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-20 18:57:03,488 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.28ms. Allocated memory is still 117.4MB. Free memory is still 86.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 654.60ms. Allocated memory is still 161.5MB. Free memory was 122.1MB in the beginning and 104.6MB in the end (delta: 17.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 77.20ms. Allocated memory is still 161.5MB. Free memory was 104.6MB in the beginning and 102.6MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 40.45ms. Allocated memory is still 161.5MB. Free memory was 102.6MB in the beginning and 101.1MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 573.40ms. Allocated memory is still 161.5MB. Free memory was 101.1MB in the beginning and 82.9MB in the end (delta: 18.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 43923.71ms. Allocated memory was 161.5MB in the beginning and 415.2MB in the end (delta: 253.8MB). Free memory was 82.3MB in the beginning and 283.6MB in the end (delta: -201.3MB). Peak memory consumption was 202.2MB. Max. memory is 16.1GB. * Witness Printer took 86.90ms. Allocated memory is still 415.2MB. Free memory was 283.6MB in the beginning and 280.5MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_772,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_772,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 630]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 14 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 43.7s, OverallIterations: 12, TraceHistogramMax: 3, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 3.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 2.2s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 668 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 668 mSDsluCounter, 334 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 131 IncrementalHoareTripleChecker+Unchecked, 269 mSDsCounter, 75 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1114 IncrementalHoareTripleChecker+Invalid, 1320 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 75 mSolverCounterUnsat, 65 mSDtfsCounter, 1114 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 543 GetRequests, 289 SyntacticMatches, 23 SemanticMatches, 231 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2345 ImplicationChecksByTransitivity, 13.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=35occurred in iteration=10, InterpolantAutomatonStates: 94, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 12 MinimizatonAttempts, 75 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 10 LocationsWithAnnotation, 10 PreInvPairs, 28 NumberOfFragments, 1831 HoareAnnotationTreeSize, 10 FomulaSimplifications, 132 FormulaSimplificationTreeSizeReduction, 0.4s HoareSimplificationTime, 10 FomulaSimplificationsInter, 22605 FormulaSimplificationTreeSizeReductionInter, 1.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 6.8s InterpolantComputationTime, 346 NumberOfCodeBlocks, 337 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 456 ConstructedInterpolants, 5 QuantifiedInterpolants, 2660 SizeOfPredicates, 92 NumberOfNonLiveVariables, 2463 ConjunctsInSsa, 230 ConjunctsInUnsatCore, 31 InterpolantComputations, 3 PerfectInterpolantSequences, 215/316 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: OVERALL_TIME: 2.3s, ICFG_INTERPRETER_ENTERED_PROCEDURES: 1, DAG_INTERPRETER_EARLY_EXIT_QUERIES_NONTRIVIAL: 4, DAG_INTERPRETER_EARLY_EXITS: 1, TOOLS_POST_APPLICATIONS: 10, TOOLS_POST_TIME: 2.1s, TOOLS_POST_CALL_APPLICATIONS: 0, TOOLS_POST_CALL_TIME: 0.0s, TOOLS_POST_RETURN_APPLICATIONS: 0, TOOLS_POST_RETURN_TIME: 0.0s, TOOLS_QUANTIFIERELIM_APPLICATIONS: 10, TOOLS_QUANTIFIERELIM_TIME: 2.1s, TOOLS_QUANTIFIERELIM_MAX_TIME: 0.9s, FLUID_QUERY_TIME: 0.0s, FLUID_QUERIES: 22, FLUID_YES_ANSWERS: 0, DOMAIN_JOIN_APPLICATIONS: 0, DOMAIN_JOIN_TIME: 0.0s, DOMAIN_ALPHA_APPLICATIONS: 0, DOMAIN_ALPHA_TIME: 0.0s, DOMAIN_WIDEN_APPLICATIONS: 2, DOMAIN_WIDEN_TIME: 0.1s, DOMAIN_ISSUBSETEQ_APPLICATIONS: 3, DOMAIN_ISSUBSETEQ_TIME: 0.0s, DOMAIN_ISBOTTOM_APPLICATIONS: 4, DOMAIN_ISBOTTOM_TIME: 0.0s, LOOP_SUMMARIZER_APPLICATIONS: 1, LOOP_SUMMARIZER_CACHE_MISSES: 1, LOOP_SUMMARIZER_OVERALL_TIME: 2.2s, LOOP_SUMMARIZER_NEW_COMPUTATION_TIME: 2.2s, LOOP_SUMMARIZER_FIXPOINT_ITERATIONS: 3, CALL_SUMMARIZER_APPLICATIONS: 0, CALL_SUMMARIZER_CACHE_MISSES: 0, CALL_SUMMARIZER_OVERALL_TIME: 0.0s, CALL_SUMMARIZER_NEW_COMPUTATION_TIME: 0.0s, PROCEDURE_GRAPH_BUILDER_TIME: 0.0s, PATH_EXPR_TIME: 0.0s, REGEX_TO_DAG_TIME: 0.0s, DAG_COMPRESSION_TIME: 0.0s, DAG_COMPRESSION_PROCESSED_NODES: 56, DAG_COMPRESSION_RETAINED_NODES: 25, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 593]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 622]: Loop Invariant [2022-11-20 18:57:03,497 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 18:57:03,498 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 18:57:03,498 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 18:57:03,498 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 18:57:03,498 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 18:57:03,499 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 18:57:03,500 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 18:57:03,500 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 18:57:03,500 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 18:57:03,500 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 18:57:03,501 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 18:57:03,501 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: (((((((((((((((((((((((((i == 0 && 1 <= \old(data)) && \old(data) <= 1) && head <= 0) && 1 <= data) && data == 1) && data <= 1) && \old(len) <= 2) && #NULL == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && 2 <= \old(len)) && 0 <= head) && len <= 2) && #NULL == 0) || (((((((((((((1 <= i && 1 <= \old(data)) && \old(data) <= 1) && head <= 0) && 1 <= data) && data == 1) && data <= 1) && \old(len) <= 2) && #NULL == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && 2 <= \old(len)) && 0 <= head) && len <= 2) && #NULL == 0)) && index <= 0) && !(s == #memory_$Pointer$[s][4])) && \valid[temp] == 1) && \valid[head] == 1) && temp == 0) && i == 1) && index <= 0) && len == 2) && unknown-#memory_int-unknown[#memory_$Pointer$[s][s + 4]][#memory_$Pointer$[s][s + 4]] == len + 1) && s == 0) || (((((((((((((((((((((((((i == 0 && 1 <= \old(data)) && \old(data) <= 1) && head <= 0) && 1 <= data) && data == 1) && data <= 1) && \old(len) <= 2) && #NULL == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && 2 <= \old(len)) && 0 <= head) && len <= 2) && #NULL == 0) || (((((((((((((1 <= i && 1 <= \old(data)) && \old(data) <= 1) && head <= 0) && 1 <= data) && data == 1) && data <= 1) && \old(len) <= 2) && #NULL == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && 2 <= \old(len)) && 0 <= head) && len <= 2) && #NULL == 0)) && i == 0) && !(s == #memory_$Pointer$[s][4])) && \valid[temp] == 1) && \valid[head] == 1) && !(head == s)) && temp == 0) && unknown-#memory_int-unknown[s][s] == len) && index <= 0) && len == 2) && unknown-#memory_int-unknown[#memory_$Pointer$[s][s + 4]][#memory_$Pointer$[s][s + 4]] == len + 1) && s == 0)) || ((((((((((((((((((((i == 0 && 1 <= \old(data)) && \old(data) <= 1) && head <= 0) && 1 <= data) && data == 1) && data <= 1) && \old(len) <= 2) && #NULL == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && 2 <= \old(len)) && 0 <= head) && len <= 2) && #NULL == 0) || (((((((((((((1 <= i && 1 <= \old(data)) && \old(data) <= 1) && head <= 0) && 1 <= data) && data == 1) && data <= 1) && \old(len) <= 2) && #NULL == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && 2 <= \old(len)) && 0 <= head) && len <= 2) && #NULL == 0)) && \valid[temp] == 1) && \valid[head] == 1) && temp == 0) && index <= 0) && 2 <= i) && len == 2) - InvariantResult [Line: 576]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((data == \old(data) && !(temp == head)) && \valid[temp] == 1) && \valid[head] == 1) && 1 <= \old(data)) && 8 == unknown-#length-unknown[temp]) && temp == 0) && \old(data) <= 1) && head <= 0) && 1 <= len) && 1 <= data) && data == 1) && data <= 1) && \old(len) <= 2) && len == 2) && temp < unknown-#StackHeapBarrier-unknown) && #NULL == 0) && data == \old(data)) && 0 <= unknown-#StackHeapBarrier-unknown) && 2 <= \old(len)) && !(temp == 0)) && 0 <= head) && len <= 2) && #NULL == 0) || ((((((((((((((((((((2 == len && data == \old(data)) && \valid[temp] == 1) && 1 <= \old(data)) && 8 == unknown-#length-unknown[temp]) && temp == 0) && \old(data) <= 1) && head <= 0) && 1 <= data) && data == 1) && data <= 1) && \old(len) <= 2) && len == 2) && temp < unknown-#StackHeapBarrier-unknown) && #NULL == 0) && data == \old(data)) && 0 <= unknown-#StackHeapBarrier-unknown) && 2 <= \old(len)) && !(temp == 0)) && 0 <= head) && #NULL == 0) - InvariantResult [Line: 613]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 572]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 585]: Loop Invariant [2022-11-20 18:57:03,503 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 18:57:03,504 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base Derived loop invariant: ((((((((((((((((((\valid[temp] == 1 && \valid[head] == 1) && 1 <= \old(data)) && temp == 0) && \old(data) <= 1) && head <= 0) && 1 <= len) && 1 <= data) && data == 1) && data <= 1) && \old(len) <= 2) && len == 2) && #NULL == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && 2 <= \old(len)) && 0 <= head) && len <= 2) && #NULL == 0) || (((((((((((((2 == len && 1 <= \old(data)) && \old(data) <= 1) && head <= 0) && 1 <= data) && data == 1) && data <= 1) && \old(len) <= 2) && len == 2) && #NULL == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && 2 <= \old(len)) && 0 <= head) && #NULL == 0)) || ((((((((((((((((\valid[temp] == 1 && \valid[head] == 1) && 1 <= \old(data)) && temp == 0) && \old(data) <= 1) && !(head == #memory_$Pointer$[head][head + 4])) && head == 0) && 1 <= data) && data == 1) && data <= 1) && \old(len) <= 2) && len == 2) && #NULL == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && 2 <= \old(len)) && len <= 2) && #NULL == 0) - InvariantResult [Line: 613]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 618]: Loop Invariant [2022-11-20 18:57:03,505 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 18:57:03,505 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 18:57:03,505 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 18:57:03,505 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 18:57:03,505 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 18:57:03,506 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 18:57:03,512 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 18:57:03,513 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 18:57:03,513 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 18:57:03,513 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 18:57:03,515 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 18:57:03,515 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base Derived loop invariant: ((((((((((((((((((((((((!(s == #memory_$Pointer$[s][4]) && \valid[temp] == 1) && \valid[head] == 1) && 1 <= \old(data)) && !(head == s)) && temp == 0) && \old(data) <= 1) && head <= 0) && unknown-#memory_int-unknown[s][s] == len) && 1 <= data) && index <= 0) && 2 <= i) && data == 1) && data <= 1) && \old(len) <= 2) && len == 2) && #NULL == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && 2 <= \old(len)) && unknown-#memory_int-unknown[#memory_$Pointer$[s][s + 4]][#memory_$Pointer$[s][s + 4]] == len + 1) && 0 <= head) && len <= 2) && s == 0) && #NULL == 0) || (((((((((((((((((((((s == \result && i == 0) && head == \result) && \valid[temp] == 1) && \valid[head] == 1) && 1 <= \old(data)) && temp == 0) && \old(data) <= 1) && !(head == #memory_$Pointer$[head][head + 4])) && len <= 0) && 1 <= data) && data == 1) && data <= 1) && \old(len) <= 2) && len == 2) && \result == head) && #NULL == 0) && \result == s) && 0 <= unknown-#StackHeapBarrier-unknown) && 2 <= \old(len)) && s == 0) && #NULL == 0)) || ((((((((((((((((((((((((len == data && !(s == #memory_$Pointer$[s][4])) && \valid[temp] == 1) && \valid[head] == 1) && 1 <= \old(data)) && temp == 0) && \old(data) <= 1) && !(head == #memory_$Pointer$[head][head + 4])) && i == 1) && head == 0) && unknown-#memory_int-unknown[s][s] == len) && 1 <= data) && index <= 0) && data == 1) && data <= 1) && \old(len) <= 2) && len == 2) && s == head) && #NULL == 0) && head == s) && 0 <= unknown-#StackHeapBarrier-unknown) && 2 <= \old(len)) && len <= 2) && s == 0) && #NULL == 0) - InvariantResult [Line: 600]: Loop Invariant [2022-11-20 18:57:03,516 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 18:57:03,517 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 18:57:03,517 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 18:57:03,517 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 18:57:03,517 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 18:57:03,518 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 18:57:03,518 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 18:57:03,518 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 18:57:03,518 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 18:57:03,518 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 18:57:03,519 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 18:57:03,519 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 18:57:03,521 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 18:57:03,521 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 18:57:03,522 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 18:57:03,522 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 18:57:03,522 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 18:57:03,522 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 18:57:03,523 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 18:57:03,523 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 18:57:03,523 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 18:57:03,523 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 18:57:03,523 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 18:57:03,524 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: (((((((((((((((i == 0 && !(s == #memory_$Pointer$[s][4])) && \valid[temp] == 1) && \valid[head] == 1) && !(head == s)) && temp == 0) && unknown-#memory_int-unknown[head][head] == expected) && unknown-#memory_int-unknown[s][s] == len) && 2 == expected) && index <= 0) && ((((((((((((((((1 <= i && 1 <= \old(data)) && \old(data) <= 1) && head <= 0) && 1 <= data) && data == 1) && data <= 1) && \old(len) <= 2) && len == 2) && #NULL == 0) && i <= 1) && 0 <= unknown-#StackHeapBarrier-unknown) && 2 <= \old(len)) && 0 <= head) && len <= 2) && #NULL == 0) || (((((((((((((((i == 0 && 1 <= \old(data)) && \old(data) <= 1) && head <= 0) && 1 <= data) && data == 1) && data <= 1) && \old(len) <= 2) && len == 2) && #NULL == 0) && i <= 1) && 0 <= unknown-#StackHeapBarrier-unknown) && 2 <= \old(len)) && 0 <= head) && len <= 2) && #NULL == 0))) && head == 0) && unknown-#memory_int-unknown[#memory_$Pointer$[s][s + 4]][#memory_$Pointer$[s][s + 4]] == len + 1) && s == 0) && index == 0) || ((((((((((((((unknown-#memory_int-unknown[#memory_$Pointer$[head][head + 4]][#memory_$Pointer$[head][head + 4]] == 3 && !(s == #memory_$Pointer$[s][4])) && \valid[temp] == 1) && 1 <= index) && \valid[head] == 1) && !(head == #memory_$Pointer$[head][4])) && temp == 0) && i == 1) && index <= 1) && index <= 0) && 3 == expected) && ((((((((((((((((1 <= i && 1 <= \old(data)) && \old(data) <= 1) && head <= 0) && 1 <= data) && data == 1) && data <= 1) && \old(len) <= 2) && len == 2) && #NULL == 0) && i <= 1) && 0 <= unknown-#StackHeapBarrier-unknown) && 2 <= \old(len)) && 0 <= head) && len <= 2) && #NULL == 0) || (((((((((((((((i == 0 && 1 <= \old(data)) && \old(data) <= 1) && head <= 0) && 1 <= data) && data == 1) && data <= 1) && \old(len) <= 2) && len == 2) && #NULL == 0) && i <= 1) && 0 <= unknown-#StackHeapBarrier-unknown) && 2 <= \old(len)) && 0 <= head) && len <= 2) && #NULL == 0))) && head == 0) && unknown-#memory_int-unknown[#memory_$Pointer$[s][s + 4]][#memory_$Pointer$[s][s + 4]] == len + 1) && s == 0)) || (((((((((((index <= 0 && !(s == #memory_$Pointer$[s][4])) && \valid[temp] == 1) && \valid[head] == 1) && temp == 0) && i == 1) && index <= 0) && 3 == expected) && ((((((((((((((((1 <= i && 1 <= \old(data)) && \old(data) <= 1) && head <= 0) && 1 <= data) && data == 1) && data <= 1) && \old(len) <= 2) && len == 2) && #NULL == 0) && i <= 1) && 0 <= unknown-#StackHeapBarrier-unknown) && 2 <= \old(len)) && 0 <= head) && len <= 2) && #NULL == 0) || (((((((((((((((i == 0 && 1 <= \old(data)) && \old(data) <= 1) && head <= 0) && 1 <= data) && data == 1) && data <= 1) && \old(len) <= 2) && len == 2) && #NULL == 0) && i <= 1) && 0 <= unknown-#StackHeapBarrier-unknown) && 2 <= \old(len)) && 0 <= head) && len <= 2) && #NULL == 0))) && unknown-#memory_int-unknown[head][head] == 3) && unknown-#memory_int-unknown[#memory_$Pointer$[s][s + 4]][#memory_$Pointer$[s][s + 4]] == len + 1) && s == 0) - InvariantResult [Line: 607]: Loop Invariant [2022-11-20 18:57:03,525 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 18:57:03,526 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 18:57:03,526 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 18:57:03,526 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_772,QUANTIFIED] [2022-11-20 18:57:03,526 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 18:57:03,527 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 18:57:03,528 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 18:57:03,528 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 18:57:03,528 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 18:57:03,528 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_772,QUANTIFIED] [2022-11-20 18:57:03,529 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 18:57:03,529 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base Derived loop invariant: (((((((((((((((((((((((((i == 0 && \valid[temp] == 1) && \valid[head] == 1) && 1 <= \old(data)) && temp == 0) && \old(data) <= 1) && head <= 0) && !(head == #memory_$Pointer$[head][head + 4])) && 1 <= data) && data == len + i) && data == 1) && data <= 1) && \old(len) <= 2) && len == 2) && s == head) && #NULL == 0) && index == i) && head == s) && !(head == #memory_$Pointer$[head][4])) && 0 <= unknown-#StackHeapBarrier-unknown) && 2 <= \old(len)) && 0 <= head) && len <= 2) && s == 0) && #NULL == 0) || (((((((((((((((((((((((\valid[temp] == 1 && \valid[head] == 1) && 1 <= \old(data)) && (forall v_ArrVal_772 : [int]int :: #memory_$Pointer$[head := v_ArrVal_772][s][s + 4] == head)) && temp == 0) && \old(data) <= 1) && head <= 0) && unknown-#memory_int-unknown[s][s] == len) && 1 <= data) && index <= 0) && data == len + i) && data == len + 1) && head == #memory_$Pointer$[s][4]) && data == 1) && data <= 1) && \old(len) <= 2) && len == 2) && #NULL == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && 2 <= \old(len)) && 0 <= head) && len <= 2) && s == 0) && #NULL == 0)) || (((((((((((((((((((((((((!(s == #memory_$Pointer$[s][4]) && 1 <= i) && \valid[temp] == 1) && \valid[head] == 1) && 1 <= \old(data)) && temp == 0) && \old(data) <= 1) && head <= 0) && unknown-#memory_int-unknown[s][s] == len) && 1 <= data) && data == len + 1) && data == 1) && data <= 1) && \old(len) <= 2) && len == 2) && s == head) && #NULL == 0) && index == i) && head == s) && i <= 1) && 0 <= unknown-#StackHeapBarrier-unknown) && 2 <= \old(len)) && 0 <= head) && len <= 2) && s == 0) && #NULL == 0) RESULT: Ultimate proved your program to be correct! [2022-11-20 18:57:03,543 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6aec7cb7-89c8-447d-8f3d-5def91949efc/bin/utaipan-6cKwYrpEi9/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE