./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/list-simple/sll2c_update_all_reverse.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 2329fc70 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f2cb204-05c4-4a98-92c6-7a6b48f1623a/bin/utaipan-gh47qXpMRh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f2cb204-05c4-4a98-92c6-7a6b48f1623a/bin/utaipan-gh47qXpMRh/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f2cb204-05c4-4a98-92c6-7a6b48f1623a/bin/utaipan-gh47qXpMRh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f2cb204-05c4-4a98-92c6-7a6b48f1623a/bin/utaipan-gh47qXpMRh/config/TaipanReach.xml -i ../../sv-benchmarks/c/list-simple/sll2c_update_all_reverse.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f2cb204-05c4-4a98-92c6-7a6b48f1623a/bin/utaipan-gh47qXpMRh/config/svcomp-Overflow-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f2cb204-05c4-4a98-92c6-7a6b48f1623a/bin/utaipan-gh47qXpMRh --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4fecbd384f63aa34e01807a3a6735a322a2435f1312f0df3ed763fde7f43fe0a --- 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-2329fc7 [2022-12-14 09:33:25,685 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-14 09:33:25,687 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-14 09:33:25,705 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-14 09:33:25,705 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-14 09:33:25,706 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-14 09:33:25,708 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-14 09:33:25,709 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-14 09:33:25,711 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-14 09:33:25,712 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-14 09:33:25,713 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-14 09:33:25,714 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-14 09:33:25,714 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-14 09:33:25,715 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-14 09:33:25,716 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-14 09:33:25,717 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-14 09:33:25,718 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-14 09:33:25,719 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-14 09:33:25,720 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-14 09:33:25,722 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-14 09:33:25,723 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-14 09:33:25,724 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-14 09:33:25,725 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-14 09:33:25,726 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-14 09:33:25,730 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-14 09:33:25,730 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-14 09:33:25,730 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-14 09:33:25,731 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-14 09:33:25,732 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-14 09:33:25,732 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-14 09:33:25,733 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-14 09:33:25,733 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-14 09:33:25,734 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-14 09:33:25,735 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-14 09:33:25,735 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-14 09:33:25,736 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-14 09:33:25,736 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-14 09:33:25,736 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-14 09:33:25,737 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-14 09:33:25,737 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-14 09:33:25,738 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-14 09:33:25,739 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f2cb204-05c4-4a98-92c6-7a6b48f1623a/bin/utaipan-gh47qXpMRh/config/svcomp-Overflow-32bit-Taipan_Default.epf [2022-12-14 09:33:25,758 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-14 09:33:25,758 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-14 09:33:25,759 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-14 09:33:25,759 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-14 09:33:25,760 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-14 09:33:25,760 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-14 09:33:25,760 INFO L138 SettingsManager]: * User list type=DISABLED [2022-12-14 09:33:25,760 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-12-14 09:33:25,760 INFO L138 SettingsManager]: * Explicit value domain=true [2022-12-14 09:33:25,760 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-12-14 09:33:25,761 INFO L138 SettingsManager]: * Octagon Domain=false [2022-12-14 09:33:25,761 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-12-14 09:33:25,761 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-12-14 09:33:25,761 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-12-14 09:33:25,761 INFO L138 SettingsManager]: * Interval Domain=false [2022-12-14 09:33:25,761 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-12-14 09:33:25,762 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-12-14 09:33:25,762 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-12-14 09:33:25,762 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-14 09:33:25,763 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-14 09:33:25,763 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-12-14 09:33:25,763 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-14 09:33:25,763 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-14 09:33:25,763 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-14 09:33:25,763 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-14 09:33:25,764 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-14 09:33:25,764 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-14 09:33:25,764 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-12-14 09:33:25,764 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-14 09:33:25,764 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-14 09:33:25,764 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-14 09:33:25,765 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-14 09:33:25,765 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-14 09:33:25,765 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-14 09:33:25,765 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 09:33:25,765 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-14 09:33:25,765 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-12-14 09:33:25,766 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-14 09:33:25,766 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-14 09:33:25,766 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-12-14 09:33:25,766 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-14 09:33:25,766 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-14 09:33:25,766 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-12-14 09:33:25,766 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_4f2cb204-05c4-4a98-92c6-7a6b48f1623a/bin/utaipan-gh47qXpMRh/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_4f2cb204-05c4-4a98-92c6-7a6b48f1623a/bin/utaipan-gh47qXpMRh 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 ! overflow) ) 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 -> 4fecbd384f63aa34e01807a3a6735a322a2435f1312f0df3ed763fde7f43fe0a [2022-12-14 09:33:25,931 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-14 09:33:25,951 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-14 09:33:25,953 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-14 09:33:25,953 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-14 09:33:25,954 INFO L275 PluginConnector]: CDTParser initialized [2022-12-14 09:33:25,955 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f2cb204-05c4-4a98-92c6-7a6b48f1623a/bin/utaipan-gh47qXpMRh/../../sv-benchmarks/c/list-simple/sll2c_update_all_reverse.i [2022-12-14 09:33:28,565 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-14 09:33:28,718 INFO L351 CDTParser]: Found 1 translation units. [2022-12-14 09:33:28,719 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f2cb204-05c4-4a98-92c6-7a6b48f1623a/sv-benchmarks/c/list-simple/sll2c_update_all_reverse.i [2022-12-14 09:33:28,728 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f2cb204-05c4-4a98-92c6-7a6b48f1623a/bin/utaipan-gh47qXpMRh/data/d587ad722/5289a1c2181348c384e7bdda75244681/FLAGd57733074 [2022-12-14 09:33:28,739 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f2cb204-05c4-4a98-92c6-7a6b48f1623a/bin/utaipan-gh47qXpMRh/data/d587ad722/5289a1c2181348c384e7bdda75244681 [2022-12-14 09:33:28,741 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-14 09:33:28,742 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-14 09:33:28,743 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-14 09:33:28,743 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-14 09:33:28,746 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-14 09:33:28,747 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 09:33:28" (1/1) ... [2022-12-14 09:33:28,748 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7d0dda61 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 09:33:28, skipping insertion in model container [2022-12-14 09:33:28,748 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 09:33:28" (1/1) ... [2022-12-14 09:33:28,754 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-14 09:33:28,780 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-14 09:33:28,967 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f2cb204-05c4-4a98-92c6-7a6b48f1623a/sv-benchmarks/c/list-simple/sll2c_update_all_reverse.i[24436,24449] [2022-12-14 09:33:28,968 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 09:33:28,975 INFO L203 MainTranslator]: Completed pre-run [2022-12-14 09:33:29,007 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f2cb204-05c4-4a98-92c6-7a6b48f1623a/sv-benchmarks/c/list-simple/sll2c_update_all_reverse.i[24436,24449] [2022-12-14 09:33:29,008 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 09:33:29,024 INFO L208 MainTranslator]: Completed translation [2022-12-14 09:33:29,025 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 09:33:29 WrapperNode [2022-12-14 09:33:29,025 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-14 09:33:29,026 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-14 09:33:29,026 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-14 09:33:29,026 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-14 09:33:29,031 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 09:33:29" (1/1) ... [2022-12-14 09:33:29,040 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 09:33:29" (1/1) ... [2022-12-14 09:33:29,056 INFO L138 Inliner]: procedures = 126, calls = 26, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 145 [2022-12-14 09:33:29,056 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-14 09:33:29,057 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-14 09:33:29,057 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-14 09:33:29,057 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-14 09:33:29,063 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 09:33:29" (1/1) ... [2022-12-14 09:33:29,063 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 09:33:29" (1/1) ... [2022-12-14 09:33:29,066 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 09:33:29" (1/1) ... [2022-12-14 09:33:29,066 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 09:33:29" (1/1) ... [2022-12-14 09:33:29,070 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 09:33:29" (1/1) ... [2022-12-14 09:33:29,073 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 09:33:29" (1/1) ... [2022-12-14 09:33:29,074 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 09:33:29" (1/1) ... [2022-12-14 09:33:29,075 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 09:33:29" (1/1) ... [2022-12-14 09:33:29,077 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-14 09:33:29,078 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-14 09:33:29,078 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-14 09:33:29,078 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-14 09:33:29,078 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 09:33:29" (1/1) ... [2022-12-14 09:33:29,083 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 09:33:29,094 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f2cb204-05c4-4a98-92c6-7a6b48f1623a/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 09:33:29,106 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f2cb204-05c4-4a98-92c6-7a6b48f1623a/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-14 09:33:29,116 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f2cb204-05c4-4a98-92c6-7a6b48f1623a/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-14 09:33:29,147 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-14 09:33:29,148 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-14 09:33:29,148 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2022-12-14 09:33:29,148 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2022-12-14 09:33:29,148 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-14 09:33:29,148 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-14 09:33:29,148 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-12-14 09:33:29,148 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-12-14 09:33:29,148 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-14 09:33:29,148 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-14 09:33:29,156 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-14 09:33:29,156 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-14 09:33:29,248 INFO L235 CfgBuilder]: Building ICFG [2022-12-14 09:33:29,250 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-14 09:33:29,441 INFO L276 CfgBuilder]: Performing block encoding [2022-12-14 09:33:29,473 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-14 09:33:29,473 INFO L300 CfgBuilder]: Removed 6 assume(true) statements. [2022-12-14 09:33:29,476 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 09:33:29 BoogieIcfgContainer [2022-12-14 09:33:29,476 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-14 09:33:29,478 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-14 09:33:29,478 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-14 09:33:29,481 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-14 09:33:29,481 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.12 09:33:28" (1/3) ... [2022-12-14 09:33:29,481 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4bd0485 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 09:33:29, skipping insertion in model container [2022-12-14 09:33:29,482 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 09:33:29" (2/3) ... [2022-12-14 09:33:29,482 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4bd0485 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 09:33:29, skipping insertion in model container [2022-12-14 09:33:29,482 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 09:33:29" (3/3) ... [2022-12-14 09:33:29,483 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2c_update_all_reverse.i [2022-12-14 09:33:29,498 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-14 09:33:29,499 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 18 error locations. [2022-12-14 09:33:29,542 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-14 09:33:29,548 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;@7101a674, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-14 09:33:29,548 INFO L358 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2022-12-14 09:33:29,552 INFO L276 IsEmpty]: Start isEmpty. Operand has 56 states, 34 states have (on average 1.7941176470588236) internal successors, (61), 52 states have internal predecessors, (61), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-14 09:33:29,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-12-14 09:33:29,557 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 09:33:29,558 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 09:33:29,558 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2022-12-14 09:33:29,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 09:33:29,563 INFO L85 PathProgramCache]: Analyzing trace with hash -1792803940, now seen corresponding path program 1 times [2022-12-14 09:33:29,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 09:33:29,571 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685234907] [2022-12-14 09:33:29,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:33:29,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 09:33:29,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:33:29,827 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 09:33:29,828 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 09:33:29,828 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685234907] [2022-12-14 09:33:29,828 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1685234907] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 09:33:29,829 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 09:33:29,829 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 09:33:29,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718639784] [2022-12-14 09:33:29,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 09:33:29,834 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 09:33:29,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 09:33:29,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 09:33:29,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 09:33:29,862 INFO L87 Difference]: Start difference. First operand has 56 states, 34 states have (on average 1.7941176470588236) internal successors, (61), 52 states have internal predecessors, (61), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-14 09:33:29,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 09:33:29,914 INFO L93 Difference]: Finished difference Result 105 states and 122 transitions. [2022-12-14 09:33:29,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 09:33:29,917 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 8 [2022-12-14 09:33:29,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 09:33:29,923 INFO L225 Difference]: With dead ends: 105 [2022-12-14 09:33:29,923 INFO L226 Difference]: Without dead ends: 57 [2022-12-14 09:33:29,926 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 09:33:29,929 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 5 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 09:33:29,930 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 102 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 09:33:29,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-12-14 09:33:29,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 51. [2022-12-14 09:33:29,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 30 states have (on average 1.7333333333333334) internal successors, (52), 47 states have internal predecessors, (52), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-14 09:33:29,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 56 transitions. [2022-12-14 09:33:29,969 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 56 transitions. Word has length 8 [2022-12-14 09:33:29,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 09:33:29,969 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 56 transitions. [2022-12-14 09:33:29,970 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-14 09:33:29,970 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 56 transitions. [2022-12-14 09:33:29,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-12-14 09:33:29,971 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 09:33:29,971 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 09:33:29,971 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-14 09:33:29,972 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2022-12-14 09:33:29,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 09:33:29,972 INFO L85 PathProgramCache]: Analyzing trace with hash 1559711374, now seen corresponding path program 1 times [2022-12-14 09:33:29,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 09:33:29,973 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015173960] [2022-12-14 09:33:29,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:33:29,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 09:33:29,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:33:30,091 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-14 09:33:30,091 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 09:33:30,091 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015173960] [2022-12-14 09:33:30,092 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2015173960] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 09:33:30,092 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 09:33:30,092 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 09:33:30,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595274634] [2022-12-14 09:33:30,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 09:33:30,093 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 09:33:30,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 09:33:30,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 09:33:30,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 09:33:30,094 INFO L87 Difference]: Start difference. First operand 51 states and 56 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-12-14 09:33:30,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 09:33:30,140 INFO L93 Difference]: Finished difference Result 57 states and 63 transitions. [2022-12-14 09:33:30,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 09:33:30,140 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 13 [2022-12-14 09:33:30,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 09:33:30,141 INFO L225 Difference]: With dead ends: 57 [2022-12-14 09:33:30,141 INFO L226 Difference]: Without dead ends: 55 [2022-12-14 09:33:30,142 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-12-14 09:33:30,143 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 3 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 09:33:30,144 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 131 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 09:33:30,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-12-14 09:33:30,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2022-12-14 09:33:30,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 33 states have (on average 1.6666666666666667) internal successors, (55), 50 states have internal predecessors, (55), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-12-14 09:33:30,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 61 transitions. [2022-12-14 09:33:30,155 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 61 transitions. Word has length 13 [2022-12-14 09:33:30,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 09:33:30,156 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 61 transitions. [2022-12-14 09:33:30,156 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-12-14 09:33:30,156 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 61 transitions. [2022-12-14 09:33:30,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-12-14 09:33:30,156 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 09:33:30,157 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 09:33:30,157 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-14 09:33:30,157 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2022-12-14 09:33:30,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 09:33:30,158 INFO L85 PathProgramCache]: Analyzing trace with hash -1889579151, now seen corresponding path program 1 times [2022-12-14 09:33:30,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 09:33:30,158 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573043828] [2022-12-14 09:33:30,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:33:30,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 09:33:30,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:33:30,231 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-14 09:33:30,232 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 09:33:30,232 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573043828] [2022-12-14 09:33:30,232 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1573043828] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 09:33:30,232 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 09:33:30,232 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 09:33:30,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343582606] [2022-12-14 09:33:30,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 09:33:30,233 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 09:33:30,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 09:33:30,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 09:33:30,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 09:33:30,234 INFO L87 Difference]: Start difference. First operand 55 states and 61 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-12-14 09:33:30,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 09:33:30,267 INFO L93 Difference]: Finished difference Result 55 states and 61 transitions. [2022-12-14 09:33:30,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 09:33:30,268 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 16 [2022-12-14 09:33:30,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 09:33:30,269 INFO L225 Difference]: With dead ends: 55 [2022-12-14 09:33:30,269 INFO L226 Difference]: Without dead ends: 51 [2022-12-14 09:33:30,269 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-12-14 09:33:30,271 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 38 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 09:33:30,271 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 35 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 09:33:30,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-12-14 09:33:30,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2022-12-14 09:33:30,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 33 states have (on average 1.5454545454545454) internal successors, (51), 46 states have internal predecessors, (51), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-12-14 09:33:30,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 57 transitions. [2022-12-14 09:33:30,278 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 57 transitions. Word has length 16 [2022-12-14 09:33:30,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 09:33:30,278 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 57 transitions. [2022-12-14 09:33:30,278 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-12-14 09:33:30,278 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 57 transitions. [2022-12-14 09:33:30,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-12-14 09:33:30,279 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 09:33:30,279 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 09:33:30,279 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-14 09:33:30,280 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2022-12-14 09:33:30,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 09:33:30,280 INFO L85 PathProgramCache]: Analyzing trace with hash 1683920076, now seen corresponding path program 1 times [2022-12-14 09:33:30,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 09:33:30,280 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79814870] [2022-12-14 09:33:30,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:33:30,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 09:33:30,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:33:30,365 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-14 09:33:30,366 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 09:33:30,366 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79814870] [2022-12-14 09:33:30,366 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [79814870] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 09:33:30,366 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 09:33:30,366 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 09:33:30,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621621893] [2022-12-14 09:33:30,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 09:33:30,367 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 09:33:30,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 09:33:30,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 09:33:30,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-14 09:33:30,368 INFO L87 Difference]: Start difference. First operand 51 states and 57 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-12-14 09:33:30,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 09:33:30,412 INFO L93 Difference]: Finished difference Result 69 states and 78 transitions. [2022-12-14 09:33:30,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 09:33:30,412 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 19 [2022-12-14 09:33:30,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 09:33:30,413 INFO L225 Difference]: With dead ends: 69 [2022-12-14 09:33:30,413 INFO L226 Difference]: Without dead ends: 51 [2022-12-14 09:33:30,414 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-14 09:33:30,415 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 33 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 09:33:30,416 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 43 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 09:33:30,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-12-14 09:33:30,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 50. [2022-12-14 09:33:30,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 34 states have (on average 1.4705882352941178) internal successors, (50), 45 states have internal predecessors, (50), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-12-14 09:33:30,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 56 transitions. [2022-12-14 09:33:30,423 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 56 transitions. Word has length 19 [2022-12-14 09:33:30,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 09:33:30,424 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 56 transitions. [2022-12-14 09:33:30,424 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-12-14 09:33:30,424 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 56 transitions. [2022-12-14 09:33:30,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-12-14 09:33:30,425 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 09:33:30,425 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 09:33:30,425 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-14 09:33:30,425 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2022-12-14 09:33:30,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 09:33:30,426 INFO L85 PathProgramCache]: Analyzing trace with hash -1655695399, now seen corresponding path program 1 times [2022-12-14 09:33:30,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 09:33:30,426 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87320477] [2022-12-14 09:33:30,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:33:30,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 09:33:30,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:33:30,534 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-12-14 09:33:30,535 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 09:33:30,535 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87320477] [2022-12-14 09:33:30,535 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [87320477] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 09:33:30,535 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [645559038] [2022-12-14 09:33:30,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:33:30,535 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 09:33:30,536 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f2cb204-05c4-4a98-92c6-7a6b48f1623a/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 09:33:30,537 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f2cb204-05c4-4a98-92c6-7a6b48f1623a/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 09:33:30,538 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f2cb204-05c4-4a98-92c6-7a6b48f1623a/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-14 09:33:30,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:33:30,639 INFO L263 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-14 09:33:30,643 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 09:33:30,703 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-14 09:33:30,703 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 09:33:30,703 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [645559038] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 09:33:30,703 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-14 09:33:30,703 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2022-12-14 09:33:30,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995434564] [2022-12-14 09:33:30,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 09:33:30,704 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 09:33:30,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 09:33:30,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 09:33:30,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-12-14 09:33:30,705 INFO L87 Difference]: Start difference. First operand 50 states and 56 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-12-14 09:33:30,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 09:33:30,738 INFO L93 Difference]: Finished difference Result 86 states and 95 transitions. [2022-12-14 09:33:30,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 09:33:30,738 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 21 [2022-12-14 09:33:30,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 09:33:30,739 INFO L225 Difference]: With dead ends: 86 [2022-12-14 09:33:30,739 INFO L226 Difference]: Without dead ends: 44 [2022-12-14 09:33:30,740 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-12-14 09:33:30,741 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 72 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 09:33:30,741 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 76 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 09:33:30,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-12-14 09:33:30,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2022-12-14 09:33:30,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 31 states have (on average 1.4193548387096775) internal successors, (44), 40 states have internal predecessors, (44), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-14 09:33:30,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 48 transitions. [2022-12-14 09:33:30,746 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 48 transitions. Word has length 21 [2022-12-14 09:33:30,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 09:33:30,746 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 48 transitions. [2022-12-14 09:33:30,747 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-12-14 09:33:30,747 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 48 transitions. [2022-12-14 09:33:30,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-12-14 09:33:30,747 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 09:33:30,747 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 09:33:30,753 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f2cb204-05c4-4a98-92c6-7a6b48f1623a/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-14 09:33:30,948 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f2cb204-05c4-4a98-92c6-7a6b48f1623a/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 09:33:30,948 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2022-12-14 09:33:30,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 09:33:30,949 INFO L85 PathProgramCache]: Analyzing trace with hash 661914875, now seen corresponding path program 1 times [2022-12-14 09:33:30,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 09:33:30,949 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037910234] [2022-12-14 09:33:30,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:33:30,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 09:33:30,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:33:31,014 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-14 09:33:31,014 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 09:33:31,014 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037910234] [2022-12-14 09:33:31,014 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1037910234] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 09:33:31,014 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 09:33:31,014 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 09:33:31,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231557090] [2022-12-14 09:33:31,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 09:33:31,015 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 09:33:31,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 09:33:31,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 09:33:31,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-14 09:33:31,016 INFO L87 Difference]: Start difference. First operand 44 states and 48 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-12-14 09:33:31,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 09:33:31,073 INFO L93 Difference]: Finished difference Result 70 states and 76 transitions. [2022-12-14 09:33:31,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 09:33:31,074 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 20 [2022-12-14 09:33:31,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 09:33:31,075 INFO L225 Difference]: With dead ends: 70 [2022-12-14 09:33:31,075 INFO L226 Difference]: Without dead ends: 68 [2022-12-14 09:33:31,075 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-14 09:33:31,076 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 56 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 09:33:31,077 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 55 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 09:33:31,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2022-12-14 09:33:31,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 49. [2022-12-14 09:33:31,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 36 states have (on average 1.3611111111111112) internal successors, (49), 45 states have internal predecessors, (49), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-14 09:33:31,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 53 transitions. [2022-12-14 09:33:31,084 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 53 transitions. Word has length 20 [2022-12-14 09:33:31,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 09:33:31,084 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 53 transitions. [2022-12-14 09:33:31,084 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-12-14 09:33:31,084 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 53 transitions. [2022-12-14 09:33:31,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-12-14 09:33:31,085 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 09:33:31,085 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 09:33:31,085 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-14 09:33:31,085 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2022-12-14 09:33:31,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 09:33:31,085 INFO L85 PathProgramCache]: Analyzing trace with hash 445037629, now seen corresponding path program 1 times [2022-12-14 09:33:31,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 09:33:31,085 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073632620] [2022-12-14 09:33:31,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:33:31,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 09:33:31,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:33:31,127 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-14 09:33:31,127 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 09:33:31,127 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073632620] [2022-12-14 09:33:31,127 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2073632620] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 09:33:31,127 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 09:33:31,127 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 09:33:31,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883291941] [2022-12-14 09:33:31,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 09:33:31,128 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 09:33:31,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 09:33:31,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 09:33:31,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 09:33:31,129 INFO L87 Difference]: Start difference. First operand 49 states and 53 transitions. Second operand has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-12-14 09:33:31,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 09:33:31,152 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions. [2022-12-14 09:33:31,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 09:33:31,152 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 22 [2022-12-14 09:33:31,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 09:33:31,153 INFO L225 Difference]: With dead ends: 49 [2022-12-14 09:33:31,153 INFO L226 Difference]: Without dead ends: 48 [2022-12-14 09:33:31,153 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-12-14 09:33:31,154 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 2 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 09:33:31,154 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 70 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 09:33:31,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-12-14 09:33:31,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2022-12-14 09:33:31,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 36 states have (on average 1.3333333333333333) internal successors, (48), 44 states have internal predecessors, (48), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-14 09:33:31,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 52 transitions. [2022-12-14 09:33:31,160 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 52 transitions. Word has length 22 [2022-12-14 09:33:31,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 09:33:31,161 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 52 transitions. [2022-12-14 09:33:31,161 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-12-14 09:33:31,161 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 52 transitions. [2022-12-14 09:33:31,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-12-14 09:33:31,162 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 09:33:31,162 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 09:33:31,162 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-14 09:33:31,162 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2022-12-14 09:33:31,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 09:33:31,162 INFO L85 PathProgramCache]: Analyzing trace with hash 445041609, now seen corresponding path program 1 times [2022-12-14 09:33:31,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 09:33:31,163 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273077459] [2022-12-14 09:33:31,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:33:31,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 09:33:31,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:33:31,239 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-14 09:33:31,239 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 09:33:31,239 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273077459] [2022-12-14 09:33:31,239 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1273077459] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 09:33:31,239 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 09:33:31,239 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-14 09:33:31,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784883731] [2022-12-14 09:33:31,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 09:33:31,240 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 09:33:31,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 09:33:31,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 09:33:31,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-14 09:33:31,241 INFO L87 Difference]: Start difference. First operand 48 states and 52 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-12-14 09:33:31,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 09:33:31,321 INFO L93 Difference]: Finished difference Result 101 states and 111 transitions. [2022-12-14 09:33:31,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 09:33:31,321 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 22 [2022-12-14 09:33:31,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 09:33:31,322 INFO L225 Difference]: With dead ends: 101 [2022-12-14 09:33:31,322 INFO L226 Difference]: Without dead ends: 70 [2022-12-14 09:33:31,323 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-12-14 09:33:31,324 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 88 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 09:33:31,324 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 72 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 09:33:31,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-12-14 09:33:31,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 49. [2022-12-14 09:33:31,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 37 states have (on average 1.3243243243243243) internal successors, (49), 45 states have internal predecessors, (49), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-14 09:33:31,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 53 transitions. [2022-12-14 09:33:31,331 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 53 transitions. Word has length 22 [2022-12-14 09:33:31,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 09:33:31,331 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 53 transitions. [2022-12-14 09:33:31,332 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-12-14 09:33:31,332 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 53 transitions. [2022-12-14 09:33:31,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-12-14 09:33:31,332 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 09:33:31,332 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 09:33:31,333 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-14 09:33:31,333 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2022-12-14 09:33:31,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 09:33:31,333 INFO L85 PathProgramCache]: Analyzing trace with hash 911264695, now seen corresponding path program 1 times [2022-12-14 09:33:31,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 09:33:31,333 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681166986] [2022-12-14 09:33:31,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:33:31,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 09:33:31,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:33:31,426 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-14 09:33:31,426 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 09:33:31,426 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681166986] [2022-12-14 09:33:31,426 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [681166986] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 09:33:31,426 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 09:33:31,427 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-14 09:33:31,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506792217] [2022-12-14 09:33:31,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 09:33:31,427 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-14 09:33:31,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 09:33:31,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-14 09:33:31,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-14 09:33:31,428 INFO L87 Difference]: Start difference. First operand 49 states and 53 transitions. Second operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-12-14 09:33:31,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 09:33:31,524 INFO L93 Difference]: Finished difference Result 67 states and 73 transitions. [2022-12-14 09:33:31,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-14 09:33:31,525 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 23 [2022-12-14 09:33:31,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 09:33:31,525 INFO L225 Difference]: With dead ends: 67 [2022-12-14 09:33:31,525 INFO L226 Difference]: Without dead ends: 66 [2022-12-14 09:33:31,526 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2022-12-14 09:33:31,526 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 123 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 09:33:31,526 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 84 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 09:33:31,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2022-12-14 09:33:31,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 52. [2022-12-14 09:33:31,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 40 states have (on average 1.325) internal successors, (53), 48 states have internal predecessors, (53), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-14 09:33:31,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 57 transitions. [2022-12-14 09:33:31,533 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 57 transitions. Word has length 23 [2022-12-14 09:33:31,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 09:33:31,534 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 57 transitions. [2022-12-14 09:33:31,534 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-12-14 09:33:31,534 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 57 transitions. [2022-12-14 09:33:31,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-12-14 09:33:31,534 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 09:33:31,534 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 09:33:31,535 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-14 09:33:31,535 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2022-12-14 09:33:31,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 09:33:31,535 INFO L85 PathProgramCache]: Analyzing trace with hash -447949947, now seen corresponding path program 1 times [2022-12-14 09:33:31,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 09:33:31,535 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911931809] [2022-12-14 09:33:31,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:33:31,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 09:33:31,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:33:31,629 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-14 09:33:31,629 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 09:33:31,630 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911931809] [2022-12-14 09:33:31,630 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1911931809] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 09:33:31,630 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [134494788] [2022-12-14 09:33:31,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:33:31,630 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 09:33:31,630 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f2cb204-05c4-4a98-92c6-7a6b48f1623a/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 09:33:31,631 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f2cb204-05c4-4a98-92c6-7a6b48f1623a/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 09:33:31,632 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f2cb204-05c4-4a98-92c6-7a6b48f1623a/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-14 09:33:31,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:33:31,715 INFO L263 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-14 09:33:31,718 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 09:33:31,750 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-12-14 09:33:31,751 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 09:33:31,751 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [134494788] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 09:33:31,751 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-14 09:33:31,751 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2022-12-14 09:33:31,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036641377] [2022-12-14 09:33:31,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 09:33:31,752 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 09:33:31,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 09:33:31,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 09:33:31,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-14 09:33:31,752 INFO L87 Difference]: Start difference. First operand 52 states and 57 transitions. Second operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-12-14 09:33:31,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 09:33:31,819 INFO L93 Difference]: Finished difference Result 66 states and 72 transitions. [2022-12-14 09:33:31,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-14 09:33:31,819 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 25 [2022-12-14 09:33:31,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 09:33:31,820 INFO L225 Difference]: With dead ends: 66 [2022-12-14 09:33:31,820 INFO L226 Difference]: Without dead ends: 65 [2022-12-14 09:33:31,820 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2022-12-14 09:33:31,821 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 74 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 09:33:31,821 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 75 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 09:33:31,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-12-14 09:33:31,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 53. [2022-12-14 09:33:31,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 41 states have (on average 1.3170731707317074) internal successors, (54), 49 states have internal predecessors, (54), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-14 09:33:31,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 58 transitions. [2022-12-14 09:33:31,828 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 58 transitions. Word has length 25 [2022-12-14 09:33:31,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 09:33:31,829 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 58 transitions. [2022-12-14 09:33:31,829 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-12-14 09:33:31,829 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 58 transitions. [2022-12-14 09:33:31,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-12-14 09:33:31,829 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 09:33:31,830 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 09:33:31,835 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f2cb204-05c4-4a98-92c6-7a6b48f1623a/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-12-14 09:33:32,030 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f2cb204-05c4-4a98-92c6-7a6b48f1623a/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 09:33:32,031 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2022-12-14 09:33:32,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 09:33:32,031 INFO L85 PathProgramCache]: Analyzing trace with hash -1001546373, now seen corresponding path program 1 times [2022-12-14 09:33:32,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 09:33:32,032 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517825715] [2022-12-14 09:33:32,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:33:32,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 09:33:32,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:33:32,242 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-14 09:33:32,243 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 09:33:32,243 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517825715] [2022-12-14 09:33:32,243 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1517825715] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 09:33:32,243 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1493078832] [2022-12-14 09:33:32,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:33:32,243 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 09:33:32,243 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f2cb204-05c4-4a98-92c6-7a6b48f1623a/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 09:33:32,244 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f2cb204-05c4-4a98-92c6-7a6b48f1623a/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 09:33:32,245 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f2cb204-05c4-4a98-92c6-7a6b48f1623a/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-14 09:33:32,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:33:32,339 INFO L263 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-14 09:33:32,340 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 09:33:32,366 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-12-14 09:33:32,367 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 09:33:32,367 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1493078832] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 09:33:32,367 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-14 09:33:32,367 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 7 [2022-12-14 09:33:32,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128072029] [2022-12-14 09:33:32,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 09:33:32,368 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 09:33:32,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 09:33:32,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 09:33:32,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-12-14 09:33:32,368 INFO L87 Difference]: Start difference. First operand 53 states and 58 transitions. Second operand has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-12-14 09:33:32,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 09:33:32,421 INFO L93 Difference]: Finished difference Result 63 states and 69 transitions. [2022-12-14 09:33:32,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 09:33:32,422 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 26 [2022-12-14 09:33:32,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 09:33:32,422 INFO L225 Difference]: With dead ends: 63 [2022-12-14 09:33:32,422 INFO L226 Difference]: Without dead ends: 61 [2022-12-14 09:33:32,423 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2022-12-14 09:33:32,423 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 65 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 09:33:32,424 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 67 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 09:33:32,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-12-14 09:33:32,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 51. [2022-12-14 09:33:32,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 41 states have (on average 1.2682926829268293) internal successors, (52), 47 states have internal predecessors, (52), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-14 09:33:32,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 56 transitions. [2022-12-14 09:33:32,430 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 56 transitions. Word has length 26 [2022-12-14 09:33:32,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 09:33:32,431 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 56 transitions. [2022-12-14 09:33:32,431 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-12-14 09:33:32,431 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 56 transitions. [2022-12-14 09:33:32,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-12-14 09:33:32,432 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 09:33:32,432 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 09:33:32,437 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f2cb204-05c4-4a98-92c6-7a6b48f1623a/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-12-14 09:33:32,632 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f2cb204-05c4-4a98-92c6-7a6b48f1623a/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-12-14 09:33:32,633 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2022-12-14 09:33:32,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 09:33:32,633 INFO L85 PathProgramCache]: Analyzing trace with hash -1570684968, now seen corresponding path program 1 times [2022-12-14 09:33:32,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 09:33:32,634 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556929260] [2022-12-14 09:33:32,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:33:32,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 09:33:32,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:33:32,823 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 09:33:32,823 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 09:33:32,823 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556929260] [2022-12-14 09:33:32,823 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [556929260] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 09:33:32,823 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 09:33:32,823 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 09:33:32,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179745222] [2022-12-14 09:33:32,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 09:33:32,824 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 09:33:32,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 09:33:32,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 09:33:32,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-14 09:33:32,824 INFO L87 Difference]: Start difference. First operand 51 states and 56 transitions. Second operand has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-12-14 09:33:32,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 09:33:32,889 INFO L93 Difference]: Finished difference Result 59 states and 66 transitions. [2022-12-14 09:33:32,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-14 09:33:32,889 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 31 [2022-12-14 09:33:32,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 09:33:32,890 INFO L225 Difference]: With dead ends: 59 [2022-12-14 09:33:32,890 INFO L226 Difference]: Without dead ends: 58 [2022-12-14 09:33:32,890 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-12-14 09:33:32,891 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 27 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 09:33:32,891 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 89 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 09:33:32,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-12-14 09:33:32,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 49. [2022-12-14 09:33:32,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 40 states have (on average 1.25) internal successors, (50), 45 states have internal predecessors, (50), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-14 09:33:32,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 54 transitions. [2022-12-14 09:33:32,898 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 54 transitions. Word has length 31 [2022-12-14 09:33:32,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 09:33:32,898 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 54 transitions. [2022-12-14 09:33:32,898 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-12-14 09:33:32,899 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 54 transitions. [2022-12-14 09:33:32,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-12-14 09:33:32,899 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 09:33:32,899 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 09:33:32,899 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-14 09:33:32,900 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2022-12-14 09:33:32,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 09:33:32,900 INFO L85 PathProgramCache]: Analyzing trace with hash -1446717048, now seen corresponding path program 1 times [2022-12-14 09:33:32,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 09:33:32,900 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806295045] [2022-12-14 09:33:32,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:33:32,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 09:33:32,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:33:33,069 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-14 09:33:33,069 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 09:33:33,069 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806295045] [2022-12-14 09:33:33,069 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [806295045] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 09:33:33,069 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1152194657] [2022-12-14 09:33:33,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:33:33,069 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 09:33:33,069 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f2cb204-05c4-4a98-92c6-7a6b48f1623a/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 09:33:33,070 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f2cb204-05c4-4a98-92c6-7a6b48f1623a/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 09:33:33,071 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f2cb204-05c4-4a98-92c6-7a6b48f1623a/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-14 09:33:33,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:33:33,174 INFO L263 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-14 09:33:33,176 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 09:33:33,226 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-12-14 09:33:33,226 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 09:33:33,285 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-12-14 09:33:33,285 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1152194657] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 09:33:33,286 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [914257832] [2022-12-14 09:33:33,302 INFO L159 IcfgInterpreter]: Started Sifa with 22 locations of interest [2022-12-14 09:33:33,302 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 09:33:33,306 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 09:33:33,311 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 09:33:33,311 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 09:33:33,382 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-12-14 09:33:33,387 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-12-14 09:33:33,395 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:33:33,396 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 22 treesize of output 7 [2022-12-14 09:33:33,402 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:33:33,403 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 22 treesize of output 7 [2022-12-14 09:33:33,414 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:33:33,415 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 16 treesize of output 17 [2022-12-14 09:33:33,672 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-12-14 09:33:33,679 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 7 treesize of output 3 [2022-12-14 09:33:33,688 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 9 treesize of output 3 [2022-12-14 09:33:33,695 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-12-14 09:33:33,703 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 7 treesize of output 3 [2022-12-14 09:33:33,715 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 09:33:33,716 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 09:33:33,718 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 09:33:33,720 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 09:33:33,721 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 09:33:33,892 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 7 treesize of output 3 [2022-12-14 09:33:33,899 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 9 treesize of output 3 [2022-12-14 09:33:33,909 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-12-14 09:33:33,925 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 7 treesize of output 3 [2022-12-14 09:33:33,930 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-12-14 09:33:33,938 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 09:33:33,939 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 09:33:33,940 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 09:33:33,942 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 09:33:33,943 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 09:33:33,984 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:33:33,984 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2022-12-14 09:33:33,996 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2022-12-14 09:33:34,005 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2022-12-14 09:33:34,142 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:33:34,143 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 134 treesize of output 118 [2022-12-14 09:33:34,159 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 09:33:34,160 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 130 treesize of output 118 [2022-12-14 09:33:34,170 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 09:33:34,171 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 126 treesize of output 114 [2022-12-14 09:33:34,227 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-12-14 09:33:34,234 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-12-14 09:33:34,247 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-12-14 09:33:34,419 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 09:33:34,427 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 19 treesize of output 1 [2022-12-14 09:33:34,435 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 19 treesize of output 1 [2022-12-14 09:33:34,603 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 09:33:34,639 INFO L321 Elim1Store]: treesize reduction 25, result has 40.5 percent of original size [2022-12-14 09:33:34,639 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 152 treesize of output 146 [2022-12-14 09:33:34,669 INFO L321 Elim1Store]: treesize reduction 25, result has 40.5 percent of original size [2022-12-14 09:33:34,669 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 148 treesize of output 142 [2022-12-14 09:33:35,006 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 09:33:35,039 INFO L321 Elim1Store]: treesize reduction 25, result has 40.5 percent of original size [2022-12-14 09:33:35,039 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 150 treesize of output 144 [2022-12-14 09:33:35,068 INFO L321 Elim1Store]: treesize reduction 25, result has 40.5 percent of original size [2022-12-14 09:33:35,068 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 146 treesize of output 140 [2022-12-14 09:33:35,490 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:33:35,491 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 138 treesize of output 120 [2022-12-14 09:33:35,499 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 134 treesize of output 122 [2022-12-14 09:33:35,508 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 130 treesize of output 118 [2022-12-14 09:33:35,565 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 54 for LOIs [2022-12-14 09:33:35,641 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 09:33:38,140 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [914257832] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 09:33:38,140 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-12-14 09:33:38,140 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [8, 7, 7] total 27 [2022-12-14 09:33:38,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148923205] [2022-12-14 09:33:38,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 09:33:38,141 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-14 09:33:38,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 09:33:38,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-14 09:33:38,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=572, Unknown=0, NotChecked=0, Total=702 [2022-12-14 09:33:38,142 INFO L87 Difference]: Start difference. First operand 49 states and 54 transitions. Second operand has 17 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 13 states have internal predecessors, (21), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-14 09:33:38,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 09:33:38,968 INFO L93 Difference]: Finished difference Result 59 states and 65 transitions. [2022-12-14 09:33:38,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-14 09:33:38,969 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 13 states have internal predecessors, (21), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 32 [2022-12-14 09:33:38,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 09:33:38,969 INFO L225 Difference]: With dead ends: 59 [2022-12-14 09:33:38,969 INFO L226 Difference]: Without dead ends: 58 [2022-12-14 09:33:38,970 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 65 SyntacticMatches, 12 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 327 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=161, Invalid=769, Unknown=0, NotChecked=0, Total=930 [2022-12-14 09:33:38,970 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 50 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 339 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 347 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 339 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-14 09:33:38,970 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 113 Invalid, 347 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 339 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-14 09:33:38,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-12-14 09:33:38,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 45. [2022-12-14 09:33:38,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 37 states have (on average 1.2162162162162162) internal successors, (45), 41 states have internal predecessors, (45), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-14 09:33:38,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 49 transitions. [2022-12-14 09:33:38,975 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 49 transitions. Word has length 32 [2022-12-14 09:33:38,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 09:33:38,975 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 49 transitions. [2022-12-14 09:33:38,975 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 13 states have internal predecessors, (21), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-14 09:33:38,976 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2022-12-14 09:33:38,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-12-14 09:33:38,976 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 09:33:38,976 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 09:33:38,981 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f2cb204-05c4-4a98-92c6-7a6b48f1623a/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-12-14 09:33:39,176 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f2cb204-05c4-4a98-92c6-7a6b48f1623a/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-12-14 09:33:39,177 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2022-12-14 09:33:39,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 09:33:39,179 INFO L85 PathProgramCache]: Analyzing trace with hash -2007112546, now seen corresponding path program 1 times [2022-12-14 09:33:39,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 09:33:39,179 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299179038] [2022-12-14 09:33:39,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:33:39,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 09:33:39,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:33:39,247 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 09:33:39,247 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 09:33:39,247 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299179038] [2022-12-14 09:33:39,247 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1299179038] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 09:33:39,247 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 09:33:39,247 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 09:33:39,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540586233] [2022-12-14 09:33:39,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 09:33:39,248 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 09:33:39,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 09:33:39,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 09:33:39,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 09:33:39,249 INFO L87 Difference]: Start difference. First operand 45 states and 49 transitions. Second operand has 3 states, 2 states have (on average 14.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-12-14 09:33:39,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 09:33:39,271 INFO L93 Difference]: Finished difference Result 45 states and 49 transitions. [2022-12-14 09:33:39,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 09:33:39,271 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 14.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 34 [2022-12-14 09:33:39,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 09:33:39,272 INFO L225 Difference]: With dead ends: 45 [2022-12-14 09:33:39,272 INFO L226 Difference]: Without dead ends: 44 [2022-12-14 09:33:39,272 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-12-14 09:33:39,277 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 2 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 09:33:39,277 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 60 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 09:33:39,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-12-14 09:33:39,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2022-12-14 09:33:39,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 37 states have (on average 1.1891891891891893) internal successors, (44), 40 states have internal predecessors, (44), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-14 09:33:39,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 48 transitions. [2022-12-14 09:33:39,282 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 48 transitions. Word has length 34 [2022-12-14 09:33:39,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 09:33:39,283 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 48 transitions. [2022-12-14 09:33:39,283 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 14.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-12-14 09:33:39,283 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 48 transitions. [2022-12-14 09:33:39,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-12-14 09:33:39,283 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 09:33:39,283 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 09:33:39,283 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-14 09:33:39,283 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2022-12-14 09:33:39,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 09:33:39,284 INFO L85 PathProgramCache]: Analyzing trace with hash -2090861761, now seen corresponding path program 1 times [2022-12-14 09:33:39,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 09:33:39,284 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056056663] [2022-12-14 09:33:39,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:33:39,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 09:33:39,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:33:39,321 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 09:33:39,321 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 09:33:39,321 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056056663] [2022-12-14 09:33:39,321 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2056056663] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 09:33:39,321 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 09:33:39,321 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 09:33:39,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936341874] [2022-12-14 09:33:39,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 09:33:39,322 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 09:33:39,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 09:33:39,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 09:33:39,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 09:33:39,322 INFO L87 Difference]: Start difference. First operand 44 states and 48 transitions. Second operand has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-12-14 09:33:39,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 09:33:39,358 INFO L93 Difference]: Finished difference Result 44 states and 48 transitions. [2022-12-14 09:33:39,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 09:33:39,359 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 35 [2022-12-14 09:33:39,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 09:33:39,359 INFO L225 Difference]: With dead ends: 44 [2022-12-14 09:33:39,360 INFO L226 Difference]: Without dead ends: 43 [2022-12-14 09:33:39,360 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-12-14 09:33:39,360 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 18 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 09:33:39,360 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 61 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 09:33:39,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-12-14 09:33:39,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2022-12-14 09:33:39,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 37 states have (on average 1.162162162162162) internal successors, (43), 39 states have internal predecessors, (43), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-14 09:33:39,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2022-12-14 09:33:39,365 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 35 [2022-12-14 09:33:39,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 09:33:39,365 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2022-12-14 09:33:39,365 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-12-14 09:33:39,365 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2022-12-14 09:33:39,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-12-14 09:33:39,366 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 09:33:39,366 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 09:33:39,366 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-14 09:33:39,366 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2022-12-14 09:33:39,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 09:33:39,366 INFO L85 PathProgramCache]: Analyzing trace with hash -2090946654, now seen corresponding path program 1 times [2022-12-14 09:33:39,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 09:33:39,366 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731240989] [2022-12-14 09:33:39,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:33:39,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 09:33:39,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:33:39,431 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-14 09:33:39,431 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 09:33:39,431 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731240989] [2022-12-14 09:33:39,431 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [731240989] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 09:33:39,431 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [34700894] [2022-12-14 09:33:39,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:33:39,431 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 09:33:39,431 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f2cb204-05c4-4a98-92c6-7a6b48f1623a/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 09:33:39,432 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f2cb204-05c4-4a98-92c6-7a6b48f1623a/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 09:33:39,433 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f2cb204-05c4-4a98-92c6-7a6b48f1623a/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-14 09:33:39,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:33:39,530 INFO L263 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 5 conjunts are in the unsatisfiable core [2022-12-14 09:33:39,532 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 09:33:39,555 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-12-14 09:33:39,555 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 09:33:39,586 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-12-14 09:33:39,586 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [34700894] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 09:33:39,586 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [103024843] [2022-12-14 09:33:39,588 INFO L159 IcfgInterpreter]: Started Sifa with 30 locations of interest [2022-12-14 09:33:39,588 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 09:33:39,588 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 09:33:39,588 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 09:33:39,588 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 09:33:39,608 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-12-14 09:33:39,610 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-12-14 09:33:39,615 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:33:39,615 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 22 treesize of output 7 [2022-12-14 09:33:39,621 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:33:39,622 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 16 treesize of output 17 [2022-12-14 09:33:39,625 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:33:39,626 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 22 treesize of output 7 [2022-12-14 09:33:39,817 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-12-14 09:33:39,823 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-12-14 09:33:39,830 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 7 treesize of output 3 [2022-12-14 09:33:39,837 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 9 treesize of output 3 [2022-12-14 09:33:39,843 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 7 treesize of output 3 [2022-12-14 09:33:39,850 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 09:33:39,852 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 09:33:39,853 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 09:33:39,854 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 09:33:39,855 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 09:33:40,006 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 7 treesize of output 3 [2022-12-14 09:33:40,013 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-12-14 09:33:40,020 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 7 treesize of output 3 [2022-12-14 09:33:40,027 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 7 treesize of output 3 [2022-12-14 09:33:40,035 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-12-14 09:33:40,044 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 09:33:40,046 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 09:33:40,047 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 09:33:40,049 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 09:33:40,050 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 09:33:40,100 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 09:33:40,101 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:33:40,102 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 189 treesize of output 173 [2022-12-14 09:33:40,113 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 09:33:40,114 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 187 treesize of output 175 [2022-12-14 09:33:40,124 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 09:33:40,125 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 195 treesize of output 94 [2022-12-14 09:33:40,279 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:33:40,280 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 137 treesize of output 121 [2022-12-14 09:33:40,288 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 09:33:40,289 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 133 treesize of output 121 [2022-12-14 09:33:40,297 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 09:33:40,298 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 129 treesize of output 117 [2022-12-14 09:33:40,336 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-12-14 09:33:40,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 11 treesize of output 7 [2022-12-14 09:33:40,349 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-12-14 09:33:40,497 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 19 treesize of output 1 [2022-12-14 09:33:40,504 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 19 treesize of output 1 [2022-12-14 09:33:40,511 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 09:33:40,709 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 19 treesize of output 1 [2022-12-14 09:33:40,717 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 19 treesize of output 1 [2022-12-14 09:33:40,726 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 09:33:40,875 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 09:33:40,883 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 19 treesize of output 1 [2022-12-14 09:33:40,890 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 19 treesize of output 1 [2022-12-14 09:33:41,268 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:33:41,268 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 137 treesize of output 121 [2022-12-14 09:33:41,275 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 09:33:41,275 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 133 treesize of output 121 [2022-12-14 09:33:41,281 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 09:33:41,282 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 125 treesize of output 113 [2022-12-14 09:33:41,339 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 54 for LOIs [2022-12-14 09:33:41,402 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 09:33:44,608 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [103024843] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 09:33:44,608 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-12-14 09:33:44,608 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [6, 6, 6] total 29 [2022-12-14 09:33:44,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097975754] [2022-12-14 09:33:44,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 09:33:44,609 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-12-14 09:33:44,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 09:33:44,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-12-14 09:33:44,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=678, Unknown=0, NotChecked=0, Total=812 [2022-12-14 09:33:44,609 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand has 24 states, 20 states have (on average 1.45) internal successors, (29), 20 states have internal predecessors, (29), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-14 09:33:46,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 09:33:46,876 INFO L93 Difference]: Finished difference Result 69 states and 78 transitions. [2022-12-14 09:33:46,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-12-14 09:33:46,876 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 20 states have (on average 1.45) internal successors, (29), 20 states have internal predecessors, (29), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 35 [2022-12-14 09:33:46,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 09:33:46,877 INFO L225 Difference]: With dead ends: 69 [2022-12-14 09:33:46,877 INFO L226 Difference]: Without dead ends: 57 [2022-12-14 09:33:46,878 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 73 SyntacticMatches, 9 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 255 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=210, Invalid=1122, Unknown=0, NotChecked=0, Total=1332 [2022-12-14 09:33:46,878 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 69 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 559 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 571 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 559 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-12-14 09:33:46,878 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 73 Invalid, 571 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 559 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-12-14 09:33:46,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-12-14 09:33:46,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 46. [2022-12-14 09:33:46,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 40 states have (on average 1.15) internal successors, (46), 42 states have internal predecessors, (46), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-14 09:33:46,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 50 transitions. [2022-12-14 09:33:46,884 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 50 transitions. Word has length 35 [2022-12-14 09:33:46,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 09:33:46,884 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 50 transitions. [2022-12-14 09:33:46,884 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 20 states have (on average 1.45) internal successors, (29), 20 states have internal predecessors, (29), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-14 09:33:46,885 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 50 transitions. [2022-12-14 09:33:46,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-12-14 09:33:46,885 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 09:33:46,885 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 09:33:46,890 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f2cb204-05c4-4a98-92c6-7a6b48f1623a/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-12-14 09:33:47,086 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f2cb204-05c4-4a98-92c6-7a6b48f1623a/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 09:33:47,087 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2022-12-14 09:33:47,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 09:33:47,088 INFO L85 PathProgramCache]: Analyzing trace with hash -1480952228, now seen corresponding path program 1 times [2022-12-14 09:33:47,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 09:33:47,089 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918426809] [2022-12-14 09:33:47,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:33:47,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 09:33:47,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:33:47,198 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-12-14 09:33:47,199 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 09:33:47,199 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918426809] [2022-12-14 09:33:47,199 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1918426809] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 09:33:47,199 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [460546781] [2022-12-14 09:33:47,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:33:47,199 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 09:33:47,199 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f2cb204-05c4-4a98-92c6-7a6b48f1623a/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 09:33:47,200 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f2cb204-05c4-4a98-92c6-7a6b48f1623a/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 09:33:47,201 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f2cb204-05c4-4a98-92c6-7a6b48f1623a/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-12-14 09:33:47,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:33:47,310 INFO L263 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 5 conjunts are in the unsatisfiable core [2022-12-14 09:33:47,312 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 09:33:47,336 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-12-14 09:33:47,336 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 09:33:47,367 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-12-14 09:33:47,367 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [460546781] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 09:33:47,368 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1352601575] [2022-12-14 09:33:47,370 INFO L159 IcfgInterpreter]: Started Sifa with 30 locations of interest [2022-12-14 09:33:47,370 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 09:33:47,370 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 09:33:47,370 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 09:33:47,371 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 09:33:47,391 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-12-14 09:33:47,394 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-12-14 09:33:47,399 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:33:47,399 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 22 treesize of output 7 [2022-12-14 09:33:47,406 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:33:47,406 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 16 treesize of output 17 [2022-12-14 09:33:47,411 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:33:47,412 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 22 treesize of output 7 [2022-12-14 09:33:47,493 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 7 treesize of output 3 [2022-12-14 09:33:47,501 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 7 treesize of output 3 [2022-12-14 09:33:47,507 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 7 treesize of output 3 [2022-12-14 09:33:47,513 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-12-14 09:33:47,518 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-12-14 09:33:47,551 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-12-14 09:33:47,557 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 7 treesize of output 3 [2022-12-14 09:33:47,563 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 7 treesize of output 3 [2022-12-14 09:33:47,569 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 7 treesize of output 3 [2022-12-14 09:33:47,575 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-12-14 09:33:47,610 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2022-12-14 09:33:47,617 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:33:47,618 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2022-12-14 09:33:47,625 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2022-12-14 09:33:47,676 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-12-14 09:33:47,683 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 7 treesize of output 3 [2022-12-14 09:33:47,688 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 7 treesize of output 3 [2022-12-14 09:33:47,694 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 7 treesize of output 3 [2022-12-14 09:33:47,700 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-12-14 09:33:47,737 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 7 treesize of output 3 [2022-12-14 09:33:47,747 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 7 treesize of output 3 [2022-12-14 09:33:47,753 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-12-14 09:33:47,762 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 7 treesize of output 3 [2022-12-14 09:33:47,768 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-12-14 09:33:47,804 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2022-12-14 09:33:47,812 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2022-12-14 09:33:47,820 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:33:47,821 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2022-12-14 09:33:47,888 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 11 [2022-12-14 09:33:47,904 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-12-14 09:33:47,904 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 19 treesize of output 18 [2022-12-14 09:33:47,922 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-12-14 09:33:47,922 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 19 treesize of output 18 [2022-12-14 09:33:48,107 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 09:33:48,108 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 09:33:48,146 INFO L321 Elim1Store]: treesize reduction 130, result has 12.2 percent of original size [2022-12-14 09:33:48,146 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 347 treesize of output 325 [2022-12-14 09:33:48,166 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 09:33:48,166 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 09:33:48,203 INFO L321 Elim1Store]: treesize reduction 130, result has 12.2 percent of original size [2022-12-14 09:33:48,203 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 347 treesize of output 325 [2022-12-14 09:33:48,236 INFO L321 Elim1Store]: treesize reduction 21, result has 34.4 percent of original size [2022-12-14 09:33:48,237 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 341 treesize of output 340 [2022-12-14 09:33:48,819 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 19 treesize of output 1 [2022-12-14 09:33:48,829 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 09:33:48,836 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 19 treesize of output 1 [2022-12-14 09:33:49,009 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 09:33:49,030 INFO L321 Elim1Store]: treesize reduction 35, result has 16.7 percent of original size [2022-12-14 09:33:49,030 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 263 treesize of output 247 [2022-12-14 09:33:49,057 INFO L321 Elim1Store]: treesize reduction 35, result has 16.7 percent of original size [2022-12-14 09:33:49,058 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 263 treesize of output 247 [2022-12-14 09:33:49,845 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 7 treesize of output 3 [2022-12-14 09:33:49,849 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 7 treesize of output 3 [2022-12-14 09:33:49,854 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-12-14 09:33:49,859 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 7 treesize of output 3 [2022-12-14 09:33:49,865 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-12-14 09:33:49,897 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-12-14 09:33:49,903 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 7 treesize of output 3 [2022-12-14 09:33:49,909 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-12-14 09:33:49,914 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 7 treesize of output 3 [2022-12-14 09:33:49,918 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 7 treesize of output 3 [2022-12-14 09:33:49,968 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 09:33:49,969 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:33:49,970 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 189 treesize of output 173 [2022-12-14 09:33:49,976 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 09:33:49,977 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 187 treesize of output 175 [2022-12-14 09:33:49,987 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 09:33:49,988 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 195 treesize of output 94 [2022-12-14 09:33:50,018 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 79 for LOIs [2022-12-14 09:33:50,109 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 09:33:55,645 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [1352601575] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 09:33:55,646 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-12-14 09:33:55,646 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [6, 6, 6] total 29 [2022-12-14 09:33:55,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572561888] [2022-12-14 09:33:55,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 09:33:55,646 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-12-14 09:33:55,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 09:33:55,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-12-14 09:33:55,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=708, Unknown=0, NotChecked=0, Total=812 [2022-12-14 09:33:55,647 INFO L87 Difference]: Start difference. First operand 46 states and 50 transitions. Second operand has 24 states, 20 states have (on average 1.5) internal successors, (30), 20 states have internal predecessors, (30), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-14 09:33:59,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 09:33:59,770 INFO L93 Difference]: Finished difference Result 84 states and 94 transitions. [2022-12-14 09:33:59,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-12-14 09:33:59,771 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 20 states have (on average 1.5) internal successors, (30), 20 states have internal predecessors, (30), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 38 [2022-12-14 09:33:59,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 09:33:59,771 INFO L225 Difference]: With dead ends: 84 [2022-12-14 09:33:59,771 INFO L226 Difference]: Without dead ends: 56 [2022-12-14 09:33:59,772 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 80 SyntacticMatches, 11 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 292 ImplicationChecksByTransitivity, 8.7s TimeCoverageRelationStatistics Valid=219, Invalid=1421, Unknown=0, NotChecked=0, Total=1640 [2022-12-14 09:33:59,772 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 25 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 647 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 662 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 647 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-12-14 09:33:59,772 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 74 Invalid, 662 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 647 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-12-14 09:33:59,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-12-14 09:33:59,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 48. [2022-12-14 09:33:59,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 42 states have (on average 1.1666666666666667) internal successors, (49), 44 states have internal predecessors, (49), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-14 09:33:59,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 53 transitions. [2022-12-14 09:33:59,781 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 53 transitions. Word has length 38 [2022-12-14 09:33:59,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 09:33:59,782 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 53 transitions. [2022-12-14 09:33:59,782 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 20 states have (on average 1.5) internal successors, (30), 20 states have internal predecessors, (30), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-14 09:33:59,782 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 53 transitions. [2022-12-14 09:33:59,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-12-14 09:33:59,782 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 09:33:59,782 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 09:33:59,787 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f2cb204-05c4-4a98-92c6-7a6b48f1623a/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-12-14 09:33:59,983 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f2cb204-05c4-4a98-92c6-7a6b48f1623a/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-12-14 09:33:59,984 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2022-12-14 09:33:59,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 09:33:59,985 INFO L85 PathProgramCache]: Analyzing trace with hash 1337753016, now seen corresponding path program 1 times [2022-12-14 09:33:59,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 09:33:59,986 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734641508] [2022-12-14 09:33:59,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:33:59,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 09:34:00,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:34:00,081 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-12-14 09:34:00,081 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 09:34:00,081 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734641508] [2022-12-14 09:34:00,081 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [734641508] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 09:34:00,081 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [194202995] [2022-12-14 09:34:00,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:34:00,082 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 09:34:00,082 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f2cb204-05c4-4a98-92c6-7a6b48f1623a/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 09:34:00,083 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f2cb204-05c4-4a98-92c6-7a6b48f1623a/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 09:34:00,083 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f2cb204-05c4-4a98-92c6-7a6b48f1623a/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-12-14 09:34:00,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:34:00,184 INFO L263 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 5 conjunts are in the unsatisfiable core [2022-12-14 09:34:00,187 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 09:34:00,213 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 09:34:00,213 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 09:34:00,250 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 09:34:00,250 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [194202995] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 09:34:00,250 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [334709467] [2022-12-14 09:34:00,253 INFO L159 IcfgInterpreter]: Started Sifa with 33 locations of interest [2022-12-14 09:34:00,253 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 09:34:00,253 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 09:34:00,253 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 09:34:00,254 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 09:34:00,273 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-12-14 09:34:00,276 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-12-14 09:34:00,284 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:34:00,284 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 16 treesize of output 17 [2022-12-14 09:34:00,289 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:34:00,289 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 22 treesize of output 7 [2022-12-14 09:34:00,294 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:34:00,294 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 22 treesize of output 7 [2022-12-14 09:34:00,372 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-12-14 09:34:00,379 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 7 treesize of output 3 [2022-12-14 09:34:00,386 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 7 treesize of output 3 [2022-12-14 09:34:00,393 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-12-14 09:34:00,399 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 7 treesize of output 3 [2022-12-14 09:34:00,428 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 7 treesize of output 3 [2022-12-14 09:34:00,434 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 7 treesize of output 3 [2022-12-14 09:34:00,442 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-12-14 09:34:00,448 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-12-14 09:34:00,455 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 7 treesize of output 3 [2022-12-14 09:34:00,496 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 09:34:00,497 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:34:00,498 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 189 treesize of output 173 [2022-12-14 09:34:00,507 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 09:34:00,508 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 187 treesize of output 175 [2022-12-14 09:34:00,517 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 09:34:00,518 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 203 treesize of output 98 [2022-12-14 09:34:00,573 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 7 treesize of output 3 [2022-12-14 09:34:00,577 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 7 treesize of output 3 [2022-12-14 09:34:00,583 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-12-14 09:34:00,589 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-12-14 09:34:00,595 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 7 treesize of output 3 [2022-12-14 09:34:00,622 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 7 treesize of output 3 [2022-12-14 09:34:00,629 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 7 treesize of output 3 [2022-12-14 09:34:00,636 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-12-14 09:34:00,644 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-12-14 09:34:00,650 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 7 treesize of output 3 [2022-12-14 09:34:00,687 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 09:34:00,688 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:34:00,689 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 189 treesize of output 173 [2022-12-14 09:34:00,697 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 09:34:00,698 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 187 treesize of output 175 [2022-12-14 09:34:00,713 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 09:34:00,714 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 195 treesize of output 94 [2022-12-14 09:34:00,759 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-12-14 09:34:00,759 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2022-12-14 09:34:00,770 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:34:00,770 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-12-14 09:34:00,789 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-12-14 09:34:00,789 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 25 [2022-12-14 09:34:01,110 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 09:34:01,110 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 09:34:01,154 INFO L321 Elim1Store]: treesize reduction 126, result has 14.9 percent of original size [2022-12-14 09:34:01,154 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 442 treesize of output 408 [2022-12-14 09:34:01,194 INFO L321 Elim1Store]: treesize reduction 23, result has 36.1 percent of original size [2022-12-14 09:34:01,194 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 436 treesize of output 433 [2022-12-14 09:34:01,217 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 09:34:01,218 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 09:34:01,251 INFO L321 Elim1Store]: treesize reduction 130, result has 12.2 percent of original size [2022-12-14 09:34:01,251 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 430 treesize of output 408 [2022-12-14 09:34:02,253 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 19 treesize of output 1 [2022-12-14 09:34:02,263 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 19 treesize of output 1 [2022-12-14 09:34:02,269 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 09:34:02,384 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 09:34:02,412 INFO L321 Elim1Store]: treesize reduction 35, result has 16.7 percent of original size [2022-12-14 09:34:02,412 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 260 treesize of output 244 [2022-12-14 09:34:02,441 INFO L321 Elim1Store]: treesize reduction 35, result has 16.7 percent of original size [2022-12-14 09:34:02,441 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 260 treesize of output 244 [2022-12-14 09:34:03,223 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 7 treesize of output 3 [2022-12-14 09:34:03,227 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-12-14 09:34:03,231 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-12-14 09:34:03,237 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 7 treesize of output 3 [2022-12-14 09:34:03,241 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 7 treesize of output 3 [2022-12-14 09:34:03,263 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 7 treesize of output 3 [2022-12-14 09:34:03,267 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-12-14 09:34:03,273 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 7 treesize of output 3 [2022-12-14 09:34:03,278 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 7 treesize of output 3 [2022-12-14 09:34:03,285 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-12-14 09:34:03,308 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2022-12-14 09:34:03,313 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2022-12-14 09:34:03,321 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:34:03,321 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2022-12-14 09:34:03,338 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 79 for LOIs [2022-12-14 09:34:03,420 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 09:34:09,831 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [334709467] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 09:34:09,831 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-12-14 09:34:09,831 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [6, 6, 6] total 31 [2022-12-14 09:34:09,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930687029] [2022-12-14 09:34:09,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 09:34:09,832 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-12-14 09:34:09,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 09:34:09,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-12-14 09:34:09,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=810, Unknown=0, NotChecked=0, Total=930 [2022-12-14 09:34:09,833 INFO L87 Difference]: Start difference. First operand 48 states and 53 transitions. Second operand has 26 states, 22 states have (on average 1.5) internal successors, (33), 22 states have internal predecessors, (33), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-14 09:34:13,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 09:34:13,767 INFO L93 Difference]: Finished difference Result 66 states and 72 transitions. [2022-12-14 09:34:13,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-12-14 09:34:13,768 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 22 states have (on average 1.5) internal successors, (33), 22 states have internal predecessors, (33), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 39 [2022-12-14 09:34:13,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 09:34:13,768 INFO L225 Difference]: With dead ends: 66 [2022-12-14 09:34:13,768 INFO L226 Difference]: Without dead ends: 64 [2022-12-14 09:34:13,768 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 81 SyntacticMatches, 11 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 336 ImplicationChecksByTransitivity, 9.2s TimeCoverageRelationStatistics Valid=235, Invalid=1571, Unknown=0, NotChecked=0, Total=1806 [2022-12-14 09:34:13,769 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 63 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 761 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 782 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 761 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-12-14 09:34:13,769 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 122 Invalid, 782 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 761 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-12-14 09:34:13,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-12-14 09:34:13,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 54. [2022-12-14 09:34:13,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 48 states have (on average 1.1458333333333333) internal successors, (55), 50 states have internal predecessors, (55), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-14 09:34:13,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 59 transitions. [2022-12-14 09:34:13,781 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 59 transitions. Word has length 39 [2022-12-14 09:34:13,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 09:34:13,781 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 59 transitions. [2022-12-14 09:34:13,781 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 22 states have (on average 1.5) internal successors, (33), 22 states have internal predecessors, (33), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-14 09:34:13,781 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 59 transitions. [2022-12-14 09:34:13,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-12-14 09:34:13,782 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 09:34:13,782 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 09:34:13,786 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f2cb204-05c4-4a98-92c6-7a6b48f1623a/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-12-14 09:34:13,982 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f2cb204-05c4-4a98-92c6-7a6b48f1623a/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-12-14 09:34:13,983 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2022-12-14 09:34:13,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 09:34:13,984 INFO L85 PathProgramCache]: Analyzing trace with hash -956446587, now seen corresponding path program 1 times [2022-12-14 09:34:13,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 09:34:13,985 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485501836] [2022-12-14 09:34:13,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:34:13,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 09:34:14,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:34:14,076 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-12-14 09:34:14,076 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 09:34:14,076 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485501836] [2022-12-14 09:34:14,076 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [485501836] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 09:34:14,076 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1988961025] [2022-12-14 09:34:14,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:34:14,076 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 09:34:14,076 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f2cb204-05c4-4a98-92c6-7a6b48f1623a/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 09:34:14,077 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f2cb204-05c4-4a98-92c6-7a6b48f1623a/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 09:34:14,078 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f2cb204-05c4-4a98-92c6-7a6b48f1623a/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-12-14 09:34:14,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:34:14,202 INFO L263 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 5 conjunts are in the unsatisfiable core [2022-12-14 09:34:14,204 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 09:34:14,228 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-12-14 09:34:14,228 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 09:34:14,262 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-12-14 09:34:14,262 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1988961025] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 09:34:14,262 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [688425160] [2022-12-14 09:34:14,265 INFO L159 IcfgInterpreter]: Started Sifa with 33 locations of interest [2022-12-14 09:34:14,265 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 09:34:14,265 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 09:34:14,265 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 09:34:14,265 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 09:34:14,282 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-12-14 09:34:14,285 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-12-14 09:34:14,291 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:34:14,291 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 22 treesize of output 7 [2022-12-14 09:34:14,296 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:34:14,296 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 22 treesize of output 7 [2022-12-14 09:34:14,303 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:34:14,304 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 16 treesize of output 17 [2022-12-14 09:34:14,378 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 7 treesize of output 3 [2022-12-14 09:34:14,384 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-12-14 09:34:14,391 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 7 treesize of output 3 [2022-12-14 09:34:14,398 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-12-14 09:34:14,405 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 7 treesize of output 3 [2022-12-14 09:34:14,429 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-12-14 09:34:14,436 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-12-14 09:34:14,443 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 7 treesize of output 3 [2022-12-14 09:34:14,448 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 7 treesize of output 3 [2022-12-14 09:34:14,455 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 7 treesize of output 3 [2022-12-14 09:34:14,476 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:34:14,477 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2022-12-14 09:34:14,485 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2022-12-14 09:34:14,495 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2022-12-14 09:34:14,543 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 7 treesize of output 3 [2022-12-14 09:34:14,550 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 7 treesize of output 3 [2022-12-14 09:34:14,556 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-12-14 09:34:14,566 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-12-14 09:34:14,572 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 7 treesize of output 3 [2022-12-14 09:34:14,599 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 7 treesize of output 3 [2022-12-14 09:34:14,606 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-12-14 09:34:14,614 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 7 treesize of output 3 [2022-12-14 09:34:14,620 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-12-14 09:34:14,628 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 7 treesize of output 3 [2022-12-14 09:34:14,646 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2022-12-14 09:34:14,655 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2022-12-14 09:34:14,665 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:34:14,665 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2022-12-14 09:34:14,712 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-12-14 09:34:14,712 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 19 treesize of output 18 [2022-12-14 09:34:14,724 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 11 [2022-12-14 09:34:14,744 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-12-14 09:34:14,744 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 19 treesize of output 18 [2022-12-14 09:34:14,921 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 09:34:14,922 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 09:34:14,958 INFO L321 Elim1Store]: treesize reduction 130, result has 12.2 percent of original size [2022-12-14 09:34:14,958 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 347 treesize of output 325 [2022-12-14 09:34:14,976 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 09:34:14,976 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 09:34:15,009 INFO L321 Elim1Store]: treesize reduction 126, result has 14.9 percent of original size [2022-12-14 09:34:15,010 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 347 treesize of output 329 [2022-12-14 09:34:15,040 INFO L321 Elim1Store]: treesize reduction 21, result has 34.4 percent of original size [2022-12-14 09:34:15,041 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 341 treesize of output 340 [2022-12-14 09:34:15,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 13 treesize of output 9 [2022-12-14 09:34:15,475 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 19 treesize of output 1 [2022-12-14 09:34:15,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 19 treesize of output 1 [2022-12-14 09:34:15,609 INFO L321 Elim1Store]: treesize reduction 35, result has 16.7 percent of original size [2022-12-14 09:34:15,609 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 263 treesize of output 247 [2022-12-14 09:34:15,630 INFO L321 Elim1Store]: treesize reduction 35, result has 16.7 percent of original size [2022-12-14 09:34:15,630 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 263 treesize of output 247 [2022-12-14 09:34:15,657 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 09:34:16,750 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 7 treesize of output 3 [2022-12-14 09:34:16,756 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 7 treesize of output 3 [2022-12-14 09:34:16,762 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-12-14 09:34:16,768 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 7 treesize of output 3 [2022-12-14 09:34:16,774 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-12-14 09:34:16,802 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 7 treesize of output 3 [2022-12-14 09:34:16,807 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 7 treesize of output 3 [2022-12-14 09:34:16,815 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-12-14 09:34:16,822 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-12-14 09:34:16,829 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 7 treesize of output 3 [2022-12-14 09:34:16,876 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 09:34:16,877 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:34:16,879 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 189 treesize of output 173 [2022-12-14 09:34:16,886 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 09:34:16,887 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 187 treesize of output 175 [2022-12-14 09:34:16,894 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 09:34:16,894 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 203 treesize of output 98 [2022-12-14 09:34:16,921 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 75 for LOIs [2022-12-14 09:34:17,016 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 09:34:23,325 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [688425160] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 09:34:23,325 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-12-14 09:34:23,325 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [6, 6, 6] total 32 [2022-12-14 09:34:23,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010222784] [2022-12-14 09:34:23,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 09:34:23,326 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-12-14 09:34:23,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 09:34:23,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-12-14 09:34:23,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=865, Unknown=0, NotChecked=0, Total=992 [2022-12-14 09:34:23,326 INFO L87 Difference]: Start difference. First operand 54 states and 59 transitions. Second operand has 27 states, 23 states have (on average 1.4782608695652173) internal successors, (34), 23 states have internal predecessors, (34), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-14 09:34:33,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 09:34:33,936 INFO L93 Difference]: Finished difference Result 61 states and 69 transitions. [2022-12-14 09:34:33,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-12-14 09:34:33,937 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 23 states have (on average 1.4782608695652173) internal successors, (34), 23 states have internal predecessors, (34), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 45 [2022-12-14 09:34:33,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 09:34:33,937 INFO L225 Difference]: With dead ends: 61 [2022-12-14 09:34:33,937 INFO L226 Difference]: Without dead ends: 0 [2022-12-14 09:34:33,939 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 97 SyntacticMatches, 12 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 602 ImplicationChecksByTransitivity, 15.4s TimeCoverageRelationStatistics Valid=408, Invalid=2562, Unknown=0, NotChecked=0, Total=2970 [2022-12-14 09:34:33,939 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 41 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1034 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 1059 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 1034 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-12-14 09:34:33,939 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 2 Invalid, 1059 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 1034 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-12-14 09:34:33,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-12-14 09:34:33,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-12-14 09:34:33,940 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-12-14 09:34:33,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-12-14 09:34:33,940 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 45 [2022-12-14 09:34:33,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 09:34:33,940 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-12-14 09:34:33,940 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 23 states have (on average 1.4782608695652173) internal successors, (34), 23 states have internal predecessors, (34), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-14 09:34:33,940 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-12-14 09:34:33,940 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-12-14 09:34:33,942 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 18 remaining) [2022-12-14 09:34:33,943 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 18 remaining) [2022-12-14 09:34:33,943 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 18 remaining) [2022-12-14 09:34:33,943 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 18 remaining) [2022-12-14 09:34:33,943 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 18 remaining) [2022-12-14 09:34:33,943 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 18 remaining) [2022-12-14 09:34:33,943 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 18 remaining) [2022-12-14 09:34:33,943 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 18 remaining) [2022-12-14 09:34:33,943 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 18 remaining) [2022-12-14 09:34:33,943 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 18 remaining) [2022-12-14 09:34:33,944 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 18 remaining) [2022-12-14 09:34:33,944 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 18 remaining) [2022-12-14 09:34:33,944 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 18 remaining) [2022-12-14 09:34:33,944 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 18 remaining) [2022-12-14 09:34:33,944 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 18 remaining) [2022-12-14 09:34:33,944 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 18 remaining) [2022-12-14 09:34:33,944 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 18 remaining) [2022-12-14 09:34:33,944 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 18 remaining) [2022-12-14 09:34:33,949 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f2cb204-05c4-4a98-92c6-7a6b48f1623a/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-12-14 09:34:34,144 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f2cb204-05c4-4a98-92c6-7a6b48f1623a/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 09:34:34,150 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-12-14 09:34:39,998 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 625) no Hoare annotation was computed. [2022-12-14 09:34:39,998 INFO L899 garLoopResultBuilder]: For program point L630(line 630) no Hoare annotation was computed. [2022-12-14 09:34:39,998 INFO L899 garLoopResultBuilder]: For program point L630-1(line 630) no Hoare annotation was computed. [2022-12-14 09:34:39,998 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW(line 609) no Hoare annotation was computed. [2022-12-14 09:34:39,998 INFO L902 garLoopResultBuilder]: At program point main_returnLabel#1(lines 620 639) the Hoare annotation is: true [2022-12-14 09:34:39,998 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW(line 616) no Hoare annotation was computed. [2022-12-14 09:34:39,999 INFO L895 garLoopResultBuilder]: At program point L614-2(lines 614 617) the Hoare annotation is: (and (let ((.cse0 (<= 2 |ULTIMATE.start_sll_circular_create_#in~len#1|)) (.cse1 (<= |ULTIMATE.start_sll_circular_create_#in~data#1| 1)) (.cse2 (<= |ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0)) (.cse3 (= |ULTIMATE.start_sll_circular_update_at_#in~head#1.base| |ULTIMATE.start_main_~s~0#1.base|)) (.cse4 (<= |ULTIMATE.start_sll_circular_create_#res#1.offset| 0)) (.cse5 (<= 0 |ULTIMATE.start_sll_circular_create_~last~0#1.offset|)) (.cse6 (<= 1 |ULTIMATE.start_sll_circular_create_~data#1|)) (.cse7 (<= 0 |ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (.cse8 (<= 1 |ULTIMATE.start_sll_circular_create_#in~data#1|)) (.cse9 (= |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_sll_circular_update_at_#in~index#1|)) (.cse10 (= |ULTIMATE.start_main_~s~0#1.offset| |ULTIMATE.start_sll_circular_update_at_#in~head#1.offset|)) (.cse11 (<= |ULTIMATE.start_sll_circular_create_~len#1| 1)) (.cse12 (= |ULTIMATE.start_main_~data~0#1| 1)) (.cse13 (<= |ULTIMATE.start_sll_circular_create_~data#1| 1)) (.cse14 (= (+ |ULTIMATE.start_main_~len~0#1| |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~new_data~0#1|)) (.cse15 (<= |ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0)) (.cse16 (= |ULTIMATE.start_sll_circular_update_at_#in~data#1| |ULTIMATE.start_sll_circular_update_at_~data#1|)) (.cse17 (= |ULTIMATE.start_sll_circular_update_at_#in~data#1| |ULTIMATE.start_main_~new_data~0#1|))) (or (and .cse0 .cse1 .cse2 .cse3 (< 0 (+ |ULTIMATE.start_main_~i~0#1| 1)) (= |ULTIMATE.start_sll_circular_update_at_#in~head#1.offset| |ULTIMATE.start_sll_circular_update_at_~head#1.offset|) (= |ULTIMATE.start_sll_circular_update_at_#in~head#1.base| |ULTIMATE.start_sll_circular_update_at_~head#1.base|) .cse4 (<= |ULTIMATE.start_sll_circular_create_#in~len#1| 2) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (= |ULTIMATE.start_sll_circular_update_at_~index#1| |ULTIMATE.start_sll_circular_update_at_#in~index#1|) .cse14 .cse15 .cse16 .cse17) (and .cse0 (< 0 |ULTIMATE.start_sll_circular_update_at_#in~index#1|) .cse1 .cse2 (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_update_at_#in~head#1.base|) |ULTIMATE.start_sll_circular_update_at_#in~head#1.offset|) |ULTIMATE.start_sll_circular_update_at_~head#1.offset|) .cse3 (= |ULTIMATE.start_sll_circular_update_at_#in~index#1| (+ |ULTIMATE.start_sll_circular_update_at_~index#1| 1)) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (= |ULTIMATE.start_sll_circular_update_at_~head#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_update_at_#in~head#1.base|) |ULTIMATE.start_sll_circular_update_at_#in~head#1.offset|)) .cse15 .cse16 .cse17))) (or (let ((.cse18 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) (and (< |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |#StackHeapBarrier|) (< .cse18 |#StackHeapBarrier|) (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |ULTIMATE.start_sll_circular_create_~last~0#1.offset|)) (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) (= (+ |ULTIMATE.start_sll_circular_create_~len#1| 1) |ULTIMATE.start_sll_circular_create_#in~len#1|) (= (select (select |#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) (+ |ULTIMATE.start_sll_circular_create_~new_head~0#1.offset| 4)) |ULTIMATE.start_sll_circular_create_~data#1|) (= |ULTIMATE.start_sll_circular_create_~head~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |ULTIMATE.start_sll_circular_create_~last~0#1.offset|)) (= (select |#valid| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) 1) (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_#res#1.base|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) 0) (= 8 (select |#length| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base|)) (not (= 0 .cse18)) (= |ULTIMATE.start_sll_circular_create_#res#1.base| |ULTIMATE.start_main_~s~0#1.base|) (not (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| 0)) (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| .cse18) (< 0 |#StackHeapBarrier|))) (and (<= 1 |ULTIMATE.start_sll_circular_create_~len#1|) (<= |ULTIMATE.start_main_~i~0#1| 0))) (= |ULTIMATE.start_main_~len~0#1| 2) (= |#NULL.offset| 0) (<= 0 |ULTIMATE.start_sll_circular_update_at_#in~head#1.offset|) (<= 0 |ULTIMATE.start_sll_circular_create_#res#1.offset|) (<= |ULTIMATE.start_main_~new_data~0#1| 3) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.offset| 0) (<= 0 |#StackHeapBarrier|) (<= |ULTIMATE.start_main_~s~0#1.offset| 0) (= |#NULL.base| 0)) [2022-12-14 09:34:39,999 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 590) no Hoare annotation was computed. [2022-12-14 09:34:40,000 INFO L895 garLoopResultBuilder]: At program point L631(lines 631 633) the Hoare annotation is: (and (<= |ULTIMATE.start_main_#t~ret17#1| 2147483647) (<= 2 |ULTIMATE.start_sll_circular_create_#in~len#1|) (<= |ULTIMATE.start_sll_circular_update_at_#in~head#1.offset| 0) (<= |ULTIMATE.start_sll_circular_update_at_#in~data#1| 3) (<= |ULTIMATE.start_sll_circular_get_data_at_~index#1| 0) (<= |ULTIMATE.start_sll_circular_create_#in~data#1| 1) (<= 1 |ULTIMATE.start_sll_circular_create_~len#1|) (<= 0 (+ |ULTIMATE.start_main_#t~ret17#1| 2147483648)) (<= |ULTIMATE.start_sll_circular_create_#res#1.offset| 0) (<= |ULTIMATE.start_sll_circular_create_#in~len#1| 2) (<= |ULTIMATE.start_sll_circular_update_at_~data#1| 3) (<= 1 |ULTIMATE.start_sll_circular_create_~data#1|) (<= 0 |ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (= |ULTIMATE.start_sll_circular_get_data_at_#res#1| (select (select |#memory_int| |ULTIMATE.start_sll_circular_get_data_at_~head#1.base|) (+ |ULTIMATE.start_sll_circular_get_data_at_~head#1.offset| 4))) (<= 1 |ULTIMATE.start_sll_circular_create_#in~data#1|) (<= |ULTIMATE.start_sll_circular_update_at_~index#1| 0) (<= |ULTIMATE.start_sll_circular_create_~len#1| 1) (<= |ULTIMATE.start_sll_circular_update_at_#in~index#1| 1) (<= |ULTIMATE.start_sll_circular_create_~data#1| 1) (<= |ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (let ((.cse0 (= |ULTIMATE.start_main_~s~0#1.offset| |ULTIMATE.start_sll_circular_get_data_at_#in~head#1.offset|)) (.cse1 (= |ULTIMATE.start_main_~s~0#1.base| |ULTIMATE.start_sll_circular_get_data_at_#in~head#1.base|)) (.cse2 (= |ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0)) (.cse3 (= (+ |ULTIMATE.start_main_~len~0#1| |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~expected~0#1|)) (.cse4 (= |ULTIMATE.start_main_~data~0#1| 1)) (.cse5 (= |ULTIMATE.start_main_~len~0#1| 2)) (.cse6 (= |#NULL.offset| 0)) (.cse7 (= |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_sll_circular_get_data_at_#in~index#1|)) (.cse8 (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.offset| 0)) (.cse9 (= |#NULL.base| 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_get_data_at_#in~head#1.base|) |ULTIMATE.start_sll_circular_get_data_at_#in~head#1.offset|) |ULTIMATE.start_sll_circular_get_data_at_~head#1.offset|) .cse5 .cse6 .cse7 (< 0 |ULTIMATE.start_sll_circular_get_data_at_#in~index#1|) (= (+ |ULTIMATE.start_sll_circular_get_data_at_~index#1| 1) |ULTIMATE.start_sll_circular_get_data_at_#in~index#1|) .cse8 (= |ULTIMATE.start_sll_circular_get_data_at_~head#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_get_data_at_#in~head#1.base|) |ULTIMATE.start_sll_circular_get_data_at_#in~head#1.offset|)) .cse9) (and .cse0 .cse1 .cse2 (< 0 (+ |ULTIMATE.start_main_~i~0#1| 1)) .cse3 .cse4 (= |ULTIMATE.start_sll_circular_get_data_at_~index#1| |ULTIMATE.start_sll_circular_get_data_at_#in~index#1|) .cse5 .cse6 .cse7 (= |ULTIMATE.start_sll_circular_get_data_at_~head#1.offset| |ULTIMATE.start_sll_circular_get_data_at_#in~head#1.offset|) .cse8 (= |ULTIMATE.start_sll_circular_get_data_at_~head#1.base| |ULTIMATE.start_sll_circular_get_data_at_#in~head#1.base|) .cse9))) (= |ULTIMATE.start_sll_circular_get_data_at_#res#1| |ULTIMATE.start_main_#t~ret17#1|) (<= 0 |ULTIMATE.start_sll_circular_get_data_at_#in~head#1.offset|) (<= 0 |ULTIMATE.start_sll_circular_update_at_#in~head#1.offset|) (<= 0 |ULTIMATE.start_sll_circular_create_#res#1.offset|) (<= |ULTIMATE.start_main_~new_data~0#1| 3) (<= 0 |#StackHeapBarrier|) (<= |ULTIMATE.start_main_~s~0#1.offset| 0)) [2022-12-14 09:34:40,000 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW(line 629) no Hoare annotation was computed. [2022-12-14 09:34:40,000 INFO L902 garLoopResultBuilder]: At program point L598-2(lines 598 602) the Hoare annotation is: true [2022-12-14 09:34:40,000 INFO L899 garLoopResultBuilder]: For program point L590(line 590) no Hoare annotation was computed. [2022-12-14 09:34:40,000 INFO L899 garLoopResultBuilder]: For program point L590-1(line 590) no Hoare annotation was computed. [2022-12-14 09:34:40,000 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW(line 625) no Hoare annotation was computed. [2022-12-14 09:34:40,000 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 590) no Hoare annotation was computed. [2022-12-14 09:34:40,000 INFO L895 garLoopResultBuilder]: At program point L607-2(lines 607 610) the Hoare annotation is: (let ((.cse0 (<= 2 |ULTIMATE.start_sll_circular_create_#in~len#1|)) (.cse1 (= |ULTIMATE.start_main_~s~0#1.offset| |ULTIMATE.start_sll_circular_get_data_at_#in~head#1.offset|)) (.cse2 (<= |ULTIMATE.start_sll_circular_update_at_#in~head#1.offset| 0)) (.cse3 (<= |ULTIMATE.start_sll_circular_update_at_#in~data#1| 3)) (.cse4 (= |ULTIMATE.start_main_~s~0#1.base| |ULTIMATE.start_sll_circular_get_data_at_#in~head#1.base|)) (.cse5 (<= |ULTIMATE.start_sll_circular_create_#in~data#1| 1)) (.cse6 (<= 1 |ULTIMATE.start_sll_circular_create_~len#1|)) (.cse7 (= |ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0)) (.cse8 (<= |ULTIMATE.start_sll_circular_create_#res#1.offset| 0)) (.cse9 (<= |ULTIMATE.start_sll_circular_create_#in~len#1| 2)) (.cse10 (<= |ULTIMATE.start_sll_circular_update_at_~data#1| 3)) (.cse11 (<= 1 |ULTIMATE.start_sll_circular_create_~data#1|)) (.cse12 (<= 0 |ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (.cse22 (<= 1 |ULTIMATE.start_sll_circular_create_#in~data#1|)) (.cse23 (<= |ULTIMATE.start_sll_circular_update_at_~index#1| 0)) (.cse24 (<= |ULTIMATE.start_sll_circular_create_~len#1| 1)) (.cse25 (<= |ULTIMATE.start_sll_circular_update_at_#in~index#1| 1)) (.cse13 (= |ULTIMATE.start_main_~data~0#1| 1)) (.cse26 (<= |ULTIMATE.start_sll_circular_create_~data#1| 1)) (.cse14 (= |ULTIMATE.start_sll_circular_get_data_at_~index#1| |ULTIMATE.start_sll_circular_get_data_at_#in~index#1|)) (.cse27 (<= |ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0)) (.cse15 (= |ULTIMATE.start_main_~len~0#1| 2)) (.cse16 (= |#NULL.offset| 0)) (.cse17 (= |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_sll_circular_get_data_at_#in~index#1|)) (.cse28 (<= 0 |ULTIMATE.start_sll_circular_update_at_#in~head#1.offset|)) (.cse18 (= |ULTIMATE.start_sll_circular_get_data_at_~head#1.offset| |ULTIMATE.start_sll_circular_get_data_at_#in~head#1.offset|)) (.cse29 (<= 0 |ULTIMATE.start_sll_circular_create_#res#1.offset|)) (.cse30 (<= |ULTIMATE.start_main_~new_data~0#1| 3)) (.cse19 (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.offset| 0)) (.cse31 (<= 0 |#StackHeapBarrier|)) (.cse32 (<= |ULTIMATE.start_main_~s~0#1.offset| 0)) (.cse20 (= |ULTIMATE.start_sll_circular_get_data_at_~head#1.base| |ULTIMATE.start_sll_circular_get_data_at_#in~head#1.base|)) (.cse21 (= |#NULL.base| 0))) (or (and (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_get_data_at_#in~head#1.base|) |ULTIMATE.start_sll_circular_get_data_at_#in~head#1.offset|) |ULTIMATE.start_sll_circular_get_data_at_~head#1.offset|) .cse15 .cse16 .cse17 (= (+ |ULTIMATE.start_sll_circular_get_data_at_~index#1| 1) |ULTIMATE.start_sll_circular_get_data_at_#in~index#1|) .cse19 (= |ULTIMATE.start_sll_circular_get_data_at_~head#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_get_data_at_#in~head#1.base|) |ULTIMATE.start_sll_circular_get_data_at_#in~head#1.offset|)) .cse21)) .cse22 (<= |ULTIMATE.start_main_~expected~0#1| 3) .cse23 .cse24 .cse25 .cse26 .cse27 (<= 0 |ULTIMATE.start_sll_circular_get_data_at_#in~head#1.offset|) .cse28 (<= 1 |ULTIMATE.start_sll_circular_get_data_at_#in~index#1|) .cse29 (<= 3 |ULTIMATE.start_main_~expected~0#1|) (<= |ULTIMATE.start_main_~i~0#1| 1) .cse30 .cse31 .cse32) (and .cse0 (<= 0 |ULTIMATE.start_main_~s~0#1.offset|) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (<= |ULTIMATE.start_main_~i~0#1| 0) .cse7 (< 0 (+ |ULTIMATE.start_main_~i~0#1| 1)) (= (+ |ULTIMATE.start_main_~len~0#1| |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~expected~0#1|) .cse8 .cse9 .cse10 .cse11 .cse12 .cse22 .cse23 .cse24 .cse25 .cse13 .cse26 .cse14 .cse27 .cse15 .cse16 .cse17 .cse28 .cse18 .cse29 .cse30 .cse19 .cse31 .cse32 .cse20 .cse21))) [2022-12-14 09:34:40,000 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW(line 629) no Hoare annotation was computed. [2022-12-14 09:34:40,000 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW(line 625) no Hoare annotation was computed. [2022-12-14 09:34:40,000 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2022-12-14 09:34:40,000 INFO L899 garLoopResultBuilder]: For program point L616(line 616) no Hoare annotation was computed. [2022-12-14 09:34:40,000 INFO L899 garLoopResultBuilder]: For program point L616-1(line 616) no Hoare annotation was computed. [2022-12-14 09:34:40,001 INFO L899 garLoopResultBuilder]: For program point L625(line 625) no Hoare annotation was computed. [2022-12-14 09:34:40,001 INFO L899 garLoopResultBuilder]: For program point L625-1(line 625) no Hoare annotation was computed. [2022-12-14 09:34:40,001 INFO L899 garLoopResultBuilder]: For program point L625-5(line 625) no Hoare annotation was computed. [2022-12-14 09:34:40,001 INFO L899 garLoopResultBuilder]: For program point L625-6(line 625) no Hoare annotation was computed. [2022-12-14 09:34:40,001 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW(line 629) no Hoare annotation was computed. [2022-12-14 09:34:40,001 INFO L895 garLoopResultBuilder]: At program point L625-7(lines 625 628) the Hoare annotation is: (let ((.cse0 (<= 1 |ULTIMATE.start_sll_circular_create_#in~data#1|)) (.cse1 (= |ULTIMATE.start_main_~data~0#1| 1)) (.cse2 (<= |ULTIMATE.start_sll_circular_create_~data#1| 1)) (.cse4 (= |ULTIMATE.start_main_~len~0#1| 2)) (.cse5 (= |#NULL.offset| 0)) (.cse6 (<= 0 |ULTIMATE.start_sll_circular_create_#res#1.offset|)) (.cse7 (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.offset| 0)) (.cse8 (<= |ULTIMATE.start_main_~s~0#1.offset| 0)) (.cse9 (= |#NULL.base| 0))) (or (let ((.cse3 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) (and (< |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |#StackHeapBarrier|) (= |ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |ULTIMATE.start_sll_circular_create_~last~0#1.offset|)) (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) (< |ULTIMATE.start_sll_circular_create_~last~0#1.base| |#StackHeapBarrier|) (= (+ |ULTIMATE.start_sll_circular_create_~len#1| 1) |ULTIMATE.start_sll_circular_create_#in~len#1|) (= (select (select |#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) (+ |ULTIMATE.start_sll_circular_create_~new_head~0#1.offset| 4)) |ULTIMATE.start_sll_circular_create_~data#1|) .cse0 (= |ULTIMATE.start_sll_circular_create_#in~data#1| |ULTIMATE.start_sll_circular_create_~data#1|) (= |ULTIMATE.start_sll_circular_create_~head~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |ULTIMATE.start_sll_circular_create_~last~0#1.offset|)) (= (select |#valid| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) 1) (= |ULTIMATE.start_main_~len~0#1| |ULTIMATE.start_sll_circular_create_#in~len#1|) .cse1 (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_#res#1.base|) .cse2 (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) 0) (= 8 (select |#length| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base|)) (not (= 0 .cse3)) (= |ULTIMATE.start_sll_circular_create_~head~0#1.offset| |ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) .cse4 (= |ULTIMATE.start_sll_circular_create_#res#1.base| |ULTIMATE.start_main_~s~0#1.base|) (not (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| 0)) .cse5 .cse6 .cse7 .cse8 (= |ULTIMATE.start_main_~len~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1)) (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| .cse3) (< 0 |#StackHeapBarrier|) (= |ULTIMATE.start_sll_circular_create_#res#1.offset| |ULTIMATE.start_main_~s~0#1.offset|) .cse9)) (and (<= 2 |ULTIMATE.start_sll_circular_create_#in~len#1|) (<= 0 |ULTIMATE.start_main_~s~0#1.offset|) (<= |ULTIMATE.start_sll_circular_update_at_#in~head#1.offset| 0) (<= |ULTIMATE.start_sll_circular_update_at_#in~data#1| 3) (<= |ULTIMATE.start_sll_circular_create_#in~data#1| 1) (<= 1 |ULTIMATE.start_sll_circular_create_~len#1|) (<= |ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (<= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_sll_circular_create_#res#1.offset| 0) (<= 0 (+ |ULTIMATE.start_main_~i~0#1| 2147483648)) (<= |ULTIMATE.start_sll_circular_create_#in~len#1| 2) (<= |ULTIMATE.start_sll_circular_update_at_~data#1| 3) (<= 0 |ULTIMATE.start_sll_circular_create_~last~0#1.offset|) (<= 1 |ULTIMATE.start_sll_circular_create_~data#1|) (<= 0 |ULTIMATE.start_sll_circular_create_~head~0#1.offset|) .cse0 (<= |ULTIMATE.start_sll_circular_update_at_~index#1| 0) (<= |ULTIMATE.start_sll_circular_create_~len#1| 1) (<= |ULTIMATE.start_sll_circular_update_at_#in~index#1| 1) .cse1 .cse2 (<= |ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) .cse4 .cse5 (<= 0 |ULTIMATE.start_sll_circular_update_at_#in~head#1.offset|) .cse6 (<= |ULTIMATE.start_main_~new_data~0#1| 3) .cse7 (<= 0 |#StackHeapBarrier|) .cse8 .cse9))) [2022-12-14 09:34:40,001 INFO L899 garLoopResultBuilder]: For program point L625-8(lines 625 628) no Hoare annotation was computed. [2022-12-14 09:34:40,001 INFO L895 garLoopResultBuilder]: At program point L584(line 584) the Hoare annotation is: (let ((.cse0 (select |#memory_int| 1))) (and (= |ULTIMATE.start_main_~data~0#1| |ULTIMATE.start_sll_circular_create_#in~data#1|) (= 2 (select |#length| 1)) (= |ULTIMATE.start_sll_circular_create_#in~len#1| |ULTIMATE.start_sll_circular_create_~len#1|) (= |ULTIMATE.start_sll_circular_create_#in~data#1| |ULTIMATE.start_sll_circular_create_~data#1|) (= (select |#valid| 1) 1) (= |ULTIMATE.start_main_~len~0#1| |ULTIMATE.start_sll_circular_create_#in~len#1|) (= |ULTIMATE.start_main_~data~0#1| 1) (= (select |#valid| 0) 0) (= |ULTIMATE.start_main_~len~0#1| 2) (= (select |#valid| 2) 1) (= |#NULL.offset| 0) (= (select .cse0 0) 48) (= 27 (select |#length| 2)) (= (select .cse0 1) 0) (< 0 |#StackHeapBarrier|) (= |#NULL.base| 0))) [2022-12-14 09:34:40,001 INFO L899 garLoopResultBuilder]: For program point L584-1(line 584) no Hoare annotation was computed. [2022-12-14 09:34:40,001 INFO L899 garLoopResultBuilder]: For program point L609(line 609) no Hoare annotation was computed. [2022-12-14 09:34:40,001 INFO L899 garLoopResultBuilder]: For program point L609-1(line 609) no Hoare annotation was computed. [2022-12-14 09:34:40,001 INFO L899 garLoopResultBuilder]: For program point L626(line 626) no Hoare annotation was computed. [2022-12-14 09:34:40,001 INFO L899 garLoopResultBuilder]: For program point L626-1(line 626) no Hoare annotation was computed. [2022-12-14 09:34:40,001 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW(line 629) no Hoare annotation was computed. [2022-12-14 09:34:40,002 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 626) no Hoare annotation was computed. [2022-12-14 09:34:40,002 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW(line 630) no Hoare annotation was computed. [2022-12-14 09:34:40,002 INFO L895 garLoopResultBuilder]: At program point L586-2(lines 586 591) the Hoare annotation is: (let ((.cse0 (<= 1 |ULTIMATE.start_sll_circular_create_#in~data#1|)) (.cse1 (= |ULTIMATE.start_sll_circular_create_#in~data#1| |ULTIMATE.start_sll_circular_create_~data#1|)) (.cse2 (= |ULTIMATE.start_main_~len~0#1| |ULTIMATE.start_sll_circular_create_#in~len#1|)) (.cse3 (= |ULTIMATE.start_main_~data~0#1| 1)) (.cse4 (<= |ULTIMATE.start_sll_circular_create_~data#1| 1)) (.cse5 (= |ULTIMATE.start_main_~len~0#1| 2)) (.cse6 (= |#NULL.offset| 0)) (.cse7 (< 0 |#StackHeapBarrier|)) (.cse8 (= |#NULL.base| 0))) (or (and (< |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |#StackHeapBarrier|) (= (select (select |#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) 4) |ULTIMATE.start_sll_circular_create_~data#1|) (= |ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) (< |ULTIMATE.start_sll_circular_create_~last~0#1.base| |#StackHeapBarrier|) (not (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| 0)) (= (+ |ULTIMATE.start_sll_circular_create_~len#1| 1) |ULTIMATE.start_sll_circular_create_#in~len#1|) .cse0 .cse1 (= (select |#valid| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) 1) .cse2 .cse3 .cse4 (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) 0) (= 8 (select |#length| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base|)) (= |ULTIMATE.start_sll_circular_create_~head~0#1.offset| |ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) .cse5 (not (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| 0)) .cse6 (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.offset| 0) (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)) .cse7 .cse8) (let ((.cse9 (select |#memory_int| 1))) (and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0) 0) (= (select |#length| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) 8) (= |ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (= 2 (select |#length| 1)) (= (select |#valid| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1) (= |ULTIMATE.start_sll_circular_create_~head~0#1.offset| |ULTIMATE.start_sll_circular_create_~last~0#1.offset|) (= |ULTIMATE.start_sll_circular_create_#in~len#1| |ULTIMATE.start_sll_circular_create_~len#1|) (= (select (select |#memory_int| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) 4) |ULTIMATE.start_sll_circular_create_~data#1|) .cse0 .cse1 (= (select |#valid| 1) 1) .cse2 .cse3 .cse4 (< |ULTIMATE.start_sll_circular_create_~head~0#1.base| |#StackHeapBarrier|) (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (= (select |#valid| 0) 0) .cse5 (= (select |#valid| 2) 1) .cse6 (= (select .cse9 0) 48) (= 27 (select |#length| 2)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0) 0) (= (select .cse9 1) 0) .cse7 .cse8)))) [2022-12-14 09:34:40,002 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-12-14 09:34:40,002 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 626) no Hoare annotation was computed. [2022-12-14 09:34:40,002 INFO L899 garLoopResultBuilder]: For program point L595(lines 595 605) no Hoare annotation was computed. [2022-12-14 09:34:40,002 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW(line 630) no Hoare annotation was computed. [2022-12-14 09:34:40,002 INFO L895 garLoopResultBuilder]: At program point L587(line 587) the Hoare annotation is: (let ((.cse0 (select |#memory_int| 1))) (and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0) 0) (= (select |#length| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) 8) (= |ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (= 2 (select |#length| 1)) (= (select |#valid| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1) (= |ULTIMATE.start_sll_circular_create_~head~0#1.offset| |ULTIMATE.start_sll_circular_create_~last~0#1.offset|) (= |ULTIMATE.start_sll_circular_create_#in~len#1| |ULTIMATE.start_sll_circular_create_~len#1|) (= (select (select |#memory_int| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) 4) |ULTIMATE.start_sll_circular_create_~data#1|) (<= 1 |ULTIMATE.start_sll_circular_create_#in~data#1|) (= |ULTIMATE.start_sll_circular_create_#in~data#1| |ULTIMATE.start_sll_circular_create_~data#1|) (= (select |#valid| 1) 1) (= |ULTIMATE.start_main_~len~0#1| |ULTIMATE.start_sll_circular_create_#in~len#1|) (= |ULTIMATE.start_main_~data~0#1| 1) (<= |ULTIMATE.start_sll_circular_create_~data#1| 1) (< |ULTIMATE.start_sll_circular_create_~head~0#1.base| |#StackHeapBarrier|) (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (= (select |#valid| 0) 0) (= |ULTIMATE.start_main_~len~0#1| 2) (= (select |#valid| 2) 1) (= |#NULL.offset| 0) (= (select .cse0 0) 48) (= 27 (select |#length| 2)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0) 0) (= (select .cse0 1) 0) (< 0 |#StackHeapBarrier|) (= |#NULL.base| 0))) [2022-12-14 09:34:40,002 INFO L899 garLoopResultBuilder]: For program point L587-1(line 587) no Hoare annotation was computed. [2022-12-14 09:34:40,002 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 625) no Hoare annotation was computed. [2022-12-14 09:34:40,002 INFO L899 garLoopResultBuilder]: For program point L629(line 629) no Hoare annotation was computed. [2022-12-14 09:34:40,002 INFO L899 garLoopResultBuilder]: For program point L596(lines 596 604) no Hoare annotation was computed. [2022-12-14 09:34:40,002 INFO L899 garLoopResultBuilder]: For program point L629-4(line 629) no Hoare annotation was computed. [2022-12-14 09:34:40,003 INFO L899 garLoopResultBuilder]: For program point L629-5(line 629) no Hoare annotation was computed. [2022-12-14 09:34:40,003 INFO L895 garLoopResultBuilder]: At program point L629-6(lines 629 634) the Hoare annotation is: (and (<= 2 |ULTIMATE.start_sll_circular_create_#in~len#1|) (<= 0 |ULTIMATE.start_main_~s~0#1.offset|) (<= 0 (+ |ULTIMATE.start_main_~i~0#1| 1)) (<= |ULTIMATE.start_sll_circular_update_at_#in~head#1.offset| 0) (<= |ULTIMATE.start_sll_circular_update_at_#in~data#1| 3) (<= |ULTIMATE.start_sll_circular_create_#in~data#1| 1) (<= 1 |ULTIMATE.start_sll_circular_create_~len#1|) (= |ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (<= |ULTIMATE.start_sll_circular_create_#res#1.offset| 0) (<= |ULTIMATE.start_sll_circular_create_#in~len#1| 2) (<= |ULTIMATE.start_sll_circular_update_at_~data#1| 3) (<= 1 |ULTIMATE.start_sll_circular_create_~data#1|) (<= 0 |ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (<= 1 |ULTIMATE.start_sll_circular_create_#in~data#1|) (<= |ULTIMATE.start_sll_circular_update_at_~index#1| 0) (<= |ULTIMATE.start_sll_circular_create_~len#1| 1) (<= |ULTIMATE.start_sll_circular_update_at_#in~index#1| 1) (= |ULTIMATE.start_main_~data~0#1| 1) (<= |ULTIMATE.start_sll_circular_create_~data#1| 1) (<= |ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (= |#NULL.offset| 0) (<= 0 |ULTIMATE.start_sll_circular_update_at_#in~head#1.offset|) (<= 0 |ULTIMATE.start_sll_circular_create_#res#1.offset|) (<= |ULTIMATE.start_main_~i~0#1| 1) (<= |ULTIMATE.start_main_~new_data~0#1| 3) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.offset| 0) (<= 0 |#StackHeapBarrier|) (<= |ULTIMATE.start_main_~s~0#1.offset| 0) (= |#NULL.base| 0)) [2022-12-14 09:34:40,003 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW(line 609) no Hoare annotation was computed. [2022-12-14 09:34:40,003 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW(line 616) no Hoare annotation was computed. [2022-12-14 09:34:40,003 INFO L899 garLoopResultBuilder]: For program point L576(lines 576 578) no Hoare annotation was computed. [2022-12-14 09:34:40,003 INFO L902 garLoopResultBuilder]: At program point L572(line 572) the Hoare annotation is: true [2022-12-14 09:34:40,003 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 574 582) the Hoare annotation is: (or (not (= |#NULL.offset| 0)) (not (= |#NULL.base| 0)) (and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|)) (let ((.cse0 (not (< 0 |#StackHeapBarrier|)))) (and (let ((.cse1 (select |old(#memory_int)| 1))) (or (not (= (select |old(#valid)| 2) 1)) (not (= (select |old(#valid)| 1) 1)) .cse0 (not (= |node_create_#in~data#1| 1)) (not (= (select |old(#length)| 1) 2)) (not (= (select |old(#length)| 2) 27)) (not (= (select .cse1 0) 48)) (not (= (select |old(#valid)| 0) 0)) (not (= (select .cse1 1) 0)))) (or .cse0 (forall ((|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_18| Int)) (let ((.cse2 (select (select |old(#memory_int)| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_18|) 4))) (or (not (= (select (select |old(#memory_$Pointer$.offset)| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_18|) 0) 0)) (not (= .cse2 |node_create_#in~data#1|)) (not (= (select |old(#length)| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_18|) 8)) (= |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_18| 0) (not (< |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_18| |#StackHeapBarrier|)) (not (= .cse2 1)) (not (= (select (select |old(#memory_$Pointer$.base)| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_18|) 0) 0)) (not (= (select |old(#valid)| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_18|) 1))))))))) [2022-12-14 09:34:40,003 INFO L899 garLoopResultBuilder]: For program point node_createEXIT(lines 574 582) no Hoare annotation was computed. [2022-12-14 09:34:40,006 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 09:34:40,007 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-14 09:34:40,016 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-14 09:34:40,016 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 09:34:40,019 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-14 09:34:40,019 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 09:34:40,021 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-14 09:34:40,021 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 09:34:40,021 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-14 09:34:40,022 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 09:34:40,023 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-14 09:34:40,023 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 09:34:40,023 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-14 09:34:40,023 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 09:34:40,025 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 09:34:40,025 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-14 09:34:40,025 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-14 09:34:40,026 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 09:34:40,026 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 09:34:40,027 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 09:34:40,027 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-14 09:34:40,027 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-14 09:34:40,027 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 09:34:40,027 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 09:34:40,029 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-14 09:34:40,029 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 09:34:40,029 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 09:34:40,029 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 09:34:40,029 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-14 09:34:40,029 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-14 09:34:40,030 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 09:34:40,030 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 09:34:40,031 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-14 09:34:40,031 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 09:34:40,031 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 09:34:40,032 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 09:34:40,032 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-14 09:34:40,032 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-14 09:34:40,032 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 09:34:40,032 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 09:34:40,034 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-14 09:34:40,034 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 09:34:40,042 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-14 09:34:40,043 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 09:34:40,044 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.12 09:34:40 BoogieIcfgContainer [2022-12-14 09:34:40,044 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-14 09:34:40,044 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-14 09:34:40,044 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-14 09:34:40,045 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-14 09:34:40,045 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 09:33:29" (3/4) ... [2022-12-14 09:34:40,047 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-12-14 09:34:40,051 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure node_create [2022-12-14 09:34:40,054 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 30 nodes and edges [2022-12-14 09:34:40,054 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 16 nodes and edges [2022-12-14 09:34:40,054 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2022-12-14 09:34:40,055 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-12-14 09:34:40,071 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((new_head < unknown-#StackHeapBarrier-unknown && unknown-#memory_int-unknown[new_head][4] == data) && last == 0) && head == new_head) && last < unknown-#StackHeapBarrier-unknown) && !(last == 0)) && len + 1 == \old(len)) && 1 <= \old(data)) && \old(data) == data) && \valid[new_head] == 1) && len == \old(len)) && data == 1) && data <= 1) && #memory_$Pointer$[new_head][new_head] == 0) && 8 == unknown-#length-unknown[new_head]) && head == new_head) && len == 2) && !(new_head == 0)) && #NULL == 0) && new_head == 0) && last == #memory_$Pointer$[new_head][new_head]) && 0 < unknown-#StackHeapBarrier-unknown) && #NULL == 0) || (((((((((((((((((((((((((#memory_$Pointer$[head][0] == 0 && unknown-#length-unknown[head] == 8) && head == 0) && 2 == unknown-#length-unknown[1]) && \valid[head] == 1) && head == last) && \old(len) == len) && unknown-#memory_int-unknown[head][4] == data) && 1 <= \old(data)) && \old(data) == data) && \valid[1] == 1) && len == \old(len)) && data == 1) && data <= 1) && head < unknown-#StackHeapBarrier-unknown) && head == last) && \valid[0] == 0) && len == 2) && \valid[2] == 1) && #NULL == 0) && unknown-#memory_int-unknown[1][0] == 48) && 27 == unknown-#length-unknown[2]) && #memory_$Pointer$[head][0] == 0) && unknown-#memory_int-unknown[1][1] == 0) && 0 < unknown-#StackHeapBarrier-unknown) && #NULL == 0) [2022-12-14 09:34:40,071 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((((new_head < unknown-#StackHeapBarrier-unknown && last == 0) && head == #memory_$Pointer$[last][last]) && head == new_head) && last < unknown-#StackHeapBarrier-unknown) && len + 1 == \old(len)) && unknown-#memory_int-unknown[new_head][new_head + 4] == data) && 1 <= \old(data)) && \old(data) == data) && head == #memory_$Pointer$[last][last]) && \valid[new_head] == 1) && len == \old(len)) && data == 1) && head == \result) && data <= 1) && #memory_$Pointer$[new_head][new_head] == 0) && 8 == unknown-#length-unknown[new_head]) && !(0 == #memory_$Pointer$[new_head][new_head])) && head == new_head) && len == 2) && \result == s) && !(new_head == 0)) && #NULL == 0) && 0 <= \result) && new_head == 0) && s <= 0) && len == i + 1) && last == #memory_$Pointer$[new_head][new_head]) && 0 < unknown-#StackHeapBarrier-unknown) && \result == s) && #NULL == 0) || ((((((((((((((((((((((((((((((2 <= \old(len) && 0 <= s) && head <= 0) && \old(data) <= 3) && \old(data) <= 1) && 1 <= len) && last <= 0) && i <= 0) && \result <= 0) && 0 <= i + 2147483648) && \old(len) <= 2) && data <= 3) && 0 <= last) && 1 <= data) && 0 <= head) && 1 <= \old(data)) && index <= 0) && len <= 1) && \old(index) <= 1) && data == 1) && data <= 1) && head <= 0) && len == 2) && #NULL == 0) && 0 <= head) && 0 <= \result) && new_data <= 3) && new_head == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && s <= 0) && #NULL == 0) [2022-12-14 09:34:40,071 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((2 <= \old(len) && 0 <= s) && 0 <= i + 1) && head <= 0) && \old(data) <= 3) && \old(data) <= 1) && 1 <= len) && last == 0) && \result <= 0) && \old(len) <= 2) && data <= 3) && 1 <= data) && 0 <= head) && 1 <= \old(data)) && index <= 0) && len <= 1) && \old(index) <= 1) && data == 1) && data <= 1) && head <= 0) && len == 2) && #NULL == 0) && 0 <= head) && 0 <= \result) && i <= 1) && new_data <= 3) && new_head == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && s <= 0) && #NULL == 0 [2022-12-14 09:34:40,071 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((((((2 <= \old(len) && \old(data) <= 1) && last <= 0) && head == s) && 0 < i + 1) && head == head) && head == head) && \result <= 0) && \old(len) <= 2) && 0 <= last) && 1 <= data) && 0 <= head) && 1 <= \old(data)) && i == \old(index)) && s == head) && len <= 1) && data == 1) && data <= 1) && index == \old(index)) && len + i == new_data) && head <= 0) && \old(data) == data) && \old(data) == new_data) || (((((((((((((((((((((2 <= \old(len) && 0 < \old(index)) && \old(data) <= 1) && last <= 0) && #memory_$Pointer$[head][head] == head) && head == s) && \old(index) == index + 1) && \result <= 0) && 0 <= last) && 1 <= data) && 0 <= head) && 1 <= \old(data)) && i == \old(index)) && s == head) && len <= 1) && data == 1) && data <= 1) && len + i == new_data) && head == #memory_$Pointer$[head][head]) && head <= 0) && \old(data) == data) && \old(data) == new_data)) && ((((((((((((((((new_head < unknown-#StackHeapBarrier-unknown && #memory_$Pointer$[new_head][new_head] < unknown-#StackHeapBarrier-unknown) && head == #memory_$Pointer$[last][last]) && head == new_head) && len + 1 == \old(len)) && unknown-#memory_int-unknown[new_head][new_head + 4] == data) && head == #memory_$Pointer$[last][last]) && \valid[new_head] == 1) && head == \result) && #memory_$Pointer$[new_head][new_head] == 0) && 8 == unknown-#length-unknown[new_head]) && !(0 == #memory_$Pointer$[new_head][new_head])) && \result == s) && !(new_head == 0)) && last == #memory_$Pointer$[new_head][new_head]) && 0 < unknown-#StackHeapBarrier-unknown) || (1 <= len && i <= 0))) && len == 2) && #NULL == 0) && 0 <= head) && 0 <= \result) && new_data <= 3) && new_head == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && s <= 0) && #NULL == 0 [2022-12-14 09:34:40,071 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((((((((((((2 <= \old(len) && s == head) && head <= 0) && \old(data) <= 3) && s == head) && \old(data) <= 1) && 1 <= len) && last == 0) && \result <= 0) && \old(len) <= 2) && data <= 3) && 1 <= data) && 0 <= head) && data == 1) && index == \old(index)) && len == 2) && #NULL == 0) && i == \old(index)) && head == head) && new_head == 0) && head == head) && #NULL == 0) || (((((((((((((((((((((2 <= \old(len) && s == head) && head <= 0) && \old(data) <= 3) && s == head) && \old(data) <= 1) && 1 <= len) && last == 0) && \result <= 0) && \old(len) <= 2) && data <= 3) && 1 <= data) && 0 <= head) && data == 1) && #memory_$Pointer$[head][head] == head) && len == 2) && #NULL == 0) && i == \old(index)) && index + 1 == \old(index)) && new_head == 0) && head == #memory_$Pointer$[head][head]) && #NULL == 0)) && 1 <= \old(data)) && expected <= 3) && index <= 0) && len <= 1) && \old(index) <= 1) && data <= 1) && head <= 0) && 0 <= head) && 0 <= head) && 1 <= \old(index)) && 0 <= \result) && 3 <= expected) && i <= 1) && new_data <= 3) && 0 <= unknown-#StackHeapBarrier-unknown) && s <= 0) || ((((((((((((((((((((((((((((((((((((2 <= \old(len) && 0 <= s) && s == head) && head <= 0) && \old(data) <= 3) && s == head) && \old(data) <= 1) && 1 <= len) && i <= 0) && last == 0) && 0 < i + 1) && len + i == expected) && \result <= 0) && \old(len) <= 2) && data <= 3) && 1 <= data) && 0 <= head) && 1 <= \old(data)) && index <= 0) && len <= 1) && \old(index) <= 1) && data == 1) && data <= 1) && index == \old(index)) && head <= 0) && len == 2) && #NULL == 0) && i == \old(index)) && 0 <= head) && head == head) && 0 <= \result) && new_data <= 3) && new_head == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && s <= 0) && head == head) && #NULL == 0) [2022-12-14 09:34:40,072 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((aux-sll_circular_get_data_at(s, i)-aux <= 2147483647 && 2 <= \old(len)) && head <= 0) && \old(data) <= 3) && index <= 0) && \old(data) <= 1) && 1 <= len) && 0 <= aux-sll_circular_get_data_at(s, i)-aux + 2147483648) && \result <= 0) && \old(len) <= 2) && data <= 3) && 1 <= data) && 0 <= head) && \result == unknown-#memory_int-unknown[head][head + 4]) && 1 <= \old(data)) && index <= 0) && len <= 1) && \old(index) <= 1) && data <= 1) && head <= 0) && ((((((((((((((s == head && s == head) && last == 0) && len + i == expected) && data == 1) && #memory_$Pointer$[head][head] == head) && len == 2) && #NULL == 0) && i == \old(index)) && 0 < \old(index)) && index + 1 == \old(index)) && new_head == 0) && head == #memory_$Pointer$[head][head]) && #NULL == 0) || (((((((((((((s == head && s == head) && last == 0) && 0 < i + 1) && len + i == expected) && data == 1) && index == \old(index)) && len == 2) && #NULL == 0) && i == \old(index)) && head == head) && new_head == 0) && head == head) && #NULL == 0))) && \result == aux-sll_circular_get_data_at(s, i)-aux) && 0 <= head) && 0 <= head) && 0 <= \result) && new_data <= 3) && 0 <= unknown-#StackHeapBarrier-unknown) && s <= 0 [2022-12-14 09:34:40,080 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f2cb204-05c4-4a98-92c6-7a6b48f1623a/bin/utaipan-gh47qXpMRh/witness.graphml [2022-12-14 09:34:40,080 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-14 09:34:40,081 INFO L158 Benchmark]: Toolchain (without parser) took 71338.79ms. Allocated memory was 121.6MB in the beginning and 255.9MB in the end (delta: 134.2MB). Free memory was 79.1MB in the beginning and 214.4MB in the end (delta: -135.2MB). Peak memory consumption was 401.5kB. Max. memory is 16.1GB. [2022-12-14 09:34:40,081 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 96.5MB. Free memory is still 45.1MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-14 09:34:40,081 INFO L158 Benchmark]: CACSL2BoogieTranslator took 282.21ms. Allocated memory is still 121.6MB. Free memory was 79.1MB in the beginning and 61.8MB in the end (delta: 17.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-12-14 09:34:40,081 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.57ms. Allocated memory is still 121.6MB. Free memory was 61.8MB in the beginning and 59.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-14 09:34:40,081 INFO L158 Benchmark]: Boogie Preprocessor took 20.51ms. Allocated memory is still 121.6MB. Free memory was 59.4MB in the beginning and 57.8MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-14 09:34:40,081 INFO L158 Benchmark]: RCFGBuilder took 398.31ms. Allocated memory was 121.6MB in the beginning and 146.8MB in the end (delta: 25.2MB). Free memory was 57.8MB in the beginning and 104.4MB in the end (delta: -46.6MB). Peak memory consumption was 8.9MB. Max. memory is 16.1GB. [2022-12-14 09:34:40,081 INFO L158 Benchmark]: TraceAbstraction took 70566.29ms. Allocated memory was 146.8MB in the beginning and 255.9MB in the end (delta: 109.1MB). Free memory was 103.3MB in the beginning and 218.6MB in the end (delta: -115.3MB). Peak memory consumption was 144.6MB. Max. memory is 16.1GB. [2022-12-14 09:34:40,081 INFO L158 Benchmark]: Witness Printer took 35.87ms. Allocated memory is still 255.9MB. Free memory was 218.6MB in the beginning and 214.4MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-12-14 09:34:40,082 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.13ms. Allocated memory is still 96.5MB. Free memory is still 45.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 282.21ms. Allocated memory is still 121.6MB. Free memory was 79.1MB in the beginning and 61.8MB in the end (delta: 17.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 30.57ms. Allocated memory is still 121.6MB. Free memory was 61.8MB in the beginning and 59.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 20.51ms. Allocated memory is still 121.6MB. Free memory was 59.4MB in the beginning and 57.8MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 398.31ms. Allocated memory was 121.6MB in the beginning and 146.8MB in the end (delta: 25.2MB). Free memory was 57.8MB in the beginning and 104.4MB in the end (delta: -46.6MB). Peak memory consumption was 8.9MB. Max. memory is 16.1GB. * TraceAbstraction took 70566.29ms. Allocated memory was 146.8MB in the beginning and 255.9MB in the end (delta: 109.1MB). Free memory was 103.3MB in the beginning and 218.6MB in the end (delta: -115.3MB). Peak memory consumption was 144.6MB. Max. memory is 16.1GB. * Witness Printer took 35.87ms. Allocated memory is still 255.9MB. Free memory was 218.6MB in the beginning and 214.4MB in the end (delta: 4.2MB). 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$.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$.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$.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$.offset - 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$.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$.offset - 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$.offset - 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 * 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: 590]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 590]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 625]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 625]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 626]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 626]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 616]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 616]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 625]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 625]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 629]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 629]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 630]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 630]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 609]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 609]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 629]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 629]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 56 locations, 18 error locations. Started 1 CEGAR loops. OverallTime: 70.5s, OverallIterations: 19, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 22.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 5.9s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 855 SdHoareTripleChecker+Valid, 4.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 854 mSDsluCounter, 1404 SdHoareTripleChecker+Invalid, 4.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 927 mSDsCounter, 114 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3893 IncrementalHoareTripleChecker+Invalid, 4007 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 114 mSolverCounterUnsat, 477 mSDtfsCounter, 3893 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 781 GetRequests, 478 SyntacticMatches, 55 SemanticMatches, 248 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1831 ImplicationChecksByTransitivity, 41.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=56occurred in iteration=0, InterpolantAutomatonStates: 193, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 19 MinimizatonAttempts, 134 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 12 LocationsWithAnnotation, 16 PreInvPairs, 37 NumberOfFragments, 1627 HoareAnnotationTreeSize, 16 FomulaSimplifications, 605 FormulaSimplificationTreeSizeReduction, 1.7s HoareSimplificationTime, 12 FomulaSimplificationsInter, 56580 FormulaSimplificationTreeSizeReductionInter, 4.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 765 NumberOfCodeBlocks, 765 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 922 ConstructedInterpolants, 0 QuantifiedInterpolants, 1921 SizeOfPredicates, 19 NumberOfNonLiveVariables, 2267 ConjunctsInSsa, 41 ConjunctsInUnsatCore, 32 InterpolantComputations, 14 PerfectInterpolantSequences, 218/240 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: 12.8s, ICFG_INTERPRETER_ENTERED_PROCEDURES: 10, DAG_INTERPRETER_EARLY_EXIT_QUERIES_NONTRIVIAL: 174, DAG_INTERPRETER_EARLY_EXITS: 0, TOOLS_POST_APPLICATIONS: 408, TOOLS_POST_TIME: 8.9s, TOOLS_POST_CALL_APPLICATIONS: 50, TOOLS_POST_CALL_TIME: 0.9s, TOOLS_POST_RETURN_APPLICATIONS: 40, TOOLS_POST_RETURN_TIME: 1.4s, TOOLS_QUANTIFIERELIM_APPLICATIONS: 498, TOOLS_QUANTIFIERELIM_TIME: 11.0s, TOOLS_QUANTIFIERELIM_MAX_TIME: 0.5s, FLUID_QUERY_TIME: 0.0s, FLUID_QUERIES: 769, FLUID_YES_ANSWERS: 0, DOMAIN_JOIN_APPLICATIONS: 83, DOMAIN_JOIN_TIME: 0.9s, DOMAIN_ALPHA_APPLICATIONS: 0, DOMAIN_ALPHA_TIME: 0.0s, DOMAIN_WIDEN_APPLICATIONS: 19, DOMAIN_WIDEN_TIME: 0.2s, DOMAIN_ISSUBSETEQ_APPLICATIONS: 54, DOMAIN_ISSUBSETEQ_TIME: 0.1s, DOMAIN_ISBOTTOM_APPLICATIONS: 174, DOMAIN_ISBOTTOM_TIME: 0.3s, LOOP_SUMMARIZER_APPLICATIONS: 35, LOOP_SUMMARIZER_CACHE_MISSES: 35, LOOP_SUMMARIZER_OVERALL_TIME: 7.0s, LOOP_SUMMARIZER_NEW_COMPUTATION_TIME: 7.0s, LOOP_SUMMARIZER_FIXPOINT_ITERATIONS: 54, CALL_SUMMARIZER_APPLICATIONS: 40, CALL_SUMMARIZER_CACHE_MISSES: 5, CALL_SUMMARIZER_OVERALL_TIME: 0.2s, CALL_SUMMARIZER_NEW_COMPUTATION_TIME: 0.2s, 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: 4054, DAG_COMPRESSION_RETAINED_NODES: 533, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 18 specifications checked. All of them hold - InvariantResult [Line: 620]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 598]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 631]: Loop Invariant [2022-12-14 09:34:40,086 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-14 09:34:40,086 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 09:34:40,087 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-14 09:34:40,087 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base Derived loop invariant: ((((((((((((((((((((((((((aux-sll_circular_get_data_at(s, i)-aux <= 2147483647 && 2 <= \old(len)) && head <= 0) && \old(data) <= 3) && index <= 0) && \old(data) <= 1) && 1 <= len) && 0 <= aux-sll_circular_get_data_at(s, i)-aux + 2147483648) && \result <= 0) && \old(len) <= 2) && data <= 3) && 1 <= data) && 0 <= head) && \result == unknown-#memory_int-unknown[head][head + 4]) && 1 <= \old(data)) && index <= 0) && len <= 1) && \old(index) <= 1) && data <= 1) && head <= 0) && ((((((((((((((s == head && s == head) && last == 0) && len + i == expected) && data == 1) && #memory_$Pointer$[head][head] == head) && len == 2) && #NULL == 0) && i == \old(index)) && 0 < \old(index)) && index + 1 == \old(index)) && new_head == 0) && head == #memory_$Pointer$[head][head]) && #NULL == 0) || (((((((((((((s == head && s == head) && last == 0) && 0 < i + 1) && len + i == expected) && data == 1) && index == \old(index)) && len == 2) && #NULL == 0) && i == \old(index)) && head == head) && new_head == 0) && head == head) && #NULL == 0))) && \result == aux-sll_circular_get_data_at(s, i)-aux) && 0 <= head) && 0 <= head) && 0 <= \result) && new_data <= 3) && 0 <= unknown-#StackHeapBarrier-unknown) && s <= 0 - InvariantResult [Line: 572]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 586]: Loop Invariant [2022-12-14 09:34:40,088 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-14 09:34:40,088 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 09:34:40,088 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-14 09:34:40,088 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 09:34:40,089 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-14 09:34:40,089 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 09:34:40,089 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-14 09:34:40,089 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base Derived loop invariant: ((((((((((((((((((((((new_head < unknown-#StackHeapBarrier-unknown && unknown-#memory_int-unknown[new_head][4] == data) && last == 0) && head == new_head) && last < unknown-#StackHeapBarrier-unknown) && !(last == 0)) && len + 1 == \old(len)) && 1 <= \old(data)) && \old(data) == data) && \valid[new_head] == 1) && len == \old(len)) && data == 1) && data <= 1) && #memory_$Pointer$[new_head][new_head] == 0) && 8 == unknown-#length-unknown[new_head]) && head == new_head) && len == 2) && !(new_head == 0)) && #NULL == 0) && new_head == 0) && last == #memory_$Pointer$[new_head][new_head]) && 0 < unknown-#StackHeapBarrier-unknown) && #NULL == 0) || (((((((((((((((((((((((((#memory_$Pointer$[head][0] == 0 && unknown-#length-unknown[head] == 8) && head == 0) && 2 == unknown-#length-unknown[1]) && \valid[head] == 1) && head == last) && \old(len) == len) && unknown-#memory_int-unknown[head][4] == data) && 1 <= \old(data)) && \old(data) == data) && \valid[1] == 1) && len == \old(len)) && data == 1) && data <= 1) && head < unknown-#StackHeapBarrier-unknown) && head == last) && \valid[0] == 0) && len == 2) && \valid[2] == 1) && #NULL == 0) && unknown-#memory_int-unknown[1][0] == 48) && 27 == unknown-#length-unknown[2]) && #memory_$Pointer$[head][0] == 0) && unknown-#memory_int-unknown[1][1] == 0) && 0 < unknown-#StackHeapBarrier-unknown) && #NULL == 0) - InvariantResult [Line: 629]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((2 <= \old(len) && 0 <= s) && 0 <= i + 1) && head <= 0) && \old(data) <= 3) && \old(data) <= 1) && 1 <= len) && last == 0) && \result <= 0) && \old(len) <= 2) && data <= 3) && 1 <= data) && 0 <= head) && 1 <= \old(data)) && index <= 0) && len <= 1) && \old(index) <= 1) && data == 1) && data <= 1) && head <= 0) && len == 2) && #NULL == 0) && 0 <= head) && 0 <= \result) && i <= 1) && new_data <= 3) && new_head == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && s <= 0) && #NULL == 0 - InvariantResult [Line: 625]: Loop Invariant [2022-12-14 09:34:40,090 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 09:34:40,090 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-14 09:34:40,090 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-14 09:34:40,090 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 09:34:40,090 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 09:34:40,091 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 09:34:40,091 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-14 09:34:40,091 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-14 09:34:40,091 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 09:34:40,091 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base Derived loop invariant: ((((((((((((((((((((((((((((((new_head < unknown-#StackHeapBarrier-unknown && last == 0) && head == #memory_$Pointer$[last][last]) && head == new_head) && last < unknown-#StackHeapBarrier-unknown) && len + 1 == \old(len)) && unknown-#memory_int-unknown[new_head][new_head + 4] == data) && 1 <= \old(data)) && \old(data) == data) && head == #memory_$Pointer$[last][last]) && \valid[new_head] == 1) && len == \old(len)) && data == 1) && head == \result) && data <= 1) && #memory_$Pointer$[new_head][new_head] == 0) && 8 == unknown-#length-unknown[new_head]) && !(0 == #memory_$Pointer$[new_head][new_head])) && head == new_head) && len == 2) && \result == s) && !(new_head == 0)) && #NULL == 0) && 0 <= \result) && new_head == 0) && s <= 0) && len == i + 1) && last == #memory_$Pointer$[new_head][new_head]) && 0 < unknown-#StackHeapBarrier-unknown) && \result == s) && #NULL == 0) || ((((((((((((((((((((((((((((((2 <= \old(len) && 0 <= s) && head <= 0) && \old(data) <= 3) && \old(data) <= 1) && 1 <= len) && last <= 0) && i <= 0) && \result <= 0) && 0 <= i + 2147483648) && \old(len) <= 2) && data <= 3) && 0 <= last) && 1 <= data) && 0 <= head) && 1 <= \old(data)) && index <= 0) && len <= 1) && \old(index) <= 1) && data == 1) && data <= 1) && head <= 0) && len == 2) && #NULL == 0) && 0 <= head) && 0 <= \result) && new_data <= 3) && new_head == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && s <= 0) && #NULL == 0) - InvariantResult [Line: 614]: Loop Invariant [2022-12-14 09:34:40,092 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-14 09:34:40,092 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 09:34:40,092 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 09:34:40,093 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 09:34:40,093 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-14 09:34:40,093 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-14 09:34:40,093 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 09:34:40,093 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 09:34:40,094 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-14 09:34:40,094 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 09:34:40,094 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 09:34:40,094 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 09:34:40,094 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-14 09:34:40,094 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-14 09:34:40,094 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 09:34:40,094 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base Derived loop invariant: ((((((((((((((((((((((((((((((((2 <= \old(len) && \old(data) <= 1) && last <= 0) && head == s) && 0 < i + 1) && head == head) && head == head) && \result <= 0) && \old(len) <= 2) && 0 <= last) && 1 <= data) && 0 <= head) && 1 <= \old(data)) && i == \old(index)) && s == head) && len <= 1) && data == 1) && data <= 1) && index == \old(index)) && len + i == new_data) && head <= 0) && \old(data) == data) && \old(data) == new_data) || (((((((((((((((((((((2 <= \old(len) && 0 < \old(index)) && \old(data) <= 1) && last <= 0) && #memory_$Pointer$[head][head] == head) && head == s) && \old(index) == index + 1) && \result <= 0) && 0 <= last) && 1 <= data) && 0 <= head) && 1 <= \old(data)) && i == \old(index)) && s == head) && len <= 1) && data == 1) && data <= 1) && len + i == new_data) && head == #memory_$Pointer$[head][head]) && head <= 0) && \old(data) == data) && \old(data) == new_data)) && ((((((((((((((((new_head < unknown-#StackHeapBarrier-unknown && #memory_$Pointer$[new_head][new_head] < unknown-#StackHeapBarrier-unknown) && head == #memory_$Pointer$[last][last]) && head == new_head) && len + 1 == \old(len)) && unknown-#memory_int-unknown[new_head][new_head + 4] == data) && head == #memory_$Pointer$[last][last]) && \valid[new_head] == 1) && head == \result) && #memory_$Pointer$[new_head][new_head] == 0) && 8 == unknown-#length-unknown[new_head]) && !(0 == #memory_$Pointer$[new_head][new_head])) && \result == s) && !(new_head == 0)) && last == #memory_$Pointer$[new_head][new_head]) && 0 < unknown-#StackHeapBarrier-unknown) || (1 <= len && i <= 0))) && len == 2) && #NULL == 0) && 0 <= head) && 0 <= \result) && new_data <= 3) && new_head == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && s <= 0) && #NULL == 0 - InvariantResult [Line: 607]: Loop Invariant [2022-12-14 09:34:40,095 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-14 09:34:40,096 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 09:34:40,097 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-14 09:34:40,097 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base Derived loop invariant: ((((((((((((((((((((((((((((((((((((((2 <= \old(len) && s == head) && head <= 0) && \old(data) <= 3) && s == head) && \old(data) <= 1) && 1 <= len) && last == 0) && \result <= 0) && \old(len) <= 2) && data <= 3) && 1 <= data) && 0 <= head) && data == 1) && index == \old(index)) && len == 2) && #NULL == 0) && i == \old(index)) && head == head) && new_head == 0) && head == head) && #NULL == 0) || (((((((((((((((((((((2 <= \old(len) && s == head) && head <= 0) && \old(data) <= 3) && s == head) && \old(data) <= 1) && 1 <= len) && last == 0) && \result <= 0) && \old(len) <= 2) && data <= 3) && 1 <= data) && 0 <= head) && data == 1) && #memory_$Pointer$[head][head] == head) && len == 2) && #NULL == 0) && i == \old(index)) && index + 1 == \old(index)) && new_head == 0) && head == #memory_$Pointer$[head][head]) && #NULL == 0)) && 1 <= \old(data)) && expected <= 3) && index <= 0) && len <= 1) && \old(index) <= 1) && data <= 1) && head <= 0) && 0 <= head) && 0 <= head) && 1 <= \old(index)) && 0 <= \result) && 3 <= expected) && i <= 1) && new_data <= 3) && 0 <= unknown-#StackHeapBarrier-unknown) && s <= 0) || ((((((((((((((((((((((((((((((((((((2 <= \old(len) && 0 <= s) && s == head) && head <= 0) && \old(data) <= 3) && s == head) && \old(data) <= 1) && 1 <= len) && i <= 0) && last == 0) && 0 < i + 1) && len + i == expected) && \result <= 0) && \old(len) <= 2) && data <= 3) && 1 <= data) && 0 <= head) && 1 <= \old(data)) && index <= 0) && len <= 1) && \old(index) <= 1) && data == 1) && data <= 1) && index == \old(index)) && head <= 0) && len == 2) && #NULL == 0) && i == \old(index)) && 0 <= head) && head == head) && 0 <= \result) && new_data <= 3) && new_head == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && s <= 0) && head == head) && #NULL == 0) RESULT: Ultimate proved your program to be correct! [2022-12-14 09:34:40,111 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f2cb204-05c4-4a98-92c6-7a6b48f1623a/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE