./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 8393723b Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad856ce5-3bf9-4073-857b-483dd0f5a44b/bin/utaipan-I9t0OCRTmS/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad856ce5-3bf9-4073-857b-483dd0f5a44b/bin/utaipan-I9t0OCRTmS/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad856ce5-3bf9-4073-857b-483dd0f5a44b/bin/utaipan-I9t0OCRTmS/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad856ce5-3bf9-4073-857b-483dd0f5a44b/bin/utaipan-I9t0OCRTmS/config/TaipanReach.xml -i ../../sv-benchmarks/c/list-simple/sll2n_update_all.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad856ce5-3bf9-4073-857b-483dd0f5a44b/bin/utaipan-I9t0OCRTmS/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad856ce5-3bf9-4073-857b-483dd0f5a44b/bin/utaipan-I9t0OCRTmS --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-8393723 [2022-11-19 06:33:22,806 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-19 06:33:22,809 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-19 06:33:22,830 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-19 06:33:22,830 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-19 06:33:22,831 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-19 06:33:22,833 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-19 06:33:22,834 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-19 06:33:22,836 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-19 06:33:22,837 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-19 06:33:22,838 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-19 06:33:22,840 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-19 06:33:22,840 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-19 06:33:22,841 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-19 06:33:22,842 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-19 06:33:22,844 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-19 06:33:22,845 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-19 06:33:22,846 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-19 06:33:22,848 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-19 06:33:22,850 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-19 06:33:22,852 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-19 06:33:22,853 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-19 06:33:22,854 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-19 06:33:22,855 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-19 06:33:22,859 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-19 06:33:22,860 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-19 06:33:22,860 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-19 06:33:22,861 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-19 06:33:22,862 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-19 06:33:22,863 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-19 06:33:22,863 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-19 06:33:22,864 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-19 06:33:22,865 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-19 06:33:22,866 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-19 06:33:22,867 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-19 06:33:22,867 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-19 06:33:22,868 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-19 06:33:22,869 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-19 06:33:22,869 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-19 06:33:22,870 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-19 06:33:22,871 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-19 06:33:22,872 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad856ce5-3bf9-4073-857b-483dd0f5a44b/bin/utaipan-I9t0OCRTmS/config/svcomp-Reach-32bit-Taipan_Default.epf [2022-11-19 06:33:22,896 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-19 06:33:22,897 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-19 06:33:22,897 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-19 06:33:22,897 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-19 06:33:22,898 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-19 06:33:22,899 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-19 06:33:22,899 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-19 06:33:22,899 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-19 06:33:22,900 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-19 06:33:22,900 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-19 06:33:22,900 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-19 06:33:22,900 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-19 06:33:22,901 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-19 06:33:22,901 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-19 06:33:22,901 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-19 06:33:22,902 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-19 06:33:22,902 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-19 06:33:22,902 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-19 06:33:22,903 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-19 06:33:22,903 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-19 06:33:22,903 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-19 06:33:22,904 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-19 06:33:22,904 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-19 06:33:22,904 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-19 06:33:22,904 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-19 06:33:22,905 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-19 06:33:22,905 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-19 06:33:22,905 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-19 06:33:22,905 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-19 06:33:22,906 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-19 06:33:22,906 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-19 06:33:22,906 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-19 06:33:22,906 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-19 06:33:22,907 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-19 06:33:22,907 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-19 06:33:22,907 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-19 06:33:22,907 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-19 06:33:22,908 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-19 06:33:22,908 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-19 06:33:22,908 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-19 06:33:22,908 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-19 06:33:22,909 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_ad856ce5-3bf9-4073-857b-483dd0f5a44b/bin/utaipan-I9t0OCRTmS/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_ad856ce5-3bf9-4073-857b-483dd0f5a44b/bin/utaipan-I9t0OCRTmS 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-19 06:33:23,202 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-19 06:33:23,225 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-19 06:33:23,228 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-19 06:33:23,229 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-19 06:33:23,230 INFO L275 PluginConnector]: CDTParser initialized [2022-11-19 06:33:23,231 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad856ce5-3bf9-4073-857b-483dd0f5a44b/bin/utaipan-I9t0OCRTmS/../../sv-benchmarks/c/list-simple/sll2n_update_all.i [2022-11-19 06:33:23,311 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad856ce5-3bf9-4073-857b-483dd0f5a44b/bin/utaipan-I9t0OCRTmS/data/0164fb4df/6392e341d5bd4c1fa86aee1290a0560c/FLAG9481c9882 [2022-11-19 06:33:23,880 INFO L306 CDTParser]: Found 1 translation units. [2022-11-19 06:33:23,881 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad856ce5-3bf9-4073-857b-483dd0f5a44b/sv-benchmarks/c/list-simple/sll2n_update_all.i [2022-11-19 06:33:23,894 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad856ce5-3bf9-4073-857b-483dd0f5a44b/bin/utaipan-I9t0OCRTmS/data/0164fb4df/6392e341d5bd4c1fa86aee1290a0560c/FLAG9481c9882 [2022-11-19 06:33:24,184 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad856ce5-3bf9-4073-857b-483dd0f5a44b/bin/utaipan-I9t0OCRTmS/data/0164fb4df/6392e341d5bd4c1fa86aee1290a0560c [2022-11-19 06:33:24,187 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-19 06:33:24,189 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-19 06:33:24,191 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-19 06:33:24,191 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-19 06:33:24,195 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-19 06:33:24,196 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 06:33:24" (1/1) ... [2022-11-19 06:33:24,198 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2dec56e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:33:24, skipping insertion in model container [2022-11-19 06:33:24,198 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 06:33:24" (1/1) ... [2022-11-19 06:33:24,207 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-19 06:33:24,244 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-19 06:33:24,696 WARN L234 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad856ce5-3bf9-4073-857b-483dd0f5a44b/sv-benchmarks/c/list-simple/sll2n_update_all.i[24218,24231] [2022-11-19 06:33:24,701 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-19 06:33:24,722 INFO L203 MainTranslator]: Completed pre-run [2022-11-19 06:33:24,797 WARN L234 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad856ce5-3bf9-4073-857b-483dd0f5a44b/sv-benchmarks/c/list-simple/sll2n_update_all.i[24218,24231] [2022-11-19 06:33:24,798 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-19 06:33:24,827 INFO L208 MainTranslator]: Completed translation [2022-11-19 06:33:24,828 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:33:24 WrapperNode [2022-11-19 06:33:24,828 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-19 06:33:24,830 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-19 06:33:24,830 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-19 06:33:24,830 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-19 06:33:24,839 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:33:24" (1/1) ... [2022-11-19 06:33:24,873 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:33:24" (1/1) ... [2022-11-19 06:33:24,911 INFO L138 Inliner]: procedures = 126, calls = 22, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 118 [2022-11-19 06:33:24,912 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-19 06:33:24,914 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-19 06:33:24,914 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-19 06:33:24,915 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-19 06:33:24,925 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:33:24" (1/1) ... [2022-11-19 06:33:24,926 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:33:24" (1/1) ... [2022-11-19 06:33:24,950 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:33:24" (1/1) ... [2022-11-19 06:33:24,950 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:33:24" (1/1) ... [2022-11-19 06:33:24,956 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:33:24" (1/1) ... [2022-11-19 06:33:24,967 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:33:24" (1/1) ... [2022-11-19 06:33:24,976 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:33:24" (1/1) ... [2022-11-19 06:33:24,977 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:33:24" (1/1) ... [2022-11-19 06:33:24,979 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-19 06:33:24,988 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-19 06:33:24,988 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-19 06:33:24,988 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-19 06:33:24,989 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:33:24" (1/1) ... [2022-11-19 06:33:24,997 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-19 06:33:25,012 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad856ce5-3bf9-4073-857b-483dd0f5a44b/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 06:33:25,026 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad856ce5-3bf9-4073-857b-483dd0f5a44b/bin/utaipan-I9t0OCRTmS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-19 06:33:25,057 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad856ce5-3bf9-4073-857b-483dd0f5a44b/bin/utaipan-I9t0OCRTmS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-19 06:33:25,076 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-19 06:33:25,077 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-19 06:33:25,077 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-19 06:33:25,077 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-19 06:33:25,077 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-19 06:33:25,078 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-19 06:33:25,078 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-19 06:33:25,078 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-19 06:33:25,078 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-19 06:33:25,078 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-19 06:33:25,203 INFO L235 CfgBuilder]: Building ICFG [2022-11-19 06:33:25,205 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-19 06:33:25,459 INFO L276 CfgBuilder]: Performing block encoding [2022-11-19 06:33:25,600 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-19 06:33:25,600 INFO L300 CfgBuilder]: Removed 6 assume(true) statements. [2022-11-19 06:33:25,603 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 06:33:25 BoogieIcfgContainer [2022-11-19 06:33:25,604 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-19 06:33:25,607 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-19 06:33:25,607 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-19 06:33:25,620 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-19 06:33:25,620 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 06:33:24" (1/3) ... [2022-11-19 06:33:25,622 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5eeddc13 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 06:33:25, skipping insertion in model container [2022-11-19 06:33:25,622 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:33:24" (2/3) ... [2022-11-19 06:33:25,622 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5eeddc13 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 06:33:25, skipping insertion in model container [2022-11-19 06:33:25,622 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 06:33:25" (3/3) ... [2022-11-19 06:33:25,626 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2n_update_all.i [2022-11-19 06:33:25,649 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-19 06:33:25,649 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-19 06:33:25,725 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-19 06:33:25,740 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;@21409acb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-19 06:33:25,740 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-19 06:33:25,752 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-19 06:33:25,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-19 06:33:25,760 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 06:33:25,761 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-19 06:33:25,761 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-19 06:33:25,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 06:33:25,771 INFO L85 PathProgramCache]: Analyzing trace with hash 1963659983, now seen corresponding path program 1 times [2022-11-19 06:33:25,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 06:33:25,791 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706311429] [2022-11-19 06:33:25,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:33:25,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 06:33:25,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:33:26,185 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-19 06:33:26,186 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 06:33:26,186 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706311429] [2022-11-19 06:33:26,188 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1706311429] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 06:33:26,188 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 06:33:26,189 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-19 06:33:26,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129367280] [2022-11-19 06:33:26,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 06:33:26,213 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-19 06:33:26,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 06:33:26,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-19 06:33:26,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 06:33:26,272 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-19 06:33:26,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 06:33:26,351 INFO L93 Difference]: Finished difference Result 27 states and 41 transitions. [2022-11-19 06:33:26,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-19 06:33:26,354 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-19 06:33:26,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 06:33:26,363 INFO L225 Difference]: With dead ends: 27 [2022-11-19 06:33:26,364 INFO L226 Difference]: Without dead ends: 12 [2022-11-19 06:33:26,367 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-19 06:33:26,371 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.1s IncrementalHoareTripleChecker+Time [2022-11-19 06:33:26,372 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.1s Time] [2022-11-19 06:33:26,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2022-11-19 06:33:26,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 11. [2022-11-19 06:33:26,408 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-19 06:33:26,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 15 transitions. [2022-11-19 06:33:26,410 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 15 transitions. Word has length 7 [2022-11-19 06:33:26,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 06:33:26,411 INFO L495 AbstractCegarLoop]: Abstraction has 11 states and 15 transitions. [2022-11-19 06:33:26,412 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-19 06:33:26,413 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 15 transitions. [2022-11-19 06:33:26,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-19 06:33:26,414 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 06:33:26,414 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 06:33:26,415 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-19 06:33:26,415 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-19 06:33:26,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 06:33:26,416 INFO L85 PathProgramCache]: Analyzing trace with hash -1491156930, now seen corresponding path program 1 times [2022-11-19 06:33:26,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 06:33:26,417 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190555963] [2022-11-19 06:33:26,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:33:26,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 06:33:26,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:33:26,694 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-19 06:33:26,695 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 06:33:26,695 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190555963] [2022-11-19 06:33:26,696 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1190555963] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 06:33:26,696 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1399175243] [2022-11-19 06:33:26,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:33:26,697 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 06:33:26,697 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad856ce5-3bf9-4073-857b-483dd0f5a44b/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 06:33:26,701 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad856ce5-3bf9-4073-857b-483dd0f5a44b/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 06:33:26,716 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad856ce5-3bf9-4073-857b-483dd0f5a44b/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-19 06:33:26,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:33:26,839 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-19 06:33:26,844 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 06:33:26,897 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-19 06:33:26,897 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 06:33:26,920 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-19 06:33:26,920 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1399175243] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 06:33:26,921 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1830261480] [2022-11-19 06:33:26,943 INFO L159 IcfgInterpreter]: Started Sifa with 9 locations of interest [2022-11-19 06:33:26,943 INFO L166 IcfgInterpreter]: Building call graph [2022-11-19 06:33:26,947 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-19 06:33:26,959 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-19 06:33:26,960 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-19 06:33:27,115 INFO L321 Elim1Store]: treesize reduction 20, result has 48.7 percent of original size [2022-11-19 06:33:27,116 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-19 06:33:27,185 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-11-19 06:33:27,186 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-19 06:33:27,282 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:33:27,283 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 06:33:27,285 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-19 06:33:27,381 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:33:27,384 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:33:27,385 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 06:33:27,391 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-19 06:33:27,430 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:33:27,431 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 06:33:27,433 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-19 06:33:27,704 INFO L321 Elim1Store]: treesize reduction 70, result has 34.0 percent of original size [2022-11-19 06:33:27,705 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-19 06:33:27,778 INFO L321 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-11-19 06:33:27,779 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-19 06:33:28,143 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:33:28,262 INFO L321 Elim1Store]: treesize reduction 52, result has 33.3 percent of original size [2022-11-19 06:33:28,263 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-19 06:33:28,307 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:33:28,320 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-19 06:33:28,321 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-19 06:33:28,358 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:33:28,448 INFO L321 Elim1Store]: treesize reduction 52, result has 33.3 percent of original size [2022-11-19 06:33:28,449 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-19 06:33:28,479 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:33:28,484 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:33:28,510 INFO L321 Elim1Store]: treesize reduction 21, result has 34.4 percent of original size [2022-11-19 06:33:28,511 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-19 06:33:28,550 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 06:33:28,588 INFO L321 Elim1Store]: treesize reduction 39, result has 18.8 percent of original size [2022-11-19 06:33:28,589 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-19 06:33:28,624 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 06:33:28,659 INFO L321 Elim1Store]: treesize reduction 39, result has 18.8 percent of original size [2022-11-19 06:33:28,661 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-19 06:33:29,050 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-19 06:33:29,062 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-19 06:33:29,107 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:33:29,108 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 06:33:29,109 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 06:33:29,111 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-19 06:33:29,133 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:33:29,133 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 06:33:29,136 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-19 06:33:29,153 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:33:29,154 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 06:33:29,155 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-19 06:33:29,198 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-19 06:33:29,207 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-19 06:33:29,211 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-19 06:33:29,497 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [1830261480] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 06:33:29,497 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-11-19 06:33:29,497 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [3, 3, 3] total 7 [2022-11-19 06:33:29,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320118254] [2022-11-19 06:33:29,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 06:33:29,499 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-19 06:33:29,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 06:33:29,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-19 06:33:29,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-11-19 06:33:29,500 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-19 06:33:29,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 06:33:29,563 INFO L93 Difference]: Finished difference Result 18 states and 25 transitions. [2022-11-19 06:33:29,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-19 06:33:29,563 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-19 06:33:29,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 06:33:29,564 INFO L225 Difference]: With dead ends: 18 [2022-11-19 06:33:29,564 INFO L226 Difference]: Without dead ends: 13 [2022-11-19 06:33:29,565 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-19 06:33:29,566 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.0s IncrementalHoareTripleChecker+Time [2022-11-19 06:33:29,566 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.0s Time] [2022-11-19 06:33:29,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2022-11-19 06:33:29,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 12. [2022-11-19 06:33:29,573 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-19 06:33:29,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 16 transitions. [2022-11-19 06:33:29,573 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 16 transitions. Word has length 9 [2022-11-19 06:33:29,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 06:33:29,574 INFO L495 AbstractCegarLoop]: Abstraction has 12 states and 16 transitions. [2022-11-19 06:33:29,574 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-19 06:33:29,574 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 16 transitions. [2022-11-19 06:33:29,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-19 06:33:29,575 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 06:33:29,575 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 06:33:29,589 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad856ce5-3bf9-4073-857b-483dd0f5a44b/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-19 06:33:29,783 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad856ce5-3bf9-4073-857b-483dd0f5a44b/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2022-11-19 06:33:29,784 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-19 06:33:29,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 06:33:29,784 INFO L85 PathProgramCache]: Analyzing trace with hash -1766738179, now seen corresponding path program 1 times [2022-11-19 06:33:29,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 06:33:29,784 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130404527] [2022-11-19 06:33:29,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:33:29,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 06:33:29,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:33:29,884 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-19 06:33:29,884 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 06:33:29,884 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130404527] [2022-11-19 06:33:29,884 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1130404527] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 06:33:29,885 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2115349808] [2022-11-19 06:33:29,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:33:29,885 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 06:33:29,885 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad856ce5-3bf9-4073-857b-483dd0f5a44b/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 06:33:29,886 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad856ce5-3bf9-4073-857b-483dd0f5a44b/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 06:33:29,911 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad856ce5-3bf9-4073-857b-483dd0f5a44b/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-19 06:33:29,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:33:29,994 INFO L263 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-19 06:33:29,995 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 06:33:30,007 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-19 06:33:30,008 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 06:33:30,022 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-19 06:33:30,022 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2115349808] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 06:33:30,022 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [743209430] [2022-11-19 06:33:30,024 INFO L159 IcfgInterpreter]: Started Sifa with 10 locations of interest [2022-11-19 06:33:30,025 INFO L166 IcfgInterpreter]: Building call graph [2022-11-19 06:33:30,025 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-19 06:33:30,025 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-19 06:33:30,025 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-19 06:33:30,078 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-11-19 06:33:30,079 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-19 06:33:30,092 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-19 06:33:30,144 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:33:30,145 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:33:30,146 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 06:33:30,147 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-19 06:33:30,161 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:33:30,165 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-19 06:33:30,175 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 06:33:30,176 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-19 06:33:30,190 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:33:30,195 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-19 06:33:30,206 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 06:33:30,207 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-19 06:33:30,343 INFO L321 Elim1Store]: treesize reduction 70, result has 34.0 percent of original size [2022-11-19 06:33:30,343 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-19 06:33:30,388 INFO L321 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-11-19 06:33:30,389 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-19 06:33:30,603 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:33:30,714 INFO L321 Elim1Store]: treesize reduction 52, result has 33.3 percent of original size [2022-11-19 06:33:30,715 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-19 06:33:30,747 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:33:30,760 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-19 06:33:30,761 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-19 06:33:30,785 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:33:30,867 INFO L321 Elim1Store]: treesize reduction 52, result has 33.3 percent of original size [2022-11-19 06:33:30,867 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-19 06:33:30,891 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:33:30,896 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:33:30,919 INFO L321 Elim1Store]: treesize reduction 21, result has 34.4 percent of original size [2022-11-19 06:33:30,920 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-19 06:33:30,951 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 06:33:30,974 INFO L321 Elim1Store]: treesize reduction 39, result has 18.8 percent of original size [2022-11-19 06:33:30,974 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-19 06:33:31,000 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 06:33:31,018 INFO L321 Elim1Store]: treesize reduction 39, result has 18.8 percent of original size [2022-11-19 06:33:31,019 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-19 06:33:31,342 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-19 06:33:31,353 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-19 06:33:31,389 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:33:31,390 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 06:33:31,392 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-19 06:33:31,411 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:33:31,412 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 06:33:31,413 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 06:33:31,414 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-19 06:33:31,433 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:33:31,434 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 06:33:31,435 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-19 06:33:31,481 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-19 06:33:31,495 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-19 06:33:31,506 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-19 06:33:31,579 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-19 06:33:31,588 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-19 06:33:31,602 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-19 06:33:31,693 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-19 06:33:31,703 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-19 06:33:31,715 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-19 06:33:31,819 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-19 06:33:31,828 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-19 06:33:31,835 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-19 06:33:32,889 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-19 06:33:32,889 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-19 06:33:32,889 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-19 06:33:32,890 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2022-11-19 06:33:32,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996208715] [2022-11-19 06:33:32,890 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-19 06:33:32,890 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-19 06:33:32,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 06:33:32,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-19 06:33:32,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2022-11-19 06:33:32,895 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-19 06:33:32,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 06:33:32,941 INFO L93 Difference]: Finished difference Result 22 states and 30 transitions. [2022-11-19 06:33:32,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-19 06:33:32,942 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-19 06:33:32,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 06:33:32,943 INFO L225 Difference]: With dead ends: 22 [2022-11-19 06:33:32,943 INFO L226 Difference]: Without dead ends: 14 [2022-11-19 06:33:32,945 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-19 06:33:32,946 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-19 06:33:32,946 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-19 06:33:32,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2022-11-19 06:33:32,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2022-11-19 06:33:32,954 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-19 06:33:32,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 18 transitions. [2022-11-19 06:33:32,955 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 18 transitions. Word has length 11 [2022-11-19 06:33:32,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 06:33:32,956 INFO L495 AbstractCegarLoop]: Abstraction has 14 states and 18 transitions. [2022-11-19 06:33:32,956 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-19 06:33:32,956 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 18 transitions. [2022-11-19 06:33:32,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-19 06:33:32,958 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 06:33:32,958 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 06:33:32,968 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad856ce5-3bf9-4073-857b-483dd0f5a44b/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-19 06:33:33,165 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad856ce5-3bf9-4073-857b-483dd0f5a44b/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 06:33:33,165 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-19 06:33:33,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 06:33:33,166 INFO L85 PathProgramCache]: Analyzing trace with hash 323163372, now seen corresponding path program 2 times [2022-11-19 06:33:33,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 06:33:33,166 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566364761] [2022-11-19 06:33:33,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:33:33,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 06:33:33,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:33:33,316 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-19 06:33:33,317 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 06:33:33,317 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566364761] [2022-11-19 06:33:33,317 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1566364761] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 06:33:33,317 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [814429737] [2022-11-19 06:33:33,317 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-19 06:33:33,318 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 06:33:33,318 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad856ce5-3bf9-4073-857b-483dd0f5a44b/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 06:33:33,319 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad856ce5-3bf9-4073-857b-483dd0f5a44b/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 06:33:33,323 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad856ce5-3bf9-4073-857b-483dd0f5a44b/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-19 06:33:33,434 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-19 06:33:33,434 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-19 06:33:33,436 INFO L263 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-19 06:33:33,439 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 06:33:33,493 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-19 06:33:33,493 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 06:33:33,527 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-19 06:33:33,528 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [814429737] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 06:33:33,528 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1269637793] [2022-11-19 06:33:33,533 INFO L159 IcfgInterpreter]: Started Sifa with 10 locations of interest [2022-11-19 06:33:33,533 INFO L166 IcfgInterpreter]: Building call graph [2022-11-19 06:33:33,533 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-19 06:33:33,533 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-19 06:33:33,534 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-19 06:33:33,583 INFO L321 Elim1Store]: treesize reduction 20, result has 48.7 percent of original size [2022-11-19 06:33:33,584 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-19 06:33:33,623 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-11-19 06:33:33,623 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-19 06:33:33,654 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:33:33,658 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-19 06:33:33,667 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 06:33:33,668 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-19 06:33:33,685 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:33:33,688 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-19 06:33:33,699 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 06:33:33,700 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-19 06:33:33,718 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:33:33,720 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:33:33,720 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 06:33:33,722 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-19 06:33:33,823 INFO L321 Elim1Store]: treesize reduction 54, result has 27.0 percent of original size [2022-11-19 06:33:33,823 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-19 06:33:33,926 INFO L321 Elim1Store]: treesize reduction 78, result has 26.4 percent of original size [2022-11-19 06:33:33,926 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-19 06:33:34,181 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:33:34,188 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:33:34,272 INFO L321 Elim1Store]: treesize reduction 49, result has 25.8 percent of original size [2022-11-19 06:33:34,273 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-19 06:33:34,298 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:33:34,420 INFO L321 Elim1Store]: treesize reduction 52, result has 33.3 percent of original size [2022-11-19 06:33:34,421 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-19 06:33:34,443 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:33:34,549 INFO L321 Elim1Store]: treesize reduction 52, result has 33.3 percent of original size [2022-11-19 06:33:34,550 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-19 06:33:34,580 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:33:34,585 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:33:34,587 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:33:34,670 INFO L321 Elim1Store]: treesize reduction 89, result has 26.4 percent of original size [2022-11-19 06:33:34,670 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-19 06:33:34,718 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 06:33:34,745 INFO L321 Elim1Store]: treesize reduction 39, result has 18.8 percent of original size [2022-11-19 06:33:34,745 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-19 06:33:34,775 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 06:33:34,806 INFO L321 Elim1Store]: treesize reduction 39, result has 18.8 percent of original size [2022-11-19 06:33:34,807 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-19 06:33:35,148 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-19 06:33:35,155 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-19 06:33:35,189 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:33:35,190 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 06:33:35,194 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-19 06:33:35,217 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:33:35,218 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 06:33:35,219 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-19 06:33:35,237 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:33:35,239 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 06:33:35,240 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 06:33:35,241 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-19 06:33:35,300 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-19 06:33:35,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 11 treesize of output 7 [2022-11-19 06:33:35,342 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-19 06:33:35,393 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-19 06:33:35,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-19 06:33:35,413 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-19 06:33:35,461 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-19 06:33:35,469 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-19 06:33:35,479 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-19 06:33:35,559 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-19 06:33:35,566 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-19 06:33:35,569 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-19 06:33:36,484 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-19 06:33:36,484 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-19 06:33:36,484 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-19 06:33:36,485 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2022-11-19 06:33:36,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529227574] [2022-11-19 06:33:36,485 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-19 06:33:36,485 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-19 06:33:36,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 06:33:36,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-19 06:33:36,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=197, Unknown=0, NotChecked=0, Total=306 [2022-11-19 06:33:36,487 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-19 06:33:36,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 06:33:36,546 INFO L93 Difference]: Finished difference Result 27 states and 35 transitions. [2022-11-19 06:33:36,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-19 06:33:36,549 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-19 06:33:36,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 06:33:36,549 INFO L225 Difference]: With dead ends: 27 [2022-11-19 06:33:36,549 INFO L226 Difference]: Without dead ends: 22 [2022-11-19 06:33:36,550 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=109, Invalid=197, Unknown=0, NotChecked=0, Total=306 [2022-11-19 06:33:36,551 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.0s IncrementalHoareTripleChecker+Time [2022-11-19 06:33:36,551 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.0s Time] [2022-11-19 06:33:36,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-11-19 06:33:36,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 16. [2022-11-19 06:33:36,558 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-19 06:33:36,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 21 transitions. [2022-11-19 06:33:36,558 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 21 transitions. Word has length 13 [2022-11-19 06:33:36,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 06:33:36,559 INFO L495 AbstractCegarLoop]: Abstraction has 16 states and 21 transitions. [2022-11-19 06:33:36,559 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-19 06:33:36,559 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 21 transitions. [2022-11-19 06:33:36,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-19 06:33:36,560 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 06:33:36,560 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 06:33:36,573 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad856ce5-3bf9-4073-857b-483dd0f5a44b/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-19 06:33:36,766 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad856ce5-3bf9-4073-857b-483dd0f5a44b/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 06:33:36,766 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-19 06:33:36,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 06:33:36,767 INFO L85 PathProgramCache]: Analyzing trace with hash -1961650133, now seen corresponding path program 3 times [2022-11-19 06:33:36,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 06:33:36,767 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732754274] [2022-11-19 06:33:36,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:33:36,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 06:33:36,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:33:36,950 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-19 06:33:36,951 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 06:33:36,951 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732754274] [2022-11-19 06:33:36,951 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [732754274] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 06:33:36,951 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1503225797] [2022-11-19 06:33:36,952 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-19 06:33:36,952 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 06:33:36,952 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad856ce5-3bf9-4073-857b-483dd0f5a44b/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 06:33:36,953 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad856ce5-3bf9-4073-857b-483dd0f5a44b/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 06:33:36,983 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad856ce5-3bf9-4073-857b-483dd0f5a44b/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-19 06:33:37,089 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-19 06:33:37,089 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-19 06:33:37,091 INFO L263 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-19 06:33:37,092 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 06:33:37,110 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-19 06:33:37,110 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 06:33:37,129 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-19 06:33:37,129 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1503225797] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 06:33:37,129 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1999873743] [2022-11-19 06:33:37,131 INFO L159 IcfgInterpreter]: Started Sifa with 10 locations of interest [2022-11-19 06:33:37,131 INFO L166 IcfgInterpreter]: Building call graph [2022-11-19 06:33:37,132 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-19 06:33:37,132 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-19 06:33:37,132 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-19 06:33:37,172 INFO L321 Elim1Store]: treesize reduction 20, result has 48.7 percent of original size [2022-11-19 06:33:37,173 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-19 06:33:37,214 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-11-19 06:33:37,215 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-19 06:33:37,248 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:33:37,252 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-19 06:33:37,260 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 06:33:37,261 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-19 06:33:37,285 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:33:37,286 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 06:33:37,287 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-19 06:33:37,305 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:33:37,306 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:33:37,307 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 06:33:37,308 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-19 06:33:37,435 INFO L321 Elim1Store]: treesize reduction 70, result has 34.0 percent of original size [2022-11-19 06:33:37,435 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-19 06:33:37,476 INFO L321 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-11-19 06:33:37,476 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-19 06:33:37,665 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:33:37,676 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-19 06:33:37,677 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-19 06:33:37,698 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:33:37,784 INFO L321 Elim1Store]: treesize reduction 52, result has 33.3 percent of original size [2022-11-19 06:33:37,784 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-19 06:33:37,804 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:33:37,874 INFO L321 Elim1Store]: treesize reduction 52, result has 33.3 percent of original size [2022-11-19 06:33:37,875 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-19 06:33:37,898 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:33:37,900 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:33:37,922 INFO L321 Elim1Store]: treesize reduction 21, result has 34.4 percent of original size [2022-11-19 06:33:37,922 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-19 06:33:37,957 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 06:33:37,988 INFO L321 Elim1Store]: treesize reduction 39, result has 18.8 percent of original size [2022-11-19 06:33:37,988 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-19 06:33:38,013 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 06:33:38,041 INFO L321 Elim1Store]: treesize reduction 39, result has 18.8 percent of original size [2022-11-19 06:33:38,041 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-19 06:33:38,257 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-19 06:33:38,266 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-19 06:33:38,295 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:33:38,295 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 06:33:38,296 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 06:33:38,299 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-19 06:33:38,318 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:33:38,318 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 06:33:38,319 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-19 06:33:38,338 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:33:38,339 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 06:33:38,340 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-19 06:33:38,383 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-19 06:33:38,402 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-19 06:33:38,420 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-19 06:33:38,471 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-19 06:33:38,479 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-19 06:33:38,486 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-19 06:33:38,522 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-19 06:33:38,535 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-19 06:33:38,543 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-19 06:33:38,605 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-19 06:33:38,613 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-19 06:33:38,615 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-19 06:33:39,547 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-19 06:33:39,547 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-19 06:33:39,547 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-19 06:33:39,547 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2022-11-19 06:33:39,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650448373] [2022-11-19 06:33:39,547 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-19 06:33:39,548 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-19 06:33:39,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 06:33:39,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-19 06:33:39,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2022-11-19 06:33:39,549 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-19 06:33:39,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 06:33:39,658 INFO L93 Difference]: Finished difference Result 29 states and 39 transitions. [2022-11-19 06:33:39,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-19 06:33:39,658 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-19 06:33:39,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 06:33:39,661 INFO L225 Difference]: With dead ends: 29 [2022-11-19 06:33:39,661 INFO L226 Difference]: Without dead ends: 22 [2022-11-19 06:33:39,662 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 32 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2022-11-19 06:33:39,664 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-19 06:33:39,664 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-19 06:33:39,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-11-19 06:33:39,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 17. [2022-11-19 06:33:39,678 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-19 06:33:39,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 22 transitions. [2022-11-19 06:33:39,682 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 22 transitions. Word has length 15 [2022-11-19 06:33:39,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 06:33:39,683 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 22 transitions. [2022-11-19 06:33:39,684 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-19 06:33:39,684 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 22 transitions. [2022-11-19 06:33:39,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-19 06:33:39,685 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 06:33:39,685 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 06:33:39,696 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad856ce5-3bf9-4073-857b-483dd0f5a44b/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-19 06:33:39,896 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad856ce5-3bf9-4073-857b-483dd0f5a44b/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 06:33:39,897 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-19 06:33:39,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 06:33:39,897 INFO L85 PathProgramCache]: Analyzing trace with hash -1300823316, now seen corresponding path program 1 times [2022-11-19 06:33:39,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 06:33:39,897 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254205954] [2022-11-19 06:33:39,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:33:39,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 06:33:39,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:33:41,156 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-19 06:33:41,156 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 06:33:41,157 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254205954] [2022-11-19 06:33:41,157 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [254205954] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 06:33:41,157 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [811510954] [2022-11-19 06:33:41,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:33:41,157 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 06:33:41,157 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad856ce5-3bf9-4073-857b-483dd0f5a44b/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 06:33:41,158 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad856ce5-3bf9-4073-857b-483dd0f5a44b/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 06:33:41,191 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad856ce5-3bf9-4073-857b-483dd0f5a44b/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-19 06:33:41,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:33:41,314 INFO L263 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 89 conjunts are in the unsatisfiable core [2022-11-19 06:33:41,317 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 06:33:41,342 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-19 06:33:41,402 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-19 06:33:41,403 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-19 06:33:41,444 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-19 06:33:41,585 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-19 06:33:41,591 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-19 06:33:41,704 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 06:33:41,704 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-19 06:33:41,753 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-19 06:33:41,883 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-19 06:33:41,913 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-19 06:33:41,913 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 06:33:42,132 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-19 06:33:42,143 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:33:42,144 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:33:42,440 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-19 06:33:42,441 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [811510954] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 06:33:42,441 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [917765313] [2022-11-19 06:33:42,444 INFO L159 IcfgInterpreter]: Started Sifa with 10 locations of interest [2022-11-19 06:33:42,444 INFO L166 IcfgInterpreter]: Building call graph [2022-11-19 06:33:42,445 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-19 06:33:42,445 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-19 06:33:42,445 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-19 06:33:42,531 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-11-19 06:33:42,531 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-19 06:33:42,551 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-19 06:33:42,584 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:33:42,588 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-19 06:33:42,596 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 06:33:42,598 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-19 06:33:42,622 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:33:42,623 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 06:33:42,624 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-19 06:33:42,643 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:33:42,644 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:33:42,645 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 06:33:42,646 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-19 06:33:42,759 INFO L321 Elim1Store]: treesize reduction 54, result has 27.0 percent of original size [2022-11-19 06:33:42,761 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-19 06:33:42,855 INFO L321 Elim1Store]: treesize reduction 78, result has 26.4 percent of original size [2022-11-19 06:33:42,855 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-19 06:33:43,070 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:33:43,204 INFO L321 Elim1Store]: treesize reduction 52, result has 33.3 percent of original size [2022-11-19 06:33:43,205 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-19 06:33:43,234 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:33:43,357 INFO L321 Elim1Store]: treesize reduction 52, result has 33.3 percent of original size [2022-11-19 06:33:43,357 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-19 06:33:43,383 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:33:43,390 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:33:43,399 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-19 06:33:43,400 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-19 06:33:43,423 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:33:43,427 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:33:43,430 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:33:43,464 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-11-19 06:33:43,464 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-19 06:33:43,502 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 06:33:43,534 INFO L321 Elim1Store]: treesize reduction 39, result has 18.8 percent of original size [2022-11-19 06:33:43,535 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-19 06:33:43,562 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 06:33:43,584 INFO L321 Elim1Store]: treesize reduction 39, result has 18.8 percent of original size [2022-11-19 06:33:43,584 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-19 06:33:43,895 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-19 06:33:43,905 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-19 06:33:43,939 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:33:43,940 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 06:33:43,941 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-19 06:33:43,960 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:33:43,961 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 06:33:43,962 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 06:33:43,963 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-19 06:33:43,986 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:33:43,987 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 06:33:43,988 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-19 06:33:44,047 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-19 06:33:44,057 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-19 06:33:44,073 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-19 06:33:44,153 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-19 06:33:44,170 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-19 06:33:44,179 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-19 06:33:44,280 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-19 06:33:44,290 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-19 06:33:44,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-19 06:33:44,388 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-19 06:33:44,396 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-19 06:33:44,400 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-19 06:33:45,887 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-19 06:33:45,888 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-19 06:33:45,888 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-19 06:33:45,888 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 37 [2022-11-19 06:33:45,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220005459] [2022-11-19 06:33:45,888 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-19 06:33:45,889 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-11-19 06:33:45,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 06:33:45,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-11-19 06:33:45,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=1809, Unknown=0, NotChecked=0, Total=1980 [2022-11-19 06:33:45,891 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-19 06:33:47,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 06:33:47,063 INFO L93 Difference]: Finished difference Result 42 states and 56 transitions. [2022-11-19 06:33:47,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-19 06:33:47,064 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-19 06:33:47,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 06:33:47,065 INFO L225 Difference]: With dead ends: 42 [2022-11-19 06:33:47,065 INFO L226 Difference]: Without dead ends: 40 [2022-11-19 06:33:47,067 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 15 SyntacticMatches, 3 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 902 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=539, Invalid=3367, Unknown=0, NotChecked=0, Total=3906 [2022-11-19 06:33:47,068 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-19 06:33:47,068 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-19 06:33:47,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-11-19 06:33:47,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 25. [2022-11-19 06:33:47,098 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-19 06:33:47,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 34 transitions. [2022-11-19 06:33:47,107 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 34 transitions. Word has length 16 [2022-11-19 06:33:47,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 06:33:47,107 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 34 transitions. [2022-11-19 06:33:47,107 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-19 06:33:47,108 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 34 transitions. [2022-11-19 06:33:47,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-19 06:33:47,108 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 06:33:47,108 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 06:33:47,119 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad856ce5-3bf9-4073-857b-483dd0f5a44b/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-19 06:33:47,315 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad856ce5-3bf9-4073-857b-483dd0f5a44b/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 06:33:47,316 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-19 06:33:47,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 06:33:47,316 INFO L85 PathProgramCache]: Analyzing trace with hash -1672469698, now seen corresponding path program 1 times [2022-11-19 06:33:47,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 06:33:47,317 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213504943] [2022-11-19 06:33:47,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:33:47,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 06:33:47,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:33:47,434 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-19 06:33:47,434 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 06:33:47,435 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [213504943] [2022-11-19 06:33:47,435 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [213504943] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 06:33:47,435 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 06:33:47,435 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-19 06:33:47,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727413098] [2022-11-19 06:33:47,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 06:33:47,436 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-19 06:33:47,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 06:33:47,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-19 06:33:47,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-19 06:33:47,437 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-19 06:33:47,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 06:33:47,496 INFO L93 Difference]: Finished difference Result 36 states and 47 transitions. [2022-11-19 06:33:47,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-19 06:33:47,497 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-19 06:33:47,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 06:33:47,498 INFO L225 Difference]: With dead ends: 36 [2022-11-19 06:33:47,498 INFO L226 Difference]: Without dead ends: 31 [2022-11-19 06:33:47,499 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-19 06:33:47,499 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-19 06:33:47,500 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-19 06:33:47,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-11-19 06:33:47,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 27. [2022-11-19 06:33:47,515 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-19 06:33:47,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 35 transitions. [2022-11-19 06:33:47,515 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 35 transitions. Word has length 17 [2022-11-19 06:33:47,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 06:33:47,516 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 35 transitions. [2022-11-19 06:33:47,516 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-19 06:33:47,516 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 35 transitions. [2022-11-19 06:33:47,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-19 06:33:47,517 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 06:33:47,517 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 06:33:47,517 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-19 06:33:47,518 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-19 06:33:47,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 06:33:47,518 INFO L85 PathProgramCache]: Analyzing trace with hash 2004938827, now seen corresponding path program 2 times [2022-11-19 06:33:47,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 06:33:47,519 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90611512] [2022-11-19 06:33:47,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:33:47,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 06:33:47,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:33:47,632 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-19 06:33:47,633 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 06:33:47,633 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90611512] [2022-11-19 06:33:47,633 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [90611512] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 06:33:47,633 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1264167300] [2022-11-19 06:33:47,634 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-19 06:33:47,634 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 06:33:47,634 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad856ce5-3bf9-4073-857b-483dd0f5a44b/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 06:33:47,635 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad856ce5-3bf9-4073-857b-483dd0f5a44b/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 06:33:47,659 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad856ce5-3bf9-4073-857b-483dd0f5a44b/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-19 06:33:47,999 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-11-19 06:33:47,999 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-19 06:33:48,002 INFO L263 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-19 06:33:48,003 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 06:33:48,030 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-19 06:33:48,030 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 06:33:48,074 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-19 06:33:48,075 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1264167300] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 06:33:48,075 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1264120683] [2022-11-19 06:33:48,077 INFO L159 IcfgInterpreter]: Started Sifa with 10 locations of interest [2022-11-19 06:33:48,077 INFO L166 IcfgInterpreter]: Building call graph [2022-11-19 06:33:48,078 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-19 06:33:48,078 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-19 06:33:48,078 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-19 06:33:48,151 INFO L321 Elim1Store]: treesize reduction 20, result has 48.7 percent of original size [2022-11-19 06:33:48,152 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-19 06:33:48,208 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-11-19 06:33:48,208 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-19 06:33:48,250 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:33:48,251 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 06:33:48,252 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-19 06:33:48,270 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:33:48,274 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-19 06:33:48,285 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 06:33:48,286 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-19 06:33:48,308 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:33:48,309 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:33:48,310 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 06:33:48,311 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-19 06:33:48,466 INFO L321 Elim1Store]: treesize reduction 70, result has 34.0 percent of original size [2022-11-19 06:33:48,467 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-19 06:33:48,521 INFO L321 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-11-19 06:33:48,521 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-19 06:33:48,817 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:33:48,980 INFO L321 Elim1Store]: treesize reduction 52, result has 33.3 percent of original size [2022-11-19 06:33:48,981 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-19 06:33:49,011 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:33:49,129 INFO L321 Elim1Store]: treesize reduction 52, result has 33.3 percent of original size [2022-11-19 06:33:49,129 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-19 06:33:49,174 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:33:49,186 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-19 06:33:49,187 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-19 06:33:49,212 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:33:49,217 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:33:49,244 INFO L321 Elim1Store]: treesize reduction 21, result has 34.4 percent of original size [2022-11-19 06:33:49,245 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-19 06:33:49,274 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 06:33:49,310 INFO L321 Elim1Store]: treesize reduction 39, result has 18.8 percent of original size [2022-11-19 06:33:49,310 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-19 06:33:49,340 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 06:33:49,375 INFO L321 Elim1Store]: treesize reduction 39, result has 18.8 percent of original size [2022-11-19 06:33:49,376 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-19 06:33:49,662 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-19 06:33:49,671 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-19 06:33:49,699 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:33:49,700 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 06:33:49,701 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-19 06:33:49,719 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:33:49,720 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 06:33:49,721 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 06:33:49,722 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-19 06:33:49,740 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:33:49,741 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 06:33:49,742 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-19 06:33:49,784 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-19 06:33:49,793 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-19 06:33:49,804 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-19 06:33:49,891 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-19 06:33:49,900 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-19 06:33:49,916 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-19 06:33:50,032 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-19 06:33:50,042 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-19 06:33:50,051 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-19 06:33:50,138 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-19 06:33:50,146 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-19 06:33:50,165 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-19 06:33:51,341 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-19 06:33:51,342 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-19 06:33:51,342 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-19 06:33:51,342 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 8 [2022-11-19 06:33:51,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662073523] [2022-11-19 06:33:51,342 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-19 06:33:51,343 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-19 06:33:51,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 06:33:51,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-19 06:33:51,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=176, Unknown=0, NotChecked=0, Total=240 [2022-11-19 06:33:51,344 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-19 06:33:51,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 06:33:51,465 INFO L93 Difference]: Finished difference Result 47 states and 60 transitions. [2022-11-19 06:33:51,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-19 06:33:51,466 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-19 06:33:51,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 06:33:51,467 INFO L225 Difference]: With dead ends: 47 [2022-11-19 06:33:51,467 INFO L226 Difference]: Without dead ends: 35 [2022-11-19 06:33:51,467 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 37 SyntacticMatches, 4 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=87, Invalid=255, Unknown=0, NotChecked=0, Total=342 [2022-11-19 06:33:51,468 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 48 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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-19 06:33:51,468 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-19 06:33:51,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-11-19 06:33:51,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 27. [2022-11-19 06:33:51,481 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-19 06:33:51,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 33 transitions. [2022-11-19 06:33:51,482 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 33 transitions. Word has length 17 [2022-11-19 06:33:51,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 06:33:51,482 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 33 transitions. [2022-11-19 06:33:51,483 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-19 06:33:51,483 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 33 transitions. [2022-11-19 06:33:51,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-19 06:33:51,484 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 06:33:51,484 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 06:33:51,491 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad856ce5-3bf9-4073-857b-483dd0f5a44b/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-19 06:33:51,691 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad856ce5-3bf9-4073-857b-483dd0f5a44b/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 06:33:51,691 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-19 06:33:51,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 06:33:51,692 INFO L85 PathProgramCache]: Analyzing trace with hash 688194100, now seen corresponding path program 1 times [2022-11-19 06:33:51,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 06:33:51,692 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756815148] [2022-11-19 06:33:51,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:33:51,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 06:33:51,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:33:51,832 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-19 06:33:51,832 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 06:33:51,832 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756815148] [2022-11-19 06:33:51,833 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1756815148] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 06:33:51,833 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [196821062] [2022-11-19 06:33:51,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:33:51,833 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 06:33:51,833 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad856ce5-3bf9-4073-857b-483dd0f5a44b/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 06:33:51,836 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad856ce5-3bf9-4073-857b-483dd0f5a44b/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 06:33:51,848 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad856ce5-3bf9-4073-857b-483dd0f5a44b/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-19 06:33:52,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:33:52,017 INFO L263 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-19 06:33:52,018 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 06:33:52,032 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-19 06:33:52,032 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 06:33:52,053 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-19 06:33:52,054 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [196821062] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 06:33:52,054 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1436048926] [2022-11-19 06:33:52,056 INFO L159 IcfgInterpreter]: Started Sifa with 10 locations of interest [2022-11-19 06:33:52,057 INFO L166 IcfgInterpreter]: Building call graph [2022-11-19 06:33:52,057 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-19 06:33:52,057 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-19 06:33:52,057 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-19 06:33:52,122 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-11-19 06:33:52,123 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-19 06:33:52,139 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-19 06:33:52,175 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:33:52,180 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-19 06:33:52,189 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 06:33:52,190 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-19 06:33:52,209 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:33:52,211 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:33:52,212 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 06:33:52,213 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-19 06:33:52,228 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:33:52,236 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-19 06:33:52,247 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 06:33:52,248 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-19 06:33:52,367 INFO L321 Elim1Store]: treesize reduction 54, result has 27.0 percent of original size [2022-11-19 06:33:52,368 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-19 06:33:52,461 INFO L321 Elim1Store]: treesize reduction 78, result has 26.4 percent of original size [2022-11-19 06:33:52,461 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-19 06:33:52,699 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:33:52,838 INFO L321 Elim1Store]: treesize reduction 52, result has 33.3 percent of original size [2022-11-19 06:33:52,839 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-19 06:33:52,875 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:33:52,881 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:33:52,897 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-19 06:33:52,898 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-19 06:33:52,921 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:33:52,930 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:33:52,933 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:33:52,975 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-11-19 06:33:52,975 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-19 06:33:53,005 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:33:53,077 INFO L321 Elim1Store]: treesize reduction 52, result has 33.3 percent of original size [2022-11-19 06:33:53,077 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-19 06:33:53,101 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 06:33:53,137 INFO L321 Elim1Store]: treesize reduction 39, result has 18.8 percent of original size [2022-11-19 06:33:53,137 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-19 06:33:53,166 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 06:33:53,190 INFO L321 Elim1Store]: treesize reduction 39, result has 18.8 percent of original size [2022-11-19 06:33:53,191 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-19 06:33:53,533 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-19 06:33:53,541 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-19 06:33:53,574 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:33:53,575 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 06:33:53,576 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-19 06:33:53,598 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:33:53,598 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 06:33:53,600 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-19 06:33:53,617 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:33:53,618 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 06:33:53,619 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 06:33:53,620 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-19 06:33:53,679 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-19 06:33:53,693 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-19 06:33:53,703 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-19 06:33:53,783 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-19 06:33:53,792 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-19 06:33:53,806 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-19 06:33:53,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 11 treesize of output 7 [2022-11-19 06:33:53,905 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-19 06:33:53,915 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-19 06:33:54,046 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-19 06:33:54,055 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-19 06:33:54,059 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-19 06:33:55,924 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-19 06:33:55,924 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-19 06:33:55,925 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-19 06:33:55,925 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 6 [2022-11-19 06:33:55,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874976754] [2022-11-19 06:33:55,925 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-19 06:33:55,926 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-19 06:33:55,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 06:33:55,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-19 06:33:55,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2022-11-19 06:33:55,927 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-19 06:33:56,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 06:33:56,014 INFO L93 Difference]: Finished difference Result 36 states and 44 transitions. [2022-11-19 06:33:56,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-19 06:33:56,015 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-19 06:33:56,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 06:33:56,015 INFO L225 Difference]: With dead ends: 36 [2022-11-19 06:33:56,015 INFO L226 Difference]: Without dead ends: 31 [2022-11-19 06:33:56,016 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 45 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2022-11-19 06:33:56,017 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 14 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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-19 06:33:56,017 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-19 06:33:56,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-11-19 06:33:56,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 28. [2022-11-19 06:33:56,029 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-19 06:33:56,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 34 transitions. [2022-11-19 06:33:56,029 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 34 transitions. Word has length 19 [2022-11-19 06:33:56,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 06:33:56,030 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 34 transitions. [2022-11-19 06:33:56,030 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-19 06:33:56,030 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions. [2022-11-19 06:33:56,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-19 06:33:56,031 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 06:33:56,031 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 06:33:56,044 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad856ce5-3bf9-4073-857b-483dd0f5a44b/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-19 06:33:56,235 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad856ce5-3bf9-4073-857b-483dd0f5a44b/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2022-11-19 06:33:56,235 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-19 06:33:56,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 06:33:56,236 INFO L85 PathProgramCache]: Analyzing trace with hash -142471946, now seen corresponding path program 1 times [2022-11-19 06:33:56,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 06:33:56,236 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627605570] [2022-11-19 06:33:56,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:33:56,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 06:33:56,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:33:57,873 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-19 06:33:57,874 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 06:33:57,874 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627605570] [2022-11-19 06:33:57,874 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [627605570] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 06:33:57,874 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [796475961] [2022-11-19 06:33:57,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:33:57,874 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 06:33:57,875 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad856ce5-3bf9-4073-857b-483dd0f5a44b/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 06:33:57,876 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad856ce5-3bf9-4073-857b-483dd0f5a44b/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 06:33:57,899 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad856ce5-3bf9-4073-857b-483dd0f5a44b/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-19 06:33:58,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:33:58,104 INFO L263 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 100 conjunts are in the unsatisfiable core [2022-11-19 06:33:58,113 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 06:33:58,144 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-19 06:33:58,222 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-19 06:33:58,222 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-19 06:33:58,277 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-19 06:33:58,443 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:33:58,444 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-19 06:33:58,666 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-19 06:33:58,666 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-19 06:33:58,675 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-19 06:33:58,679 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:33:58,680 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-19 06:33:58,996 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-19 06:33:59,001 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-19 06:33:59,048 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-19 06:33:59,083 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-19 06:33:59,083 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 06:33:59,312 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-19 06:33:59,332 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-19 06:33:59,358 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-19 06:33:59,376 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-19 06:33:59,377 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-19 06:33:59,383 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-19 06:33:59,892 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-19 06:33:59,895 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 06:34:00,042 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-19 06:34:00,042 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [796475961] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 06:34:00,042 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [394680358] [2022-11-19 06:34:00,044 INFO L159 IcfgInterpreter]: Started Sifa with 10 locations of interest [2022-11-19 06:34:00,044 INFO L166 IcfgInterpreter]: Building call graph [2022-11-19 06:34:00,045 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-19 06:34:00,045 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-19 06:34:00,045 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-19 06:34:00,092 INFO L321 Elim1Store]: treesize reduction 20, result has 48.7 percent of original size [2022-11-19 06:34:00,092 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-19 06:34:00,138 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-11-19 06:34:00,139 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-19 06:34:00,175 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:34:00,180 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-19 06:34:00,191 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 06:34:00,192 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-19 06:34:00,218 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:34:00,221 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:34:00,221 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 06:34:00,225 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-19 06:34:00,246 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:34:00,247 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 06:34:00,248 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-19 06:34:00,394 INFO L321 Elim1Store]: treesize reduction 70, result has 34.0 percent of original size [2022-11-19 06:34:00,395 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-19 06:34:00,442 INFO L321 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-11-19 06:34:00,442 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-19 06:34:00,794 INFO L321 Elim1Store]: treesize reduction 49, result has 25.8 percent of original size [2022-11-19 06:34:00,794 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-19 06:34:00,821 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:34:00,915 INFO L321 Elim1Store]: treesize reduction 52, result has 33.3 percent of original size [2022-11-19 06:34:00,915 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-19 06:34:00,935 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:34:01,016 INFO L321 Elim1Store]: treesize reduction 52, result has 33.3 percent of original size [2022-11-19 06:34:01,017 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-19 06:34:01,046 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:34:01,050 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:34:01,128 INFO L321 Elim1Store]: treesize reduction 74, result has 24.5 percent of original size [2022-11-19 06:34:01,128 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-19 06:34:01,174 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 06:34:01,208 INFO L321 Elim1Store]: treesize reduction 39, result has 18.8 percent of original size [2022-11-19 06:34:01,210 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-19 06:34:01,247 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 06:34:01,281 INFO L321 Elim1Store]: treesize reduction 39, result has 18.8 percent of original size [2022-11-19 06:34:01,281 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-19 06:34:01,651 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-19 06:34:01,659 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-19 06:34:01,703 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:34:01,704 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 06:34:01,704 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 06:34:01,705 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-19 06:34:01,726 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:34:01,727 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 06:34:01,727 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-19 06:34:01,744 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:34:01,745 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 06:34:01,746 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-19 06:34:01,793 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-19 06:34:01,811 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-19 06:34:01,826 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-19 06:34:01,906 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-19 06:34:01,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-19 06:34:01,932 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-19 06:34:02,026 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-19 06:34:02,043 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-19 06:34:02,052 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-19 06:34:02,639 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-19 06:34:02,648 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-19 06:34:02,650 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-19 06:34:04,436 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-19 06:34:04,436 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-19 06:34:04,436 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-19 06:34:04,437 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 45 [2022-11-19 06:34:04,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950677836] [2022-11-19 06:34:04,437 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-19 06:34:04,438 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2022-11-19 06:34:04,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 06:34:04,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2022-11-19 06:34:04,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=196, Invalid=2459, Unknown=1, NotChecked=100, Total=2756 [2022-11-19 06:34:04,440 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-19 06:34:05,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 06:34:05,647 INFO L93 Difference]: Finished difference Result 69 states and 86 transitions. [2022-11-19 06:34:05,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-19 06:34:05,648 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-19 06:34:05,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 06:34:05,649 INFO L225 Difference]: With dead ends: 69 [2022-11-19 06:34:05,649 INFO L226 Difference]: Without dead ends: 67 [2022-11-19 06:34:05,650 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 22 SyntacticMatches, 2 SemanticMatches, 64 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 998 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=385, Invalid=3778, Unknown=1, NotChecked=126, Total=4290 [2022-11-19 06:34:05,651 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 143 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 444 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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.5s IncrementalHoareTripleChecker+Time [2022-11-19 06:34:05,652 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.5s Time] [2022-11-19 06:34:05,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-11-19 06:34:05,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 35. [2022-11-19 06:34:05,675 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-19 06:34:05,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 43 transitions. [2022-11-19 06:34:05,676 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 43 transitions. Word has length 20 [2022-11-19 06:34:05,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 06:34:05,677 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 43 transitions. [2022-11-19 06:34:05,677 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-19 06:34:05,677 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 43 transitions. [2022-11-19 06:34:05,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-19 06:34:05,678 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 06:34:05,678 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 06:34:05,687 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad856ce5-3bf9-4073-857b-483dd0f5a44b/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-19 06:34:05,896 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad856ce5-3bf9-4073-857b-483dd0f5a44b/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 06:34:05,896 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-19 06:34:05,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 06:34:05,896 INFO L85 PathProgramCache]: Analyzing trace with hash 1594744395, now seen corresponding path program 3 times [2022-11-19 06:34:05,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 06:34:05,897 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665840214] [2022-11-19 06:34:05,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:34:05,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 06:34:05,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:34:06,053 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-19 06:34:06,054 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 06:34:06,054 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665840214] [2022-11-19 06:34:06,054 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [665840214] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 06:34:06,054 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1782444429] [2022-11-19 06:34:06,055 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-19 06:34:06,055 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 06:34:06,055 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad856ce5-3bf9-4073-857b-483dd0f5a44b/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 06:34:06,056 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad856ce5-3bf9-4073-857b-483dd0f5a44b/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 06:34:06,092 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad856ce5-3bf9-4073-857b-483dd0f5a44b/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-19 06:34:06,414 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-19 06:34:06,414 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-19 06:34:06,418 INFO L263 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-19 06:34:06,419 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 06:34:06,486 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-19 06:34:06,486 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 06:34:06,486 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1782444429] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 06:34:06,486 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-19 06:34:06,487 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 9 [2022-11-19 06:34:06,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1229375024] [2022-11-19 06:34:06,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 06:34:06,488 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-19 06:34:06,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 06:34:06,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-19 06:34:06,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2022-11-19 06:34:06,490 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-19 06:34:06,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 06:34:06,552 INFO L93 Difference]: Finished difference Result 41 states and 50 transitions. [2022-11-19 06:34:06,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-19 06:34:06,553 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-19 06:34:06,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 06:34:06,555 INFO L225 Difference]: With dead ends: 41 [2022-11-19 06:34:06,555 INFO L226 Difference]: Without dead ends: 22 [2022-11-19 06:34:06,556 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2022-11-19 06:34:06,557 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-19 06:34:06,557 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-19 06:34:06,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-11-19 06:34:06,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2022-11-19 06:34:06,574 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-19 06:34:06,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 23 transitions. [2022-11-19 06:34:06,578 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 23 transitions. Word has length 20 [2022-11-19 06:34:06,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 06:34:06,578 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 23 transitions. [2022-11-19 06:34:06,579 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-19 06:34:06,579 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2022-11-19 06:34:06,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-19 06:34:06,580 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 06:34:06,580 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 06:34:06,594 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad856ce5-3bf9-4073-857b-483dd0f5a44b/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-19 06:34:06,788 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad856ce5-3bf9-4073-857b-483dd0f5a44b/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 06:34:06,788 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-19 06:34:06,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 06:34:06,789 INFO L85 PathProgramCache]: Analyzing trace with hash -123315596, now seen corresponding path program 2 times [2022-11-19 06:34:06,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 06:34:06,789 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908217681] [2022-11-19 06:34:06,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:34:06,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 06:34:06,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:34:06,922 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-19 06:34:06,922 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 06:34:06,923 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908217681] [2022-11-19 06:34:06,923 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1908217681] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 06:34:06,923 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [740710245] [2022-11-19 06:34:06,923 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-19 06:34:06,923 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 06:34:06,924 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad856ce5-3bf9-4073-857b-483dd0f5a44b/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 06:34:06,925 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad856ce5-3bf9-4073-857b-483dd0f5a44b/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 06:34:06,964 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad856ce5-3bf9-4073-857b-483dd0f5a44b/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-19 06:34:07,135 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-19 06:34:07,136 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-19 06:34:07,138 INFO L263 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-19 06:34:07,139 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 06:34:07,180 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-19 06:34:07,181 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 06:34:07,223 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-19 06:34:07,224 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [740710245] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 06:34:07,224 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [400991092] [2022-11-19 06:34:07,228 INFO L159 IcfgInterpreter]: Started Sifa with 10 locations of interest [2022-11-19 06:34:07,228 INFO L166 IcfgInterpreter]: Building call graph [2022-11-19 06:34:07,229 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-19 06:34:07,229 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-19 06:34:07,229 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-19 06:34:07,286 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-11-19 06:34:07,287 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-19 06:34:07,299 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-19 06:34:07,337 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:34:07,338 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 06:34:07,339 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-19 06:34:07,355 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:34:07,359 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-19 06:34:07,369 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 06:34:07,370 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-19 06:34:07,393 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:34:07,394 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:34:07,395 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 06:34:07,396 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-19 06:34:07,556 INFO L321 Elim1Store]: treesize reduction 70, result has 34.0 percent of original size [2022-11-19 06:34:07,556 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-19 06:34:07,599 INFO L321 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-11-19 06:34:07,600 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-19 06:34:07,883 INFO L321 Elim1Store]: treesize reduction 49, result has 25.8 percent of original size [2022-11-19 06:34:07,884 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-19 06:34:07,910 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:34:08,018 INFO L321 Elim1Store]: treesize reduction 52, result has 33.3 percent of original size [2022-11-19 06:34:08,019 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-19 06:34:08,042 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:34:08,129 INFO L321 Elim1Store]: treesize reduction 52, result has 33.3 percent of original size [2022-11-19 06:34:08,130 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-19 06:34:08,147 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:34:08,151 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:34:08,209 INFO L321 Elim1Store]: treesize reduction 74, result has 24.5 percent of original size [2022-11-19 06:34:08,210 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-19 06:34:08,251 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 06:34:08,283 INFO L321 Elim1Store]: treesize reduction 39, result has 18.8 percent of original size [2022-11-19 06:34:08,283 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-19 06:34:08,331 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 06:34:08,353 INFO L321 Elim1Store]: treesize reduction 39, result has 18.8 percent of original size [2022-11-19 06:34:08,354 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-19 06:34:08,785 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-19 06:34:08,792 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-19 06:34:08,821 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:34:08,822 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 06:34:08,823 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-19 06:34:08,839 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:34:08,840 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 06:34:08,841 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 06:34:08,842 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-19 06:34:08,866 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:34:08,867 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 06:34:08,868 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-19 06:34:08,921 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-19 06:34:08,931 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-19 06:34:08,940 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-19 06:34:09,038 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-19 06:34:09,052 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-19 06:34:09,062 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-19 06:34:09,154 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-19 06:34:09,162 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-19 06:34:09,175 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-19 06:34:09,710 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-19 06:34:09,718 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-19 06:34:09,722 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-19 06:34:10,784 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-19 06:34:10,785 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-19 06:34:10,785 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-19 06:34:10,785 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 7 [2022-11-19 06:34:10,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577315783] [2022-11-19 06:34:10,785 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-19 06:34:10,786 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-19 06:34:10,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 06:34:10,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-19 06:34:10,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2022-11-19 06:34:10,787 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-19 06:34:10,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 06:34:10,916 INFO L93 Difference]: Finished difference Result 22 states and 23 transitions. [2022-11-19 06:34:10,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-19 06:34:10,917 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-19 06:34:10,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 06:34:10,917 INFO L225 Difference]: With dead ends: 22 [2022-11-19 06:34:10,917 INFO L226 Difference]: Without dead ends: 0 [2022-11-19 06:34:10,918 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 52 SyntacticMatches, 3 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=89, Invalid=291, Unknown=0, NotChecked=0, Total=380 [2022-11-19 06:34:10,918 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 11 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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-19 06:34:10,919 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-19 06:34:10,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-11-19 06:34:10,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-11-19 06:34:10,920 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-19 06:34:10,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-11-19 06:34:10,920 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 21 [2022-11-19 06:34:10,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 06:34:10,920 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-11-19 06:34:10,920 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-19 06:34:10,920 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-11-19 06:34:10,920 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-11-19 06:34:10,924 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-11-19 06:34:10,937 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad856ce5-3bf9-4073-857b-483dd0f5a44b/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2022-11-19 06:34:11,131 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad856ce5-3bf9-4073-857b-483dd0f5a44b/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-11-19 06:34:11,134 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-11-19 06:34:13,725 INFO L902 garLoopResultBuilder]: At program point L572(line 572) the Hoare annotation is: true [2022-11-19 06:34:13,725 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-19 06:34:13,725 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-11-19 06:34:13,725 INFO L902 garLoopResultBuilder]: At program point L631(lines 613 632) the Hoare annotation is: true [2022-11-19 06:34:13,726 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-19 06:34:13,726 INFO L899 garLoopResultBuilder]: For program point L624(lines 624 626) no Hoare annotation was computed. [2022-11-19 06:34:13,726 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-19 06:34:13,726 INFO L895 garLoopResultBuilder]: At program point L625(lines 613 632) the Hoare annotation is: false [2022-11-19 06:34:13,727 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-19 06:34:13,727 INFO L902 garLoopResultBuilder]: At program point L593-2(lines 593 597) the Hoare annotation is: true [2022-11-19 06:34:13,727 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-19 06:34:13,728 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-19 06:34:13,728 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 630) no Hoare annotation was computed. [2022-11-19 06:34:13,728 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-11-19 06:34:13,731 INFO L444 BasicCegarLoop]: Path program histogram: [3, 3, 2, 1, 1, 1, 1] [2022-11-19 06:34:13,734 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-19 06:34:13,749 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-19 06:34:13,751 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-19 06:34:13,751 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-19 06:34:13,752 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-19 06:34:13,752 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-19 06:34:13,752 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-19 06:34:13,760 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-19 06:34:13,760 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-19 06:34:13,761 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-19 06:34:13,761 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-19 06:34:13,762 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-19 06:34:13,762 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-19 06:34:13,772 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-19 06:34:13,774 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-19 06:34:13,777 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-19 06:34:13,778 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-19 06:34:13,778 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-19 06:34:13,779 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-19 06:34:13,779 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-19 06:34:13,780 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-19 06:34:13,783 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-19 06:34:13,784 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-19 06:34:13,784 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-19 06:34:13,785 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-19 06:34:13,785 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-19 06:34:13,786 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-19 06:34:13,789 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-19 06:34:13,790 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-19 06:34:13,791 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-19 06:34:13,791 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-19 06:34:13,791 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-19 06:34:13,792 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-19 06:34:13,792 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-19 06:34:13,792 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-19 06:34:13,793 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-19 06:34:13,793 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-19 06:34:13,794 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-19 06:34:13,794 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-19 06:34:13,799 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-19 06:34:13,799 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-19 06:34:13,800 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-19 06:34:13,800 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-19 06:34:13,800 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-19 06:34:13,801 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-19 06:34:13,801 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-19 06:34:13,802 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-19 06:34:13,802 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-19 06:34:13,802 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-19 06:34:13,803 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-19 06:34:13,803 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-19 06:34:13,809 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-19 06:34:13,809 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-19 06:34:13,810 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-19 06:34:13,810 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_772,QUANTIFIED] [2022-11-19 06:34:13,811 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-19 06:34:13,811 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-19 06:34:13,815 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-19 06:34:13,815 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-19 06:34:13,816 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-19 06:34:13,816 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_772,QUANTIFIED] [2022-11-19 06:34:13,816 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-19 06:34:13,817 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-19 06:34:13,820 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 06:34:13 BoogieIcfgContainer [2022-11-19 06:34:13,821 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-19 06:34:13,821 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-19 06:34:13,821 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-19 06:34:13,822 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-19 06:34:13,822 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 06:33:25" (3/4) ... [2022-11-19 06:34:13,826 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-11-19 06:34:13,837 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 28 nodes and edges [2022-11-19 06:34:13,838 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2022-11-19 06:34:13,838 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2022-11-19 06:34:13,838 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-19 06:34:13,865 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-19 06:34:13,865 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-19 06:34:13,865 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-19 06:34:13,866 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-19 06:34:13,867 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-19 06:34:13,867 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-19 06:34:13,883 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad856ce5-3bf9-4073-857b-483dd0f5a44b/bin/utaipan-I9t0OCRTmS/witness.graphml [2022-11-19 06:34:13,884 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-19 06:34:13,884 INFO L158 Benchmark]: Toolchain (without parser) took 49695.43ms. Allocated memory was 111.1MB in the beginning and 360.7MB in the end (delta: 249.6MB). Free memory was 70.3MB in the beginning and 186.9MB in the end (delta: -116.6MB). Peak memory consumption was 133.3MB. Max. memory is 16.1GB. [2022-11-19 06:34:13,885 INFO L158 Benchmark]: CDTParser took 0.31ms. Allocated memory is still 111.1MB. Free memory is still 88.3MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-19 06:34:13,885 INFO L158 Benchmark]: CACSL2BoogieTranslator took 637.83ms. Allocated memory is still 111.1MB. Free memory was 70.1MB in the beginning and 80.1MB in the end (delta: -10.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-11-19 06:34:13,885 INFO L158 Benchmark]: Boogie Procedure Inliner took 83.14ms. Allocated memory is still 111.1MB. Free memory was 80.1MB in the beginning and 78.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-19 06:34:13,885 INFO L158 Benchmark]: Boogie Preprocessor took 73.59ms. Allocated memory is still 111.1MB. Free memory was 78.0MB in the beginning and 76.4MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-19 06:34:13,886 INFO L158 Benchmark]: RCFGBuilder took 615.91ms. Allocated memory is still 111.1MB. Free memory was 76.1MB in the beginning and 58.2MB in the end (delta: 17.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2022-11-19 06:34:13,886 INFO L158 Benchmark]: TraceAbstraction took 48214.07ms. Allocated memory was 111.1MB in the beginning and 360.7MB in the end (delta: 249.6MB). Free memory was 57.6MB in the beginning and 190.0MB in the end (delta: -132.5MB). Peak memory consumption was 192.4MB. Max. memory is 16.1GB. [2022-11-19 06:34:13,886 INFO L158 Benchmark]: Witness Printer took 62.43ms. Allocated memory is still 360.7MB. Free memory was 190.0MB in the beginning and 186.9MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-19 06:34:13,888 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.31ms. Allocated memory is still 111.1MB. Free memory is still 88.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 637.83ms. Allocated memory is still 111.1MB. Free memory was 70.1MB in the beginning and 80.1MB in the end (delta: -10.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 83.14ms. Allocated memory is still 111.1MB. Free memory was 80.1MB in the beginning and 78.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 73.59ms. Allocated memory is still 111.1MB. Free memory was 78.0MB in the beginning and 76.4MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 615.91ms. Allocated memory is still 111.1MB. Free memory was 76.1MB in the beginning and 58.2MB in the end (delta: 17.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 48214.07ms. Allocated memory was 111.1MB in the beginning and 360.7MB in the end (delta: 249.6MB). Free memory was 57.6MB in the beginning and 190.0MB in the end (delta: -132.5MB). Peak memory consumption was 192.4MB. Max. memory is 16.1GB. * Witness Printer took 62.43ms. Allocated memory is still 360.7MB. Free memory was 190.0MB in the beginning and 186.9MB 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: 48.0s, OverallIterations: 12, TraceHistogramMax: 3, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 3.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 2.6s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 668 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 668 mSDsluCounter, 334 SdHoareTripleChecker+Invalid, 1.2s 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, 15.0s 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, 2.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 7.7s 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-19 06:34:13,904 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-19 06:34:13,905 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-19 06:34:13,905 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-19 06:34:13,905 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-19 06:34:13,906 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-19 06:34:13,906 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-19 06:34:13,909 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-19 06:34:13,909 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-19 06:34:13,909 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-19 06:34:13,910 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-19 06:34:13,910 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-19 06:34:13,910 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-19 06:34:13,914 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-19 06:34:13,915 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-19 06:34:13,917 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-19 06:34:13,917 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-19 06:34:13,918 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-19 06:34:13,918 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-19 06:34:13,918 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-19 06:34:13,919 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-19 06:34:13,920 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-19 06:34:13,921 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-19 06:34:13,921 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-19 06:34:13,921 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-19 06:34:13,922 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-19 06:34:13,922 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-19 06:34:13,924 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-19 06:34:13,924 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-19 06:34:13,924 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-19 06:34:13,925 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-19 06:34:13,925 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-19 06:34:13,925 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-19 06:34:13,926 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-19 06:34:13,926 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-19 06:34:13,926 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-19 06:34:13,927 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-19 06:34:13,927 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-19 06:34:13,927 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-19 06:34:13,929 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-19 06:34:13,930 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-19 06:34:13,930 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-19 06:34:13,930 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-19 06:34:13,931 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-19 06:34:13,931 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-19 06:34:13,931 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-19 06:34:13,932 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-19 06:34:13,932 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-19 06:34:13,932 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-19 06:34:13,933 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-19 06:34:13,933 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-19 06:34:13,935 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-19 06:34:13,936 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-19 06:34:13,936 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-19 06:34:13,936 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_772,QUANTIFIED] [2022-11-19 06:34:13,937 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-19 06:34:13,937 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-19 06:34:13,939 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-19 06:34:13,939 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-19 06:34:13,939 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-19 06:34:13,940 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_772,QUANTIFIED] [2022-11-19 06:34:13,940 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-19 06:34:13,940 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-19 06:34:13,960 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad856ce5-3bf9-4073-857b-483dd0f5a44b/bin/utaipan-I9t0OCRTmS/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